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?

US Corporate Insiders Are Selling Stocks at a Near Record Pace

Proposed spec to share SKILL and "loop"/"Workflow" by OCI registry

How vibe coding a game made me design an AI agent protocol

Apple targets OpenAI employees with legal letters

"Strengthening the Heartbeat" by the Educational Theorist Thomas Sergiovanni

Show HN: hmr-serve, hot-loading web app for any folder (MIT)

Show HN: Notvex – encrypted local-first notes with SQLCipher and XChaCha20

Advances in Real Time Rendering in Games

Prompt submitted to cloud even when using local LLM by default

Guy Makes Mechanical Mirrors [video]

Echelon 3000

Rust Is a Harness

Show HN: Watch Wikipedia being edited live on a 3D globe

Show HN: A sandbox for running real jailbreak techniques against local LLMs

GTFO VR Postmortem

Proposal for universal AI ethics standard against country censorship

Spine – a knowledge graph of your repo, in 7 languages, that feeds an agent

Show HN: I made a Strava for logging degen trades on WSB

Show HN: Sokkan – my Claude Code sessions kept forgetting, so I gave them memory

Real Money, Fake Models: Deceptive Model Claims in Shadow APIs

Show HN: Math Grid – Japan's 100-square math drill (hyakumasu keisan)

Cutting China reliance would cost the West $23T, research suggests

Gofi – go tooling for Ubiquiti Unifi gear

Ampere, open-source battery charge control for Apple Silicon Macs

Recognition of unfamiliar predators in horses through only visual predator cues

Humans evolved to be twice as big as our ancestors

Neglected software update caused widespread Telstra network outage

Get notified about open slots at campgrounds / huts / cabins all over the world

50 vs. 60 Hz and Alzheimer's Disease, an AI Exploration

Should AI usage be explicitly disclosed in movies and TV shows?