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?

The Future of Self-Evolving Software

AI Financial Advisor – FiscalAI· Streamlit

Open-source pixel-art editor

Record baby boom brings heaviest parrot back from the brink

Keycheats.com – Offical Reseller for All Cheats Products|Cheap Pricing

Show HN: We built client-side AST SEO audits for a Next.js CMS to avoid LLM lag

Show HN: Aidcrew a team of coding agents, each on its own model, in one terminal

AI Norms and Values, Part 2 of 3: AI for Honeycomb Engineering

ICE Gave New Hires Access to Restricted Info on Palantir App

Omarchy Hyprland – external monitor multi-GPU configuration

Who Eats Memory Costs

GPT-6 Astra Achieves SOTA on ARC-AGI

Hi Reddit I'm Wile E. Coyote. I'm taking on ACME. AMA

Transformation Tracker

One Year Suspension for Steve Balmer

Using GPT-6 Astra – OpenAI Docs

France had its hottest summer since records began over a century ago

Three-LLM: Three.js-based WebGPU LLM inference engine

Word42 – A Wordprocessor

OpenAI's GPT-6 Astra on ARC-AGI-3

SF's Tech Right Debates the Ideal Dictator

Claude Fable 5.1 decoded a centuries-old royalist message hidden in since 1653

GPT 6 Astra Vibe Check

Are others seeing Google's ReCAPCHA rejecting Firefox users?

AMD Versal HBM Series (FPGA's with up to 32GB HBM2e)

Google Lyria 3.5 music generation (public preview)

Show HN: I processed 100k+ LinkedIn posts into open-source Claude Code skills

Language skills stay strong in elderly while other cognitive abilities decline

Rust stabilizes Never type on nightly

The death of San Francisco's Market Street