Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Prototyping turned into an excuse for not thinking

Ask HN: What should I re-skill in?

The internet is deciding what to forget

Cyphernetes – Cypher for Kubernetes

Show HN: 65K synthetic personas project 136 English council elections

Emergency jabs after 100 children die of suspected measles in Bangladesh

YC interview simulator. Retro game aesthetic

Follow Tracker making NHL players rethink social media

A soft robot has no problem moving with no motor and no gears

Anthropic says new AI model too dangerous for public release

The AWS Lambda 'Kiss of Death'

How Many Lives Do Amber Alerts Really Save?

Show HN: Lingle – Voice agent to simulate zoom-based personal language lessons

Amazon Ending Support for Older Kindles: Full List of Affected Devices

Show HN: Memoriki – LLM Wiki+MemPalace for persistent personal knowledge bases

Show HN: Agent Tuning, using recursion to achieve predictable agent output

Kids Are Discovering the Joys – and Pains – Of the Landline

Open source died in March. It just doesn't know it yet

How the Trivy supply chain attack harvested credentials from secrets managers

Hosted AI API Gateway – smart routing across Google, OpenAI, Anthropic, and more

Funerals Keep Africa Poor

Kanye of the Tech Industry

Samsung's 2026 Q1 profit increased eightfold to a record $38B

A dashboard for the state of the American Chestnut

Use a gaming PC as a Google Gemma 4 LLM server

BunnyCDN has been silently losing our production files for 15 months

Show HN: Rust based eBook library for Python, with MIT license

Show HN: Curated list of ~40 AI browser extensions across 9 categories

The Training Example Lie Bracket

Benchmarking LLMs with Marimo Pair