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?

Muse Spark Open, the Most Capable US Open‑Weight Model to Date

Opus 5.5 can make full product launch videos

Chinese Users Find Little Money in 'Selling' Their Faces to AI

Investors dump data centre bonds as AI borrowers face 'Darwin moment'

Total War Remaster Removed from Steam After AI Allegations, Brings Back Original

A C++ Trick Question Post

AI Safety Is Not a Corporate Plot

Molecular glue degraders reduce Alzheimer's-linked brain plaques in mice

Notational Velocity comes back in from the cold

The 'leap second' could disappear. How a minor adjustment became a major problem

Lying in a Hammock at William Duffy's Farm in Pine Island, Minnesota

Dual Axes, Not Dueling

Build Self-Improving AI Agents with Temporal and Oodle

Artificial Analysis Decision Index v1.0

Branded

TR-Core – A non-neural symbolic AI architecture built in pure Python

You better start believing in philosophical thought experiments

Anthropic: The Agony and the Ecstasy

Georgia man sues Flock, sheriff's office over alleged ALPR-fueled retaliation

Nunc Sonat, control Apple TV and HomePod music from the Mac menu bar

JEV: Type Safe AI

PhantomWave End to End Encrypted Digital Voice Chat [video]

Pessimists Archive

Danish Supreme Court Finds That AI CSAM Is CSAM

Fintech startup Ramp hits $60B valuation after $1.85B funding round

Making a Software Trailer with Astra

Show HN: Relay – A Mac app that carries replies between Claude, Codex and Cursor

Opsin Raises $21M to Expand Its Risk Protection Layer

Bill Gates returns to wage war on AI risks

AMD Helion for Agentic AI and Enterprise