Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Show HN: DocForge – Multi-Agent RAG That Fact-Checks Its Own Answers

Show HN: 10-min AI threat model (STRIDE and MAESTRO), assumption-driven

Maester 2.0

ChatGPT Containers can now run bash, pip/NPM install packages and download files

Show HN: ToEnvelope – A local-first, WYSIWYG envelope printer for the browser

Show HN: Consciousness Gateway – AI routing with consciousness-first alignment

Typography Hierarchy Boosts UI Usability

Golang OpenClaw-Like Project

Show HN: OctoStore = Leader election as a service (single binary, self-hostable)

Insidious in VR

Secrets About 'Tennessee's Ancient Egyptian Temple' Revealed (2018)

Robots Dream of Agentic Soup: A Evolutionary Agent Skill Experiment

Pre-training vs. post-training is a false dichotomy

Show HN: Merge Jpg Free Online Tool

Ask HN: Do You Use AI Email Assistants Like Google CC?

Why is everyone talking about Section 230?

'So Tired I Want to Cry': China's AI Subsidy War Swamps Shops

Some thoughts about tool design and AI

Show HN: Carapace – A security-hardened Rust alternative to OpenClaw

Who Is Parker Miller? (From Mitchell Martin)

Ask HN: Has anyone achieved recursive self-improvement with agentic tools?

Jony Ive and Ferrari car interior reveal, Apple car?

Ex-Meta exec says Instagram exposed teen daughter to 'predators' in bombshell

Biases in the Blind Spot: Detecting What LLMs Fail to Mention

Sony Jumbotron Image Control System (1998) [pdf]

Show HN: AI-Powered Structured Data Extraction from Any Document (93%+ Accuracy)

Try AI Beauty – Transform your look with the power of AI

Apple Easter egg has been hiding in plain sight

Best Global Brands 2025

Memsearch,an agent memory with md as source of truth(inspired by OpenClaw)