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?

Show HN: A free, open-source agent orchestrator for knowledge work

AuralFret – Chords and scales together on one guitar board

Automatically detecting AI text in my browser

Show HN: A FOSS Expense Splitter

Word Processors in Basic, Part 2

Google: Attackers are using prompt injection against coding agents

I'm not an economist, but here's an argument I've been thinking about

Plotext 6 – Plot data, images and video in the terminal

Authentication Is Largely Solved. Authorization Isn't

Ask HN: How to know when Claude has changed model itself during processing?

Besxar is building an orbital semiconductor factory, one SpaceX rocket at a time

How to pick the right AI model for each task [video]

Lloyds Bank Denies Palestine Action Prisoner's Mum Mortgage over 'Adverse Media'

How Big Should a Terraform Root Module Be?

Skill Showcase: /Guide

I love her but I don't want to be her

School Students Who Use AI Get Worse Test Scores, OECD Warns

The Quiet Unwinding of Microsoft and OpenAI

Which Mac for Local LLMs in 2026? A Buyer's Guide

Heat forces French Champagne makers to stiffen their drink

Human-made webring for handcrafted personal websites

FinOps for LLM Spend – why your bill has changed

Anthropic researcher says more than 10% chance AI "could kill all humans"

Show HN: Give your AI agent on-screen guides that show users where to click

How to select your first marketing channel

Where Does Bad Code Come From? [video]

Arctic Summer 2026 Climate Review

Show HN: Adding initContainers and env vars to deployments w/o Kyverno

The Einstein test: what happens when AI tries to rediscover relativity?

Legal AI startup Harvey reaches $15.6B valuation with $550M round