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?

Modbook

Ask HN: How would you market this service?

Data Center Fornicator [video]

Zapping Rocks Unlocks Stimulated Geologic Hydrogen

Show HN: Widen, a native Postgres GUI using Apple's on-device LLM

Installing NixOS on my car: Part 1

Has the hallucination problem in AI been solved?

Systemic Risks in the Managed PostgreSQL Industry: Extension Risks

Patterns and problems in emerging multi-agent systems

Fairly Ranking the Most Brilliant Birds

It's How You Ask: Gender-Associated Linguistic Bias in LLMs

US Space Force gives Rocket Lab $397M to build threat-tracking 'Flatellites'

A Workaphile's Apology

Dario Amodei on Concentration of Power

Snail OS – Custom Firmware for the Xteink X4

Omarchy Quattro by DHH Released [video]

Why Your Summer Wardrobe Should Include UV Protection, Linen Clothing

California Energy Storage System Survey

Theory of Constraints

Destroying My Homelab with Kubernetes – Linux Society UNSW 2026 [video]

Guiding Ships with Moire Patterns

TrueStar – AI moderated expert interviews and multi-agent deep research

CosmicOS: An open source Contact message

We Can't Control the Bots

Privacy is an underrated advantage in Slack apps

Dots3-Note Preview

One Moment – A temporary clipboard that lives only in the browser

Attention Through Arithmetic Intensity

Snap Chart AI

Privibe - LLM Cli Local first+privacy focus+llama.cpp cache branch + Qwen3.x