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: Personal Context Manager

Brazil will require facial recognition to keep a mobile phone line by 2029

Capital Wants a Monopoly

Building Java Me Apps with Modern Tooling

Metabolic Heterogeneity of Obesity

Launch HN: Simantic (YC F26) – Firmware Simulation for AI Agents

Where the Next Maintainers Learn

H.264 Is Magic

Serving Prefill and Decode for Agentic AI (On Tenstorrent Blackhole)

Embrace: RCE, Address Bar Spoofing and More in Cursor, Codex, Copilot and Claude

Is $ 80K okay to live in US?

Ask HN: I built a local-first in-browser vector PDF editor with OCR – feedback?

Getting good at AI takes time and practice

LLMs for Computational Social Science

I 'write software' as of Oct 2026 – Part 1

UK social media ban may lock out more than 100k teenagers without ID

AI for Science expands to foundations and research institutions

Dead Star Offers a Glimpse into Our Solar System's Future

Alphabet shares tumble in $500B rout

Democrats' Secret Effort to Stack Alaska's Ballot

Stars' criminal histories could reshape estimates of their magnetic fields

I'm building my toddler a game wall, and Google's dead Stadia controller runs it

Running Self-Hosted AI Agents on Oxide

An Al Breakthrough Has Made Decades of Computer Science Research 'Irrelevant'

Show HN: Witchat – Windows/Linux client for the bitchat Bluetooth mesh

Grace Blackwell needs a new scheduler: 27% more usable GPUs from the same racks

MCP tools should disclose LLM and external API dependencies

Give your coding agent a verification harness to check its code

Show HN: Wavefunction – a minimal, open-source desktop coding agent for Mac

GeDefense TV – local-first security console for Android TV / Google TV