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?

Canvas hack: company pays criminals to delete students' stolen data

Making cross-platform SIMD code pleasant

FMS – A Groovebox for the Nintendo Game Boy Advance

Subvert.fm – a co-op music platform – launched today

Show HN: Agent Harness with Prolog and WASM core incl. 90s Borland-style TUI

I/O Multiplexing: select(), poll(), and epoll() Explaination Extended

Building a GUI Library from Scratch

The Geometry of Reasoning and Learning in the Age of AI [video]

Refunds are a proxy for regret your marketing should measure

How driving test booking is changing for learner drivers

CNCF TOC votes in favor of OTel Graduation

PEP 661 – Sentinel Values, accepted 5 years later

ESA and JAXA team up on planetary defence, Ramses mission to asteroid Apophis

Apple's iOS 26.5 Update Patches More Than 50 Security Flaws

Show HN: I mage GhosttyFX, a JavaFX terminal view that uses libghostty

Building a devcontainer: workspace mounts, DNS wildcards and /etc./resolv.conf

The Download: the hantavirus outbreak and Musk vs. Altman week 2

Allowlisting Config Capabilities by Embedding Rye in Go

Houses are for living, not for speculation

LUKSbox – Store sensitive files in the cloud

Show HN: I made a weird language and if you no think it dumb, I want your help

Elsevier vs. Meta: first science publisher sues over scraped research papers

Robots We Saw at Kazakhstan's AI Conference

CERN KiCad Libraries

Ask HN: Books you wish you had read earlier?

Why Optimistic Merging Works Better (2015)

SQLite is the best home for AI agents

Local Agent Memory with 98% Recall-5 on LongMemEval-S, no LLMs, no API Key

Got tired of paying for 6 Shopify tools that didn't talk to each other

Implementing advanced AI technologies in finance