Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Quantified evidence: Sonnet 4.6 quality regression

Trace your Claude Code easily

French Tax Code as Code

Show HN: GTMJobs – a job board with GTM Engineer jobs ONLY

Introspective Diffusion Language Models

How much RAM can LinkedIn Tab consume?

The Business Case for Vanilla JavaScript

What is your opinion on the energy transition?

Claude Code OAuth down for >12 hours

Show HN: GTA 6 Breach via Anodot and Snowflake Explained

The man with the most dangerous job on Earth

Show HN: Early Reader – Free open source reading app I built for my 4-year-old

Ask HN: What's Better?–Tauri or Electron?

ZFS Helped to Remove Code

How Big Is India's E-Commerce Market? Don't Ask Bain

Show HN: A Bomberman-style 1v1 game where LLMs compete in real time

If [static analysis] could have, why didn't it?

Global imbalances are back with no clear path to resolution

OpenAI snub shows UK's energy costs are killing industry

Shock from Iran war has Trump's vision for US energy dominance flailing

Technical SEO vs. content optimization: which one moves rankings?

The disappearing and unappreciated art of audible alerts [video]

Inland Customs Line

Show HN: Connections Hint Today – spoiler-safe hints for NYT Connections

Linux 7.0 Released with New Hardware Support, Optimizations and Self-Healing XFS

Show HN: Nous – A compiled language for self-healing AI agents

More than 100 reverse engineered hidden Shortcuts actions for iOS and macOS

Nvidia AIStore – scalable storage for AI applications

Stonks-CLI – track your investment portfolios from the terminal

DPRK IT Worker Captcha