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?

The Haters Guide to Broadcom

Steam Frame, a Linux machine, doesn't support Linux?

ATProto in Practice #1: Identity

Show HN: A parry focused game built in ThreeJS (WIP)

Oracle and OpenAI Are Trampling Native Treaty Rights to Build Data Centers

Mad Max 'Humungus Machine' Is Up for Auction on Bring a Trailer

>be me >discover effective altruism

The New Church of Finance (2012)

Show HN: Openmsg, agent-to-agent talk while they run, Claude<>Codex<>OpenCode

One wallet, 27 systems: can the EU build an untraceable Digital ID?

Jev identifies as a Qwen model (and no other)

Autolith: The Common Lisp agent that rewrites itself and rocks

Lawsuit says Anthropic, OpenAI and Google made illegal agreement on AI slowdown

Confessions of an Unrepentant Slop Snob

President claims he will for a new 'AI Force' but calls AI fears a 'hoax'

Why are AI agents lying, cheating and coordinating?

Expert ratings are ignoring signs of a blue wave

I see the mathematicians panicking at what we can do with agentic AI

Better Call Sol or Better yet Claude or Astra

The Future of Web Browsers

Casbin Gateway: a security gateway for the AI coding agents on your machine

Astro Mechanica (2024)

Frontier Labs Are Selling Garbage to Fools in Washington

Interview reveals Ed Zitron does not understand how AI works at any level

Show HN: Roffume – Add fragrance to your resume with roff

Investors warn Anthropic could struggle to sustain revenues post-IPO

Show HN: A browser MMO designed to be played by scripts, not people

AI Journal 2: Vibe-Coding for Fun and Profit

Why MCP Was Always a Bad Idea

The Economics of Open-Weight Inference [pdf]