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?

AI Just Changed Mathematics Forever – Brian Greene & Tristan Buckmaster

Matternet wants to rain hot chicken from the sky

Decision Models vs. ML Classification

Forward-Deployed Engineers

Language Model "Shape" – Alex L. Zhang

Our Solar System Is Terminally Unstable

Ciliate Is About to Die (2020) [video]

The Dot and the Swarm

The cost of lies: A Mineserver story

Dyson CameraJet

wizard-engine: Research WebAssembly Engine

Amazon responds to data center backlash, says it no longer uses NDAs

Archiving the Oldest Webcam Feed

Forbidden Stories and UC Berkeley Journalism launch cross-border lab

Weirdstuff Warehouse Reopens

Flying cell tower beams phone signal to Japan from 10 miles up

Pico CSS is no longer maintained (final release v2.1.1)

Being asked to sanitise Wikipedia entries

VersionStory: Comparison and Redlining for AI native legal teams

100M homes could be powered by solar projects stuck in permitting

Show HN: Watch a neural net learn Clash Royale defense in the browser

Show HN: Lines of C, Beats QOI

Why AI task-level productivity doesn't translate to organizational throughput

Oversight Has Capacity: Calibrating Agent Guards to a Subjective Fatiguing Human

Testing 12 different Zigbee temperature/humidity sensors

Changelog to README: testing LLM update strategies

Meeting Buddy – A Cute Mascot That Parachutes in Before Your Meetings (macOS)

Gentle AI: AI Coding Ecosystem

Show HN: The Livability Map of Japan

Organic Driven Development