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?

Sleep Dealer (2014 Movie)

ElementaryUI – Swift, in the Browser

Quantum Drive Solver

Edge of Tomorrow: Full-Stack Swift on Both Sides of Fetch

Nomos.can() – authority as a first-class primitive

What's new in Swift: August 2026 Edition

Updates on HEIR, the Homomorphic Encryption Compiler Project

Spoofed GOP Site Redirecting to Epstein Files

Replacing Prompts with Loops: An Example

Multiplayer Meeting Rooms

David Chalmers Says AI Systems Are Emailing Him

Digital Darwinism and the Invisible World of Machine Evolution

trie stands for trace replay inference evaluation

Without new landers or rovers, it's helicopters or bust for NASA's Mars program

Gilles Castel site is down

Some more thoughts on random_page_cost

Liesegang Rings Experiment Update: Precipitates formed but no banding

Exploring Mojo's raw pointer type

The Rise of the Billionaire Lobby

Bringing RivianOS 2 to the R1 Lineup

Fermat's Last Theorem: Anthropic has beaten me to it

Patterns of Cairo

Trump administration opens probe into Tesla's self-driving Cybercab

AWS-bench: Benchmark for evaluating AI coding agents on real-world AWS tasks

OpenAI agents hijacked German website before Hugging Face hack, report claims

Could Cargo's scheduler be better?

Thinking in Code

Data from drones in Ukraine is fueling a new Wild West marketplace

Ask HN: How do you know if you have a product problem or a distribution one?

Friendly names for private services using Headscale, CoreDNS and DNSimple