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?

DeepSeek V4 Flash 0731: Is It Cheaper to Run It at Home or Pay per Token?

All memory manufactured in 2027 has been sold out

Is your Bitcoin seed safe after Coldcard accident? What about iancoleman/bip39?

Truckslop

Marque Terminal

The Ones Who Look Outward

Tsang Tsou-Choi

Show HN: Remembrane – agent memory in one SQLite file, zero dependencies

Windows Tracks You with Hidden ID. We Built DeGDID to Block It

AI model achieves breakthrough in forecasting cyclones – Google DeepMind

Operational Tropical Cyclone Forecasting with AI – Nature

Don't get rejected by Apple anymore

Show HN: CapyToolkit – Browser-native developer and hardware diagnostic tools

High-Quality Free Transparent PNG Collections

I won't read LLM authored fiction

The offline messaging apps challenging internet shutdowns

Ask HN: DeepSeek Alternatives

Ask HN: After 20 years of coding it is not a fun hobby anymore. How about you?

Russian spy 'honeytraps' lure Ukrainian soldiers to their deaths

Ball Scratch Simulator: release date, gameplay, VR, and PC requirements

Passkeys by default and retirement of Microsoft SMS and voice authentication

How to read the Attention formula from the Attention is all you need paper

Americans Are Richer Than Everyone Else

INT2 KV-cache quantization is getting surprisingly good

Canadian imports for data centre equipment up 88% from prior year

Restaurants and theatres ban Meta's smart glasses

Dark mode toggles: two states are enough

I have never seen a game fail because the artists were too slow

Ask HN: I can't post in Show HN

Programming the Gigatron