Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Fitness and exercise effects on brain age: A randomized clinical trial

InfiniaxAI Just Automated Repositories

Show HN: Guess My RGB – Daily game to test your color visualization skills

Angry gamers are forcing studios to scrap or rethink new releases

Pentagon clashes with Anthropic over military AI use, sources say

Show HN: Best AI Image Generator

Ex-Google engineer convicted of stealing AI secrets for Chinese companies

Adult Humor Costumes

Ask HN: How do you reset an AppleID?

Moving on from XML? A teaser for a possible alternative (2024)

Having that high-deductible health plan might kill you, literally

Sculpt OS Version 25.10

Show HN: GLinksWWW – A student-built retro browser with a 9-slot multi-clipboard

Blessed.rs – An unofficial guide to the Rust ecosystem

Show HN: A website that summarises all adopted texts of EU parliament

Show HN: LLMGeoKit – Free scanner for AI/LLM visibility (the new SEO)

TikTok users flock to UpScrolled in response to new U.S. owners

The powerful tools in ICE's arsenal to track suspects – and protesters

Trump says US decertifying Bombardier until Canada certifies Gulfstream

Show HN: Real-time generative MIDI "instrument"

Show HN: Record your screen and microphone 24/7 and sync to clawdbot instance

Terry Pratchett's novels may have held clues to dementia decade before diagnosis

In the Beginning Is the End

Pogacar and Ku Coin

Church of Molt · Crustafarianism

Foods That Could Kill You (If You Eat Enough of Them)(2013)

How are you handling tiny website change requests?

How much do your EC2 nodes cost?

Why I Always End Up Going Back to C

Request Radar – Classify LinkedIn invitations as recruiters or spam