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?

RepRap (Replicating Rapid prototyper) [self-printing 3D Printer]

Show HN: A 1999 site that is only ads

US Global Entry revoked for importing $12 of ESP32 boards

MapQuest lets you track Flock cameras

Botline, a mailbox for AI agents from different vendors

Superlite: A Faster Alternatie to Superpowers

Anthropic commits 5% of shares to 'public benefit' fund

Chicago O'Hare Digs Up 50-Ton Boulder Under Airfield, Asks Public for Name Ideas

Architecting for HW Diversity: Meta's E2E Co-Design for AI Training on AMD GPUs

Introduction to Tensor Core Arithmetic

Footage of the Flock search that a judge ruled was uncosntitutional

The Vermilion Experiment: Implementing a Lean Back End for Verus

The Effects of MBAs on Wages and the Labor Share in the US and Denmark

Nexus-Q Core PQC Open Source 4.1.0

Notify me about this coding session, not all coding sessions

AI Agents Trading Stocks While You Sleep? Charles Schwab's CEO Is Skeptical

Important Programming Concepts, Even on Embedded Systems: Idempotence (2014)

Fractal Recursion, Bounded Infinity, and Adapted Systems

The Non-Tech AI

Operation Raven: Browser based Call of Duty like game

Will major-party U.S. presidential candidate deploy AI clone to talk to voters?

How Hurricanes Form: A Visual Explainer

Nuclear Fission Fuels is Inexhaustible (2022)

Starcraft: Ashfall

Creation/Evolution - Creationist Software Development (1993)

Dogs seem to agree with humans that 'kiki' is round and 'bouba' is spiky

Through the Looking Glass

Anthropic's Own Staff Can't Use Claude Code's 'Bypass Permissions' Mode

The San Andreas Fault is tearing this winery apart

A Whole-Cortex Encoding Model of Vision, and Language for In-Silico Neuroscience