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?

Martin Picard's Mitochondrial Theory of Mind

A quarter of EU power came from solar for the first time in June 2026

MX3D Bridge (3D printed bridge in Amsterdam)

Show HN: Scaffold a raw idea into something ship-ready in under a minute

Show HN: iMessage is the best interface, so I built TypeScript SDK for it

Meta scales back plan to track keystrokes, mouse movements after staff uproar

Show HN: A Back end-as-a-Service for collaborative SaaS applications

A Companion Robot Company Just Landed a Classroom

Memetic transfer: ecosystem of information exchange, and the attention economy

How can a dugnad save the web?

Show HN: Leenar – Tell us what you're building, we deploy your infra

Pareidolia

OpenAI Makes ChatGPT ChatGPT Again

Show HN: Design Skills Directory – curated agent skills for UI taste and craft

British coder who revolutionised Ukraine's drone army on paternity leave

Abliterated Kimi K3 for blackbox software red teaming

I vibe coded a free offline Math game for kids

Show HN: Race to AGI – a simulation browser game about running a frontier AI lab

Ask HN: What Is Best for Marketing YouTube or Other Social Media

China's A.I. Play Is Different from America's

Font uses an optical illusion to hide from AI

Show HN: I built a browser workbench for generating and comparing AI music

Roger Summit, Who Invented an Early Online Search Service DIALOG, Dies at 95

Enterprise Haskell at H-E-B

The Voice of Google

Chinese CXMT to Match Micron's DRAM Manufacturing Capacity This Year

Show HN: Turn a Suno song into a music video with beat-synced auto-editing

Cleaning a 120 Notebook Mess

Print a Stencil – SVG to 3D Printing PCB solder paste stencil

Kevin O'Leary claimed opposition to Utah data center was fueled by Chinese money