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?

System Card: Claude Fable 5.2 and Claude Mythos 5.2 [pdf]

Claude Fable 5.2 now available on AI Gateway

Claude Fable 5.2 designs a working voice assistant [video]

CUI – Native UI components for C

Show HN: BigHits. Best comments viewer and listener

Some M5 Macs Are Struggling with High-Refresh-Rate Displays

UE5.9 running with Lumen in the browser with WebGPU

Iran was behind cyber-attack on French supermarket freezers, Paris says

Particle-1 vs. GPT-6.1 SOL: same pass rate, 71% lower cost in our tests

An Open Letter to Streaming Platforms: Urgent Need for a Hybrid Production Label

Retro486 Pro – Pure-JavaScript Intel 80486DX2 PC and Motherboard Emulator

The Cortado Census

Show HN: Desk - Open-source macOS workspace for CLI coding agents

Sound of Brainfuck running the ChaCha20 cipher (2022)

Google warns it may scan Gmail, Drive to stop teens seeing porn [in Australia]

Automated researchers can reliably mitigate alignment failures

Ask HN: Good Harness for Advanced Learning?

Recent advances in AI are creating a 'paradigm shift' for robotics

Radio Shack Index

AI can generate CAD. Hardware still needs human judgment

Silicon Graphics founded November 9, 1981

Flows and Diffusion Models on Digits

Show HN: Website to test if you can detect someone staring at your back

Vercel MCP Now Supports Client ID Metadata Documents

Judge declares the ENIAC patent invalid, October 19, 1973 (2019)

I ran 120B MoE models on my 32GB M1 Max using under 16 GB

Retro Nim UI – Windows 3.1 style UI toolkit

I Gave a Shakespeare AI 3 Upgrades. It Beat Stockfish

OtherWords – Explore AI Token Probabilities

For Ofelia (On Pan's Labyrinth, and Liars)