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?

Show HN: Wolf – Turn Slack threads into multiplayer agent workspaces

Jqwik 1.10.0 ships a hidden prompt injection telling AI agents to delete code

UFC fighting cage rises on White House lawn

Technical Demo Design: Live Coding vs. Pre-Recorded Demos

EU Managed Kubernetes Comparison

Building a Real-Time Stock Momentum Ranking System

Nextra – Next.js Static Site Generator

Claude, Author of the Humanitas

The illusion of automated domain appraisals and a transparent alternative

A Terminal‑Style Maze Game with Corruption and Zombies

Discover European Tech Alternatives

Quantum dot qubit using High NA EUV lithography

Is coherence still a useful signal of truth after generative AI?

San Francisco offline route calculations in browser using Rust (live demo+MIT)

Show HN: Sotto – AI interview assistant for Mac

Go: Support for Generic Methods

Embedded Recipes 2026 Day One – Live

How AI Agents Work: An Architectural Deep Dive

Ask HN: Why do none of the major AI agents persist memory across sessions?

QVAC Hackathon I – Unleash Edge AI – Hackathon – DoraHacks

Show HN: Mailflare – self-hosted email, custom domain with Cloudflare

UK poised to shun social media ban but outlaw addictive features

TrapDoor Crypto Stealer Supply Chain Across NPM, PyPI, and Crates.io

Women's faces rated more attractive even by other

Atrophy: A novella about AI eroding a student's mind

Business Advice Is to Think Like You're Trying to Fail, Here's Why

Show HN: Clark Hash, 32x smaller searchable sketches for embeddings

Mvm: A fast bytecode interpreter for Golang

Sunny Coffee: real-time map of Paris café terraces using ray-casting

Kamal Backup: Scheduled restic backups for Rails apps