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?

Trump's suddenly softened new green card policy

Staffing and procurement strategies for fast flow

Update on Meteorra AI – Just Shipped YouTube Video Analyser

Built GoPeek for Firefox

Granite Libraries and Project Granite Switch – IBM Research

A new YC tool promises "your code never leaves your machine." It does

YC's launches Paxel a tool that analyzes your coding sessions

How should we teach digital research workflows to undergrad philosophy students?

Wabi Tek Sabi

Educational Sticker

"Bricks & minifigs can stuff it" – Patreon CEO [video]

Azure Linux Desktop

Let the agents democratize open source

Magecart skimmer turns Stripe into a malware command server

Verilator Binary for Windows Without WSL or VM or OSS-CAD Suite or Perl Wrapper

Fixing "unfixable" 41TB BTRFS by Claude's one-shot

Download cash counter and help me

Turn HAR Files, Claude Code, Copilot CLI, and Codex CLI Logs into ATIF

Show HN: Sidekick – The zot coding agent, one click away on macOS

How much did OpenAI pay for Tomoro?

I Found the US Nuclear Detection System in Space (GPS)

You can now use your Gmail account in Proton Mail

Integer Overflow in Postgres

AI coding agents use your technology

The AX stack: what's fixed, where you can win

New version of "peers" – the AI couple doing things

Bitcoin back above $61,000 after rout leads to $1.6B liquidations

Bitrig – The best way to build native Swift apps with AI

Are AI chatbots making us lose control of our brains?

Adaptive Low-Rank Transformer with Dynamic Expert Routing for Continual Learning