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?

Medieval King Arthur manuscript could fetch £2M at auction

Inside Google’s Agentic Search Revolution

Checking the math behind OpenAI and Anthropic's latest headlines

How to write code, miss every deadline, and make everyone miserable

Scoped Error in Rust

The robots are replacing the packages

A Practical Order Matching Framework for High-Frequency Strategy Backtesting

OpenClaw for Sales – Using Local-First AI Agents for Sales Workflows

25th of May – Towel Day

The Simula One: Linux VR Computer

Your Python Scraper Has a Tell. Curl-Cffi Is How You Hide It

Autonomous bus collided with tram on its first day of service in Sweden

Peter Higgs: I wouldn't be productive enough for today's academic system

Sentry.io DE Region Outage

RSS Anyway

La Page Du Temps

AI overly affirms users asking for personal advice

OWASP CVE Lite CLI

Oak Ridge Starts Weaving Together a Quantum, Classical HPC, and AI System Stack

Ask HN: How do you deal with analysis paralysis on big goals?

Citing Gandalf, Pope Leo says we must "disarm" AI

RetinaDesk: Definitive guide to 5K and 6K displays for Mac

Launching Avrea: CI that helps teams ship faster

Show HN: Layered retrieval beats grep alone for LLM-generated engineering docs

SkillOpt – Executive Strategy for Self-Evolving Agent Skills

News about Raspberry Pi 6 and Microcontroller Development – Jeff Geerling

Out of the Loop

Meteor strike captured on volcano livestream [video]

Agent Activity: User Activity Recon Toolkit

Improving Local Techdocs for Your AI Coding Agent