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?

Lessons from shipping a watch-only Apple Watch app, built with Claude

How to find an eclipse around another planet

Just Bury Your Trash

Show HN: Thelemail, private email hosting for your own domain

The Duke of Moctezuma Is Alive and Runs a Marketing Agency

Even the oceans are struggling to keep their cool

The Art of Leaping Out of Planes to Fight Wildfires

Right-Sizing Your Intelligence Spend

A Note from LWN

Elevating Antigravity agent skills, Part 2: Image generation

A Beginner's Deep Dive Guide to Entra Passkeys

Sourcerer – fast and lightweight Git GUI client written in C++

Tell HN: Religion is dumb, especially Judaism

Show HN: OpenClip – Instant popup actions for highlighted text on macOS

It turns out that Orion's much-maligned heat shield performed well

A crash course in predicate logic

Global Bond Selloff Sends Yields to the Highest Level Since 2008

Watch the 'Eclipse of the Century' Next Year When Spain, Egypt and More Go Dark

Maniquest Launch [Productivity]

HomeOS – A self-hosted family dashboard for a kitchen touchscreen

LLMs: Intelligence vs. Cost

The Cables That Connect the World

Show HN: Subpool – Self-hosted AI subscription management for teams

Loudcloud

Aging Brains Blend Memories Together Instead of Just Forgetting Them

Open data institute solid open call

(2) TBM 438: The Right but Early Club

Dutch central bank moves share of gold from U.S., Canada to London

GOV.UK Pay at 10: how it started and how it's going

Chinese Shipper Cosco Collects Intel for Beijing with Concealed Equipment