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?

Show HN: Jetway, a working airline GDS and message router

Congratulations to the Winners of the 2026 Online Journalism Awards

Why I am so against volunteering in academia (ecology-edition)

British police try to track down theft of 70k pints worth of Guinness stout

Delve (YC W24) accused of misleading customers with 'fake compliance'

Where Europe Goes to Gig

Project Xanadu: Even More Hindsight

Mercury Poisoning Situation at MIT [video]

Patient Who Received Pig Kidney First to Progress to Human Kidney Transplant

Burning Man has become a wrinkled sausage fest of aging millennial men

Stream Ciphers and ChaCha20-Poly1305

Release 13.1.5 · Grafana/Grafana

Late Merge

Show HN: a Rust compiler translating Joern CPGs to Nuclei templates

The Summer of Open Weights

What is Nueralese and Why is it Bad

An Alternative to Jira ScriptRunner

The Last Interview

NuFinder, a macOS file manager with real RAID across S3-compatible buckets

Kalder CEO Pleads Guilty to Securities Fraud

BoardUI

Ask HN: How do you break AI agents out of the "apologize and repeat" loop

Remember Bebo? Founder shares the story

ArtStation Should Put Artists First

Crew – A multiplayer AI workspace for humans and agents, now with iOS apps

Wikimedia Workers Overwhelmingly Win Union with 93% Yes Vote

GPT‑6 Astra

MemWeaver – a vector DB with predictable memory usage

Shell.Online: live browser link for any terminal process

The Latest YC Batch