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?

Legacy Carmakers Seen Losing Mass Market to Chinese Rivals

Formula 1 returns to Africa with 10-year agreement to race in Rwanda

iPhone Takes Bigger Slice of a Shrinking Smartphone Market

Speculative Sauropods

How to let a coding agent port your code and know what it ported

Show HN: Oxynote – Self-hosted wiki with live Prometheus/SQL charts and reviews

Agent Conversion – Can AI agents use your website?

Using the Wrong Dictionary (2014)

Show HN: Magic Tools Hub – 112 PDF tools that run in the browser

Show HN: Let your agents create product demo for you

Jev handed our LLM the wrong page a tenth as often as our embeddings

Building an evidence-grounded agentic security operations harness on Cloudflare

My self-hosted infrastructure as code

Exposing why every AI launch goes viral on X [video]

Orbital Data Centers Risk Becoming Military Targets in Space

Cyber attack on French supermarket fridges raises alarm over food security

Single technology is killing oil demand

Show HN: Stepbook – run long agent tasks as short steps with saved state

Doomsday: Friday, 13 November, A.D. 2026 Science Paper

IPv4 Parsing: Having Your Cake and Eating It Too

Show HN: Helicon – Desktop App for Meta's Muse Code CLI (Linux, Windows, macOS)

Show HN: Ecsodus – Migrate AWS Copilot apps to Terraform without losing prod

Show HN: Autograph – a music notation editor you can drive with Claude over MCP

Mozilla Introduces Firefox Enterprise

A Visual Intro to Complex Numbers

Show HN: Opensidian

HumanLayer: Multiplayer Coding Agent Workspace

I built a new feature for my blog using my voice

MDMA: An open source federated LLM inference engine

Show HN: AI Crimes, a game where you spot the bug an AI wrote