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?

How long before we stop reading the code?

Ask HN: Bootstrap founders, how do you distribute what you build?

Buckets – know which user caused your database bill

We know the official GTA 6 price – it's expensive, but not too bad

Tech Company Ranker

Show HN: Execlave – AI Agent Management Platform for Governance and Enforcement

Medicine: Country Surgeon (1932)

LastPass confirms data breach after hacker compromises supply chain

ChatGPT Exporter – Export Conversations to PDF, Word, Google Docs

The Emergence of a New Paedophile Panic

Show HN: How Loud Is My Hotel?

Fate – a joke horoscope generator utility for Linux pids

Carspreading' could lead to extra 2,600 crash deaths a year by 2040, study finds

When typing is better than talking

Show HN: Fillr – Save web form as a preset and autofill with data you control

Confluence Server Backup Reader

Functional Geekery – Fogus (2014)

SEO Schema Markup

Ask HN: How to avoid LLMs struggling with Lisp parens?

European Commission's Metsola Overrides MEPs to Force Through Chat Control

GL.iNet claims alleged GPLd code is propriety to Realtek, haven't released it

Purism announces Librem 16 laptop designed to respect privacy, security, freedom

Arma: Cold War Assault (2001) source code released

Show HN: Flounder – an autonomous white-hat security auditor

100 Years Ago, Students Took the First SAT. Where Is It Headed?

France confirms first Ebola case

New Locked Pi Install

Shooting and Crying

Show HN: I made a PvP style multiplayer Minesweeper game

Roles over Jobs