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?

Weebit Nano In-Memory Compute ReRAM Silicon Kit for AI Inference [video]

Ask HN: What customer acquisition channel is working best for you?

Why is Google cutting off Search from AI-free schools? Here are some theories

Devin Apps

Show HN: Leetsys – Practice system design interviews with an AI interviewer

Show HN: Agent-plan a CLI that automatically commits your agent's plans

How I run my agent fleet to build my product

UK Open Contracting (OCDS v1.1.5) Pipeline and Companies House Ingestion

Show HN: BraKet - classify shell command effects in microseconds in TS or Rust

I built offline GitHub (with `ogh` CLI, sync etc.) for coding with agents

My own custom backup solution: backupkrake

Show HN: Cal.flare – cal.diy ported to Cloudflare Workers

Hugging Face Harness Leaderboard

Show HN: Find and share essays

Show HN: Langfuse AI Gateway, open source rust gateway to trace every LLM call

Show HN: Skylands – Run coding agents on any machine, approve from your phone

Jonathan Blow – If AI Solved Coding, Why Is My Software Still the Same? [video]

Palmfrets, Minnesota guitarist's invention, strikes a new chord

Roc(Language) and Joy(Framework): Productivity in Production [video]

ChatGPT Wallet

What would you think about Native requires and ensures clauses in Rust?

Show HN: Hexalexagons, a daily word game on a hexagonal grid

Show HN: Browser Hands – Claude in Chrome for Codex, Cursor and Any MCP Agent

A long-period transient with a Sun-like companion

Nil-3B Open Source Sovereign AI

EU Digital Identity Wallet rollout: every EU state on one board

Ciguatoxin

Show HN: Harness Tuner – eval-driven tuning loop for agent tools, prompts, model

Show HN: Rensa –a browser falling-block puzzle with chains and items

Ancient Egyptians revered dogs–can this street dog return to that former glory?