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: Muxer – Control cmux terminals from Android

PC Prices Got Stupid, So I Tried Gaming Like It Was 1996 [video]

How 'Alignment' Took over the Worlds of Business and Tech

I made a virtual pet fruit fly that Twitch chat can interact with

Dolly Parton's Imagination Library

Xcalidraw -a local-first desktop app for managing Excalidraw drawings

DocsGPT v1.1.0 chat analytics with a 400M model

Show HN: Open Accountant – AI-customizable budgeting app for freelancers

Expand Your Home Computer and Your Imagination to the Limit

AI delivers 'zero financial payoff' to most companies, Apollo economist says

Dog fight: Ornithopter vs. Raptor [video]

Search Photos by What's in Them

China's first AI-generated film hits cinemas but ticket sales lag

We can do impossible things

Pulse: Fast real time speech to text

All you need is Wide Events, not "Metrics, Logs and Traces"

Lightning.ai October 2026 Security Incident

Ask HN: Can superintelligent AI alignement be decentralized?

How Much Computation Do We Get from Every Byte We Move?

Oregon Police Are Charging a Local News Outlet $2.5M for Records About One Cop

AI Boom Looks a Lot Like the Housing Bubble

Show HN: Overengineered Monkeytype for Developers

Fine-tuned Qwen on my 16gb GPU to respond without the letter e

Elisp – Advantages of setting variables with setq instead of custom.el?

Bringing the Russian Woodpecker's Computer Back to Life [video]

The penguins are noisy, the people fantastic – being an Antarctic postmaster

Inhouseticket Like ClickUp and Jira

The Hidden Economy of Your Internet Connection

Flint · free browser streaming software for Twitch, an OBS alternative

Remixing Music to Treat Alzheimer's