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?

Opening a jar for 10 hours straight [video]

AidaIDE – A desktop IDE built around SSH sessions

SlothDB is an OLAP DB ahead of DuckDB on Clickbench SQL database in C++20

Microsoft rejects critical Azure vulnerability report, no CVE issued

The 'Mythos Moment'

Running Local Language Model on Game Boy Color

SPF PermError: What Causes It and How to Fix It Step-by-Step

How the New Testament Was Copied and Preserved

Building Shopie for Mac with SwiftUI

We need something better than touchscreens in cars

Riding the Leopard

Nvidia Surpasses Germany

'White monkeys' paid to make Chinese businesses look global

Why our AI agent needed a causal graph, not just a RAG database

Huginn Net – Multi-Protocol Passive Fingerprinting (P0f-Style)

PE packer with randomized VM ISA per output file (C++)

MicroZig: Embedded Applications in Zig

DFDS to invest €1B in battery electric ships for the Channel

Media Date Fixer: Clean Up Wrong Dates in Photo and Video Libraries

Magic 1.0 – A highly modular email theme

Ask HN: What's the minimum needed tech to sustain modern civilization?

Review: The Unaccountability Machine, by Dan Davies

Nostalgebraist's Hydrogen Jukeboxes

How a self-proclaimed Swiss king's 'empire' is riling local authorities

kzoo.k

My Thoughts on AI, Part 1: Fears, Opinions, and Mental Journey

Terse Code

Solving Connect Four

Distrust Has a Job; It's Just Not the One You're Doing

World Models for Planning Agents