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?

Thundermail June 2026 Update

Russell Vought's Latest Plan to Gut the Government Should Terrify You

Rura: Interactive TUI scratchpad for building shell pipelines

China's CXMT Is Set to Challenge DRAM Incumbents

Show HN: HowMuch – Wordle, but you guess prices

LogiGate: A zero-trust middleware architecture for AI liability written in Rust

California wealth tax fight moves to voters

What happened after 2k people tried to hack my AI assistant

Sochely – An SEO-first platform for creating and discovering local events

Notion is shutting down its email client one year after launch

Iraq warns it might leave OPEC if oil quota not raised

Musk ordered to testify in election lottery cases; one lawsuit may be narrowed

Competition intensifies for Anthropic and OpenAI ahead of IPOs

Phases of Ice

White House asks OpenAI to limit its next model release

Hallucination in World Models Is Predictable and Preventable

Honesty gets Emacs patch rejected

Guardrails for offensive AI agents and why instructions are never enough

How to Write an Effective Software Design Document

Vanguard on Demand: Kernel Level Cheating (Prevention)

Offline Access and Authentication

My Argument Against Self-Care

Why Problem Statements Aren't Enough

Local-first AI coding assistant for IntelliJ-based IDEs (paid)

Why the Slate Truck Only Costs $25K

A Declaration of the Independence of Cyberspace (1996)

Show HN: Bikepacking Planner

A data race that doesn't compile

Xbox follows Apple with price increases

Rust Foundation Welcomes OpenAI as Platinum Member