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?

Musicians shortchanged by AI deals with labels, lawsuit alleges

Show HN: My open source agent built and launched its own business in 48 hours

Live scanner that detects antidetect browsers like Kameleo

The Boeing 747 Begins Its Final Descent

Show HN: Hyperpost – Reference Implementation of a Website

Why the NATO Logo Is One of the Most Recognizable Symbols in the World

How to Build a Google Sheets API Integration with Nango and Codex

Where Did Earth Get Its Oceans? Maybe It Made Them Itself

C64IDE: Powerful, Free Mac Commodore 64 IDE Review

You can power on a Mac remotely

After empty promises, string theory finds new uses

Second Circuit Rejects Sam Bankman-Fried's Appeal

Show HN: VibeClip – open-source AI video editor you control by chatting

In the Atacama Desert, astronomers live and work in a James Bond villain lair

Review of Synthetic Users Finds Synthetic Users Don't Work

Wasi: WebGPU – A Proposed WebAssembly System Interface API

Show HN: StackScope – I crawled over 40k indie launches to see what they ship

HN Comment Golf

Fluxor: A zero-dependency PHP framework with file-based routing

Elon Musk Is Colonizing Earth

Anthropic's Fable is the most locked-down public model we've ever seen

The Roblox Problem

Swamp Is Interesting Because It Doesn't Trust AI

Adding ext3/4 compliant journaling to the 30-year-old GNU Hurd microkernel

Show HN: World Cup bracket game with no back end – brackets live in the URL

Show HN: A Terrible Way to Consume Hacker News – AI Slop

500M Subscriber Livestream [video]

CRISPR Tech Selectively Shreds Cancer Cells, Including "Undruggable" Cancers

Commits

American Ebola Unit Sparks Fury, Protests and a Political Crisis in Kenya