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?

RSA-260 Factorized

My California Dream

Momentum Exchange Tether

New video model:H3 Max.Describe the shot. Get it back with sound, in seconds

China using COSCO's merchant fleet for espionage, US says

Rare Working Apple-1 Could Fetch $800k at Auction

Yocto Project, create custom Linux-based systems

Run cloud agents on machines you manage

Eyes Wide Shut: The Missing 20 Minutes

Definitive ranking of Graph Databases and related technology – updated monthly

IBM Quantum Nighthawk R2

Uber to cut over 3k jobs in major global restructuring

The humanoid robots cleaning homes for $30 an hour

Swedish elections could trim nuclear ambitions as left-wing challengers lead

Generative AI without guardrails can harm learning

Show HN: A daily briefing service-inspired by Huxe rip:(

Where Progress Is Visible, Completion Is Not

Show HN: Single-File GGUF Inference

Show HN: Brb – A Claude Code plugin for adhdmaxxing

Show HN: ReviewAssist-Uses coding session to fix code and guided PR walkthrough

The Wait Equation

Uber allies with driver unions in bid to slow robotaxi rollout

'A crisis of authenticity': the truth about food influencers

KPMG warned Guggenheim unit over deficiencies in internal controls

Ask HN: Is anyone working on this? (Silent texts)

Ski Voice Coding for Claude Code now available on Linux

China's Private Sector Botnets Are Worth Disrupting

The $250k Synth That Replaced Frank Zappa's Band [video]

Birkhoff's Theorem (Relativity)

Show HN: The Simpsons Hit and Run Revamped