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?

The Start – Introduction, Mini Market Ticker

A congressman wants to criminalize insider trading on prediction markets

A Response to France's Best-Selling Covid Skeptic

Search is not the AI big data problem

Discord to File Confidentially for IPO

RFK Jr.'S Tuskegee Experiment

A Survey of Dynamic Array Structures

Study: Managers with first-born daughters, hire more women and pay more equal [pdf]

Show HN: I made analytics you want to watch

Coding Adventure: Analyzing Audio [video]

Vulnerability in Ruby that has existed since 2002

Startup develops inflatable fall-protection pants to prevent hip fractures

Debian Gets Its Own PPA-Like System as Debusine Repositories Launch

Hyundai Introduces Its Next-Gen Atlas Robot at CES 2026 [video]

Software Too Cheap to Meter

YII Framework 3.0 Released

Badness 0 (Apostrophe‛s version) [video]

1% vs. 67%: What happened when we stopped trusting embeddings alone

The Privilege and Point of Writing

01.06.2021

Run Claude Code in Obsidian

I Built a Multi-Agent AI to Decide Whether to Go OSS. Yes–By a 10.7x Margin

Prosody 13.0.3 released – An XMPP/Jabber server written in Lua

Show HN: TPU-doc – A zero-dependency diagnostic tool for Google Cloud TPU health

Chat of the Future Initiative – XMPP – The universal messaging standard

European leaders rally behind Greenland in face of renewed US threat

Measure anything. Invariant geometric persistence modeling system

Owning a Domain Increases Digital Self-Reliance

Runtime 0.3.0: The Unified Serverless Framework for TypeScript

Cloud: Row in Bavaria over billion-euro Microsoft contract without tender