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?

Peter Sarnak on "The AlphaZero Test" for Mathematics

How to ship a database every day

WakeAI – an AI assistant that tells you when to leave so you're never late

Show HN: Karma in Menu Bar

The restaurant menu that never goes out of date

Tesla defeats Sweden's IF Metall union after 1,021-day strike

The Neurosurgery Resident Who Proved Crouzeix's Conjecture [pdf]

Taxpayers Funded a $533M Artillery Plant That Made Nothing

Software Factory with AI

Maximizing the value of your Claude Code sessions

Show HN: DST this DST that, test your containers

Show HN: Hexis, open-source Claude Skills management

Guilt-Driven Development

RustDesk now supports true unattended remote access on Wayland

Enabling the next iteration of the borrow checker on nightly

Live Experiment of the Veblen Effect

In Stunning Color, a Celestial "Treasure Chest" Full of Stars

NIST Seeks Blueprint for AI-Era Overhaul of National Vulnerability Database

France blocks social media ban because it would require adults to prove age

One Task at a Time

RayforceDB – a pure C analytics database with a Lisp-like syntax

Show HN: Self-bench – build SWE-bench style evals from private repos

AI: The Devil on My Shoulder

Deferred Token Response

Hours of Jingling Keys [video]

Show HN: Interactive Product Demos made easy

AI by Hand

LLM Inference Benchmarking

V-RAE: Rethinking Video Latent Spaces for Generation

Why Claude's Watermarking Won't Fix Anything