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?

Apple's iCloud File Sharing Left Ex-Employees with Access to Secret Documents

AI's debt binge can't last, hidden borrowing reaches $1.65T

Ieepa Tariff Refund Process

Is Kentucky About to Give Billions in Tax Breaks to Data Centers?

Linux didn't just eat 10% of Windows share, AI bots are inflating the numbers

DDoS against Norwegian government IT infrastructure – status

Thought Atlas of Human Culture Through Chronology

Ask HN: ThePirateBay vs. Anthropic

Who's legally to blame for Anthropic and OpenAI's autonomous AI hacks?

The 1990s Web vs. today's AI

How do we prove our newsroom isn't AI?

When is it OK to use AI?

PicoEFI: Minimal build environment for EFI applications

Global Aviation Incidents Map

As France's Elders Swelter in the Heat, Postal Workers Come to the Rescue

Qwen3.8 Max Intelligence, Performance and Price Analysis

Teacher Sent a Private Snapchat Complaining…Police Pulled Up to Her School

Show HN: AxiomCore – a Claude plugin that keeps your projects structured

Kafka App? There's a Skill for That

Online Safety Act – Call for Evidence

Web app turns hand gestures into electronic music

Working on Economics with Fable 5

Science-backed tips on how to avoid distractions

It's 90 Degrees in the Arctic

Show HN: Yet Another OpenCode Plugin

New York Will Require Digital ID Checks for Social Feeds

Concern about AI spikes following OpenAI hacking incident

Reasoning walkthroughs for the ten problems [pdf]

The Dunning-Kruger Effect Is Probably Not Real

Modeling generative AI adoption and digital divide among Chinese rural teachers