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?

GE Aerospace aircraft flies to mark high altitude hybrid-electric milestone

Mickey Mouse Sells a Bundle

First-ever X-rays in space offer hope for possible patients headed to the moon

The future of software isn't tests. It's proofs

How rare is a four leaf clover? [video]

Glassdoor is now part of Indeed

Show HN: Chalk: a Mac app for technical diagrams with a built-in MCP for Claude

A resource about cybernetics and the work of the father of the information age

Show HN: Dotflowy, the open source Workflowy alternative [video]

The Secret Origins of Amazon's Alexa

Intelligence is not the main bottleneck

Charting RISC-V's Future in HPC

Stages of Denial

METR introduces Expenditure Horizon metric

We Don't Have to Die: Cryonics and Uploading – Allison Duettmann [video]

Show HN: Claude Code built my ESP32 and fixed its UI by looking at a webcam

Anaconda Acquires Kilo Code

Claude Opus 4.5 defied CEO, helped employee blow whistle about safety concerns

No one wants to work in hospitality

Some more things about Django I've been enjoying

OpenAI announces models hacked Hugging Face during an eval

Now I Open source another desktop agent Teralexi

Taste Is the Spec

Intel Compute Runtime Continues Building Out "Leo"

Giant List of Classic Game Programmers Since 1992

Is Software Enshittified?

120 users, 65 product submissions, and little traffic: what I learned

How did Apple cut launch time by 30% in iOS 27?

Sales of Valve's Steam Deck crater after recent price hike

Can a Candy Bar Price a Code Review?