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?

US clears H200 chip sales to 10 China firms as Nvidia CEO looks for breakthrough

Texas county pauses data center construction in rural areas

Deal reached with hackers to delete data stolen from the Canvas platform

Show HN: Nanci, CI written in plain Python, locally debuggable

One in seven in UK prefer consulting AI chatbots to seeing doctor, study finds

Blanet

A field manual for Deutsche Bahn

Plasma secrets: Windows position for naughty apps

World's first laughing gas breathalyser trialled in England

Austin's population tops 1M residents for the first time

Celebrating 10 Years of the MITx MicroMasters Programs

GitHub Copilot's new desktop app

Bun's Rust rewrite has been merged

AI, open code and vulnerability risk in the public sector (UK)

How the Bird Eye Was Pushed to an Evolutionary Extreme

Why Do We Interface?

Jane Street Interview Simulator

A Single Infusion Could Suppress HIV for Years

Discover Crosspad the best finger drumming web app

Physics Guarantees the Datasphere Keeps Expanding (and What It Means for Agents)

Show HN: BlitzGraph – Supabase for graphs, designed for LLM agents

Ambient Intents

Cannabis and driving? Studies reveal big risks

AI models are being used to predict conflict

Entire - How We Improved Agentic Search

Claude Code cost observability to prevent tokenmaxxing

Which programming language is fastest?

Synthetic evaluation datasets for testing AI agents before production deployment

What's in a GGUF, besides the weights – and what's still missing?

The coming AI jobs-pocalypse