Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Adversarial distillation

DOOM runs in ChatGPT and Claude

Landmark ancient-genome study shows surprise acceleration of human evolution

Custom .af video format for WebCodecs: frame-accurate playback without <video>

DESI Completes Planned 3D Map of the Universe and Continues Exploring

"Am I Crazy?" [Wading Through AI – Episode 3] [video]

Littlebird raises $11M for its AI-assisted 'recall' tool

Update: EntropyLoop is now the first AI native MCP'd Quantum RNG

DriveLogs (DMV-ready driving hour logs for teen drivers, iOS)

Japan reveals new name for 40C-and-hotter days after blistering summer

Show HN: External admission gate for GitHub Actions before execution

3 Hours with Claude 4.7: functional study webapp and remote MCP – Oneshotted

Kefir C17/C23 Compiler

Tell HN: Security Incident at Porter (YC S20)

The AI Rewrite Dilemma

Shakespeare owned a house in London. We know where it was

Ask HN: Founders, what are you building that survives a Mythos-class model?

Folding Ideas: Why was I invited to Beast Studios? [video]

ListifyText – Turn messy text into clean, structured lists instantly

Terminator: Code You See Onscreen [video]

Show HN: Pyra – a Python toolchain experiment inspired by uv and Bun

Stop Burning Money on UGC Creators: Generate Viral Ads with AI in Seconds

Only 13% of emails are written by people

Kevin Weil and Bill Peebles exit OpenAI as company continues to shed side quests

Cal.com OSS project goes closed source due to AI

Ryan Mather: My tips for getting the best results out of Claude Design

Show HN: Mind-OS – First free online AI dependency self‑assessment

The big business of survival bunkers

High Amplitude Disagreeableness

A simplified model of Fil-C