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?

Show HN: Grow any hobby (skills for humans not AI)

The Jensen Huang Scandal Should Change Everything

Escaping Space: Part II

Show HN: Bricksentry – see what a data change does before it ships (Databricks)

South Africans are giving up on Nelson Mandela's party. Good

Intelligent Eyewear with Gemini

No, AI agents did not discover a previously unknown Maya site

Africa's solar revolution is vast and speedy

Odog.net – Criminal Enterprise [pdf]

PyroNear – open-source wildfire detection

Microsoft's Outlook.com Is Down

Jules Turndown

Nvidia employees petition to bring back Jensen Huang

One Condition Away: Apache's HTTP/2 RCE on the Day It Dropped

Agent harness for learning difficult things

'Transition regret' is rare, according to study

Put MCP next to your API, not on top of it

Strategies Against Algorithms

NYC Council passes ban on 'surveillance pricing'

I Love AI

Turning Teacher Expertise into AI-Generated Educational Simulations

Elon Musk says it will be an honor to hire Jensen Huang

First Strike

Show HN: KittyBrowser, I built a web browser in your terminal

Male Pattern Baldness: Extended-Release Minoxidil Regrows Hair in Phase 3 Trial

The State of Startup Hiring 2026

Bill Gross is giving away 300k climate tech startup ideas – for free

Trump had urged Nvidia’s Jensen Huang to fight for his job

Schelling Atlas: AI agents know where to find each other on the web

Is It a 'Honeypot' or a 'Honeytrap'?