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?

Missing women on Indian streets [pdf]

ABC Australia will trial using AI for journalism

Ask HN: Is Email Marketing Dead?

The first American autonomous ground vehicles are fighting in Ukraine

Prevail – open-source AI "life OS" (not for your job)

Shell Has a Forth-Like Quality

Show HN: Brianni – AI chat on GPT/Claude/Gemini that we can't read (provable)

Ask HN: What are your favorite games?

Never ask a model to do something a deterministic system can do reliably

The EU Wants Its Own Tech Supply Chain

Show HN: iOS-style "select text on any image" OCR for de-googled Android

Show HN: Formo – Analytics and attribution for onchain apps

Is Recursive Self-Improvement Here?

I made a TUI web browser with its own layout engine

OmniConvert – The File Workbench

Samsung profits jump 1,800% as AI chip sales soar

SB mini II: a homebrew Apple II clone

Building a High-Performance C++ Backtesting Framework with Order Simulator

Voice Is My New Keyboard

Thoughts on AI

Google's exponential path to climate-wrecking digital bloat

ReactOS "Open-Source Windows" Project Now Capable of Running Half-Life 2

Would you use a tool that finds repeated pain points before you build?

Show HN: A Haskell programmable-CAD environment, in the browser with WASM

Show HN: Deceptive.design – dark pattern types, laws and cases (rebuilt)

Latent Programming Horizons in Coding Agents

Hard time deciding? Let nuclear 8 ball help you

Wanna Hear Particles?

GL.iNet Flint 4 Announced

Elon Musk's SpaceX is about to trigger a $4.3B buying frenzy