Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

The first neural interface that transforms your thoughts into text

Indent Is All You Need

The arrogant superbanker whose hubris brought Britain to its knees

Making the Rails Default Job Queue Fiber-Based

The Dirty Little Secret of AI (On a 1979 PDP-11) [video]

HappyHorse AI – AI-Powered Equestrian Training

Master of chaos wins $3M math prize for 'blowing up' equations

Why the Original Task Manager Was Under 80K and Insanely Fast [video]

Influencers Are Spinning Nicotine as a 'Natural' Health Hack

Details that make interfaces feel better

Watch a 200 Pound, 14" Drive from the 80s Boot Unix [video]

My billing system, it could be useful to some

ConvertHook – White-label widget that shows where brands rank in ChatGPT

Palantir manifesto reads like the ramblings of a comic book villain

SUSE and Nvidia reveal a turnkey AI factory for sovereign enterprise workloads

Curlew conservation scheme makes breakthrough in Fermanagh

Modern Front end Complexity: essential or accidental?

Show HN: WeTransfer Alternative for Developers

Keeping code quality high with AI agents

The MACL Extended Attribute

Mother Earth Mother Board

US recession probabilities implied by the yield curve

Show HN: AnyHabit – A minimalist habit tracker for Raspberry Pi and Docker

Highlights from Git 2.54

Enhancing Sporting Organisation Efficiency with Generative AI

Reconstructing a Vue and Three.js app from a single Webpack bundle

Show HN: Tiltbump – another game in a single HTML file

WebP to PNG Converter – Convert WebP to PNG Online Free

AI agents are a security nightmare. Moving the dev workflow to QEMU

Kiss Principle