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?

Tokensave: An MCP Server That Saved Me Tokens While Coding

Show HN: Synapse – local codebase indexer and MCP server for Claude Code

Overload and insight look identical from the outside

Show HN: Free car spec db to defeat the paywalls

Madison Square Garden Sues Wired Magazine over L.G.B.T.Q. Tracking Report

How Word Count Is Important for Social Media Posts

William Gaddis and William H. Gass: A Literary Conversation and Reading (1995)

Trump Media pitched $100K monthly fee for fastest feed of US president's posts

Disney Has Started Feeding Your Kids AI Slop

Lawyers risk being sued for failing to use AI

LLM-Integrated Multivariable Calculus Course

Topographical Collection of King George III

XRPLink – Cryptographically Verified XRP Payment Receipts, Powered by Flare FDC

FDA approves new kind of cholesterol pill

Useless Use of Cat Award

Novo Space builds modular computers for satellite constellations

Gaming Sickness and Its Impact on Players' Experiences with Games

I built a browser-based P2P file transfer tool using WebRTC

Jordan Ellenberg explains how geometry helps us understand the world

Retry is not a loop, its a data structure

Association Between Low/No-Calorie Artificial Sweeteners and Cognitive Decline

PersonalDrive: Personal Cloud Storage

Implementation of "Writing a C compiler" in Zig

Toyota pump tech could be key to hydrogen-combustion practicality

Track you Claude Code usage in dollars

Seamless iPad (or any device that can run a web browser) drawing into org-mode

China cracks down on AI companions, forcing millions to break up

Archaeologists found Homer's Iliad inside a 1,600-year-old Egyptian mummy

IceCream – Never use print() to debug again

Claude Is Painful