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?

I built COLAX – a campus app for NIT Warangal

The DNSSEC Root Signing Ceremony

Show HN: Emails on Your Mac's Notch

A first for CRISPR: prime editing alters DNA directly in the human body

Owning C types from Rust code

EU planned to scrap clock changes. Why are they still happening? – Euronews

Show HN: Stenograf – Free offline transcription and translation for Android

GCC development with large-language models

Show HN: Audimind – Create audiobooks in one AI-powered workspace

Why is AI-generated language so hard to understand?

Cutting our inference bill by 68% by being obsessive about optimization

The First Gist on GitHub

Designing an AI serving harness built to last

A neat trick I found for reusing physical memory

Please Don't Mess with Links

GitHub – mamund/APIs-and-agents: service choreography demos

Show HN: A TypeScript remake of Chinese Paladin (1995), now in English

Running the Patched PHP 8.3.36 on Ubuntu 20.04 Servers with Docker

Show HN: RAG – Run and Gun with Style

Show HN: Swurf – Swipe through the real web

Classic RTS games in browser

10x Engineer (AI Psychosis)

Show HN: Hlas-1: open-weight 3B params TTS with frontier performance

LessMi – A Windows Rat in Python, Controlled Through Discord

Whistle speech-to-text running offline on a 16mb ESP32

The same AI request emits 8.5 times more CO2 in Texas than in Sweden

First PCB manufacturer with MCP support

Netryx – Find where a street photo was taken, to the block, offline

Monochrome – Mobile Browser for macOS

Breakthrough Method for Agile AI Driven Development