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?

Realistic Code Execution Exploit Chain in OpenBao and Vault

Package Manager Sandboxing

Anthropic's prospectus details losses, growth, and, yes, a warning that its AI

GeekyAnts reports top-10 placement in Clutch's financial app developer rankings

Show HN: Bough, Visualize your vibe coded project: progress, time, cost and more

AMD buys World Labs for $8.2B

Show HN: Jevstiller – Distill Jev into a local model, with a disagreement bound

What $10k a month in sales costs you on each payment provider

C++ reminder: Function-local static variables are initialized only once

Does a design studio still make sense?

Which Wikipedia knows most about what? 122 subjects across 332 languages

Donating to Open Source

My relationship with AI is changing

Porting a 1996 Pascal/Delphi Calculator to Rust (CLI and MCP)

Show HN: Platform to promote vibe coded projects

Mistral CEO says U.S. AI safety debate masks competitors' 'negligence'

There's a New Threat to Your Personal Finances

When will the AI price wars begin?

Show HN: Sliderino, presentation software for the age of agents

Kestra Unauthenticated Remote Code Execution CVE-2026-49869

I built my ideal mini computer [video]

The Mythology of Conscious AI

Show HN: YuliusBox – 26 free tools that run in the browser

DotBot: Easy-to-use micro-robot for education and research purposes

Ingressing Minds: Causal, Non-Physical Patterns Inform Embodiments

DesktopBrain – AI File Organizer for Mac and All Folders – Private On-Device AI

Qwen3.8-Flash-Next Is on TensorFold with Speed Boosts

US sanctions force The Netherlands off Microsoft and toward alternative NixOS

Show HN: A terminal where AI coding CLIs can mention each other

Oracle's Jupiter datacenter in Mexico on hold