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?

Psion Emulator – classic Psion palmtops in your browser

The most official water costs $120k a gallon

AI Workspace for Your PC

Verisign Cooperative Agreement

Nvidia in Talks with OpenAI to Guarantee $250B Financing for Data Center

Show HN: 3D music visualization on Apple Vision Pro

Show HN: Watch random code typed out on an MS-DOS IDE

Sand battery: Finland's answer to a renewable energy headache

Why AI Doesn't Replace Software Architecture – It Makes It More Valuable

Malicious sites use JavaScript to build malware in browser memory

Show HN: CarbonSheets – Host your own customizable cheatsheet portal In GitHub

Physicists build a computer from 400 particles orbiting in liquid

Sticky notes on a storyboard became my savior productivity app

The Optimization Theory of Everything

Show HN: Quintile – keyboard-only window grids for Mac

Foxconn drops VMware, adopts hyperconverged upstart Arcrfra

Show HN: ASL V6 – Open-source AST red-teaming engine for Python AI agents

Show HN: Injectable time and timers with custom Date types for TypeScript

Multimodal foundation model for image and video understanding from Microsoft

Bullwhip Effect

It is empowering to hand off execution

Palette Vault – Color Palettes and Hex Codes

Porffor: An ahead-of-time JavaScript-to-native/WASM compiler

Newpipe Extractor in WASM

Paywall-free News Aggregator

Show HN: a Rust, Wayland, Vulkan 3D CRT, screencast application, retroarch cores

India cuts internet, then demands removal of bitchat's code

Improving Terminal Ergonomics

Why Lean is faster than Rust

Renaissance Man: imago ex machina