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?

Commercially Available Bike Generators Are Not Sustainable

Passkeys in Node.js Without Locking Users Out – Whoooop Ltd

Nebula Sans

Round Rects Are Everywhere

Show HN: PairBook – correlation and holdings overlap for +4,700 US stocks/ETFs

How we made scalable long-horizon RL environments for Browser Use

WebMCP: Teaching Your Website to Talk to AI Agents

Show HN: BumbleTap – Bind a key to any element, or automate the whole sequence

Email Verification API

AurionMail: E2EE suite (CryptPad/Stalwart) with single-password UX

Notes on Private Trackers

Chinese Hackers Broke into Justice Department, NASA, Federal Reserve, Senate

Boost Your WordPress Site with the Fastest APCu Object Cache Available

I had some free time, so I tried to pwn V8

GLM-5.3-Flash Intelligence, Performance and Price Analysis

Show HN: Splitright – split group expenses without anyone making an account

Beetles AI

Show HN: Bury.lol – a $2 pixel-art graveyard for things that died

Is it safe to call print in a Python signal handler?

MicroLighter – A zero-dep syntax highlighter

Hover Proximity Using Modern CSS

Show HN: Neoswarm – Neovim for controlling AI agents

Debugging Ubiquiti's 5G Backup on AT&T

An API proxy that trims redundant LLM tokens using AST pruning

Commodore Unveils Cyberpunk 2077 Themed Special Edition Commodore 77

VMs won't contain cyber-capable agents

Requests for Startups: Energy

Lody: A Local-First Workspace for Teams and Coding Agents

Show HN: Tabu, NSFW image and video API for explicit content moderation

C++26: Std:Inplace_vector