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?

PHP is Dead (and AI is to blame)

Show HN: Impress your boss with interactive Scikit-Learn Decision Tree

What makes $BigTechCompany's products bad, anyway?

Show HN: Project Estimator – a free, no sign-up software cost estimator

US claims Chinese AI firms are carrying out 'industrial-scale' theft

Primework by Kunst X

Bristol Myers' blood cancer cell therapy succeeds in mid-stage trial

How Much of the Internet Is Written with AI?

Steam now requires Australian users to verify their age with a credit card

Show HN: CreepyLink: A fun tool to turn safe URLs into suspicious looking links

Law schools tell students to put AI away

Our Technological Wager

Italian tech collective Autistici/Inventati shut down by Trump administration

ScanChess – Digitize handwritten chess scorebooks and diagrams into PGN/FEN

Want to borrow a dinosaur fossil? Try California's taxidermy lending library

Ryanair ATC disruption update with Synthesia AI representative [video]

The diversity hypothesis: diversity and scientific output/impact in the sciences

Show HN: Compute Polynomials Twice as Fast

The Fundamental Limits of LLMs at Scale

Diskless Kafka: Object Storage, KIP-1150, and Kafka's Future

Gambling with our lives: AI researcher quits Anthropic with warning about safety

Arm's C2-Ultra, G2-Ultra NX, and CSS N4 IP

Google warns lower quality as it revamps Europe search results to avoid EU fines

Bitap: My favorite string matching algorithm

CogniFind is now available for Windows

If I wanted to maximize AI risk

Building Jarvis: a better voice starts before training

Rails devs: heads up on JSON 3.0 gem

Teleporting ":3" – an introduction to quantum computing

People are more likely to ditch the car and use an e‑bike if they feel safe