Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Don't Call It a Moat

A satellite-smashing chain reaction could spiral out of control

LinkedIn uses 65GB of RAM with 7 tabs opened

Introducing Simple Mode

TerraLenses – Explore Countries – cultures, landscapes, facts, and comparisons

Make your own GitHub health indicator and LED lamp

Wastrelly Wabbits

How we chose Positron's Python type checker

Logan Bartlett's Reflections on the State of the Software and AI Market

Show HN: I'm making it much easier to sell your side project / small business

Forgotten Italian CPU – The Genesys B52 MMX (2021)

Show HN: Virtui – TUI session automation and recording for agents

Weeks After Denouncing Censorship, Zuckerberg Texted Musk to Remove DOGE Content

Show HN: Bulk posting with CSV for your interns

In-process circuit breaker that kills runaway AI agents before they go rogue

Package Upgrades Feel Like Russian Roulette

Meta-Harness: End-to-End Optimization of Model Harnesses

Show HN: King Louie a local multi-machine AI assistant

Ordinary Lab Gloves May Have Skewed Microplastic Data

NASA Teams Readying Artemis II Moon Rocket for Launch

Pretext: Dynamic Layout

1-Bit Bonsai: The First Commercially Viable 1-Bit LLMs

Nah – Free tools. No catch

Node Banana – Open, Local Alternative to Weavy/Flora

Samsung's new app claims to alleviate motion sickness using sound

Xenv.sh – the first secrets manager built for AI agents

A dot a day keeps the clutter away

Oracle reportedly cuts jobs to fund its AI infrastructure push

Breaking into a Govee Smart Display: From UART Shell to Device Impersonation

Hex editor should color-code bytes