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?

Preliminary Findings on AI Automation from Worker Evaluations

How the JVM Optimizes Generic Code – A Deep Dive

The Elizabeth line is getting video wrap-around advertising screens

Re: Slow USB storage device? (util-Linux-ng, 2010)

Do octopus brains work like humans'–or is there another way to be smart?

Show HN: Virshle – Make ordinary virtual machines

Why North Korea Will Never Give Up Its Nuclear Weapons

The Advance of Heliotherapy – Nature

Emergent swarm bio structure – mark 36

I Do Not Recommend Bitwarden

English councils to trial Google AI tool to speed up planning decisions

VS Code inserting 'Co-Authored-by Copilot' into commits regardless of usage

Museum Speelklok

Pixel Embeddings Beat Vision Encoders for Unified Understanding and Generation

Azthengar Build 2026.05.01

Show HN: Fabrica – A minimal terminal-based coding agent built in Rust

Inside the Courtroom at the OpenAI Trial

When Dawkins Met Claude

Where to buy a non-Apple, non-Google smartphone

Meta buys robotics startup to bolster its humanoid AI ambitions

One photographer's passion project of capturing local newsrooms

Anthropic potential $900B+ valuation round could happen within 2 weeks

Ubuntu is adding Generative AI features, and other Linux distros might follow

Man takes robot to airport, gets ticket for it, it gets on plane

IPv8 will not work [video]

Menace on the Streets

You'll Subscribe to Your Router, Too – The First Router Bribes Are Here [video]

Ember 6.12

Vibe code with me this Linux system on a browser tab

New Oscars rules: No AI actors, human-written scripts only