Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Examplefile – Sample Document File Formats

Show HN: DefendFlow Domain Security Board – live scans of popular sites

Show HN: Headroom (OSS): Cuts LLM costs by 85%

Breaking the Linearity Barrier: Recursive Swarms for Long-Horizon AI Engineering

Data Activation Thoughts

Show HN: My way – 18-agent autonomous workflow for ClaudeCode – issues to deploy

The life of a playboy publisher who shaped 20th-century literature

Revisiting Brat Summer: Artists, politicians, and the summer of 2024

Build Your Own AI Coding Agent (Full Guide) [video]

Umarell – men of retirement age who spend their time watching construction sites

The SaaS Selloff: AI and Interest Rates

BioNeMo Platform Accelerate AI-Driven Drug Discovery

AI Sandbox for Claude Code CLI with Node and Python SDKs

You Need More AWS Accounts Than You Think

Show HN: Gollem – Go framework for agentic AI app with MCP and built-in tools

A new way to call C from Java: how fast is it?

How to Read a Room in 5 Minutes

AI and Corporate Capture of Knowledge

Algebra will return to S.F. middle schools after more than a decade

MIT's Computer Systems Security (2024)

More HTTP/3 focus, one back end less

The Born-XML Shakespeare Edition: The View from the New Oxford Shakespeare

IRISC: An ARMv7 assembly interpreter and computer architecture simulator

Show HN: Agam Space – Self-hosted, zero-knowledge, E2EE file storage

Astronomers spot one of the largest spinning structures found in the Universe

Non-developers are writing apps instead of buying them

The Biggest Poverty Issues: 2025

Smalloc: A Simple Memory Allocator

AI Visibility Scanner – Check if your WAF is blocking GPTBot

Man accused of aiming laser at Trump helicopter acquitted in 35 minutes