Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Show HN: Open Java Format – a maintained fork of Palantir-Java-format

Cognex to Acquire RealSense, Expanding Machine Vision Robotic Perception Market

28% of job postings on company career sites have been open over 90 days

Show HN: Karpathy's microgpt in Rust and an array language

Compound Delay: The Causes and Consequences of Later Grandmotherhood

Nunchux on AMD MI355X: 5s MiniMax-H3 Videos in 1.3s

What I've Been Reading

The Plunging Price of Thought

AI Is a Boring Technology

You cannot manage your peers

How Scientists Contained a Threat That Could Have Destroyed Humanity

New model gev outperforms jev and takes images as input too

Amateur Naturalists Are Helping Scientists Track What Everything Eats

Show HN: Tenderness – open-source synthetic data generation for VLM/OCR

Everyone is hilariously prompt-injecting AI via llms.txt and you aren't

How Deep Is Tulainyo Lake?

The Windows message loop: how applications became reactive

Hardware-Agnostic Models in vLLM

Slop grenade – demo of Window Management API

Apple Removes iPhone 16 and iPhone 17 from Texture and Grain Support

Show HN: HookDeploy – Webhook infra with mTLS private delivery

Using Local Coding Agents

Tired of Tracking Apps?

Show HN: Droid ASC – An On-Demand Android Decompiler, 41–269x Faster Than JADX

Ask HN: Will software still matter when AI write all our programs?

Extending Scapy for Hardware Reverse Engineering

Show HN: Local Software Factory – running multiple coding agents in parallel

Show HN: Make It Nice

LLM Benchmark for de-identification and synthesis

Law firm paid £200M to support Post Office, while police investigating scandal