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?

I built SaasList, a Product Hunt alternative focused on fairer discovery

Scientists reveal five big moments when your brain dramatically changes

A Highway Is Crumbling. New York Can't Agree on How to Fix It

The consumption of AI-generated content at scale

'It's the golden age of spreadsheet geekery'

3k tons of cocaine: controversial figure pits Colombia against the UN

The Programmer as Navigator by Charles W. Bachman

Olares: An Open-Source Personal Cloud to Reclaim Your Data

Olares One: Local AI Desktop by Olares

Arcee AI Trinity Mini and Nano – US based open weight models

Most popular cooking oil in America may directly contribute to obesity

Has the freedom of hybrid work made us happier?

HN: Want to ship a native-like launcher for your Python app? Meet PyAppExec

List of Interstellar and Circumstellar Molecules

Nike's Crisis and the Economics of Brand Decay

Lewis and Clark Geolocation

The experimental Sokol Vulkan back end

More Data Independence and the History of the Relational Model

AI Wet Labs – Chapter 1 [video]

Why Am I Paying $40k for the Birth of My Child?

Rockstar co-founder compares AI to 'mad cow disease'

Mozilla's Latest Quagmire

Unitree Robotics

Locales, encodings, Unicode, and C++ [pdf]

Show HN: Locu – Deep work sessions for engineers (Linear/Jira, local-first)

GTA 6 Is Likely Too Advanced for 60FPS, Even on the PS5 Pro

Earth is spinning faster, leading timekeepers to consider an unprecedented move

Nano Banana 2

DataSetIQ – The Global Macro Data Intelligence Platform

Prisma 7