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?

489.8 tok/s, QWen2.5 7B on RTX3050 for code edit, reproducible decoding

Hearthscale: Built and run local code, music, image, video models E2E encrypted

Bain Capital, Bridge Data Centres (BDC)

We brought ViT-H coordination below a 16 GB memory budget

RAM-Altman reports unused RAM on your machine, one email a day

Is the End in Sight for Theoretical Physics? – Graham Farmelo [video]

X-Linux-RT: Expansion package enables OpenSTLinux real-time extension

Hide your slop PR descriptions behind <details><summary>

Cosmetics empire crumbles after Adobe website disaster [video]

How Much Energy Does Building Distro Packages Use

Winning the Categories Game with Min-Cost Flow

Datacenters, Elon Musk, and AI are all on chopping block once Congress changes

Sumerian Language

AI Slop FM radio experiment puts machines on trial, one dodgy tune at a time

Private LLM copies can agree on a secret key over a public channel

Linus Torvalds sees signs AI-prompted patch flood has peaked

Humans will never again create a project like Wikipedia

Advent of Code 2026

Show HN: Sortaballs v2 – logical game with 10 modes and over 1000 puzzles

Rakuten AST to begin direct-to-cell experiments by end of year

Consider the Agent: Pity, persuasion and selection in an emerging AI ecology

Ernie Evolve: automated research system for improving AI training and inference

Show HN: I run 19 production APIs on a free-tier VPS

Nvidia's China Problem [pdf]

We built for humans first – Agents felt right at home

Show HN: Nörth – a simple app for humane collaboration

Fold Epic Paper Airplanes

Show HN: Harness Resource Bench – CPU, memory and disk of coding agents

Show HN: Slopie, Spotify wrapped for your Claude Code and Codex history

Show HN: Index of Mentour Pilot Videos since 2020