Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Are credit rating agencies getting fed up with hyperscalers?

Extract Anything from Any PDF: Inside Foxit's Advanced Extraction Engine

Show HN: BlinkMarkets

Defence officials resist EU plan to curb reliance on US tech giants

Is Russia's rival to Starlink failing? Here's what we know

Linux 7.4 to Improve Apple Silicon Audio Support and Impossible Power Management

Picolibrary: A Small Press

Show HN: Scramblefall - falling blocks anagram game

SlimTCP is a lightweight, high-performance TCP/IP stack for modern datacenters

Astra One Shotted Cains's Jawbone

Toolcall-doctor – Shrink broken LLM tool-call reproducers

macOS 26.7 Code Hints at Two Unreleased Apple Game Controllers

New study says Michigan sturgeon may live to 400

Nvidia Personal AI Router (Pair)

I raised 5 kids. Looking back, their careers as adults make perfect sense

Refactoring English: Effective Writing for Software Developers (v1.0)

Ask HN: Any Alternatives to Archive.ph & co?

Mariko Aoki Phenomenon

'Guilt by association': why 7 int'l aid workers were killed in Israeli airstrike

Second complete map of a fruit fly brain completed

Desktop AI for ops is still subsidized

Paper Reef – draw a fish on paper, photograph it, it swims on a shared screen

Nvidia Wants to Turn Your Idle PCs into a Personal Home Data Center with 'Pair'

Monocode – A modern GUI for your coding agents

Trump White House just tossed a grenade into international space relations

New study: Insurance AI adoption exposes verification gap

Pimacs – An Emacs UI for Pi

On niche subjects, you can control the message of LLMs

Handwritten Code

Iroh inside Tape – Critical UX for self-hosted music streaming suite