Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

tlb•9mo 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•9mo 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•9mo 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•9mo ago

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Show HN: AgentHub – A unified SDK for LLM APIs with faithful validation

Some Thoughts on AI

The Math on AI Agents Doesn't Add Up

Need academic volunteer for Guinness World Record verification

Show HN: First Valkey-specific VS Code extension (open source Redis fork)

The Ladder to Nowhere: How OpenAI Plans to Learn Everything About You

'Amelia': the AI-generated British schoolgirl, a far-right social media star

Go 1.26 Is Around the Corner: Small Changes, Big Impact for Real-World Go System

DigiAgriApp – Software solution aimed at farmers

Show HN: Crystal Upscaler – AI image upscaler built for portraits and faces

Show HN: Bonsplit – tabs and splits for native macOS apps

Show HN: Baby Dance AI – Turn baby photos into dance videos in 30 seconds

GLM4.7-Flash vs. other Local LLM. Tested also with OpenCode [video]

State Terror Has Arrived

Show HN: SeedVR2 – One-step AI video upscaling to 4K, 10x faster

Stackmaxxing Recursion for Days [video]

Chinese Programmer Dies from Overwork at 32;Added to Work Chat While in Hospital

67,800-year-old hand stencil is the oldest human-made art

Aperture: Senior QA (2004-2005)

CachyOS newest release drops X11 for Wayland in Live ISOs

D: First impressions [video]

400 hours

Wall Street braced for a private credit meltdown. The risk of one is rising

Death to Letterboxd, and Long Live the Independent Web

Is China winning the AI race?

iOS 26 Adoption Rate Is Not Low Compared to Previous Years

Show HN: TUI for managing XDG default applications

Show HN: A browser front-end for TUI coding agents

By almost every measure, life is better than ever.

Xmake: A cross-platform build utility based on Lua