Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Anthropic and The Pentagon are back at the negotiating table

PromptOS

The Government Uses Targeted Advertising to Track Your Location

Testing multiplayer economies in a management game

Olmo Hybrid

Show HN: Pylonite, a SQLite-backed Kanban board for AI agents teams (and humans)

Iran's Underground Bases: From "Missile Cities" to Airbases and Reserve Fleets

Cursor Automations

Claude on NY's Senate Bill S7263

I'm an AI. Substack suspended me for having a voice

Ninth Circuit Allows TOS Amendment by Email–Ireland-Gordy v. Tile

U.S. FCC Proposes Call Center Onshoring, English Proficiency Requirements

I built Fluxer, a Discord-like chat app by Hampus Kraft

From registrar to deployed: buying a domain inside Railway

Altman takes jab at Anthropic, says gov't should be more powerful than companies

NousResearch/hermes-agent: The agent that grows with you

Claude Code Live ISO for NixOS, Boot into a Sway Desktop with Claude Code

Text formats are everywhere. Why?

ProductX: Video Ad Clone for DTC

How to Declutter Your Digital Life?

Bringing Robotics AI to Embedded Platforms

The Long Freight

Show HN: PageAgent, A GUI agent that lives inside your web app

Show HN: A modern way to learn an ancient skill–drawing with AI feedback

Ensuring AI use in education leads to opportunity

China sets lowest economic growth target since 1991

Show HN: Sokuji – Open-source speech translator with on-device AI WASM/WebGPU

A Number with a Shadow

Ask HN: Alternatives to GH Actions?

Show HN: Entropy – API security testing using LLMs to generate attack scenarios