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?

Tell HN: You can have separate agent account on GitHub

Intelligence Density

L-1 Identity Solutions Pier 2.3 Emulation: How the Iris Scan Works

Sony Debuts Wired Headphones with '80s-Inspired Design

A wearable identifies tagged objects by pointing a narrow infrared beam at them

DigiNotar

Mexico's Senate Approves ISP Rules to Disconnect Persistent Online Pirates

Skymizer and MiTAC to Show Kimi K3 2.8T on a Single Air-Cooled Server at SC26

Show HN: Goethe – The infrastructure for self-hosted AI

Teaching Agents to Write Maintanable Code

Run cloud agents from your home IP through a Tailscale tunnel

Lovable: We're Currently Experiencing Issues

Git Wrapper with Easier Syntax

Show HN: NKTgAI–Analyze the text first, generate second (and why that's not RAG)

Paraguay Freezes millions of bank Accounts

Revolution Medicines' pancreatic cancer drug has stunning commercial debut

The Slop Index: Which AI Model Writes the Least Like AI?

Test your defenses against a nation-state level attack

My Website's Soundtrack Is Written in TypeScript

Help your friends get ADHD and depression meds

Touch and Glow

Hollowtide: Asheron's Call, free in your browser

I Hate Emacs

Ask HN: How you guys setup multi-models agentic workflow

Terra Tempora: we shouldn't entrust our understanding of history to AI

Together Compiler: Continual Compilation for AI Inference

Orbital Speed

Valve escaped Windows. Now Steam is breaking free from the PC itself

Show HN: Cinnamon – a household AI agent with shared context and memories