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?

Opus 5.5 turned Ozymandias into a cinematic browser animation

Who Wants Artificial?

Sandboxing with Minimal Effort

US Denmark agreement enhanced veto rights over Greenland econ and military

Making Linux prove a governed action before execution

Fpp – a utility to pick file paths out of command output

Pg_chdb, fast imports from object storage to Postgres using COPY

Show HN: Is your repo giving coding agents two different answers?

Google Found the Pages. ChatGPT Found the Entity

Netflix is in the doldrums. A comeback is unlikely, Wells Fargo says

Irish data protection watchdog fines Google €403M over GDPR breaches

TempleOS in 100 Seconds [video]

Silicon Valley Saw the iPhone Coming 13 Yrs Before Apple [video]

Claude Pop – I'm Upping My P(Doom) [video]

Realtime Pathtracing in Octane

TurboKain – A 1.2MB native radio astronomy pipeline that slices 17GB in 2.3s

Choice of over 600 LLMs across 9 providers

Helium balloon lifts up to two tons of building material over Tibet's mountains

Show HN: Castrag – transcribe and semantically search a large podcast archive

Show HN: Napkin – a scratchpad that holds texts and images for copy

Feynman-"what differs physics from mathematics" [video]

What's Up with Liliputing?

America is in the wrong AI race with China

-Delete-

Big Banks Say They're Uneasy About People Shopping via AI Agents

LGBT tolerance slumps in the Netherlands as debate turns vicious

Show HN: Kern.md – Single-session long-running agent

Anthropic classifiers prohibit kernel development

United Nations: AI Agents, Misalignment and the Risk of Losing Human Control [pdf]

Grammarly will send unhinged messages to all your users if you try to cancel