Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo 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•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Getting my daily news from a dot matrix printer 2024

Show HN: Harnessing LLM-Prompt Mutation to Build Smart,Automated Fuzz Drivers

Local SLM as a compression layer for cloud API calls

Shipping the OpenClaw Stack in Public

Claude Code Routines: 5 Production Workflows That Ship Real Work

The Stress of Elite Chess Is Wearing Down the Game's Champions

"There's No Such Thing as Plain Text" – Dylan Beattie

SAP just made the opposite bet from every other enterprise platform on AI agents

Google Research: A new light on neural connections

GPT 5.5 flags accounts for "potential high-risk cybersecurity"

Ask HN: Is Zuckerberg just a „one-hit-wonder"?

The Lost Art of Structure Packing

LinkedIn Premium Does Not Boost Your Posts

Flinku – I built a Firebase Dynamic Links replacement after the shutdown

Chernobyl 40 Years On

Lambda Calculus Benchmark for AI

KDE Plasma adds support for hardware overlay planes on Intel GPUs

RSME: A lightweight reactive encryption algorithm with internal anomaly sensing

Discret 11, the French TV encryption of the 80s

Roboticist-Turned-Teacher Built a Life-Size Replica of Eniac

Choose a Reliable Ruby on Rails Dev Partner for Ongoing Maintenance and Features

Only One Side Will Be the True Successor to MS-DOS – Windows 2.x

A web-based RDP client built with Go WebAssembly and grdp

The eerie abandoned vehicles in Chernobyl's 'dead zone'

Ask HN: Do you know the problem of "14" in India?

Amália- Open Source Large Language Model (LLM) for European Portuguese

Another Microsoft Copilot AD injected into 4M GitHub commits

Martin Galway's music source files from 1980's Commodore 64 games

Morpheus spyware hijacks WhatsApp via fake Android update app

With TPU 8, Google Makes GenAI Systems Better, Not Just Bigger