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?

Valve's version of Android on Linux (based on Waydroid) is now called Lepton

What I learned building an opinionated and minimal coding agent

Show HN: TrackerNews – Keyword monitoring and insight extraction

My redirect rules from 2013 still work and yours don't

JEP 504: Remove the Applet API

Pentagon Launches $1B Program to Buy Hundreds Of Thousands Of Kamikaze Drones

The case of the 500-mile email (2002)

Solve Go Challenge: Octantconway

Why Won't the Media Report Accurately on Road Deaths?

Show HN: ThesisBoard – Trello for Investment Research

Building a fintech platform's mobile app

`npx vercel` opens a project

Catalogue of Moulded and Ornamental Brick (1892)

Social identification with a team boosts fans' social well-being

StackOverflow: AI Assist

Windows 11 growth slows as millions stick with Windows 10

Michael Levin on Pain as Agent, Healing as Alignment

Mixtures of dietary nutrients lessen behavioral deficits in mouse autism models

Show HN: I built a trending books by month Bump Chart with Hardcover data

Source code to Sega Saturn game "Powerslave" released

Comments on smartphone ban from high school teacher

Hiring: Damned If You Do, Damned If You Don't

Some Economics of Artificial Super Intelligence

Rock Paper Scissors Is a Game of Skill

Alzheimer's is the symptom, not the problem

Vibe Code Like It's 1986

The Real-Life Hunt for Red October Happened 50 Years Ago

Show HN: MetaConvert – Free PDF and Image Conversion Tools

After nearly 30 years, Crucial will stop selling RAM to consumers

Affiliate Program