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?

Speeding up GPU copies by permuting iteration spaces

When Electric Cars Were for Women

Observations from Running Steal My Bitcoin

Yours.ai- a Studio for Interesting Ideas

Show HN: Centauri Academy – a free ham radio license study site I built at 15

GM to pay $220M to settle allegations it violated drivers' privacy

Computer Science Programs Lose Students as AI Replaces Jobs

Altoids Project

A CVE triage pipeline that keeps asking, because day one tells you nothing

Memdoor: A team of 5 Qwen3.8-27B models beats Fable 5 on LiveCodeBench Hard

Show HN: Hushkey – Silent dictation hotkey for macOS

Anthropic pushes for opt-out model for Australian content

An Italian Farmer Found Some Unknown Seeds in His Attic and Planted Them

Ostrowski-automatic sequences: Theory and applications

Efficient algorithms, the Exponential Time Hypothesis, and losing the plot

Bloom Filters

One bit in RAM: fixing a Phison SSD controller in "SATAFIRM S11" state

Richard Feynman on Pseudoscience

Beating the compiler at signed 32-bit division

Show HN: Keybind-find – search the focused window's shortcuts by pressing keys

Referral Codes Canada.Share your code

Critical Software is rebuilding itself around AI (200 ppl being layed off)

Proton senior management prioritizes AI over security

The Cognitive Grammar Hack: A Blue Ocean for Logical UI

Show HN: Playground for Designing Buildable Robotics

Show HN: Muse Zouroboros, gives Muse a software factory

"Very Intentional": Steve Eisman Thinks Anthropic Is Hiding Something

AI text watermarking and quality loss

I'm building a public goods funding mechanism. Roast my design

ChatGPT and Codex usage limits merging