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?

Trump phone data leak [video]

Deadlines [pdf]

DMARCbis Is Published: RFC 9989, 9990, and 9991 Replace RFC 7489

Gemini Omni

Hackers Reached GitHub's Internal Repositories Through a VS Code Extension

AI Safety Is Underfunded by Design: Model for Incentive-Aligned AI Safety Policy

GitHub: Incident with Actions

Show HN: IgniteMS – batch text embeddings at 253K msg/s on 8x A100

Privacy Shouldn't Be a Corporate Decision

Green steel startup Boston Metal is doubling down on critical metals

People writing about their use of AI

Why English will never be a programming language

Utah legislature to explore data centers' impacts

PreyReach – AI chat that pulls local-business leads live from Google Places

Bashiir

Entropy, relayed from real RTL-SDR hardware

I Don't Vibe Code

Disney Faces $5M Lawsuit over Disneyland Facial Recognition

Big Tech Backs Colorado OS-Level Age Data Bill

Township Leader Resigns in Tears over OpenAI Data Center Death Threats

After Town Bans Flock, Councilmember Crashes Out, Proposes Internet, Phone Ban

James Murdoch to Buy New York Magazine, Other Vox Assets for Around $300M

Scaling Real-Time Traffic Forecasting with a Graph-Aware Transformer

Show HN: Dari-docs – Optimize your docs using parallel coding agents

The Great Token Wager

VSM Loop: Viable-System Orchestration for Multi-Agent R&D

Exploit released for new PinTheft Arch Linux root escalation flaw

Ask HN: Shouldn't Google need to give a public statement about Railway incident?

Show HN: Prism Coder – Qwen3.5-14B fine-tuned for MCP tool-routing decisions

Nobody Cares, Write Anyway