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: Genbuzz – An agent-driven news aggregator for AI filmmaking

Can BitMine's $213M Ethereum Bet Spark the Next Rally?

Show HN: All the Cron Jobs

Iran war: Trump says ceasefire 'over' after fresh strikes

New Jersey Passes Garden State Balcony Solar Act

Large language models can predict the results of social science experiments

The Whispering Earring (2012)

AI Slop as a Social Immune Response

Managedagents.sh

Waymo traps teens firing toy gun in driverless car, raising privacy concerns

Satellite Surge in the Night Sky: An interactive look at orbit density

Why Toolmaking Is the Most Effective Way of Learning

Show HN: Leafwright – Generate PDFs without running headless Chrome

Which Bazel tests are affected? Ask the remote cache, run nothing

LiberSystem – A capability-based microkernel OS written in Rust

Loop Engineering's Missing Half

And Then the Billionaire Paid Off $550 Million of Our Debts

What is wrong with AI services businesses

Fable Built Thomas Jefferson's Rotating Bookstand

Can geoengineering blunt El Niño's fury?

Miles: A PyTorch-Native Stack for Large-Scale LLM RL Post-Training

Solomon's Paradox

An Inside Look at the UK's Largest Illegal Rave – UK TEK 2026 [video]

Show HN: Axiom-02 – Deterministic engine modeling cognitive dissonance

Meta tests always-on 'super sensing' mode for next Ray-Bans

In Linux, things are often upside down

Ukrainian Navy Reveals Unknown Underwater Drone (UUV)

Meta tests 'super sensing' AI glasses that can capture every moment

Show HN: MacPad – a tiny macOS Notepad.exe-style editor

Dreams and Nightmares: John Berryman's fresh idiom