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?

Wow – these are the AI sources worth paying attention to

Research paper of Atlantic white shark migratory patterns

Someone forked my repo, then submitted a PR written by Claude

Math, Bits, Magic, and a Bit of Abnormal C Programming

OpenAI launches ChatGPT for personal finance, will let you connect bank accounts

Jane Street Interview Simulator

Popular node-IPC NPM package compromised to steal credentials

Virtual memory explained as a dialogue between a process and the Linux kernel

Ask HN: Do you still spend time maintaining Claude.md / AGENTS.md files?

MiniPlasma

Why 'Smart' Products Have Started to Look Like the Dumb Choice

MiniPlasma, a Powerful LPE

Why DKIM Fails and How to Fix Every Type of Alignment Error

The world model that every AI godfather is racing to figure out

US Government openly schemes to indict Raúl Castro as prelude to invading Cuba

Show HN: Layrr – Point Click and Edit any site

What Is JEPA? Joint Embedding Predictive Architecture Framework Prediction

Google sued for firing staff who tried to follow 'Don't be evil' motto (2021)

Show HN: League of Early Adopters – Give product feedback, get product feedback

AI Agents Are Tools, Not Replacements

My Mom taught me HTML (and the rest was history)

Show HN: A chess.com profiler that runs Stockfish in the browser

Microsoft Exchange, Windows 11 hacked on second day of Pwn2Own

Frink – programming language designed to make physical calculations simple

Auto-Improving Software

Bluesky Radio – Hosted by Opus 4.7

Ruby-charts: Generate pie, bar, and line charts from data files

iOS-Linuxkit: Linux on iPad, the Hard Way

Do you spend 1h+ time a week just reading?

Is the Secret to Men's Longevity a Great Butt?