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?

What the Fox Say?

Russia arrests two men who ran a website for train enthusiasts

Compile-time dependent types in the Syl programming language

Fly.io Sprites: Storage not ready blocked execution and checkpoint access

Open Community Leadership: What Is That?

Golden Spider Silk Cape

Corvus – A lightweight native Signal client in Qt

How Firebird QA works and why it needs to be stronger

The Tale of a Thousand Side Projects

Is a database per agent (or task) a useful pattern?

Logs Ingestion Benchmark: Loki, Elasticsearch, VictoriaLogs and ClickHouse

Failed $44B Firmus float probed by corporate watchdog

Bitcoin direction model I built lost to "price stays the same"

AI Did Not Break Education, It Revealed the Bug

Robotics AI Suite

Nim Version 2.4.0

Billionaires shatter spending record to fight California wealth tax

First EU AI Act harmonised standard

My GitHub account has been suspended

Out of My Other Mind – What are the defining characteristics of a conscious AI?

Tell HN: Claude Code adds your email to the prompt, the LLM sends it to websites

An AI agent performed brain surgery on a mouse

Show HN: Halis – A secure, self-hosting, native-first programming language

Show HN: Adaptive Math Learning Platform

Universal Paperclips

Spain train crash: What we know after two trains crashed with dozens feared dead

Stack Overflow Graphs Prove Nothing

The Origin of Tweet (2013)

The work we can't delegate

Microsoft just shared Azure's actual revenue in dollars: $33.2B