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?

Tracing a silent-corruption bug in differentially private LoRA fine-tuning

Linux Foundation announces Akrites: coord/remediate/disclose OSS vulnerabilities

Show HN: CodeCritic – Arduino code that compiles and simulates before you build

The Doorman's Fallacy in Action

Feds deny Polestar authorization to sell cars in US from model year 2027

Why we're choosing stewardship over an exit – Thoughtbot

"My dad is Li Gang" incident ("我爸是李刚"案)

Show HN: Omnigraph - object-storage native graph engine with git-style workflows

Scaling Rails at Aura Frames: Splitting to 8 Primary DBs

Show HN: Polygraph – Let AI agents see cross repo and maintain session memory

Cornell Recovered $100k in Unidentified Payments with AI

Russia's plan to drill superdeep revives controversial theory of 'endless oil'

Show HN: I built an Ad-free Pinterest Alternative with AI content filtering

Trying to recover from thin content penalty from Google

Idler Magazine

AI Surveillance: Age Verification Meets Your Chat Logs

Staying Awake (2008)

The easy way to build your own App and SaaS Analytics Dashboard, without SDKs

Indian Political Simulation web based game

Multi agent systems for complex tasks

Structured Primary Keys

Trailing Dots Are the Worst

Scrutineer: Scanning open source without flooding maintainers

Inaccurate diagnostic error displayed to all BMW i4 owners

Applied AI Implementation Engineer Freelance

Hours of Humanoid Teleop, Recorded in Real Homes

NewsOnScale

Achieving Host and MicroVM Density Using Erofs

AI Is Designing Radio Chips That Humans Couldn't Even Imagine

Show HN: OnBuzz – an open-source workspace for AI agent teams