Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Show HN: Sub-agents for Cursor via MCP (isolated context, no worktrees)

Show HN: LudvigEditor – A lightweight Python alternative to Electron editors

How redefining disability/special needs has changed education

Adventure can be disastrous: digital nomad families 'worldschooling' their kids

Show HN: CryptoGig – A Marketplace for Freelancers Paid in Crypto

10 People killed in Bondi Beach shooting

DoomScroll – Browse, preview, and play user-made Doom WADs in the browser

Git Will Make Sense After This [video]

Show HN: cvfitr.com – An AI Job Application tailoring site

Dogalog: A realtime Prolog-based livecoding music environment

University life: From 50 years ago to now (2019)

Shai-Hulud compromised a dev machine and raided GitHub org access: a post-mortem

Scale Test-Time Compute with Parallel Coordinated Reasoning [pdf]

Internet in the Age of Agents

Willison on Merchant's "Copywriters reveal how AI has decimated their industry"

How to install a Toolchain for clang on phones without root access (2024, 2025)

How the invention of buttons led to simplicity and to planned obsolescence

Vanessa et S., magnifique dominatrice (13)

Why We Age

We Sent Our CEO to Dubai's Supercar Junkyards [video]

An open-source energy and latency profiler for LLMs: ELANA

Total Internet Shutdowns per Year

Show HN: Made a simple tool to generate App Store / Play Store screenshots

An array index points between elements

Single prompt to Gemini to 6M parameters model

Show HN: 2zuz – Shopping search without promoted or junk results

Show HN: A Simple, Fast, and Ad-Free Whois Lookup Tool

Show HN: Stepped Actions – distributed workflow orchestration for Rails

Evaluating GPT-5.2 Thinking: Cryptographic Challenge Case Study

Startup Playbook