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?

EU's five regulations that will change how we live, drive, and use the internet

Touchscreens in cars are getting worse, Swedish test finds

Show HN: You can continue a Claude session in Codex, and vice versa

Extracts of Polypore Mushroom Mycelia Reduce Viruses in Honey Bees

Monarchies of Malaysia

Show HN:Getting GLM 5.2 running on my slow computer

CEO and Creator of Ethos Engine for AI

Etcd v3.7.0

Timeline Studio – browser AI voiceover editor running ONNX locally

The robotaxi law that could ban Tesla

Before AI Ships Code, Show Me the Receipts

The AI didn't get smarter about my project. My notes did

LingBot-World 2.0: Interactive world generation from image, text, and actions

International timekeepers to vote on changing the leap second to a leap hour

$130M Series A to Build the Open Superintelligence Stack

Quantum Pairs Stitch Space-Time (2015)

World Tour Finals 2026 Algorithm: Human vs. AI Exhibition Match

A certain kind of talk around LLMs that I find increasingly puzzling

The Web's HTTP Header Junk Drawer

Another German state heads down the open source sovereignty road

Stride Game Engine

I built a $10M run rate AI Startup in 150 days [video]

SanDisk has highest unrealized losses

The potential role of iron fuel in Europe's clean energy transition

Why new €3 customs charge tells a bigger story about global trade

The 4th Amendment Moves to the Cloud: Chatrie and the Future of Digital Privacy

Show HN: PandaPage – host an HTML page with one curl, no signup, auto-expires

Local codereview tool for handing structured review to agent

Probelock – lockfile for LLM tool calling

Show HN: Reddit-opportunities – See who is asking for you in Reddit