Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

AI will make formal verification go mainstream

Webb identifies earliest supernova to date, shows host galaxy

Local news organizations discover the value of their own archives

Show HN: Sift – Turning chore into a hyper-personalized, immersive journey

Human art in a post-AI world should be strange

Next Generation Agentic Proxy for AI Agents and MCP Servers

Paramount Pictures X Account Hacked to Read 'Proud Arm of the Fascist Regime'

Meta promises to reduce data sharing for EU users by 2026 to avoid EU GDPR fines

Factory Tours

Securing VMware workloads in regulated industries

Glide

Ask HN: Does your company spend time on system and API design?

Join the on-call roster, it'll change your life

A tiny entropy experiment to push LLMs into unexpected paths

Truecaller Empowers "The CTO of the Family"

Spec-driven development: Unpacking one key new AI-assisted engineering practices

A European plan to escape American technology

BazelCon 2025 Recap

BJH OS – A Free Open-Source Web Based Operating System (Demo and Source Code)

Microsoft Invests $17.5B in India for AI

If NFS isn't the answer for an all-Linux setup, what is?

What Is Atlassian Intelligence?

MASTCHAIN's "Spotify Moment" Captures the AIs Summit, Wins Best New Startup 2025

Trust as Infrastructure – Bryan Cantrill – Monktoberfest 2025 [video]

Show HN: I built an app idea generator

Getting into Public Speaking

More on the messy economics of streaming music

The Z3 Theorem Prover

Jolla: The European Phone Makes Its Comeback

Episodic Memory Architectures for Accurate and Efficient Character AI