Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Ask HN: Are we ready for vulnerabilities to be words instead of code?

The True Cost of Grade Inflation at Harvard

If you ever mention AI again, I'll

The use of AI in writing is perfectly fine

Vercel will now use code from Hobby plans for AI training by default

Show HN: Untitled88 – Query your QuickBooks data in plain English

How China is getting everyone on OpenClaw, from gearheads to grandmas

EsoLang-Bench: Evaluating Genuine Reasoning in LLMs via Esoteric Languages

Meta is killing off the metaverse. It lost $80B

Show HN: We Built Kaggle for AI Agents

GrapheneOS: Duress Pin/Password

Show HN: Just Built an AI Notetaker (Web, iOS and Android)

Trump has choked off Cuba's oil supply. China is stepping in with solar

How did Anthropic do it?

The Inverse Cognitive Maneuver: Team size as product strategy

Speed-Of-Light ExecBench: A benchmark of real-world DL kernel problems

Show HN: SomaOS – rebuilding the desktop so AI is native to it, not bolted on

I Hope You Don't Use Generative AI

Toolbench for MCP

Why Headcount Math Lies

Hiring AI-First Engineers

White House registers new 'alien'-related .gov domains as DoD tackles directive

Show HN: Blik360 – open-source 360 feedback (self-host alternative to Lattice)

Free Amazon invoice converter to excel

AI – Assassinating Intelligence

Ask HN: Are the newest LLMs better than you at programming?

DeepL is shifting to AWS for processing

On Hair as Memento Mori

Microsoft (?) sending false "your storage is almost full" warnings

We Made Haiku as Good as Opus. Improving Claude Code with Codeset