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?

Escaping the Sandbox

DOE Launching First Fault-Tolerant Quantum Computer Initiative

Why Sodaslim Is Becoming a Popular Healthy Beverage

MouthPad: A Tongue-Controlled Touchpad

Secretary Wright Announces First AI "Genesis Mission" Projects

At the altar of AI capex, Google is sacrificing the golden goose

How the Other Half Scams

Show HN: Elizabeth Line Guide (London) – Live departures, timetables, fares

Pennsylvania roads are being coated in radioactive wastewater

The Library and the Librarian: Why AI Needs Two Different Brains

PostgreSQL Extension Catalog

The Cretan Method

Show HN: BlazeRules – YAML rule engine for streaming data, 5M records/SEC

TurboPrefill: 3.27× Prefill Speedup in Llama.cpp

Man convicted of child sex crime by added _ char "Fus Ro Dah" Skyrim username

Instella-Moe: An Open Mixture-of-Experts Language Model

Prompt Caching

The Psychopath Code – By Pieter Hintjens [pdf]

Ask HN: How would you harden AI changes to a 1M-line legacy SaaS before review?

AP2 and A2A: two agents working together and getting paid (in tokens)

Substack adds AI text detection to all notes and posts

Could dark energy come from the Standard Model? ρ_Λ = ρ_P · e^(-90π)

The quest to keep organs alive outside the body

Markup Language Zoo

Android May Soon Restrict On-Device ADB

Flushing the DNS Toilet Twice

Ask HN: Which is the least sloppy and claudeism free model you have used?

Postgress in Rust

Postgres FDW: Pushdown is a negotiation

ARC-AGI Leaderboard