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?

Inexpressible States: The History and Usage of Algebraic Data Types

FlashAttention: Part 2

Fable 5.1 vs. Astra for coding: Fable 2X more expensive per task but solves more

Extracting Grid Information Using CSS

Lunch with the FT: Raspberry Pi Founder Eben Upton

GPUs: Rent vs. Buy

Open Peeps – A hand-drawn illustration library

Grandmasters: Official Theatrical Trailer [video]

Wafer-Scale Superconducting Transistors Cut Cryo Cables

Show HN: Forcefield: A fast, lightweight local-first AI agent harness

Stepshell – an authenticated web terminal for Kubernetes pods

Orca – deterministic, AI-driven development flows

A SQL Where Clause for Taste

Meetings [pdf]

WiFi QR Stand (3D Print with live preview)

The ABCs of Getting Rich

Crab (Fiction): Google's AI Overview Invented a "Crab Team"

Why Bend 2's typechecker benchmarks are misleading (and its practical flaws)

Turning a childhood home into a place to share with strangers

Signal Beta Lets Users Register Without a Phone Number

Patch2vuln v1.0: Streamlining Vulnerability Advisory from Git Patch

Data centers are swapping water for forever chemicals to keep AI cool

Show HN: Figranium – Stack blocks to build browser workflows and call via API

Code review automation fixed the wrong problem

Keeping Humans in the Loop

Find Jobs That Interview Without LeetCode

HEIF Heist

Show HN: Skillmem – local memory for coding agents that stores how, not what

AI is an elite crime spree

Fibonacci Product