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?

Migrating from TrueNAS to NixOS without losing data after the rug pull

The 80% Problem: The Last 20% Is Where the Engineer Used to Live

Bernie Sanders unveils $7T plan to give Americans control of AI industry

The Trouble with Reused Phone Numbers in CIAM

Flint: Fast Library for Number Theory

How can engineering leaders avoid becoming Bond villains?

Apple iPhone 20: Everything We Know About the Redesign Coming in 2027

Rekor – immutable tamper resistant metadata ledger

Application Gatekeeping: An Ever-Expanding Pathway to Internet Censorship

WordPalette – Generate a brand palette and visual identity from a word or image

Quantum computing startup says it will leapfrog everybody

This will save you hours on your CCNA/CCNP

The Apple Disk II Controller Card

I have made a simple CLI and would like feedback

Claude in Microsoft Foundry is now generally available

No Code Exec? No Problem Living the Age of VBS, HVCI, and Kernel CFG (2022)

Light Switch "Wakes Up" Sleeping Cancer Cells

KitForge–generate an AI agent manifest; scaffold with enforced approval gates

A Solution to A.I.'S Growing Power Demand: Homes

Gene Sequence: e2e CRISPR gRNA design pipeline – sequence to 3D model in ~5s

Candle marked from 1 to 30 EUR, priced at 30 EUR

Guide to Using Large Language Models and Generative AI in Economic History

Scott Wheeler on Stephen Sondheim

Prism: An Impure Functional Language with Typed Effects

The Humbling of the Once Almighty Dollar

Supreme Court rules geofence warrants are protected by privacy rights

Architectural Patterns: Moving Beyond Cloud-Native to Local-First

Family of magnetic field-boosted superconductors in rhombohedral graphene

Clean build time is the wrong CI metric

Show HN: Privacy Friendly Age Verification System