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?

Genesis – Real-time atomic and subatomic physics simulator

Tell HN: Anthropic found 36 bugs (6 CVEs) in Pion, OpenAI missed them

No Context Adam Curtis Intertitles [video]

What we know about the arrest of the Saudi OpenAI engineer

Ask HN: How did you learn a (natural) language?

Is the Future of Engineering a Software Factory?/Patrick Debois (Coined DevOps) [video]

Benchmarking open-source LLMs on Verilog RTL generation across 50 tasks

The biggest mammal of the Jurassic was a 5-pound otter

AI Vibe-Coding Just Hit the Video Game Industry Like an Avalanche

Publish Unreal games to the web with a single prompt

GPU-Accelerated PostGIS

Show HN: I benchmarked 6 MCP proxies in Claude Code, then built my own

Ryzen 9 9950X3D2 sold by Amazon was an Intel CPU under an AMD heat spreader

Show HN: Pogi – AWS, Google Cloud and Azure on your machine, in one binary

I found some bugs in Create mod and checked them in Minecraft

Exposé-style overview of all your windows for sway, with live thumbnails

I never authorized an integration that scans my secrets

Gnome OS Preview

Meta: Ever Got Stuck?

Nothing Is Boring in America

How to effectively debug when you no longer understand the code

Robert Hall, Optimal Money, and the Nobel Prize

Analytics engine based on LSM Tree

Brazil's electoral court rules against Meta for pro-Bolsonaro algorithm bias

Ross Douthat: How to Survive the Robot Apocalypse

Steve Jobs Faked His Way Through Unveiling the iPhone (2017)

From Redis pressure to a healthier service

Musk suggested Trump restrict Ukraine's Starlink service, Telegraph reports

Mo' Turns, Mo' Problems

Pseudo-Polynomial-Time Load Balancing