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?

Walmart Makes It Possible for Agents to Shop on Behalf of Customers

Average People in Paintings

Nu: The personal agent that runs on your rules

KillSwitch-Bench

The Search for Better Learning Algorithms – Yaroslav Bulatov [video]

Pylance and Pyrefly: bring your preferred type checker to Visual Studio Code

Analyzing Rust Programs with Charon

The one time we break the LLM cache on purpose

Gaps and islands in streaming SQL: four ways to define an island

Firecrawl vs. Tavily vs. Exa vs. DeepSeek

A first for CRISPR: powerful prime editing alters DNA directly in the human body

No Source Code? No Problem

A whirlwind tour of systemd-nspawn containers

Next-Concept Modeling: Fast, Parallel Coarse-to-Fine Text Generation

World Wars I and II Military Aviation Museum Collection

Turning VS Code into a control panel with custom extensions

What are some free AI education platforms to learn AI? [video]

UAE Paid Swiss Intelligence Firm to Compile Database of "Hostile" Facebook Users

Semi-Cursive Pen Calligraphy

Tell HN: The Amount of Irrelevant Content on Here Is Insane

A Note from Our CEO on the PingCAP Security Incident

WTF Is Agent Experience

Artificial Intimacy Erodes Autonomy

Kimi K3.1 Pro puts open-source AI a month behind the best

Tell HN: Claude CLI doesn't exit anymore, not even with CTRL-C

SF's shuttered former Westfield Mall has a buyer

Show HN: Audio Splitter – Split long MP3 files at silence in the browser

Ask HN: When did you last visit or use stackoverflow?

Crows can evaluate visual info twice as fast as mammals

Show HN: Translate Human Speech into Birdsong