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?

CVE-2026-109619 PHP Sentinel

The foolishness of "natural language programming" (1978)

Affluent and Older Americans Got Much Richer in Postpandemic Years

Show HN: Export Visible WhatsApp Web Contacts to Excel or CSV in Chrome

Twitch Plays: Interpretability of Bonsai-8B

Selling GPU Credits

Apple's $2k iPhone Duo is selling for as little as $800

Ask HN: I acquired a 4-letter domain, what would you do with it?

Livestream GLM-5.3 playing Minecraft

Mississippi AG says use of force was 'justified' in fatal shooting of toddler

Wolfram Rule 30 Prizes

Cannabis legalisation and cardiovascular hospitalisations in the USA

Show HN: Bloom – an org-mode compatible Android app for managing notes and tasks

What FDE Means at OpenAI

Never-Before-Seen Images Reveal Damage at U.S. Bases in Middle East

Warhound raises $200M to engineer war dogs and arm them with Anduril gear

Show HN: Making a smart TV dumb and then smart

Elon Musk Just Threatened the Coming Democratic Majority

Scoop: Unvetted AI agents are accessing U.S. bank accounts

GM Aims to Bring 'Eyes-Off' Driving to AI-Powered Cars Within 2 Years

From Eyeballs to ARR: Buzzy Pricing Metrics and the AI Trade

America is Booming into a Ghost Town [video]

Getty Images files for US bankruptcy, advances restructuring plan

Mapping the Northern Sky

Jank – The native Clojure dialect with seamless C++ interop

L'Oreal says weight loss drugs are impacting beauty and skin care sales

kirsch – A versatile bitmap font with an organic flair

Show HN: Impossible Machines: declaratively program the physical world

Neal.fun – About

Moderna and Merck cancer vaccine met key endpoints in melanoma trial