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?

Beats 360

Why It's So Hard to Measure the Depth of the Ocean

Are LLMs still surprisingly bad at some simple tasks?

OVH Outage (Degraded Performance)

Pruning LLMs Like a Physicist: Block Removal as an Ising Optimization Problem

Continual learning on a 28B Learner 1.0 model, new architecture

What's going on with millennium maths problems [video]

Ralph

Porting Doom's game logic and renderer to SQL

Tech elites launch college alternative, raises $42M

Rpi – a composable LLM agent SDK in Rust

Editors of higher education journal coauthor editorial with fake references

God Help Us, Let's Try to Learn About Mechanistic Interpretability Techniques

Show HN: Vigil - Keeps your Mac awake while your coding agents work

Failures shown to be the harness, not the model (blog post)

Eiderdown: A Family Tradition – Trailer [video]

Open source tries to govern AI code

Explore page for early internet websites

Managers Are Catalysts

Show HN: An API that tells you what people love about a product

Tokens Too Cheap to Meter

I deleted slow, expensive LLM turns in coding agents with Jev

Should I use Cloudflare for my SaaS, its so annoying

M&Ms and Skittles sorting machine

PayPal partners with Muse for agentic checkout

OpenCode Reloaded

Binomial Coefficient Coincidences

Show HN: Beachball – A Beachball that lives in your macOS Dock

Creator of Windows Task Manager has vibe coded a version that runs on Mac/Linux

I Asked 100 Agents to Hack Me