Packed Data Support in Haskell

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

77•matt_d•2mo ago

Comments

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

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

Zolomon•2mo ago

They mention this in the article.

spockz•2mo ago

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

cstrahan•2mo ago

No, one example of why being variable sized integers.

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

carterschonwald•2mo ago

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

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

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

lordleft•2mo ago

This was very well written. Excellent article!

NetOpWibby•2mo ago

Is this like MessagePack for Haskell?

Adding Text-to-Speech to Your Blog with OpenAI's TTS API

Do Car Buyers Care Which Engine Is Under the Hood? A Ford Exec Doesn't Think So

CertMate – SSL Certificate Management System

Ask HN: How to build a LifeOS using vibe coding?

Show HN: On-chain Fund Administration Protocol

Portal, for the C64

Defending Savannah from DDoS Attacks

Beltabol: An eager functional esolang based on the Expanse

Show HN: Transform handwritten chess notation to Lichess or chess.com instantly

Dias on the Web – Pandas Rewriter

Bulk Lots of DB-19s for Sale

The Impact of Early Galaxy Formation on the Cosmic Microwave Background

My Database Is My Application: Rethinking Webhook Logic with DuckDB and SQL

Jony Ive's AI gadget might be a pen

"Fuck the algorithm"?: What to learn from the UK's A-level grading fiasco (2020)

Senate GOP budget bill has little-noticed provision that could hurt your Wi-Fi

iOS Dev Weekly: Swift Everywhere: Bringing Swift Packages to Android

Machine Consciousness Psuedocode

Nuclear Matters Handbook [pdf]

Ted Chiang on Superintelligence in "The Hampdenshire Wonder"

Apple Loses Bid to Dismiss US Smartphone Monopoly Case

New band surges to 500k listeners on Spotify, but turns out it's AI slop

Mechanism shrinks when pulled [video]

Ukrainians Built a Jammer That Tells Russian Drones They're in Peru

Economic Nihilism

Microsoft AI tool outperforms doctors in diagnosing complex medical cases

I still choose no-code vs. vibe code

Perplexity Is Doomed

How to Opt Out of Your Car's Surveillance State

Why Don't AI Agents Work (Yet)? [video]