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?

InkBoy, 30-frame-per-second grayscale Game Boy, open sourced

Proof-based general-purpose computing with Magnetar

45 years later, the Sinclair ULA design documents surface

Show HN: Pasteface - Record, transcribe and copy speech locally in your terminal

Xbox Labs

End-to-end encrypted relays for OCapN

Mosquito Joe FDD teardown: 66% fee load, 380% termination spike

What causes AI fatigue for engineers and how to ease the strain

Argon now avaliable for pro users on ANTIGRAVITY

Timestral

Free-AI-tools – Curated list of free and low cost AI tools

Pace of Global CO2 Emissions Continue Dropping

Business accounts will consent to Meta scraping their websites Starting Oct. 30

GPT-Live-1.1 – New voices. Better accents. Less "checking."

I read a 122-page franchise FDD so you don't have to – That 1 Painter teardown

Calculators to find the value of your business data

Show HN: Find a compatible partner through Matchmaking

Ask HN: Do you talk to bots online? How has it changed?

Linus Torvalds: "banning AI is stupid and so are you"

Is Liquid Metal Killing Our PCs? Scientific Analysis and a 2-Year Test [video]

BeBox is a Haiku application that emulates Be Inc.'s BeBox

Datadog Scout 1.0: New SRE model for investigating production issues

U.K. Sanctions Cryptomus for RU Money Laundering

Data Science Weekly – Issue 673

iCloud Photos is now required for permanent Shared Albums

Veda: First Intelligent Hoby OS

DeLorean may have a flying car in the air before Tesla does [video]

Company that put gas engines in Teslas goes bankrupt owing $37M

Yours

OpenTodo, a Todoist killer with MCP integration