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: Startup ideas from customer complaints, in seconds instead of months

Disney+ Cracks Open the Door to TikTok Creator Videos

Show HN: VS Code Extension – Semantic Code Search (Semble)

The Moon is Down; I have not heard the clock (2021)

OpenDoctrines, open source grand strategy game moddable via WASM in 13 languages

I built fingerprint unlock for Mac (no Magic Keyboard) [video]

How much faster could racehorses get?

Show HN: Plan Review – independent review for Claude Code plans

Show HN: BlazeRules – YAML rule engine for streaming data, upto 5M records/SEC

What it takes to build agent infrastructure yourself

Simon Willison on Technical Blogging

Open source Cloud AI agents

The following is a valid DOS COM executable

PLS Try My OS

New Orleans will use AI to answer 911 calls instead of a human

Equity Is Worth More Than Cash Because of Optionality

The Investors Whose SpaceX Shares Vanished Before They Could Cash In

Space to cook: notes on engineering leadership

Hardware Devices That Support GNU/Linux

Obviously, DOGE Did Not Save Money

Dictionary Compression in Materialize

I got a 1998 CD-ROM world atlas running on Windows 11

Meta fined $567M in largest child safety ruling against social media giant

New Mexico court orders Meta to pay $567M over harms to children's mental health

Curating Crime and Punishment: What 10 Images Reveal About American Justice

European firms afraid of US tech kill switch but haven't made an escape plan

All Agent Skills

Tracely – Turn AI agent production failures into CI regression tests

The Code Shackle

I launched a fake deodorant brand to see if AI would notice