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?

Ask HN: What are some good benchmarks for different agent harnesses?

A Leaked GitHub Token Exposed the Exact Ozempic Formula

Ask HN: After you ship a feature, what happens to what you learned?

Show HN: Vitrus – the company brain that tells you what it doesn't know

Hackingpal

Ask HN: What are your parameter count estimates for Opus 4.8 and GPT-5.5?

Query with Curl

Extracted Value

Multi Pong – multiplayer pong game

New V4 encryption format that supports hardware-bound encryption using Yubikeys

Epoll vs. Io_uring in Linux

The Tiny Sailing Game That Feels Surprisingly Real [video]

Russia's Putin is spending $26B to live forever

First Pure-Go Cubrid Driver: Gocubrid

South Korea Could Build Nuclear Submarines, but It Shouldn't

Show HN: Callimachus – Local search across your AI coding-agent history

Not just books: renting a sewing machine from the library can improve democracy

Jobflo – A local-first job tracker built with SwiftUI

Adblock Plus doing just fine after updating to Manifest V3 two years ago

Turns Out, There Is a Cabal of Elite Crazies Trying to Control the World

Show HN: Domvault – self-hostable second brain with consent-based note sharing

Why Amazon hates 'human-in-the-loop' AI governance

28% Faster: Blink Prototype That Shows Why Apple iOS Browser Engine Ban Must End

Lessons from wasps on how societies survive power struggles

One Prompt Agentic AI Marketing for Game Developers

'Buy less' campaigns don't work

FunnyBench – Can AI Models Tell Funny Jokes?

Stop calling the Super Productionizer a 'baby blender' – Frank Elavsky

Researchers used math to crack Wordle

Show HN: TLA+ Process Studio