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?

Lybrary,a persistent AST-aware code memory for AI agents(MCP server pip install)

Show HN: Agent_acid – ACID rollbacks and dry-run guardrails for AI agents

I'm Begging You: Never Write with A.I

Cross platform, portable and CPU accelerated AI inference with Go 1.27

WebDuck – DuckDB as a Service

Does Silicon Valley Dream of Philip K Dick?

xAI launches Imagine Image 2.0 for production image workflows

JEDEC releases new SPHBM4 standard to slash AI memory costs – 512-bit interface

The Genesis Mission: AI and Quantum-Driven Discovery

The ultimate horse

Samsung debuts three new memory technologies – zHBM, zNAND-O, and BV-NAND

I'm Sorry, Dave

Supersonic Trebuchet [video]

Facing 474 GW of interconnection requests, Texas hits pause on data centers

AI on a Piece of Sponge?

OpenAI Trained Models for Months While Those Models Were Coordinating Exploits

Etherpad – the editor for documents that matter

Neutrinos from Deep Inside Earth Provide a New Picture of the Mantle

Mr. Balaji Goes to Kazakhstan

He Had Tenure. The New School Laid Him Off Anyway

Mythos social engineering AISI INC-2026-07-28-01

SECSift – Read, search, compare, and analyze any SEC filing

Show HN: Utter – Turn your voice to automatic To-dos. No sign-up

Traditions are habits somebody else paid for

cpuscout.com Is Down

Show HN: Finding obfuscated GitHub PATs and API keys in large repos

Universality and diversity in human song (2019)

Show HN: Buddy – An iOS browser with an AI agent inside

Twelve Years in the Making: JDK 28 Ships Value Classes Preview

Etherpad: A multi-touch synthesizer for iOS and Android