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?

Leak Exposes 41,000 Homeland Security Workers–Including Undercover ICE Agents

XReal Aura – Android XR Glasses

Why headlights seem more blinding than ever

Errors in the Research of Emmanuel Saez and Gabriel Zucman

LectureInk: Open-source study notes from video tutorials

How to Outrun the AI Hackers

Inequality in Equal Land

Octoverse: Commits, pushes, reach new highs in 2026

In a Setback to VMware, Tesco Is Looking to Migrate to Proxmox

When AI Does the Work, What Will Humans Do?

DOJ is inquiring about Nvidia's purchase of Hugging Face

The case of the 9 bit AES key

AI Startups Are Getting an Inch and Taking a Mile

Ask HN: Why is pagination gone on "Ask HN", and showing only 19 items?

Jacquard Machine

Latest Drop by DDoS Contains Contact Info for 40k DHS Employees

Cubecursor

How, and Why, We're Adding A.I. Tools to NYT Cooking

Leak website releases data on DHS employees

Show HN: I built a tool that finds reliability bugs in your code

Apple Touch

Climate Change Stopped the Next Ice Age

Goto Considered Sick (for error handling in C)

Synthetic survey respondents from real census data, with a calibration score

Show HN: Enframe – Drop-in sidecar that wraps any OpenAPI spec to an MCP server

Ask HN: Advise on monetization model for my freemium app wanted

Getting good at AI takes time and practice

Ask HN: Alternative to Tldraw Draw Fast?

lever: Feedback Loops for Coding Agents

Hokum: Notifications for Wayland