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?

Delegated Capability and Non-Delegated Responsibility

Unified Grid: How We Re-Architected Slack for Our Largest Customers

Happy Diwali

GitHub Down Again?

OpenSSL 3.4 and 3.6 End of Life

Incredible take from one of the GNU maintainers

Show HN: stardelt.io – a self-hosted lakehouse on k8s (pre-alpha)

a

Is the era of the educated elite over? (M.Gove, T.Debbonaire, D.Susskind) [video]

What Can AI Hack? Inside Frontier Labs' Tests

Elliptic Curve Arithmetic for Quantum Cryptanalysis: A Study of Curve25519

We Visited China's Stargate in Inner Mongolia

Kalder CEO Sentenced to 25 Months in Prison

Researchers unveiled new techniques to protect AI from backdoor attacks

Arete-27B: Training methodology and accepted factual inaccuracies

Ask HN: Is anyone using Codex, Gemini or another model over Claude Code?

Aina Ring

Taiwan sets new short-selling limits to aid beaten stock market 1d •

ThinkStream – AI generates the work. We still need to understand it

Running cyberpunk 2077 natively on Vision Pro

AI Companies Want to Buy Your Work Files and Emails

2026 ACM SIGOPS Annual Technical Conference

Project Steadfast

Hi HN, my first post

Thermodynamics in Einstein's Thought(1967) [pdf]

From the Vault to Your Library–How Seven of EA's Classic Games Were Restored

Agentic Development Future and Current Directions – Nov 2026

I'm Rewriting IBM SPSS Statistics in 100% Safe Rust, Alone

Deuterium's Impact on OLED Displays (2024)

Samsung Put Ads on a Refrigerator You Bought