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?

Show HN: Loop – Find out what happened weeks after your warm intro

Twenty-five years ago it was cryptography, today it's model weights

Show HN: Sukurini – A screenshot shelf for the macOS menu bar

Connected SUV Locked Its Owner Out in Another Country

AGI Singer: Thank You, Universe

Dependency Cultures – Richard Feldman [video]

I Designed a Custom PCB to Avoid Pressing a Button Three Times

The deadly experiment that could save the American elm

ZimaOS 1.7: The NAS Rabbit Hole Starts Here

First Beta of VLC 4.0 for iOS

Show HN: Cloudrift – CLI open-source that finds wated AWS spend

Contrail Avoidance for the Climate

Show HN: Capo – be the capo of your AWS services

The Questionable Future of Nova Launcher

Guaranteed Income: A License To Spend (2024) [pdf]

The crusade–against a big tech company.Worth reading

Thoughts about the Leiden Declaration

The Economist as Scapegoat (2020)

World’s Tallest Timber Skyscraper

How AI is powering business email compromise at scale

The Response I Got Was Cynical

Counting Permutations with Roots

Hiding Data in Permutations

A New Way That a Cow's Inner World Shapes Earth's Atmosphere

SMS-florin – rent a real UK number for SMS verification codes

Show HN: Every nuclear test from 1945 to 2017, on an interactive map

Show HN: tale.fyi, we deserve a home for fiction

My local LLM scored 6/6. It was wrong every time

Visa to Cut 7% of Workforce as CEO Seeks to Revamp Company

Show HN: Citation Safe – MCP server verifies legal citations vs. CourtListener