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?

Getting Out of the Loop: 8 Months Solo-Building with AI

Early Data Indicates an A.I.-Generated Drug Could Slow Aging

Windows 11 users are getting full-desktop ads as wallpapers from Microsoft

GTP6-Astra-Low in Codex launched a rocket in Factorio, on track for next planet

One Document, Two Hands

Show HN: A Free AI Plugin for Google Ads, Console and Analytics

Show HN: Stateful AI agent on Cloudflare Workers free tier, with evals

Show HN: I've Translated Linear Algebra Done Right by Axler to Hebrew

NASA Sea Level Change

Show HN: Nexconn – Free cross-platform chat SDK with native push

Show HN: Gat – Version large files with Git, store them anywhere

Game publisher lies to its users and claims its graphics are hand-made

Show HN: AI Agent for Google Play Submissions [video]

PeaZip is an open-source file archiver that supports strong AES-256 encryption

Show HN: Fraise: a memory database for AI agents

My dream is to become a chairman who only gave KPIs for AI, not tasks

On the 25th anniversary of 9/11, editor remembers the heroes of Flight 93

Pâro: The feeling that everything you do is somehow wrong

Stop Killing the Internet: No Digital ID and No Age Verification

The Rich Climate Distraction

Show HN: Deja - predicts your next shell command without an LLM

Name Here

Show HN: V0.1.0 of tula, which weighs what you hold

Scanned, segmented, and animated my keyboard. Now you can type on my keyboard

Nvidia Personal AI Router (Pair)

Show HN: Lini – one language for diagrams, charts, floorplan, schematic, drawing

WebAssembly Security: The Sandbox That Is Not What You Think

Codex on GPT6 Astra Low launched a rocket into space in Factorio Space Age 2.1

America's Arsenal Runs on Two Clocks