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?

You can't train in what the model knows

Why isn't xAI as impactful compared to others?

Tree Transformers

LLMs Are Complicated Now

A New Book on Plagiarism

Animaps: An open source travel map video maker

Why has the pointe shoe been so resistant to change?

How to Feed a Dictator

'Digital Circus' Google easter egg

Statement regarding GNU Savannah security reports

A record 242 US cities now have starter homes that cost $1M

Blackwell Build Atlas

I am dreading our LLM-written incident report future

Build a full knowledge graph locally with any video

I Solved My Mystery Fatigue with AI

Why Algo Traders Club Is Moving from Hyperliquid to Kalshi

Telo confirms 400 kW sustained charging for its tiny electric truck

Efficient C++ Programming for Modern C++ CPUs, Chapter 4/part 2

Out of Stealth (Kinda)

Kahneman: Theory Induced Blindness

Show HN: Agentcard – virtual cards for AI agents, now with DoorDash checkout

How to avoid street violence, by a professional kickboxer

Show HN: P34 – tabular profit prediction without the optimism bias

Lump Sum vs. DCA comparison: LS wins or does it?

Cursor Is Now SpaceX: Enterprise Agentic Coding's New Lock-In Risk

Backstitch: Real-Time Version Control for Godot

Swedish VPN provider OVPN sold to US stock and asset company

We built a lab to evaluate data agents – Hex

Speculation Is All You Need

Kernhelm: A Linux authority wall for untrusted agents