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?

Responsibility Is Taken Before It Is Given

Show HN: Security scanner for your SaaS. Find and fix Vulnerabilities. 35% off

Cyberlandfillville

Gum Wrappers World

Humazon

Plastic mechanical computer from 1963: The Digi-Comp 1 [video]

The Day of Small Things

Paperditor – a free, open-source WYSIWYG Markdown editor

Minimally Invasive Education

Lego Space Hubble Telescope

Ctok: Reconstructed Claude Tokenizer

LLMs anticipate verbal behavior from studying longitudinal conversations

Hurricane Hits Big Island, Hawaii

Concurrent Servers in Rust

Can an LLM price a World Cup match better than the market (and make money)?

Show HN: Seedle, daily -dle for Minecraft seeds

An Astronaut Saw a Russian Missile [..] Then She Went Where It Landed

Meta will train its AI on Newsmax, a far-right media outlet

Secondhand booksellers in UK and Ireland suspect AI firms 'strange' bulk orders

Supply-chain controls matter more when agents install your dependencies

How Ozempic Destroyed Fat Positivity [video]

US hires over 2k 'best and brightest' video gamers as air traffic controllers

Remembering the pre-Google web, when search was an experiment

Kimi Work attaches raw agent sessions to feedback reports

See how an H100 works in 3D with threejs

What on Earth is Google doing?

ESPConnect

Antitrust: The Monster Case (1975, IBM)

The New Bottlenecks After Coding

The teenagers who wired Romania [audio]