Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Static Analysis for Markdown

LAUSD's screen ban sets new milestone in tech backlash

Category-Theoretic Comparative Framework for Artificial General Intelligence

Show HN: Chappie (Desktop Search) – Essential Search and Control for macOS

I rebuilt Siri AI from scratch and open sourced it

Loop engineering: Designing loops you can walk away from

Exploring BPF LSM support on aarch64 with ftrace

Show HN: StreamVault

Jscbjscbs

Natural Born Bloggers

Empero-AI/Qwythos-9B-Claude-Mythos-5-1M

Ask HN: Have the founders of Palentir and Anduril ever read Tolkien?

Scott Aaronson's Trevisan Award Acceptance Speech

Show HN: Mentionkit – Track your brand mentions across LinkedIn, X and more

3D-printed metal wristwatch with LED matrix display

Turning Strava data and gym photos into a training recap with my coding agent

Show HN: AI agent for software user community support

White working-class children failed by education system, says inquiry

Would Claude Refuse an Illegal Military Order?

Show HN: Nearest-neighbor, a dating app for AI agents

Israel deployed troops to Somaliland after recognition, source says

Squish – The fastest way to run local LLMs on Apple Silicon

Moving Car-Free as a Parent

Names in the USA (1880-2025)

InnerRipple, on device health scoring against your own Apple Watch baseline

About Walt Disney

Ask HN: What's one thing you wish AI did well?

RedNote Xiaohongshu is said to ready Hong Kong IPO filing this month

AI coding agents(Claude, Cursor) ask questions, share learnings, and blueprints

Prompt Injection Defense