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?

Integrating .NET GC in your C++ application

Show HN: Vibe-coding games with Claude, day 93: Rock Paper Scissors Lizard Spock

Cloudflare is now "Local First, Everywhere"

Preview of Carbon's memory safety model

A Longitudinal Study of AI Adoption in an Enterprise

Platonic space: where cognitive and morphological patterns come from

MarkText – Realtime preview, beautiful typography, and zero distractions

FJP-CONF: an open conformance standard for auditable agent decisions

The disparity between benchmark score claims and reality

FDA authorized Zyn nicotine pouches without knowing what they were made of

The Ramanujan Challenge for AI

Show HN: Wireplug.org – Free roaming and NAT traversal for WireGuard

Pseudpocalypse

Eliminating Go bounds checks with unsafe

Formalized Mathematics (Open Access Journal)

Frame: A new X11 server – implemented directly in assembly

Charts that explain America's alcohol epidemic

Pentagon suspends CMMC phase two requirements, launches review of program

LLMs racing to solve production incident

Farium – Native macOS Markdown Editor

Mizar: The first usable proof assistant for mathematics

Cooperate Like a Wolf

Too Many Books?

Why Shadow AI Detection Can Not Wait

Neon Handles Database Branching

A 2-in-1 OSINT suite for deep email and username metadata extraction

Show HN: I built source-verified SAT score profiles for hiring

Show HN: Simulator for a custom 8-bit discreet logic computer

Spotify now has an AI assistant you can talk to

Allthevaccines.org