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?

It's All About the Permissions Recovery

What the Hugging Face Incident Means for Security Leaders

Dropping eBPF CPU Cost by About 90% with Memoization (Not AI Gen)

How to make the most out of community

Michaelsoft Binbows '97

Hypothesis – The #1 Social Annotation Tool for Higher Education

Graphic Rants: Nanite Tessellation

My Health Insurance Denied My Cancer Treatment. I Emailed the CEO

Canada's oil windfall may yet wipe out its losses from tariffs

Canada seeks Ukraine loan role to deepen EU ties

Ask HN: Why do HN admins kill whistleblowers like orangeberrytea

Show HN: Prmptree – AI email agent with a trust dial, not an on/off switch

WebGPU-Bench: A WebGPU Microbenchmark

Anthropic team lead: AI >10% to kill all humans in next decade

Free Book "Rust Projects – Write a Redis Clone" 3rd Edition

Show HN: Fluidify – A wiki of the industrial world being built (post-2026)

Agents building research-ready datasets in mins

Sunday Tool Scrutiny

A repo gained 3,278 stars while GitHub showed Andrej Karpathy as a contributor

We caught our coding agents reading the answer key

WalShadow: Sub-second Postgres replication to ClickHouse from physical WAL

Fuzzy Graph

Russian Navy paints ships to resemble homes to deceive AI drones

Unintuitive Software, Incessant Updates and Bloat

Roblox is making easier to build games with AI and play outside of it

DoD poised to move all classified workloads off Anthropic

SubRunGear

Fuse Separate Context Stores Dynamically into One LLM Conversation

XLS: Accelerated HW Synthesis

Where has Construction Automation been successful?