Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•12mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Bedrock Linux: A Meta-Distribution for Combining Parts of Other Distros

GNAT: The GNU Ada Compiler (2004) [pdf]

Munich Tram Cars (1876 – 2026)

I guess it's probably the best time of year for a protest

Show HN: Intent Bus – SQLite job bus for coordinating scripts across devices

John Rawls and the Death of Western Marxism

The Linux Kernel Tree About to Hit 40M Lines

The Prompt API

Agentic Workforce Framework, an operating model for autonomous agent teams

Notepad++ for Mac

Show HN: Friendly prediction markets to turn trips into a running tournament

Kenya's Sabastian Sawe is first person to run sub-2-hour marathon

EvanFlow – A TDD driven feedback loop for Claude Code

TurboQuant: A First-Principles Walkthrough

Language Anchoring: A Systematic Method for LLM Multilingual Adaptation

Smolwebifying My Site

Internet Graveyard

A better Kubernetes, from the ground up (2020)

Blog Is a Radio Station

Show HN: The Unix Magic poster, annotated (updated)

SpaceX warns probes into abusive AI imagery could cause headaches for IPO

From super powder to super power

Protein-templated synthesis of dinucleotide repeat DNA by antiphage RT

Sama: Feels like a good time to seriously rethink OS

The Fourth Beta of Android 17

Aether – A GCP-Native Framework to Terminate LLM Agent Drift

What I Did In The Hedonium Shockwave, by Emma, aged 6 and a half

Parental Controls

The biggest insect ever was a "dragonfly"

Coding agents ignore their own budgets