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?

Titan's Resources and Their Utilization

Geocentric Orrery

California's winery shakedown tests limits of free speech, association

As Amazon lets Mechanical Turk fade, Mercor hits a $2B gross run rate

Show HN: Built multi-hop passenger transfer routing for a browser train SIM

JadePuffer ransomware used AI agent to automate attack

list55.com: Simple transcription: Microsoft's MAI 1.5 model as a web app

Chat Control 1.0 vs. 2.0

Even banks and hyperscalers are now sounding the alarm about the AI bubble

Show HN: Branchless-nccl-router ver.JAX (GPUs cannot rest)

Shift: Sustainable Technology. With Love. From Germany

Safer-dependencies claudecode skillpack to secure dependencies during developmnt

Sorry, A.I. Is Not Giving Us a Four-Day Workweek

The Fourth Root Complexity of Data Movement

Huawei Mate 90 series reportedly to feature new Kirin 2026 chip based on τ Law

Beamforming

Anti-vaccers are fundamentally wrong about placebo-controlled trials

Alternate Clock Designs and Time Systems

AI: The ROI Runway Could Be Long Outside the Tech Sector

Town Square Is a Beautiful Experiment

Show HN: Otari: your open-source LLM control plane

The Margin: a spoiler-aware wiki that self-updates as you read

Apollo economist says a 'painful repricing' of AI markets is possible

Taiganet.com, Home of the WS4000 Simulator

Majority of id software to be laid off by Microsoft

How HN: Sopsy – Commit encrypted secrets to Git, decrypt with Touch ID

The Master's Daughter- a novel about diffusion of technology and societal change

OpenURMA: A Clean-Room Open Implementation of the Unified Bus Protocol

Why does Chicago use Comic Sans on some elevator inspection certificates?

Welcome to the Luxury City Built by Taiwan's A.I. Boom