Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Controlling the Wizzard

Self-healing nuclear fuel could improve safety, reduce waste in reactors

Ask HN: How do you keep system context from rotting over time?

Show HN: ChartGPU – WebGPU charting library, 1M+ points at 60fps

Attention Media ≠ Social Media

What to do about students using ChatGPT to do their homework?

Show HN: Mastra 1.0, open-source JavaScript agent framework from the Gatsby devs

Go-Native Durable Execution

Google Magic Cue runs on your device or in the cloud

Show HN: SolScript – Write Solidity, compile to Solana programs

The Hunt for Midori

External AI Representations and Evidentiary Reconstructability

One of the first alternative app stores in the EU is shutting down

Send your name around the Moon with the Artemis astronauts

You've Got Luddites All Wrong (2014)

The Startup Graveyard

Primes: Prime number projects in 100 programming languages

Weave.js: an open-source library to build whiteboards, canvas, and design apps

Codex Overtakes GitHub Copilot in Usage Share

Treating anxiety as a bug in legacy code (engineering approach)

Danish Pension Fund AkademikerPension to Exit US Treasuries

Anthropic's Pricing Is Stupid

Gluetun – Lightweight VPN Client in Docker for Secure Connections

Ubuntu for AI Engineering

Lumo: Privacy-first AI assistant where chats stay confidential

Daily Warship Guessing Game

Cloudflare Zero-Day: Accessing Any Host Globally

Better-Docker-ps: Because `Docker ps` is annoying and does not fit my terminal

ScentWillow AI

Pharos: The Lighthouse at Alexandria