Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

AI code analysis is getting good

Stop Chatting with AI. Start Loops (Ralph Driven Development)

Logarithmic Scales of Pleasure and Pain (2019)

LLMs for Medical Practice: Look Out

TidesDB – A Modern RocksDB Replacement [video]

Porting Graph:Easy to TypeScript with GPT-5.2 and Azad

Ask HN: How does an indy website integrate with cookie vendors to make money?

Alan Kay – 75 Years of Graphical User Interfaces [video]

Capital in the 22nd Century

The First Video Game Came Long Before Pong

Cross-site Scripting-benchmark of Python sanitizers against real browsers

Growing Up in "404 Not Found" (Part II): The Vanishing Nuclear City

Be aware when opening "take home challenges" from untrusted recruiters

Show HN: FuseCells – 2,500 handcrafted levels logic puzzle game with leaderboard

Quality of drinking water varies significantly by airline

I used Claude to revive an NPM package with 760K downloads/wk last updated 2019

obsera – a real-time intelligence platform

Francesca Albanese and the Lonely Road of Defiance

All of you are about as trustworthy as the peepers in the hood

Dittytoy – Generative Music Playground

The NPC to MC Spectrum

Stable-Pretraining-v1: Foundation Model Research Made Simple

Anti-Addiction iPhone Setup

From what longer video is this short?

Show HN: I built my own Metronome Desktop App

The most expensive education system

Show HN: Request sensitive user input from system services

Brazil's Amazon rainforest at risk as key protection under threat

Show HN: RAMBnB.xyz P2P marketplace for RAM rentals

Firebase, Antigravity, & TypeScript FTW