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?

ICE Appears to Be Buying Immigrants' Tax Identifiers from a Data Broker

Lightpanda Agent and PandaScript – LLM at buildtime, not runtime

Thirdpass – The app I wanted every time I left the house

Japan's railways stayed one while splitting apart

'Student Geng' ignites China research-integrity scandal calling out sr academics

AppleOS 27

What's that sound? It's Mount Pleasant's new AI data center [video]

HN: Maturana – Secure-by-design, zero-trust personal agent framework

Show HN: AptSelect – A local LLM client for parallel testing and evaluation

Personal taste fell out of fashion

Al Gore: Scientists were dead right: 20th anniversary of 'An Inconvenient Truth'

AI Growth – Honest AI Tools Directory and Metrics Dashboard

Final DNS Outage of 5 May 2026

Appreciation for the Small Web

Struggling for My Startup

A collection of every site on the web

Status of Jerusalem holiest site threatened as Israeli nationalists flout rules

Ten years of ClickHouse in open source

Show HN: AutomatiQ – Reverse-Engineering Agent for the Web

Computed goto for efficient dispatch tables

Show HN: ctx is now open source, a hackable desktop workbench for coding agents

Show HN: Thulr – a spoiler-free wiki for fantasy and sci-fi novels

Can Java Microservices Be as Fast as Go? A 2026 Benchmark Update

Introduction to the DOM for Vulnerability Researchers

Google Home Speaker

Digital Field Simulation

Explainer for the Cross-Origin Storage API

Will Software Have Its 3D Printing Moment?

'Passive' investors who dodged BTC, forced to own SPCX which is 3x more volatile

FairScan: An Android app to scan your documents