Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

U.S. National Park Finder

Open-source DIY radar that's 95% cheaper than $250k commercial offerings

Show HN: Claude Code Rust – a native Rust TUI that avoids the V8 heap OOM

Reconstructing a Dead USB Protocol: From Unknown Chip to Working Implementation

In the UK, EVs are cheaper than petrol cars, thanks to Chinese competition

Crypto Hack Worth $290M Triggers DeFi Contagion Shock

The Work Runs on Different Maps

Memjar: Uncompromising, local-first second brain

Tim Davis – Probabilistic engineering and the 24-7 employee

2005 PS2 Game Returning with New Release on PS5, PS4

The framework built by a father in 2006 dominated the internet

An Amish Paradox: Diversity and Change in the Largest Amish Community

LlaMa.cpp Robot Wars

Performance • tldraw Docs

Ask HN: Is your Mac's menu bar throwing errors?

SitTall – a macOS app that uses AirPods sensors to detect slouching

Anatomy of High-Performance Matrix Multiplication (2008) [pdf]

Visual Studio Code Agents App (Preview)

Hero Engineering: In Defense of Unreasonable Optimizations

Edit store price tags using Flipper Zero

Why Musicians Are Manufacturing Sold-Out Shows

A Private Recommendation System I Can Control

Ask HN: How did you land your first projects as a solo engineer/consultant?

Waterloo’s live AI-goose tracker. Never get ambushed by a cobra chicken again.

Public grocery stores are having a moment. Can they make food more affordable?

Ask HN: Should I build *another* Markdown task manager?

Show HN: AI Primer – A Searchable AI Changelog for AI Engineers and Creatives

Deleteduser.com –A $15 PII Magnet

Shyell – a Rust shell with built-in benchmarking and project-aware prompts

Resources for starting and growing an AI safety org