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?

Seeking Work – Remote – Same-Day CI, Docker, Python, or Node.js Rescue

Transform any binary file into sound and MIDI, right in the browser, free

Golang Maps: how Swiss Tables replaced the old bucket design

Qualcomm Plans to Increase Its Prices by Double Digits

ErrataBench

Senior White House official claims China's K3 model stolen from Anthropic

Philoscopia – Orient Yourself in Thinking

BGP ORIGIN attribute manipulation and its impact on the Internet

Google meets the neighbors and gets both barrels over its new UK datacenter

Swiftfilt – C++filt for Swift, with structured output

I got into YC by hacking it

A Taxonomy of Self-Evolving Agents

Ultrasensitive measurement of brain penetration mechanics with microscale probes

Gsxui – Shadcn-style components for Go

Future of SaaS

JetStream Anti-Patterns: Avoid these pitfalls to scale more efficiently

All the HTML to PDF Libraries

Zuckerberg's AI optimism blitz using nostalgia to sell AI future amid backlash

PlayStation Network outage leaves players dreading all-digital future

A representation of a chapter of your life through music

Data Depot [pdf]

Tesla swapped a solar owner's lease contract for the Book of Enoch

The Carbon programming language: graduating from the experiment

Alphabet's $205B AI spending plan spooks investors

Building a DynamoDB Conformance Suite

Measles Cases and Outbreaks in 2026

The absolute state of state management

We built an email platform you deploy in your own AWS account

Build Systems Discussion

Mistaking making for the thing you've made