Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Two Belgian Cryptographers Changed the Way the World Keeps Secrets

Use given/when/then Specs avoid Spaghetti Code

Pace of NIH Funding Slows Further in Trump's Second Year

Andon Cafe – A cafe in Stockholm run by AI

Claude Code is not making your product better

Show HN: MacYaps – Battery dying? WiFi gone? Your Mac talks back

Lazarus: How North Korea uses AI to industrialize attacks on developers

std::accumulate: Exploring an Algorithmic Empire (2016)

Same AWS t3.medium, 27-point stability gap across regions under load

Keeping the Coding Agent on the Straight and Narrow

Horribly Complicated Electric Guitar Keyboard (2013)

The Code Agent Orchestra: what makes multi-agent coding work

AIGregate: Automated Tech Newsletter with Hugo and Google Gemini API

ReMarkable firing up to 40% of their workforce

Back end-for-Front end: The most secure architecture for browser-based apps

Meta-Harness: End-to-End Optimization of Model Harnesses [pdf]

Show HN: Trainly – Free 72-hour audit of your AI agent's production traces

Dynamics of genetic and somatic trade-offs in ageing and mortality

Show HN: XTrace – Encrypted vector DB (search embeddings without exposing them)

AI-powered robot beats elite table tennis players

Claude Dropped Max 5x and 20x plans

The Endless Cycle of Enshitification

Texas Populists Almost Destroyed the Two-Party System

Show HN: Hold.aero – Fly and Learn IFR flying in the browser

OpenAI: Workspace Agents for Business

Need advice: Back end engineer → infrastructure: how do you make the transition?

Website streamed live directly from a model

Is Starlink a Secret Radar Constellation?

The AI-Native Interview

Pancreatic cancer mRNA vaccine shows lasting results in an early trial