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?

The Snapshot Paradox

Daily News Now tops search results for local news podcasts with AI content

The design process is fundamentally changing

Show HN: Nabla – Pure Rust GPU math engine, 7.5× faster matmul than PyTorch

Minecraft Server Setup Tool – An Interactive CLI for Scaffolding and Management

How to Solve the Rubik's Cube

Show HN: My ADHD girlfriend has 50 work tabs open, so I built ⌘J

Show HN: Umbra is an ESR fork that doesn't spy on you

I forced AI to reason like a senior engineer

Runtime validation in Python type annotations

Show HN: PraxisJS – signal-driven front end framework and AI experiment

Social Cache Busting

Perplexity Cannot Always Tell Right from Wrong

Show HN: Tensor.cx – Turn your documents into AI search in 30 seconds

OpenAl reveals more details about its agreement with The Pentagon

Why does C have the best file API

AWS Middle East Central Down, apparently struck in war

Show HN: Sophia – Review Change Requests Instead of Pull Requests

A new account made over $515,000 betting on the U.S. strike against Iran

Tsink – Embedded Time-Series Database for Rust

Solving the Good Will Hunting Problem

Traction Is Often a Lie

Mahmoud Ahmadinejad, Iran's ex-president, killed in Israeli airstrikes

Inter-generational Tool Knowledge for your Agents

Star Trek Comm Badge for Home Assistant Voice Control

Show HN: Imagedojo.ai – Blind arena for Google, OpenAI, and xAI image generators

The Panopticon Is Here: How the US Government Built an AI Superweapon

Let's talk about the humanoid robot in the room

Ask HN: Where do you see yourself in 5 years?

Ganak: The Making of a Versatile, High Performance Model Counter