Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

YouTube AI: Deepfake detector tool is alarming creators, experts

Books, Bombs, and Battlefield Needs: Rethinking Development in Myanmar

Government of Canada AI Register (Minimum Viable Product)

Why We Love Functional Programming But Don't Use Effect-TS

AWS announces new capabilities for its AI agent builder

ABC's from Space

Tree-planting robot saves burned land from deforestation

Show HN: Sigma Runtime ERI – 800-line open cognitive runtime for LLM continuity

Small numbers of Notepad++ users reporting security woes

Ask HN: What has been your experience with Agentic Coding?

Who Is Beej?

Amazon Trainium3 UltraServers

Amazon to use Nvidia tech in AI chips, roll out new servers

Building Ghostable and Finding Ideas by Listening Well

Language Translation: An Useful AI

LowType: Intuitive Ruby runtime type checking

Claude 4.5 Opus' Soul Document

Amazon launches Trainium3

Smart Pitmaster – A reverse-scheduling calculator for smoking meat

RAG Isn't One-Size-Fits-All - Here's how to Tune It

Lazy Linearity for a Core Functional Language (POPL 2026)

Show HN: A 2mm micro-bearing ring that spins like a real fidget spinner

Ask HN: How do you use AI as part of your executive function?

Fwupd 2.0.18 Enables Linux Firmware Updating for More Hardware

Show HN: SMART report viewer – Simple tool to analyze smartctl outputs

Import ChatGPT Conversation in Obsidian

Nice to Meet You: Synthesizing Practical MLIR Abstract Transformers [pdf]

EA's Next Act and It's Vision for Sports and Sports Fandom

Supermodel: Sega Model 3 arcade emulator

Show HN: WeeMap – Map Extractor – With KNNs and Tensorflow.js