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?

Show HN: A purely in-browser harness – let SaaS users act with natural language

Code Review Agent Should Run in CI, Not on Your Computer

Show HN: I built a phone app to gamify fitness with friends

Zxc 0.15.0 – decompression 2x faster than Zstandard

Tell HN: Wise holds my company's $22,954 for 27 days, then goes silent

Show HN: An Algol 60 compiler with a LuaJIT runtime

War Games of Dimming the Sun

I'm Not a Robot: The Internet's Human Test

WHO report on Russian lab worker death highlights "key uncertainty"

OnlyOffice 10.0 Released with AI Features, 1k Bug Fixes

Gaming on Linux Without Cheating

Asterinas 0.19.0

Show HN: MLX Direct Decider, Mac local decider without fine-tuning

Netflix is laying off roughly 6% of its workforce

Ported2Browser

ESA targets Anbernic emulation handhelds as "superfake" piracy enablers

Hash-consing MMDB search trees: 31% smaller files, identical lookups

Flashcards in ChatGPT

Bitwise-identical training and inference across GPU vendors – Nvidia, AMD, Apple

Show HN: BScaff – A CLI tool for project scaffolding and snippets

Domain Aware Software Factory

Show HN: Merlin, Run Your Claude Code and Codex from Slack, Linear and GitHub

Apply as a team and earn €50M in Mollie equity

Show HN: Open-source DFM checks for manufacturing and MCP

Man, SF is downright gloomy these days

GitHub Actions has added lock files

Cancellation of this year's Grace Hopper Celebration

Mathematical proof in the age of AI

The Silicon Compiler Comes Back as an AI Agent Factory

Pumbkin – Roll your own custom voxel jack-O-lantern