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?

Arista 7060XE7 Series

Incorruptible

How to Revive a Wemo Smart Device

Fastsync: I doubled rsync's local copy speed

Show HN: Instagram for Gmail, a feed where mail expires

Meta alleges NSO violated spyware injunction with new WhatsApp attacks

Granola Notes from WWDC 2026

I ran an arbitrage bot on Polymarket. Here are the real numbers

America's Workforce Academy by Meta

Show HN: Hires Chess Trainer – drill the mistakes from your own chess games

The Data the CIA World Factbook Left Orphaned

Apple Container Hits 1.0

EU Says Decision Not to Launch Siri AI in Europe Is Apple's Alone

Symbolicating a minified stack trace by hand: why source maps can't do it alone

What an $83,000/month AWS EC2 server does

Meta account recovery allowed unauthenticated access to full account PII

$250M iPhone Settlement Proposed in Apple Lawsuit over Misrepresented AI

AI takes people at their word

Show HN: Ocdify – Offline AI that organizes your Mac files, 100% on-device

Personal apps with no back end: static site and OAuth PKCE and OpenRouter

Show HN: Mac screen recorder that adds zoom animations from click data

Apple made a request to the EC to be exempted from interop obligations under DMA

Exceptions should not be handled – they should be aggregated

Industrial 3-D Printers Are Getting Cheaper

We have to change the rules of security

Unified Controllable and Faithful Text-to-CAD Generation with LLMs

Self-hosting email the hard way from your own routable IPv4 block up

Only Bounds

Keystone: The First Agent Harness Framework

Show HN: Sandbox AI-app lifecycle, from build to run