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: GQL Essentials: a free book on GQL

New iPad mini hands-on: Refreshed design, OLED display

Ask HN: Decent Voice to text transcription – what are you using?

Revu – Code review in times of AI

ILrDOS – header-only C++20 robot runtime for a Pi Zero 2 W

How Fast Can FlashProve Go?

Google Summer of Code 2026 results

The Bitter Wall

I found an API key leak in MLflow, and why your AI agent may have one too

Gemini, get your act together

Tabletop: Customizable, collaborative spaces to plan and play together

Building a Harness for a Voice Agent

Language model harnesses are compositional generalizers

The Power and Legacy of Virginia Tech's Mac-Based Supercomputers

SShow HN: Escapee – a horror maze game for Fri 13th

Gmail's AI summary presented a phishing email as a USPTO appointment

Show HN: Papertrails – Your personalized feed of new research papers

Show HN: Dedoomify – AI news, minus the doom

Do 9/10 new AI SaaS websites seem like they should be an editor command to you?

AMD: Where we're going we don't need (as much) DRAM

No employees and prototypes within days: AI agents supercharge startups

The Making of a Startup Simulator

A Modular Cluster Controller for Burst Autoscaling and Graceful Reconfiguration

Pharmaceutical advertising and drug recommendations by consumer-facing AI

Full Stack Washing

Schools in Italy, Scotland and Ireland receive bomb threats

Fine-tune a model on your org's data

North Korea posts revised constitution dropping reunification goal

Meta, TikTok join Google to push back on Indonesia's AI copyright law revisions

In Memoriam: Tim Peters 1952–2026