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?

Warren Buffett on the stock market (1999) [pdf]

India Country Brief: The Anthropic Economic Index

Climate change is cooking Europe's oceans, scientists find

XLibre- community-managed display server for the X11

Show HN: A Dynamic video creator for free

A library to make GNN work on binary code

The Pinecone DAISY-1 is a fantasy 8-bit computer that exists in reality

Junghans Force Mega Solar

AI is entertainment's scarlet letter

GeoLibre: An open-source GIS that runs in the browser

From "default dead" to living the future of cancer care

Made the best alarm clock for myself

Reduce Claudish: Paul-Graham-writing-style-in-Claude.md

Show HN: Data enrichment with AI for Pandas DataFrame

Rebuilding Linear's delta sync read path

React ScrollIntoView and UseRef: Scroll to Any Element

Accounts are now required to access old.reddit

Debian weighs eight options in vote on LLM usage

Input Required: Agentic Architecture Framework

Show HN: An interactive OOM handler for Linux (List hogs and ask what to do)

Radio Europe Online

Ripple – semantic commit analysis for Python that blocks broken commits

Jet engines can't tell coconut-blend fuel from jet fuel–but the environment can

The Sleep-Promoting Resilience of Boring Infrastructure

Malicious Version of ArrayRef (0.3.10) Published

My Thoughts on Agentic Coding

Run frontier LLMs on sovereign EU infrastructure

Arrayref v0.3.10 and v0.3.11 compromised on crates.io

Show HN: Ollama served my 40k-context model at 4k, silently

Nutrition standards for AI-designed foods across borders