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?

Tracking Capabilities for Safer Agents

The Elements of Power (AI Supply Chain)

JAM: DSP audio engine programmable via AI chat

Ask HN: Mac users – has Mac-to-Android texting broke for you, since macOS 26.5?

Marketing Help

Anti-Meme Explosion

Search engines and me. Is the classic internet dying? [off-topic]

SpaceX files for IPO that could make Elon Musk a trillionaire

Kickstarter apologises for its criticised adult content rules

Primer Pay – micropayments for WordPress on Base requiring Chrome extension

Deep – CLI/REPL for generating and iterating on codebases using DeepSeek

Show HN: udoc. Dependency-free document extraction in Rust

Understanding Bitcoin Inscriptions

New Bitcoin Fee Pressure Signal

Global Biolab Map

Staged Publishing for NPM Packages

Moe inference optimizations: 15% lower expert load by request reordering

Show HN: A fast, free AI rewriter

Model Thinking – Percolation Models (2020) [video]

Shareable text box

Boundaries – A Talk by Gary Bernhardt

DOS Zone

Everything Is Computer

Step by step guide: How to install Microsoft Office in any Linux distribution

China Wants A.I. To Flourish, but Not at the Expense of Jobs

Node.js TypeScript: The future of –experimental-transform-types

Can one run AI on source code with the prompt "Find below-avg swear rate files"?

TheLounge v4.5.0 released – a modern, self-hosted web IRC client

Franklin Pierce by David W. Blight

Alan's ASI Checklist