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?

Show HN: TERMy – A fast terminal assistant that does not use LLMs

Tesla launches steering-wheel-free Cybercab robotaxi in Austin

Show HN: Send secrets a server can't decrypt, even if compelled to

How I use GBNF grammars to make small local models stop hallucinating JSON

Ask HN: Rename ChatGPT?

Nicholas Polson Has Written Over 200 Academic Papers in 2026 (so far)

Show HN: Prices.eu.org

BlackRock CEO said Americans' savings and investments will fund data centers

Promptmatics – Free telemprompter following your voice

Weird Little Guys of FOSS

Job Loss Fears in the First Years of Generative Artificial Intelligence

Muse Spark 1.3 Ranks #3 on Artificial Analysis Intelligence Index

I built CashmApp – a "GPS for your finances" that reroutes when life changes

NPM audit service is down while NPM status page reports otherwise

The most important half-hour of my life

Show HN: Videm – An AI image generator with 3 free daily images

Amazon and Meta AI bots account for most website visits

The Raspberry Pi Interactive Timeline · 2006–2026

The Birds Outside, Drawn for You Automatically

ApplyOnce – Local-first job application autofill that reads scanned resumes

73% of What We Blocked in a Month Was One Syscall Your Sandbox Cannot See

A connectomics milestone: Mapping the complete male fruit fly brain

Carbon-aware electricity pricing, measured daily on 38 grids

Today markets scores 67, almost confident

Show HN: NGPDFs – 50 PDF tools that never upload your files

Show HN: Aurict – An open-source Terminal AI

Nvidia will buy Hugging Face for $13B

Beyond Wukong: an AI generated animated drama series [video]

Where Measurement Replaces Meaning

How to Secure SSH and Postgres with Warpgate