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?

Why German trains are never on time anymore

Show HN: Heypi – Like OpenClaw but for Your Team (Slack, Discord, etc.)

Reproducible Infrastructure and Nix

ARM Open Sources AI-Powered Security Code Review

What is to be done about MGLRU?

DDS Vibe Academy – 47 free AI coding masterclasses, built by AI agents

GNUtrition 0.33.0rc4

DOE's Lockheed Martin nuclear-weapons M&O contract: $48B cumulative since 1993

Show HN: Heirlooms – pass your legacy to family after stop breathing

Plume – Sensible HTTP Security Headers for Gleam Web Servers, Inspired by Helmet

How to make Unreal's Message Log 100 times faster

AI will be used to estimate age of asylum seekers from next year

Hybrid local and cloud LLM stack for regulated financial document processing?

Heirloom.app – Keep important information in a encrypted place

Show HN: Simple news aggregator with source bias meters

Ferrari bungled the design of its first EV

Good to Know: Exiting an international organization

International grads three times more likely to find work in Germany

Study reveals brain circuit that keeps memories from getting mixed up

Ingesting 1Gbps of logs into ClickHouse for $180/month

Why some Indian tech engineers are losing interest in Silicon Valley

JetBrains is killing another popular IDE (DataSpell)

Spite: A Dignified Music Player

Samsung Lawyer Fails to Differentiate iPad and Galaxy Tab in Court (2011)

Arbitrage

Brazilian Internet Forum (FIB16) in Belém, Pará: A Visual Tour

Claude Talk Small. Code Still Big

The MQ-28 Ghost Bat Is Now Flying in the U.S.

// The hope is that Claude Code will be unusable on this repository

Teaching tmux to babysit my Claude Code agents