Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

I Turned an ESP32 into a Thermal USB Webcam

ByteDance Seed 2.0

Gemini's mobile app inherits Google's location permissions

Solve Everything

Jailbreaking Google Translate

Show HN: GPACalc – Free GPA and CGPA Calculator (4.0/5.0/10.0 scales)

Project Oberon: A Late Appraisal (2025)

Marching Morons; a Year in Books; AI Character Names

AI Shifts Concern from Technical Debt to Cognitive Debt

Need Help, the Softraid and Lvm

Engineers are becoming sorcerers – Future of software dev with OpenAI Sherwin Wu

Show HN: Ktrack – A simple, offline workout tracker

Are productivity gains due to AI hard-sell where you work?

Show HN: LanceCalc – Open-source freelance platform fee calculator

Show HN: Agent Lens – Code assistant observability in VSCode

Apple Rankings by the Appleist Brian Frange

Saving the SpaceOrb360 with open source hardware and software (2024) [video]

There's a Reason American Kids Are Such Picky Eaters

Watching Code Fly By

Show HN: DepGuard – Local dependency audit and license compliance (10 pkg mgrs)

Hamming Distance for Hybrid Search in SQLite

Show HN: DocSync – Git hooks that block commits with stale documentation

ChatGPT "Physics Result" Reality Check: What It Did [video]

Zero Dependency Markdown Editor

A Wave of Unexplained Bot Traffic Is Sweeping the Web

Show HN: AI-optimized x86-64 assembly vs. GCC -O3 on three production kernels

Which past applications you built can be migrated to Agentic architecture?

Over a million people rally worldwide in solidarity with Iran protests

Cynthia's Valentine (Sci-Fi)

How Investigators Find the Source of a Fire [video]