Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Node.js creator says era of humans writing code is over

How I Design Systems

TraceMem OpenCode Plugin – Decision Tracing for AI Agents

Find 'Abbey Road when type 'Beatles abbey rd': Fuzzy/Semantic search in Postgres

Building in-browser autocomplete for millions of entries with Radix Tries

Gemini CLI: Code and Create with an Open-Source Agent

Tell HN: Amazon has deactivated my seller account. No idea how to move forward

Helsing AI

Show HN: Red Horse Oracle – Privacy-first AI art, zero data stored

Wikipedia Signs of AI writing: a Vale ruleset

Zero to One: AI Agents and Agentic Patterns

VidChat: Making Videos Searchable

Show HN: Schema First React Router

Kafka Dead Letter Queue Triage: Debugging 25,000 Failed Messages

GenAI, the Snake Eating Its Own Tail

Eleven Album

No Name: The Colorado town that accidentally named itself

Things I've learned in my 10 years as an engineering manager

How to Learn American Sign Language in 2025 [video]

Lemonade Unveils Autonomous Car Insurance, Slashing Rates for Tesla FSD by 50%

Sony to Cede Control of Bravia TVs to China's Tcl

MariaDB Doesn't Depend on MySQL

Show HN: Multi-cloud cost visibility with latency rings and GDP data

Navy ditches touchscreens for knob and dial controls after fatal crash (2019)

Compact Let Arrays for Origami-Based Mechanisms

Viking mice: Norse discovered Azores 700 years before Portuguese

Stanford scientists found a way to regrow cartilage and stop arthritis

Show HN: UseWhisper.dev – AI Code Reviewer (please test and roast it)

Show HN: A real-time poker chip tracker built as a PWA (No signup required)

Apple Pay Could Arrive in India by the End of This Year