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?

Xi pushes 'Greater BRICS' economic ties to give bloc larger global role

Memorable moments in Chromecast's history (2024)

Apple's Dimensional Drawings

AI Boom / Bust – Boom Boom Pow

"Chilling" warning or overreaction? AI bioweapons report divides experts

Free Domain Monitoring through echelongraph.io

Trump Throws His Support Behind Flock Cameras: 'I Like Them'

The biggest dinosaurs couldn't sit on their eggs

OpenAI and Anthropic Hit the Brakes

AI Coding Dictionary

The Coming War on General Computation (2011)

X.com busts Chinese bot farm, incl accounts making claims about AI data centers

Carterfone

Show HN: Spikeforge

Can an R/C Car Hit 100k Scale Miles? Self Driving Edition

Robots protest rampant AI in Poland

Math in the Movies – Sneakers (1998)

How the Eminem Show Made Me a Hip-Hop Fan

Why Society Tears Down Its Heroes

Recursive Synthetic Improvement

Agent security starts before the first prompt

Mental time travel and the evolution of the human mind

X nuked my premium account out of nowhere

Ask HN: How is AI actively a threat to humanity if it's only online?

Mental Time Travel

Former CIA official found with $40M in gold bars reaches tentative plea deal

I think Effect-TS is a strong fit for AI agent development

Dynamics in Mesoscopic Systems

Ask ChatGPT or Gemini the same "best X" twice, ~1/3 of the answer changes

Show HN: <15MB Local-first Interactive LaTeX Scratchpad in the Browser