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?

MeetMarket: Alternative Gay Hookup App

Show HN: Yes, I vibed coded something But not sure what to do with it

Noyb success: ORF.at must correct misleading cookie banner

Dire wolf brought back from extinction after 13,000 years [video]

LatConnect60 investment round: AUKUS HiRes SWIR Satellite constellation

Gelatine Sculpt: The Secret to Lean Muscle and Tight Skin

Ukkonen's suffix tree algorithm in plain English

Merlin to Bring Military Autonomy Platform to Commercial Air Cargo

Rational quantum mechanics: Testing quantum theory with quantum computers

Achiving 900M Lines of the OIN Linux System Table

Yearslong fight over users' right to tweak smart TV software heads to trial

SpaceX's historic IPO plans: Billions in losses and Musk's ownership

Déjà moo: cows can recognise the faces of people they know

BoE Governor says Plans to limit food prices 'not sustainable'

I 100% vibecoded a webgame that makes money

Musk's SpaceX Reveals Its Finances for the First Time

Show HN: SkinMax – AI Skin Care Coach

Anthropic says it's about to have its first profitable quarter

Jeff Bezos says bottom half of earners should pay zero in income taxes

OpenAI Stargate: where the US sites stand

Meta Begins Laying Off Employees as It Transforms Around AI

Wispr Flow Is Broken

Put yourself in a loop with your coding agents

Dumbshit.app

DiffsHub

PR Diff Speed Matters

[RFC] Open Access to Standards Documents – LLVM Project

Show HN: FKS2G – LLM-backed metrics for deciding how closely to review code

The Unreasonable Effectiveness of HTML

Sparrow compliance check for Linux configs