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?

Kestrel – I built a 900 KB macOS browser because Chrome ate my 8 GB Mac

ISO 24495 [pdf]

Show HN: Zuse" One agent coordinating 20 Linear issues in worktrees

Show HN: Sol-Luna Orchestrator – let Codex decide whether to delegate

Markdown Without the Split Screen

Show HN: Open sourcing MonsterWriter, piece by piece

Why aren't my two Cortex-A9 cores cache coherent?

Unitree G1 vs. Human: This Robot Learned Tennis by "Watching" Amateurs [video]

Steve French (SMB3/CIFSFS Linux kernel maintainer) has died

The Asymptote of Reality: The Hard Limit of Multimodal Models

Stalking the Wily Hacker: 40 years later – Cliff Stoll [video]

Extraterritoriality

The only floating national park [video]

Show HN: Ditdah – A Morse App for the Terminal

Opportunity Cost in Strategy Games

Unlocking hidden revenue streams with market models

Fast is better than slow

Show HN: 2048bid.lol – Rank your product by playing 2048

Ask HN: What websites do you visit daily to stay informed?

Show HN: Leaderbid – Pay to Rank Leaderboard

What Makes Australia Australia?

Simulating the Information Horizon in Chaos

Show HN: SubtitleGenerator - Fix subtitles with a low-confidence review queue

Postgres 19: What's new in Monitoring?

James Munkres (1930-2026)

Eliminating Branches in C++ Loops

Wi-Fi 8 is the first wireless upgrade in years that isn't chasing speed

China joins Europe in scrapping Windows for Linux

The market is underpricing memory bandwidth

Download Embabi Games