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?

General Magic: Oral History of the Influential Tech Company

Show HN: WGSL linter with Tint parity and a full suite of LSP niceties

EU Defence Commissioner Kubilius: Pax Americana Is Over. ^

Brutal – Framework for Making Games

Photonic Chip Cuts Cost of Hunting Exoplanets (2024)

Rapid alternation of conscious and suppressed representations in primate brains

Show HN: A web workspace for trying FLUX 3 Klein

Scaling Indic Pretraining: 2.8T Tokens and an Open Data Generation Pipeline

Red Dead Redemption 2 – Part 1460 – Old PC [video]

ThinkPad I9990303 Error Catch-22

Pi Durable on Cloudflare

Show HN: Panini – a zero-dependency parser for chaotic Indian bank narrations

Monthly API credits for Max and Team plans

Clicks Communicator Companion Phone

Social media bans are not the answer to protect young people's mental health

"Tame" boar and deer are instinctively adapting to the wolf in the Netherlands

List of Vaporware

Show HN: Claude Code, deploy using thevibehosting.com == Your app on root Linux

Directionally correct bars, a concerning new trend

Is MCP becoming the common foundation of smart, decentralised search?

Getting Canceled [video]

No Map: a browser game you walk blind, one tap at a time

Replit is no longer working with Anthropic, CEO says

CobaltC and Rust

Show HN: CiteLadder – open-source AI search visibility tracker

If it hurts, do it more

Chinese phones with built-in malware sold in Africa

Aviation superfan installs an Airbus A380 suite in his apartment

Ask HN: Local AI product situation

Neuralwatt says cache misses can use up to 140% more inference energy