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?

Good listeners connect more easily with strangers, study finds

Flying with Photons: Rendering Novel Views of Propagating Light

The Paper 2

F-16 Falcon Strike, modern combat flight SIM for Atari XL/XE

Keeping 20k GPUs Healthy

Show HN: Circe – Deterministic, offline-verifiable receipts for AI agent actions

CoreSpeed: Agent Runtime Infrastructure

Open Reimplementation of Google Widevine Content Decryption Module for Browsers

Idiomatic Rust – A peer-reviewed collection of Rust articles/talks/repos

Gary Marcus on the Problems Facing AI and LLM Scaling – The Real Eisman Playbook [video]

Spotless-Keep your code spotless

Show HN: Artificial Ivy in the Browser

Show HN: Foom.ist: When silicon surpasses human brainpower

Hotcrp.com: Unauthorized document access at CCS 2026

The New York Stock Exchange Develops Tokenized Securities Platform

Two thirds of the wheat is developed by CIMMYT

Firehound is a repository of App Store apps exposing data from users

Deliberate AI Use

Mario Bros. In CSS (No JavaScript)

LLMs Outperform Data Scientists (2025)

Show HN: PublisherLens – advertising platform intelligence and analytics

LogSentinel v3.9 – Ultra-Fast Enterprise Log Analyzer with Error Intelligence

Show HN: Username Search – Free Username Checker and Generator

Built a Real Life Running Man Competition. Partner with Steve Will Do It?

Basis Universal v2

Hackers disrupt Iran state TV to support exiled crown prince

NATS Console – Open-Source Web UI for Managing NATS JetStream

Iran Death Toll Estimates

Graphical Tricks in Classic Games

DIY Paint Color Maker