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?

Spammail.org – disposable email infrastructure, aliases, custom domains and IMAP

Try, even if they have you cold

Ratty – A terminal emulator with inline 3D graphics

The Inference Shift

Cotypist – AI Autocomplete for Mac

Projecting React

Why Was Star Fox Called Lylat Wars in Europe? [video]

All Those A.I. Note Takers? They're Making Lawyers Nervous

When Is "Next Friday"?

AI: Apologies, I was only doing as instructed. (What Hollow is and isn't)

Our keyboards are tracking us

Do city delivery drones make sense?

Building a Memory Allocator from Scratch in C

Scorpi – a Docker-like VM development platform for macOS

Life Without US Tech

Facto: The daily trivia game that makes you learn one new fact every single day

Comparisons as Predictable as the Sunrise

Piping terminal output to the browser using systemfd

I Do Not Recommend Fastmail

A game based on scrolling and zooming

Show HN: An addictive phone game about phone addiction

Recovering from Narcissistic Abuse

Women at the sharp end as AI takes over administrative roles

Using AGENTS.md / Claude.md to discourage AI-generated code contributions

Capsules: Compile-time lock discipline in OxCaml

The Eurovision Song Contest and the European Union

A simple runtime invariant miner

Chaos erupts as cyberattack disrupts learning platform Canvas amid finals

Lython: Experimental Python compiler toolchain based on LLVM

I built my second brain for meetings. No monthly subscription