Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Heisuke Hironaka Has Died

Commission presents proposal for EU Inc. – a single legal entity for Europe

Securing digital assets against future threats

Prevalence of Alpha-Synuclein Seeding in Olfactory Mucosa Following SARS-CoV-2

Store birth date in systemd for age verification

Speeding at higher speeds does not save time by a lot

Nvidia's AI-Powered Photorealistic Gaming Technology Roasted as 'AI Slop'

Infinitely many primes end in a 7

Does anyone know which company has the best tool battery technology?

Reducing features to increase privacy, is this is good move?

The Riemann hypothesis (or, how to earn $1M)

Cities: Skylines 2 boss says they overestimated Unity's capabilities

DOGE staffer who flagged grants for 'DEI' struggles to define the term [video]

Is Math Art? Werner Herzog Says Yes

Why Tech Bros Are Now Obsessed with Taste

Tools Written on the Uxn VM

Is Hacker News losing interest in startups?

EpsteinBench: We Brought Epstein's Voice Back but Got More Than We Wanted

ahsohtoa: Structure-of-Array Synthesis in C++20

Skills Are Docs

Show HN: Liteparse, an OSS universal fast document parser by LlamaParse team

Construct's official 3D model object

Arc Cancer Treatment Framework

Border-shape: The future of the non-rectangular web

Twilio inadvertently recharged dormant accounts for $20

The Anglosphere is increasingly miserable

Everyone Gets an Agent

Thailand Is Sleepwalking into a Demographic Crisis

Code4z VS Code PL/I Language Extension Preprocessor Support – By Azat Satklyčov

Mystery AI model revealed to be Xiaomi's following suspicions it was DeepSeek V4