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?

Future of Cancer Care Today (FCCT)

NCCN Guidelines

Breadwire – Draw a schematic, get a breadboard

Rhino MCP

A game inside Gmail

Loombench: A way to observe multiagent system behavior

Agent identity is a really hard problem

One in ten people are older than 65. Three in four live under a leader who is

The Ratio Club and the rise of British cybernetics

My friend's group chat just got roasted

Human transformation to machine: emotional, mental, physical

Flock CEO: We haven't 'fired' any police departments as customers

Five Possible Backdoors into LLM Search Results

Lorenz and Little: How Much Does Your Tail Cost?

We Know How to Fix Homelessness. Why Don't More Cities Do It?

GPT-5.6 Sol has gone full potato again

The Ferranti Files: 40 Years of Sinclair Secrets Unearthed [video]

Show HN: My Terminal Themes Web App Is Live

Mini organs launching to space may help future astronauts

Kitty-GPT

Tired of agents' walls of text, so I made them answer in HTML

Asia chip stocks fall, AI funding worries

Why Andrew Ng believes AI won't destroy humanity

BeeLLM

Step 5 Preview: StepFun's flagship model for agentic work

FBI disrupts North Korean 'laptop farm' used to infiltrate US companies

Is this the best inference for agents?

The Grid Died of Too Much Voltage

DeepSeek Outage

Show HN: Bokal – Open-source cookie editor without the "tabs" permission