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?

Skeptics Question Whether SpaceX Is Worth $1.77 Trillion

Spark – Turn any article into a LinkedIn post without leaving the tab

JEP 401 being merged into JDK 28?

Shall we play a game? – LLMs use tactical nukes in 95% of simulations

Recognize and break the cycle of poor family upbringing

Mtplx 1.0.0

FAQ: The Secure Boot Disaster

AI Learned How the Universe Works and Created Unexpected Problems for Physicists

Refactoring English: Month 18

Powering the next era of Confidential AI

Show HN: PyTorch on Java

The three lines of CSS that saved me 40kb and might do the same for you

Governing agent autonomy with Auto-review

The Great American AI Act (draft) [pdf]

Anthropic launches $150M Claude Corps nonprofit fellowship program

Ivanti Sentry pre-auth RCE (CVE-2026-10520) – CVSS 10.0, public PoC, CISA KEV

Building a Personal RAG Chatbot in a Few Days

Show HN: A habit tracker for people who keep quitting their hobbies

How Diana Ross' 1994 opening ceremony penalty gaffe came about

When Weight-Loss Drugs Don't Work

Rust Programming Language learning roadmap

Building Hollywood Motion Capture from Scratch [video]

Several things I like about macOS 27 Golden Gate that have nothing to do with AI

When we ask how to help

Please, Use a Link

An Introduction to Quantitative Spatial Economics

Ekbatan – Java persistence framework for event-driven systems

Only Law Can Prevent Extinction

California woman sentenced to 4 years in deadly OnlyFans fetish encounter

ITScape: Guest-to-Host Escape in KVM/ARM64 (CVE-2026-46316)