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?

Show HN: RAX Compute Gateway – One API for OpenAI, Anthropic, and Gemini

Microsoft Is Retiring Excel's Copilot() Function After Just One Year

People of ACM – Russ Cox

Show HN: Columnary, a better experience for reading long articles

Report supporting Australia's teen social media ban appears to contain AI

Facebook Perl source code from 2005

Git Links

What's behind this summer's heat, and why 2027 could be worse

Show HN: TapDiary – a one-tap time and count tracker, works offline

A central role for dietary sugars in human evolution

USC Study Finds AI Is Better at Reading Than Listening

Found an Agent created skill that applies uncle bobs

Ask HN: When do you think LLM capacity will reach its ceiling?

Speeding up the Unreal Editor launch (again) by not loading 1585 files

Hacker News Clone: VibeHack a.k.a. HackPhilia

The null result in OpenAI's enterprise AI paper

Conservation efforts help an endangered dipterocarp spread roots in Bangladesh

The Internet Archive currently down due to power outage

The Indian rupee since 1947

Sainsbury's pauses AI cameras after shopper ousted

Show HN: Kubara a package manager and framework for Kubernetes platforms

Sixfab Cellular Modems

OpenAI-Compatible API Quickstart in Python, JavaScript, and PowerShell

ScienceFlow – A Long-Horizon Agent for ML Research

Show HN: Code review that follows callers across your repos

Apache Flink accelerator built with Rust

A Camera in My Face

More methods for forecasting code automatiom

Greenest cities in Europe, and where Hamburg stands

It's Happening – Europe Is Building an Impossible Fusion Reactor [video]