Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

What 1k Days of Wordle API Data Reveals About How People Play

Natt Brittin: Ex-Google boss confirmed as new BBC director general

Tell HN: Hawaiian Airlines app showing someone else's flight info

Paper Tape Is All You Need – Training a Transformer on a 1976 Minicomputer

The Brigade System Helps Restaurants Succeed. Does It Also Lead to Abuse?

Before Leon AI 2.0, I want to say this

Show HN: Let Me Emoji That for You

I said code review was dead. Here's what I got wrong – and right

Agent-browser – Browser automation CLI

Building an AI Data Analyst Sucks

Code Review usage will count toward Codex limit instead of having separate limit

Show HN: Building an open-source product demo platform

Children of Heaven

Microscope Light

"Roadrunner": a bipedal, wheeled robot for multi-modal locomotion [video]

macOS Tips (2024)

Show HN: New Hacker News Watchlists Crome Extension

The Casino That's Eating the World

NASA Sets Out New Plans and Timelines for Moon Base and Nuclear Mars Mission

Show HN: I build a free feed reader that reimagines what is possible with RSS

An Extensive Benchmark of C and C++ Hash Tables

My quest to preserve VHS- era gaming culture, one eBay bid at a time

The best design style extraction and reuse skill on the market.

I Put a Full JVM Inside a Browser Tab. It "Works". Technically. Eventually

Supreme Court Sides with Cox in Copyright Fight over Pirated Music

I built a game where an AI judges whether things deserve each other

Malicious Litellm 1.82.8: Credential Theft and Persistent Backdoor

I built a YAML DSL for Temporal workflows

A Rare Blog

Comprehensive C++ Hashmap Benchmarks (2022)