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?

Vibe Shields

Show HN: Tar-minefield – extracting tar files is harder than you think

AI is turning protectionists into free traders

Foo

Post-AI Computer Science – Volume 4

How We Got Duo Support in NetNewsWire

Show HN: Logo Deal – Logos anyone can edit with text

US believes Nvidia's Huang had romantic relationship with alleged Chinese spy

Activists across Europe prepare two days of protests against datacentres

Working with Designers

Porting the Simulation Engine into Rust

New App: StockVirtue

The Joy of Coding Is Gone: My Honest Take on AI

4.2-Kiloyear Event May Have Helped Cause the Collapse of Egyptian Old Kingdom

Show HN: GC2 (Geo Compute Cloud)

F/OSS Comics

Show HN: Pentagonize, a connect 5 game with sliding rows and columns

Show HN: Stripe revenue, right in your notch

Microsoft requiring DMARC now or just us?

If You Were an Engineer

Show HN: Web Potions – let ChatGPT or Claude restyle the web you browse

Meridian – a web browser for macOS built on GPUI and Servo

Show HN: Personaforge – Make your portfolio out of your resume in 3 minutes

Weekend at Bernie's II

Show HN: Online Scoreboard

Pull-request previews for every client branch, without a Vercel bill

AI is a technological version of the Homeric songs

Twelve things you could build on a live index of internet radio

AirPods 3 head tracking on Linux, and first documentation of Apple RemoteHID

EU and UK spent millions on Israeli phone cracking tech despite risks