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?

Zo Computer

America is destroying itself. It's no surprise

Guix substitute and guix pull vulnerabilities

Scientists reverse brain aging, with a nasal spray

Apple Container 1.0 Released as a Native Docker Alternative for macOS

Reflections on the Guillotine

Blood Cell 'Nurseries' Upend Understanding of Human Physiology

Be a Hikikomori for Science

Proxying inference requests in 6ms with Pingora, Envoy, and Spanner

Brawndo Plasma Thermos Makes What Plants Crave [video]

Tungsten – an expressive, fast programming language

Mapping with In-Memory Layers to Reduce LLM Overload

Jellyfont: Visual Search Engine for Fonts

Drone Autonomy Crash Course

The Quest to Make Humanoid Robots Safe Enough for Humans

Recovering garbled Bitcoin addresses (2024)

AI Authentication and Authorization

The Ugly Phase

Mantissa, a distributed workload orchestration system

Scientists discover a surprising link between Vitamin C and brain health

Ask HN: When will the stock market crash?

DeFi yield comparison, read before depositing

Birdsong data from Merlin ID app to help global biodiversity project

Microsoft Copilot OS revealed in LEAKED video: built on Copilot and agentic AI

Tell HN: Megalodon.jp is faster than archive.today and doesn't require reCAPTCHA

Out-of-core LLM inference engine written from scratch in Rust

Simulation Game: Can you Terraform Mars?

Tool that stops iCloud from eating your Mac's SSD

I just tired of killing AI slop

RFC: Stopping runaway AI agent spend with atomic budget reservations