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?

Water system controllers don't belong on the internet, says ex-NSA chief

Cop who used police system to snoop for info on crook pals sentenced

Flesh-eating screwworms feast on humans in Mexico; human cases top

Show HN: From raw Point Cloud dataset to regular Grid index

Investors Clamor to Bet on AI Whiz Kid Fund After Situational Awareness Turmoil

Comparable information rates across the human communicative niche

Predictable Updates About Consciousness

Open source, locally translate any video to English

iOS 26 Gets First Jailbreak Thanks to Dopamine

Show HN: Hermes Missions – crash-safe durable execution for AI agents, no deps

China's Kimi K3 AI model escapes isolated sandbox during security test

Schrödinger's Toctou

Ask HN: What art would you like to express?

Geometric Fluid Mechanics (SGP'26 Course)

Release: Rep. Khanna Introduces Data Center Bill of Rights

Show HN: Secchi – Package intelligence in your terminal

YouTube's AI Detection Kicked Us in the Face

xAI's Grok Build 1.0 ships an undocumented remote-workspace command

CFPB Winds Down Probe of Community Loan Funds Targeted by Vought

Smoking accessories are making a comeback

Startup Lumilens Raises $700M to Replace Data-Center Wires with Light

What If Wishes Could Be Bought and Sold?

AI Tool Directory

Pyhctsa – Highly comparative time-series analysis

Show HN: Tape Music Hub, local music library manager with a P2P phone companion

Mailüfterl (Early Transistorized Computer)

Run Gitea Actions on Apple Hardware

Birdsong follows a fundamental law of human language

BMW Rolling Out In-Car Spam

The AI Experts Who Couldn't Predict AI