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?

Simplex Algorithm

Like a Bouncer at a Bookstore: Texas' App Store Accountability Act

After 80 Years, Mathematicians Give Famed 'Erdős Method' an Upgrade

Sad Things about PHP

Belonging to the Land

Live: Daniel J. Bernstein (djb) on the push to weaken post-quantum TLS [10am ET]

Software Values

You Can Now Program Steam Deck GPU with Mojo and Max

Two humpback whales set records swimming between Australia and Brazil

AI Ticket and Article Summarization Package for Otobo ITSM

Talking with your PDFs locally with Blablador and GPT4all

The $1T problem diamonds can solve [video]

Commodore Callback flip phone will use recycled memory chips

Adobe Generative AI User Guidelines (2026)

Slowjson – attack on HTTP servers accepting JSON with chunked transfer encoding

Apple and Audi alumni have made a luxe EV based on the moon buggy

I went to uni to learn. What I discovered has made me angry and terrified

I'm 16 and Running a Software Jam in a World of Slop

50 out of 413 Companies that use my libraries

Suspicious Discontinuities

Nextcloud Talk and the FOSS caveat of mobile push notifications

Position: Coding Benchmarks Are Misaligned with Agentic Software Engineering

Qwen-AgentWorld-35B-A3B: a local 'world model' you can run at home Open Models

Map2Model has been shut down [due to legal notices]

Show HN: Hyoomn – We'll constructively roast your AI coded B2B SaaS

Apple seeks approval to buy chips from blacklisted Chinese company, FT reports

GPT-5.6 Sol: ~20 US govt-approved orgs only. What about non-US businesses?

When you're stuck, just do something

Music Tuned to 440 Hz versus 432 Hz and the Health Effects

Show HN: InfyniDock – a macOS Dock that switches actual windows