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?

No Modes (Larry Tesler's license plate)

Context Mode – An Open-Source MCP Server That Reduces AI Coding Context Usage

Making Coding Fun Again

Show HN: Secret Key – Shamir-based emergency access to a password vault

Sleep-cycle memory for agents: capture while awake, distill while asleep

The History of Spam (2014) [pdf]

NixThis: The ad blocker for Windows itself

When AI Writes the Code, Show Your Judgment

Feminine and Masculine

Criminal arrest warrant for OSINT troll Jesse Nickles

Will Agent Resource Registries ever have their moment, the way AI gateways did?

We rebuilt our video editing tool

Basic Concepts of Quantum Mechanics by L. vs. Tarasov (2021)

Problems in Mathematics with Hints and Solutions (1982)

Impatient Programming

Any software developers not ready for FIRE changing their careers?

Paying for the same upstream refresh twice (Snowflake) [video]

Developer makes Windows 11 26H2 work on insanely low 128MB RAM

Why Touching an Am Radio Tower with Grass Plays Sound [video]

Show HN: EBI Space – In-session screen time awareness without harsh lockouts

Terence Tao: The Year Math Changed Forever

Socialista – Generate static ads and UGC videos from product images

noyb win: French electronics retailer Fnac Darty fined €7M

See what Claude Code reads and edits, live, in a file tree

A simpler way to put ChatGPT to work (A shared allowance for ChatGPT and Codex)

How RimWorld 1.7 Lets You Commit War Crimes Faster [video]

Show HN: Detox Mode – A Flutter app to help reduce smartphone distractions

Alkaline batteries are obsolete – but their predecessor isn't [video]

SATORATOS: Read classics from the source with original translations and notes

Show HN: BeachFinder – Find beaches with the right conditions