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?

AutoMegaKernel: Compiling a LLM into a single CUDA kernel

In A.I. Blunder, More Than 34,000 Instagram Accounts Became Vulnerable

Amp inspired extension for pi agent

Show HN: LANCommander v2.1.0 – New Avalonia-based launcher

Run local agentic AI on the Mac using MLX [video]

Show HN: BibTeX-format, and Emacs compatable BibTeX formatter

Woman Gets on Route 66. Then She Starts Hearing Music Coming from Her Tires

Anthropic says the world should have option to 'pause' on AI

Off By: Exploiting a Use-After-Free in the Linux Kernel

The Evaluations Framework

Plex, the Slow Creep of Enshittification

Show HN: Agent-pd – A zero-token audit log to catch rogue Claude Code subagents

Show HN: OpenYabby, voice-controlled multi-agent orchestrator for Claude Code

StumbleTV: Watch actidentally-exposed webcams from across the world

The Push to Solo Work

Google's 20% 'project' has become AI's 120% 'attention'

Now what?

Optimal Seating on the Airbus A380

Ask HN: Prediction for SpaceX IPO?

Grit: Rewriting Git in Rust with Agents

Show HN: AI News Aggregator

Progress: Real and Potemkin

Ask HN: Is online irritability the canary in the coal mine for various fields?

Show HN: RS-Poker V5 The one with self learning multi-threaded async Agents

The quiet push to shield pesticide makers from lawsuits

Where was your backyard millions of years ago?

Show HN: Predict World Cup scores each day against your friends

NYC Founders Looking for Startup Office Hardware

Runtime Guards for AI Agents

Devs know AI code is riddled with holes, but ship it anyway