Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Show HN: Revise – a new canvas-based word processor

Scaling the Fraud Economy: Pig Butchering as a Service

I created a tool to roast your landing page

Show HN: A full-scale build simulator for Dreadmyst (Action RPG)

Lsferreira42/figlet-go: A figlet Golang rewrite

Chinese woman discovers her iPhone X can be unlocked by her friend's face (2017)

Fill in a lean canvas nicely in the browser and download it

Ask HN: How do you prevent AI agents from going rogue in production?

AI Analyzes Faces to Measure Pain Levels

Show HN: FlexList – A global leaderboard where you pay to own your city

EmbodIOS - AI inference as the operating system (3.5s cold start)

Birth Lottery

InvokeAI Commercial Platform Shuts Down, Open-Source Project Continues

Salesforce, SAP, or ServiceNow: Which Is Most Ripe for Disruption?

90% of Cheese Contains a Pfizer-Developed GMO Ingredient–Here's What That Means

Show HN: AionUi – Open-Source Cowork for Claude Code, Gemini CLI, Codex and More

Show HN: FastScheduler – Decorator-first Python task scheduler, async support

Ask HN: Salesforce, SAP, or ServiceNow: Which Is Most Ripe for Disruption?

Git Subtree and Other Tips for Migrating a Repo

Password Storage

Citigroup set to cut about 1k jobs this week

Show HN: StatefulSet Backup Operator v0.0.3–Configurable snapshots, Redis tested

Node.js Tuesday, January 13, 2026 Security Releases

Show HN: DSAT – Data Subject Access Toolkit

Software Is Mostly All You Need

Pentagon is embracing Musk's Grok AI chatbot as it draws global outcry

The rise (and future fall) of Discord (2024)

Apple and Google's AI partnership announcement spells AI wrong

Show HN: OneView – Autopilot for Marketing Data

Overflow: React Flow component library for user-friendly diagrams and flows