Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Serve Markdown to LLMs from your Next.js app

Idea Hunting Is Dead. Databases Like This Are Replacing It

Magawa the HeroRAT

The Lazy Way to Find Your Next SaaS Idea

Pentagon puts Scouts 'on notice' over DEI and girl-centered policies

We Will Be Divided

Social media use/mental wellness links in youth are artifact of other factors [pdf]

Agentic Engineering Patterns

Might Be the Most Underrated Resource for Early Stage Founders

Kakveda open source-level AI, Infra observability agent

What Is It That Makes Today's Homes So Different, So Appealing?

How LDAP Works

How you invent math: From counting to complex numbers

Stop Burning Your Context Window – How We Cut MCP Output by 98% in Claude Code

Zerobyte

Researchers praise 'stunning' results of new prostate cancer treatment

Robotic Land Drone holds positions in Ukraine frontline for 45 days

The Missing Piece of AI Discourse Is Trust

Modula-2

US Customs destroy a rare floppy disk containing demo version of Tsukihime

ErsatzTV Has Been Archived

The Ml.energy Leaderboard

Jeffrey Epstein saw promise in Bitcoin – and its far-right supporters

Surface-Stable Fractal Dithering

Show HN: I Turned My CV into a Space Invaders Game (Rust and WASM)

Show HN: JobSeek Expat – a CLI tool to scrape English speaking jobs on LinkedIn

Accuracy vs. Speed in Local LLMs: Finding Your Sweet Spot

Silent March (2021)

Nano Banana 2 AI Image Generator – Pro Quality, Flash Speed

Czinger 21C review: flat out in America's £1.6M, 3D-printed hypercar