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?

Observing Earth's Shadow from a Plane

Vanishing Gradient Problem

Show HN: Muro 6.0 – Native Live Wallpapers for macOS, now bigger

Show HN: I'm developing a flat-file agent CMS with WASM plugins in Rust. Free

Agent session transcripts are precious, keep them

Show HN: Learn to program a modular synthesizer in the browser

Show HN: Browsentic Open-source Claude for Chrome alternative for any agent CLI

How RE investors are profiting off a California tax break for affordable housing

Discovery and engineering of avian R2 retrotransposons for targeted DNA

Show HN: Parakeetogo, a portable ASR binary faster than Photon/torch for CPU

F.02 Robot Decommission

Demoting i686 Windows targets to std-only

Pixel 11 doesn't yet meet the GrapheneOS security standards and may be skipped

How to keep learning in the age of LLMs

Abundant Software, Uncertain Economics

Show HN: Mcpward – black-box contract and security testing for MCP servers

Deep Learning Mechanics on Mnist

Fuck Zig (and maybe low-level programming in general?)

How do you review UI pull requests?

Gitframes

What Still Gets Paid If AI Changes the Interface?

Accept 'bad things' in return for benefits of AI, says Sam Altman

Subql/common 5.8.3 compromised: postinstall stealer in 18k-star SubQuery repo

Jovial Programming Language

SSO for integrations, for the one who's building it

OctLLM – Octrees as an Explicit 3D Language

Show HN: I built a video transcript tool that also reads what is on screen

Measles disaster in Florida might not be far off, analysis finds

The Myth of Exponential Hypergrowth

Pivot – Real-time analytics on Iceberg and Delta, faster than ClickHouse