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?

Pocketbyte: Modular ESP32-S3 Pocket Computer for Games, Music, and PDA Stuff

Offgrid, solar powered fridge, with no battery bank

Git credential-cache and suspend: an unexpected timeout behavior

The five primitives I run a whole company on

Crystallization of Hard Spheres

Apple fixes 75 security issues with your iPhone and 150 for Mac, update now

The Burau representation of the braid group is faithful for n = 4

Measured LLM inference speeds on Apple Silicon, with raw data (CC BY 4.0)

"Google and Reddit do not own the Internet," web scraper says after court win

Person Opposing Data Center Arrested for Clapping at City Meeting

Manufactured crisis – Europe's car industry hoards funds, delays climate action

SoK: 20 Years of Power, Privilege, and Peril in x86 System Management Mode

Big Tech credit risks rise sharply as AI spending soars

Boris Cherny says "delete your Claude.md every 6 months"

Manage Your Agent's Loadout with Dr Skill

The new SDLC with vibe coding: what Google's paper says

Show HN: AlgoDeploy – Python algo trading you run yourself (Alpaca and IBKR)

Dr. Death (James Grigson)

Show HN: Trylle – The Next-Gen Git Platform for Modern Teams

Show HN: Dowe – A full-stack language for server, web, desktop, Android, and iOS

Why communication might be the missing link in engineering education

Convergence Is Not Enough

Show HN: Bike ride planning tool with weather

We used to be able to buy things in this country

Netflix employee fired for sharing personal details in retreat trust exercise

RTL meaning: What is Register Transfer Level and how to use it?

Astronauts describe persistent 'observer' sensation after 6 month missions

Bonfire for communities: groups and tools to organise together

Functional CQRS with .NET

DConf 2026 in London