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?

Stop Making Threads

China takes a page from SpaceX and recaptures first stage of rocket to reuse it

Tip

Go Pop quiz: what time was it?

Einstein's relativity rules chemical bonds in heavy elements, new research shows

China recovered its first reusable rocket and showed a new way to do it

It's Now Imperative That You Copy That Floppy

OmFest Interest Form

Old Icons – All This

Neobrutalism Layouts

MCPA: The First Official Certification for the Model Context Protocol

The AI and observability gap for front end teams

Y2K in orbit: Tomorrow, we run out of satellite catalogue numbers

China lands reusable rocket for first time, state media says

Pearson's Anti-Piracy Vendor Takes Down Best-Selling Author's Own GitHub Repo

Apple sues OpenAI/io for stealing trade secrets

Netflix reportedly among parties in talks to buy Letterboxd

Determinisitc MIDI Synthesizer

Together AI, Apps Flyer lead list of Top dynamic companies for Q3 2026

Play Neverball in the Browser

What can you build using this? https://github.com/pixel-1998/axis-protocol

AI Can't Recreate the Thrust Game (But It Can Help You Understand It)

Lucia Auth

Man partly sucked out of broken window on flight pulled back by passengers

Linux 7.3 Enabling Second Graphics Pipe for Modern AMD APUs

The biggest bombshells from Apple's trade secret lawsuit against OpenAI

Show HN: An MCP server that lets AI agents request disability insurance quotes

Claude Savings with context caching awareness

Spiel: Chrome extension that reads articles/PDFs aloud with local TTS

A Plan to Stop Solar Storms from Sending Us Back to the Stone Age