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?

Grok Bot: The cycle of productivity tools repeats itself in AI

4-Dna.com

Show HN: Shrinking my 159-byte x86-64 Hello World ELF to 153 bytes

Partial Operator Precedence

Buy into the Emacs Platform (2018)

Nops: Read SOPS-encrypted secrets in .NET without the sops binary

We're heading past 1.5°C

Open Source Charging Monitor for Android

Show HN: EdgePad – tool for configuring edge touchpad gestures on Linux laptops

Covely – An offline personal finance app for Mac, Windows and Linux

Who to build for, now that vibecoding makes software cheap

New Spencerian Compendium

Posthuman Mimesis

fheroes2: A recreation of Heroes of Might and Magic II game engine

Bye Bye Brotli? Google's Compression Library Is a Security Mess

Lindt got chocolate price hikes wrong, chairman says after CEO's ouster

From World-Wide Web to Super-Brain (1995)

"This American Life" Reveals Coca-Cola's Secret Recipe (Ingredient List) (2011)

Balloting has completed for C++26. Unfortunately it was Disapproved

Researchers identify the main factors in pornography use among adolescents

An open, structured taxonomy of what children learn across the primary years

The Years We Can't Hire Back

Show HN: Clara – a decision model that returns a probability for every answer

Samsung running a TensorFlow lite model on 960x540 image to track you

Abstraction Fatigue

Jev-style decisions for IMAGES: Fovea-4B, open 4B, one forward pass

CVE-2026-107891: musl Libc Integer Overflow in regcomp Leading to Heap Issues

The Commentapocalypse Is Nigher

Djedi Project

Show HN: Philosphic Moon in your terminal where you can meet other scientists