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?

Show HN: Deslop Your TS Codebases

Show HN: Trackd – a Gmail subscription tracker with no bank login

How much of "write simply" is just survivorship bias?

Is the AI Apocalypse for Real? What the intelligence community thinks

AI 'kill switch' may need to be mandatory, Anthropic co-founder says

The Jenna Set (2005)

Show HN: Direct SQL Access to Your QuickBooks Data

"Do You Still Read the Code?"

How I Won $750k With this Drone [video]

AirBaltic files for Chapter 11 bankruptcy as Iran war costs bite

Micro Mock – instant OpenAPI mock server in VS Code, with chaos testing

Prompts Aren't Real

You need another HTML abstraction

The Depression Thing (2017)

A Beginning for Mathematics

97% of US database administrators are running obsolete programs

One monkey mind's 10 days of silence

Ask HN: Is your AI LLM based web service secure from prompt injection?

Submit your ideas for Interop 2027

The Cool Numbers' Club at PostHog

Valve's Steam Frame costs $1,059

Trip Report on VLDB 2026

SmartPantry – Free grocery expiry tracker with no sign-ups

Show HN: Closebytes – 60k open-source projects in a similarity point cloud

Meta bet that AI would shrink its management ranks and is now rebuilding them

Apache Cloudberry's ecosystem docs cover LibreDB Studio as a native SQL client

How to Unclench

Why estimates of hallucinated citations are probably low

The agents are coming for the web and the web isn't ready

GPT-5.6 Luna vs. GPT-6 Astra: Is a $1.20 Model Good Enough for Code Review?