Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Show HN: I made a anonymous gallery / Anti Social Media

I built on-device-only architecture for Mac utilities (and why it matters)

Detecting DOSBox from Within the Box

The Allbirds Pivot Is a Terrible Idea... Right?

Recent advances push Big Tech closer to the Q-Day danger zone

U+237C ⍼ Right angle with downwards Zig-zag arrow

Someone bought 30 WordPress plugins and backdoored them all

Congress extends controversial surveillance powers for 10 days

Chinese carmaker patents voice-controlled 'in-vehicle toilet'

Universal INCOME via check is best way to deal with unemployment caused by AI

I built a server security system with AI – come break it

ParseBench: Document Parsing Benchmark for AI Agents

Agent Harness: Inside vs. Outside the Sandbox

Systems Distributed '26

iDev Games – Mission Statement

For Regrowing Human Limbs, This Salamander Gene Could Hold the Keywise

New Treatment Lets 3 Transplant Patients Halt Anti-Rejection Drugs

Could a digital twin make you into a 'superworker'?

Settling Poker Debts is NP-hard

In this U.S. hot spot for data centers, voters have turned against them

Building a Custom HR Announcement Bot

Claude Opus fixed 3 production bugs perfectly. All 3 were the wrong fix

Cloudflare failing to resolve .co domains in some regions

Show HN: I'm Just create a simple dock for Wayland in Rust

Why scientists are nervous about fungi

Probabilistic engineering and the 24-7 employee

Show HN: Dark Mode for Hacker News

Show HN: Glassroom – See what's happening in your kid's Google Classroom

Show HN: AI Hat Arena – real-time voice charades with AI

The Watch Expert Catching Multimillion-Dollar Counterfeits