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?

Build your own Claude Code. But brilliant and utterly indifferent

Human feedback guides AI approach that automates about 84% of decisions

Banana Picking Drones

Simon Winchester, Author of 'The Professor and the Madman,' Has Died

Founding Full-Stack Engineer

Does it matter if software is unreliable and insecure?

KDE Plasma 6.9 Will Stop Leaking Memory When Right Clicking Files/Folders

When Agents Run Computations: Schrödinger's Robert Abel on Where the Human Still

Children of Men: The Future Is a Mirror for the Present

Fifth Circuit Reopens Fight over Texas Social Media Censorship Law

Show HN: Offline PDF Desk – one HTML file, redacts and merges PDFs offline

Horrible Public Key Tricks

AI 'slop' is a social judgement

An agent skill for $80 (not derogatory, it's a good skill)

Show HN: Pgxio – a tiny PostgreSQL layer inside Nginx

Show HN: Forced to build my own Harvest alternative tracking and invoicing

The laws courts cite most

A shipwreck influenced Cape Verde's cosmic-disco explosion (2021)

Tail-Call Optimization Explained: Why Recursion Doesn't Have to Blow Your Stack

LLM APIs ranked for teams building AI agents

Blunt Banhammer Blocks Basic Bots Ballistically

Spatium, a 3D gym floor planner that runs in the browser

Passenger – The free IDE for C# and .NET

Humanizer Benchmark – Reright

Our newest TPUs: 8tx and 8i Max, built for the agentic era

A live tree of systemd jobs on the boot console

Show HN: Pay-as-you-go Windows workstations for solo developers

Corruption Is a Cost-of-Living Issue: App Store Edition

Show HN: MemSeal – provenance containment for agent long-term memory

Tech's Teetering Towers