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?

Show HN: VectorAtlas – a free 80KB SVG world map with per-country IDs

Show HN: Good web design inspiration for makers focused on results not awards

Do That Which Makes Your Life Easy

3D-printing enthusiast creates 'Flock Sock' to blind controversial cameras

Why is this 15 year old still in Morocco and not in some big company?

A Preview of DuckDB v2.0

We Tracked a Shipment of Rare Books. It Ended at an Amazon AI Training Facility

Tlbic v11.0: Steering Capital from Speculation to the Real Economy

The Year of Micro Design

Engineer used 360-degree cam hidden in bag of snacks to steal DRAM process tech

Should you use AI for a task? Here's a simple way to decide

Hackers exploit macOS Screen Sharing flaw to deploy Monero miner

Incident with Github.com

A Noob Learns FFT

Show HN: An AI market analyst that must cite evidence for every line it draws

"Mad dogs and ": Heatwave economics – summer 2026

Show HN: Stressing LLMs – Complexity Benchmark

Leaf 5 released: a PHP framework built for humans and AI agents

Two API calls exposed AI's hidden reasoning [video]

Deep Orange 17, a solar-integrated, energy-positive electric vehicle

Recalls surge for vehicles as parked cars are bursting into flames.

GitHub down again? no PR access

What breaks if I delete this file? React tooling can't answer that

Hard Problems and Heuristic Answers

Show HN: 1667, a terminal UI for writing fiction with language models

Hamilton Morris on His Darkest Research Story [video]

Securing the Infrastructure of Intelligence

Tell HN: GitHub Is Overloaded

Rodney Mullen invented over 40 skateboard tricks and patented none of them

The root cause I was certain of was wrong