Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

StitchSentry – preflight checks for embroidery files

Flash-Moe: Running a 397B Parameter Model on a Mac with 48GB RAM

EVs can make power grids more reliable (and earn owners money)

Open source infrastructure (built in Rust) for internal software and AI agents

Calendrical Calculations

When machines pay machines, who bills the machine?

No existing dev tool fits perfectly, so I built my own

One Word Silenced the West [video]

Reports of code's death are greatly exaggerated

Only 9% of MSPs have strong email spoofing protection across lookalike domains

A little gap that will ensure the future of AI Agents being autonomous

Non-trivial error in physics paper found via Lean

Careless Whisper – personal local speech to text

Amanda Peet on Getting Breast Cancer While Losing Her Parents

Decorative Patterns of the Ancient World (1930)

CryptoSlate is charging AI agents $0.09 per article via x402

Contrarian AI Investment Theses

Anthropic sent lawyers – no more Claude Max in OpenCode

Ext-Markdown-mirror – now supports Pages Router and better image handling

Show HN: 20 years of Hacker News discussions, clustered and visualized

q and KDB-X

'Miracle': Europe reconnects with lost spacecraft

Freestyle Linked Lists Tricks

Looking for Contributors and Sponsors – SuggestPilot

Cooking with Functions

Sprite OS

An effect notation based on with-clauses and blocks

AI Playground for developers (built in Vite and Python)"

Install your own data breach

HN: Lasvegasbrief.com – A Signal-Based Newspaper for Las Vegas