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?

Optimizing PHP to process 50k lines per second instead of 30

Kiss Launcher – fast launcher for Android

U.S. 30-year Treasury yield jumps 9 basis points higher as trade war reignites

MacBooks, Apple Neural Engine, and Overheating

If people could ask for only one real-life wish, what would they choose?

The Ozlabs team has now left IBM

Show HN: Remember Me – O(1) Client-Side Memory (40x cheaper than Vector DBs)

Claude Code Won't Fix Your Life

Testing: Apple N1 Wi-Fi chip improves on older Broadcom chips in every way(2025)

Show HN: Rerankers – Models, benchmarks, and papers for RAG

All In – a small tool to check real buyin after decisions

AI Is still making code worse: A new CMU study confirms (2025)

Why Bitchat Is a Bad Idea: (My Audit Found Critical Zero-Days)

UK ministers launch consultation on whether to ban social media for under-16s

Optimizing GPU Programs from Java Using Babylon and Hat

Weather Spark – The Weather Year Round Anywhere on Earth

Tiled Words

Workspaces and Monorepos in Package Managers

Automate Your AI Workflows with Claude Code Hooks

Will all our drugs come from China? (2024)

Ask HN: Is there a search engine that blocks SEO / AI content?

Austrian cow shows first case of flexible, multi-purpose tool use in cattle

IntelliJ Idea: The Documentary – Trailer [video]

Show HN: Focusmo – A focus app I built for my ADHD time-blindness

Why Trump's split with Europe over Greenland is a double-edged sword for Russia

Show HN: Local and Private TradingView Alternative

Antarctic penguins have shifted their breeding season

Winaskpass: WSL SSH-add helper using WinCred

Extracting verified C++ from the Rocq theorem prover at Bloomberg

Show HN: Explic – An AI tutor that prompts you with questions, not answers