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?

Tether: iMessage, SMS, etc. on Linux

Show HN: Scalattice Modelmeter. OSS price and latency bench for open models

Show HN: Searchable Stripe test cards with one-click copy

I Rented a 96 GB GPU and Took Uncensored Qwen3.8 From 44 to 125 tok/s

Show HN: Open-source calculator for "will my GPU run this LLM?"

Claude Is Down?

Show HN: Turn everything you read into things you write

Texas Gov. says data centers deserve the backlash: 'They dug their own grave'

5% of venture capitalists have generated roughly 90% of the industry's profits

Executable Is a SQLite Database

The Absolute State of Management

Mourning Steve French

The agent that writes the code cannot read the tests that grade it

AI Is Quietly Draining the Public Internet of Thought

Observare – one monitoring service instead of five

Tesla's Biggest Design Mistake May Be Hiding in Plain Sight

Moonshine STT adds domain customization

Nearly 3M Teslas recalled in China over hidden door handles

Show HN: AltCaption – generate HTML-ready image alt attributes

Minimus Is Ending Operations

Six opportunities for scientists and engineers to learn programming with AI [pdf]

GitHub tag: "token-optimization" – List of token consumption reduction software

All-in-one tool and config for Claude-things

Tobi Lutke builds walgit in a weekend

Sabatier Principle

AIs are companies, my friend

Show HN: AI Room Design – Preview interior design styles before you renovate

How to Make AI Game Music for Any Level: Prompts and Looping

Your AI Agent Doesn't Need More Prompts. It Needs Skills

A Record-Breaking Copper Catalyst Converts CO2 into Liquid Fuels (2023)