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?

Situational Awareness Kindle eBook ePub

The Case of the Kung Fu 'Phreak'

Model Provenance Kit: Know Where Your AI Models Come From

Carbon footprint of Linus Tech Tips' private jet

7meter

Notion or Obsidian or Apple Notes?

Fidelity to Cut 800 Staffers as It Overhauls Tech, Product Teams

Ask HN: Ex-cofounder threatening to send YC email

GitHub project reproduces 58 Schmidhuber papers with AI assistant

Crypto exchange Coinbase to lay off 14% of staff as AI reshapes work

Coinbase steep first quarter loss after slide in crypto prices; shares fall 4%

Superintelligent Retrieval Agent: The Next Frontier of Information Retrieval

Opus 4.7 and DeepSeek V4-Pro select Buddhism as preferred religion

Antitrust Remedies Order Takes Effect as US Judge Denies Google's Stay Motion

Silverback Imfura took a chance, and ended up alone

Probe-Detected Grokking in Multi-Probe DPO

Transpiler.us – dev tools platform with Solana Pay USDC on mainnet

Two-Tier Verbalization in Natural Language Autoencoders

Show HN: Generate a variety of ad creatives for your SaaS

Why 'quantum proteins' could be the next big thing in biology

Implementing a Virtual Filesystem over Elasticsearch

Sparse Cholesky Elimination Tree

Palette Masters: 46 Zed themes derived from master painter color palettes

Abstract Machines for Logic Programs

Rex is a secure script execution engine that uses Cedar policies

Do houseplants improve air quality?

Analysis points to a unexpected cause of reading difficulties

Grok 4.3

AI creates a fearsome cold-war-style dilemma

Visit a Mosque in video game format and learn things about Islam