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?

How Reading "East of Eden" Affected Writers and Artists

PHP2Shell exploitation observed: packet-to-process RCE evidence

Why Gopher in 2026?

Power Leveling – One fitness score from lift, sprint and 5K PRs

Show HN: Redmi phone can do things that $16K GPU is needed for on Ethereum

Rin Chat – An Easy to Use AI Roleplay App

Diablo on Gameboy Advance

'Making a heart with maths' with maths

Your tokens aren't valuable: No more AI

Show HN: Sparse kernel delivering 36% higher training throughput

I vibe coded an alternative to splitwise free

Show HN: CodeAIHQ – High-performance technical analysis of cinema VFX pipelines

Show HN: Omni Verify, my AI agent can't post until Kane checks every promise

Google has officially turned these Nest thermostats back into dumb thermostats

Chá 茶 and Chán 禅 are one

America Has Lost 200k of Jobs in Media, Film and the Arts. How Much Is AI?

Ming dynasty statue unearthed in WA returns to China

Be a Tech Bro

What we learned making 12 apps usable by AI agents with WebMCP

AI Generated launch videos are starting to get insane

Wild Version 0.11.0 Released

What's in a Name?

Free Software Is a Failure

Why Drug Companies Are Rushing to Market Ketamine Medicines

What's It Like Inside a Data Center?

SDF Public Access Unix System – Internet Gopher Club Underground Syndicate

Pencil 4.0

Show HN: DeepSearch – Search engine built on DeepSeek API

A 1k-mile cloud on Mars may reveal physics never seen in nature

Bambu Lab CLI for slicing and printing 3D models