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?

Ajax.aspnetcdn.com Expired TLS Cert

UK Orders Ofcom to Explore Encryption Backdoors

Tesla's Germany Sales Down 72% from Their Peak

Giant Anaconda the discovery that is rewriting what we know about the Amazon

Show HN: Show HN: Ted Mosby – open-source Claude agent for architectural wikis

LLM coding workflow going into 2026

Writing Evals for AI agents

Russia damages its only launch pad for astronauts to lift off to ISS (2025)

Finding OnlyFans creators by face: search similar people from an image

Intelligence Platform for the Modern Hunter

Build a Perceptron from Scratch [Rust]

AudioNoise

macOS Tahoe 26.2 ships with an outdated version of Python 3.9.6

WebGPU rolling out in Chrome for Linux

Ask HN: How to design DB schema for multiplayer exp/level system?

Show HN: Marten – Elegant Go web framework (nothing in the way)

Show HN: Tag driven changelog generator (MDX) with optional LLM summaries

SchHow Ordinary People Win Funding Without Perfect Grades

Ask HN: What type of geek are you?

Show HN: Tooliz – An offline-first mobile toolkit built with Flutter (Radial UI)

The Concentrated Economics of AI: Why Cloud Hyperscalers May Be Undervalued

Pretty soon, heat pumps will be able to store and distribute heat as needed

Omarchy 3.3 Linux for PRO-users: archlinux and hyprland and opencode and voxtype

Show HN: VAAK (Voice-Activated Autonomous-Knowledge-System)

Claude Code in RollerCoaster Tycoon [video]

Ask HN: How common is it to withhold info about dilution?

Show HN: MCP server for SOAP web services

Another Round, Another Agent

Operating System Is Smaller Than a Photo

Extracting books from production language models (2026)