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?

How Efficient Was the Affordable Care Act at Reducing Uninsured Rates?

Book Dedications

Venezuela's oil exports rose to 1.25M bpd in May, shipping data shows

SpaceX sets aside 5% of IPO shares for selected buyers, waives lock-up

CHSE – Rust LLM compressor: 1.15M lines/s, 69-91% token savings

Faster Local engine built from scratch in Rust

Bernie Sanders: A.I. Is a Public Resource. You Should Own Half of It

What's gonna happen to software engineers?

Vercel AI Gateway Appears to Block BYOK Requests When Account Balance Reaches $0

I Tried to Sell My House with a Chatbot

Salmon Creek Farm

Bank Balance Is a Lie, and Fragmentation Is Why Nobody Can Prove It

Fivetran and dbt are one company now

Ask HN: Do you give AI agent the specs and have it start building unattended?

Remember This

How one founder's bet on 'the old school web' is paying off

The Shape of a Neuron – Weights, Bias and Activation Functions

Pretext, Pretext, Pretext: Building reasons to be together

Why the AI Revolution Hasn't Hit Game Development Yet – and Why It's Coming Next

Controlling VSCode from the Terminal

Toy Story 5 shows 'terror' of children's screen addiction, says Tom Hanks

Decache

Can the stockmarket swallow Anthropic, SpaceX and OpenAI?

'Human, all too human'

KineQuetEngine – Bio-inspired context engine in Rust (sub-100µs latency)

Workout App Made with Python-Kivy

Lid-lifting Kiwi author forced to sit in silence at writers' festival

Dell Unveils $699 Laptop with Features 'You Won't Find on a MacBook Neo'

Inherited the front end of a 150K-user app, mostly vibe coded

Ask HN: Side Projects with Meaning