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?

Ubuntu 26.10 Drops Btrfs, XFS and ZFS /Boot with Secure Boot

Anthropic is adding monthly API credits to Claude Max and Team subscriptions

Stop telling people to delete their social media

Aim – Agentic Idea Management for Automated Research

Post-Quantum Crypto: BSI Concerned About McEliece

Show HN: Sheetstream, write a million row XLSX in Node with 82 MB of RAM

To Kodak yourself out of business

Show HN: An independent execution recorder for coding agents

DeskWM: A Skeuomorphic Wayland Compositor

METR is not a meaningful check on Anthropic

European colonization of Americas cooled Earth's climate (2019)

Common Dry Cleaning Chemical Linked to Parkinson's Disease (2023)

Windows Hybrid Intelligence

Converting a TP-Link Festa F52-Outdoor into an Omada EAP225-Outdoor

I tried to move my notes out of Emacs. I failed. Again

SpaceX credit risk jumps on worries over its borrowing spree

It escapes into the world and threatens civilisation

Google AI Edge Foresight – offline, private meeting transcripts

New Tricks for the R Sweave Drivers

The solar boom is rapidly transforming emerging economies

Kevin Kelly – The Influence of Science Fiction on Science

Show HN: Botscent – Library to Detect Agents on your site

How to turn your AI into a world-class designer

Thinking for Oneself (1851) [pdf]

NASA Releases Artemis II Lunar Science Data

Bringing Internet Explorer's "Interpage Transitions" to Modern Browsers

A New AI Agent Oriented Programming Language

Show HN: Lessong - Turn any song into a language lesson

A nuclear clock synchronized to 229Th

'Jonathan' Is the Oldest Land Animal on Earth