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?

Supply Chain Attack Targets Laravel-Lang Packages with Credential Stealer

Deepsec: The security harness for finding vulnerabilities in your codebase

Perplexity Bumblebee: Read-Only Tool for Dev Supply Chain Checks on macOS/Linux

Show HN: ThinkLLM, A knowledge graph of AI models (HTTPS://thinkllm.dev)

All Model Labs Are Now Agent Labs

Zero-dependency CLI that converts LinkedIn exports into Markdown for LLMs

Show HN: Waiting for AI Grand Prix racing SIM? Me too So I made one

The SpaceX IPO filing is filled with AI bets, Starship dreams

The analog computer museum's online library

Being oncall taught me everything

Product Launches, Tools and Builder Guides

Google Is Killing ChromeOS: Aluminium OS, Its Android-Based Replacement

The Making of Indian Statistics

Microsoft reports AI is more expensive than paying human employees

Most EVM systems have no memory

Agent Substrate

Comparisons as Predictable as the Sunrise

What Is an Air Gap?

Ask HN: How concerned are you about a debt crisis?

Laravel Lang Compromised with RCE Backdoor Across 700 Versions

New kind of dark tourism emerging in online 'Backrooms,' study shows

How the Library of Congress is using both AI and volunteers to unlock history

The Verification Tree: Turning AI bug report floods into a confidence signal

Thousands evacuated in Garden Grove worry toxic chemicals in tank could explode

Systemd 261-Rc1 Released with OS Installer, IMDS Subsystem and New Storagectl

Feds unwittingly leak pilots' pre-crash conversation

Kagi Search API is now in public preview

A Visual Tour of Classical Electromagnetism (1960)

My Hermes and Obsidian Setup and Use Cases

New rule requires most green-card applicants to apply from outside U.S.