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?

Postgres 19 Repack: Built-In Online Table Bloat Cleanup

RoundSquare.lean: Zero-Axiom Negative Resolution of the Clay Yang–Mills Problem

Behind the Curtain: OpenAI's post-election power play

AR guitar with just a laptop and scissors

Dutch Court Orders ISP to Block Z-Library and OceanofPDF

Why websites are forced to make you prove you're human

New typeface using intricate designs from Shakespeare's First Folio

Show HN: Night Map

Samsung's 2 Nm Taylor Fab 2 Reportedly Booked, Mostly by AMD

If you're on Replit Pro, you have until November 8 to opt out of arbitration

Hermes Is Good?

We Tested Coding Agent Harnesses. Thinking Harder Beat All of Them

Rust Sudo is not feature complete

Accused Impostor in Private Tracker Lawsuit Faces Contempt

The client asked for a chatbot. We built a fancy PDF viewer instead

Show HN: Who and where are your anagranames?

Investigating Vault Particles with Claude

Verne V0.5: U.S. Open-Weight SOTA Robotics Foundation Model

Residential Proxies Detected on White House Network

Discord 302 Rickroll URL

The Open Door

Apple Cuts Internal AI Usage Budgets in Move to Reduce Spending

The Crackpot Index (1998)

Watching my gh actions runners

Foot-stiffening socks could make walking less tiring

Binance hackers used fake job interviews in record heist

LifeTrail – Passive GPS tracker, local trail history, no account

New Pancreatic Cancer Vaccine Sparked Immune Responses in 99% of Patients

Make more money on consumer subscriptions with Crew Plans

Show HN: Gauge – Open-Source CLI to recursively improve your docs