Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Pluralistic: If you build it (and it works), Trump will come (and take it)

AI Safety Farce

Show HN: SkillFortify, Formal verification for AI agents (auto-discovers)

What breaks when you vote on specific claims instead of whole posts?

Community-powered blocklist for removing slop from HN comments

What Hackers Consider Essential (1991)

Still Ours To Lose – almost all LLMs share one remarkable behavioral trait

Textadept

Show HN: I built a desktop app combining Claude, GPT, Gemini with local Ollama

TrueSize: Compare Real Country and Region Sizes

Claude Code is a great Dad side project environment

Why some Americans who make a lot of money feel so poor

Students are skipping the hardest part of growing up

The Great Unraveling Has Begun

Iranian Supreme Leader Ayatollah Khamenei Dies

Show HN: Iosef, an iOS simulator CLI designed for agents

Signal vs. Noise in the Skills Ecosystem

He wanted to use ChatGPT to create sustainable housing. Then it took his life

You think unemployed, I think retired

US tech supplied Israel with AI models, tech's role in warfare – AP News

Show HN: Analyze employee survey data in 60 seconds (no signup)

A pretty looking web for a quantum mechanics tool

The Atlantic AI Watchdog

Poll: How do you think LLMs will affect the job market for software developers?

Show HN: Engram – Memory for AI coding agents (2.5K installs, 80% on LOCOMO)

Show HN: Openpista – AI Agent for OS Control via Telegram/CLI in Rust

Show HN: I put Claude Code inside a Telegram bot for voice memos

We Built a Video Rendering Engine by Lying to the Browser About What Time It Is

Show HN: Userscript to Display Age/Karma of HN Users

Show HN: A POST only back end framework