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?

Patrick Stewart's First TV Appearance

A step-by-step guide for how to kill the line-by-line code review

Show HN: Trail Commons – A new open map of mountain bike trails

Show HN: HN Atlas – Discover useful tools built around HN

SLAC researchers find proof of altermagnetism, a new magnetic phase

Can't fish Ethernet? Use "invisible" fiber instead

How to configure programming language detection and summary statistics for Forge

BYD sold more EVs last month than the US did all quarter, topping 300,000

The Ford Privacy Promise: You're in Control of Your Data

Tender bond between male donkey and bull baffles scientists

AI × Hiring

DGX Model Manager

Lyngvi – A Hardened Sandbox for AI

Show HN: ChatGPT sees something else in this image

Ask HN: Does anyone enjoy work anymore?

Fossilised red blood cells found in 115M-year-old dinosaur's bone

Show HN: SignalScoop – turn customer messages into product insights

Measuring Taste – Reinforcement Learning with Neural Feedback

Oracle taps investors for $20B to finance AI expansion

A Decade of Kill Bugs

Show HN: I Built an HVAC Load Calculator Manual J

Repobs – A local dashboard to manage agent worktrees and branches

Rust Playground but it compiles locally in the Browser

I built a live election dashboard using Conformalized Quantile Regression

Which Chinese movies can you understand? 117 films ranked by HSK level

Leaflet 2.0 Beta

100% accurate next token prediction model

Ask HN: Executor Project Manager

Show HN: A 20-line kernel that fixes float32 variance under XLA

Salary Transparency