Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

New research suggests Bennu's boulders might be more porous than expected

Your Site Content Is Powering AI. Your Bank Account Has No Idea

An effect notation based on with-clauses and blocks

AI Team OS – Turn Claude Code into a Self-Managing AI Team

The development of ChatGPT killed Chegg. I watched it happen live as an employee

Web Rewind

De-anthropomorphizing "AI": From wishful mnemonics to accurate nomenclature

Worker cooperative for open source tech related to scientific image data

Running an AI Agent on a 448KB RAM Microcontroller (Zephyr)

Mole – Deep clean and optimize your Mac

Big Tech Spends More on Buildings Than Research

Response to Misleading Claims – Delve

Polsia – AI That Runs Your Company While You Sleep

Ask HN: what’s your favorite line in your Claude/agents.md files?

Designing delightful front ends with GPT-5.4

Debian's 2026 Election Accidentally Has Only One Candidate

Show HN: TabPilot – Search across Safari tabs and windows

Unswitch – AI Assistance for doing, not chatting

Vibegif.lol

Show HN: Machine learning and AI. Hype not included

A European DNS Server Added 1 Second to Every Page Load in Australia

Philip K Dick [Wiki]

OpenAI offers $100 in free Codex credits to college students in US and Canada

Construct's official 3D model object

Antibrittle Agents

The $3.5T Private Credit Crisis No One Is Talking About [video]

Pizza delivery driver built triple OS where folders SOLIDIFY at 5% capacity

Supermicro co-founder arrested, charged over $2.5B Nvidia GPU sales to China

Chinese AI videos used to look fake. Now they look like money

Now anyone can host a global AI challenge