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?

Unofficial Starlink Global Gateways and Pops

Show HN: Agent Torrent, a BitTorrent inspired mesh for idle coding agents

PrimeNG is no longer open source

Cannabis Users Face Substantially Higher Risk of Heart Attack

Show HN: TraceTree – Sandboxed behavioral analysis for NPM and PyPI packages

Sycophantic AI decreases prosocial intentions and promotes dependence

Introduction to Compilers and Language Design

Show HN: Ferroterm – Rust / WebAssembly Terminal Emulator and Library

Programmers need to start meditating now

Accelerating the Quantum-Safe Timeline

T3MP3ST autonomous red team platform multi-agent offensive-security meta-harness

EU Council forces Chat Control via fast-track

Prediction Markets Let You Bet on Whether a Wildfire Will Burn Down Your Town

Peregrine Falcon: The Fastest Animal on Earth at 390 km/h

Ask HN: Is HN crowd a left-leaning?

UK plans to give established media more visibility on YouTube

Latent Collaboration in Multi-Agent Systems

DeltaChat 2.48: zero metadata, group description, native audio/video call & more

Spain's cadastre API is SOAP from 2003, so I built a JSON wrapper (+MCP)

The Revenge of the Philosophy Majors

What We Can't Measure About AI Yet

Wikipedia Is Battling for the Soul of the Internet

Durian Montong

Was Homer's Ithaca an Island?

I built a Figma for traders and investors – all in on tab

Show HN: Skred – my opinionated sound/pattern engine and live coding thingy

Show HN: Runtime and install-time enforcement for NPM dependencies`

ActHub – EU AI Act compliance toolkit for small businesses (PHP, no framework)

EPP spreading false claims on Chat Control

All Your Favorite Gadgets Are Getting More Expensive Again