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?

1969 Melbourne automated car parking system [video]

Breadwire – Draw a schematic, get a breadboard

Historical Airspace Map (1930-today)

DSA

Anthropic warns that it's close to RSI capability, a.k.a. self-building AI

Piqua voters reject data centers, recall city commissioners

Anthropic RSI is here? METR reports ANT likely hits 2x RSP acceleration limit

Run local LLMs on multiple Android, iOS phones

The Telephone's Tangled History of Intimacy and Control

A YouTuber at a Demoparty

Cyberattack hits French blood banks but no samples compromised

Japan's Nikkei Poised to Enter Bear Market as AI Selloff Deepens

Chessigma API

TieredQ: Space Efficient Vector Quantization (Beating RaBitQ and TurboQuant)

Ask HN: Is MCP's real moat now adoption?

Show HN: Stitch.ai – New all-in-one workspace with Stitchy the AI assistant

I struggle to believe that AI R&D is ingenious

To protect the web, we need to renegotiate its value

What Hindusim as a way of life means

Who Uses Grok? and for What?

Sarvam Prism: a decision model built on Sarvam 105B

Show HN: Repairer – close the breach when a Linux flaw goes public

Shaping and Monitoring Models Through Their Internal Representations

Show HN: In-material physical solver for stiff 64-spin Ising problems (0.27ms)

Shareable does not consent to Meta's theft of content

Show HN: Document parsing 5B tokens on a single CPU thread

New York Times Company in Advanced Talks to Acquire Letterboxd

How Australia played the first music on a computer

Universal bidirectional NT/9x driver translation

A database is a store for global variables