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?

Dosbox-x OS-free version because of California age verification laws

Show HN: Rhyven a Marketplace for Agents

The AI Pascal's Wager

What Every Airline Can Learn About Proactively Shaping Revenue

April: APL as a DSL in Common Lisp

How the Billions from the Opioid Settlement Are Being Spent

Don't let a misunderstanding distract you from your goals

Regularized RSI

SERV – The SErial RISC-V CPU

Tensorlake NPM package and repo compromised

A DuckDB Database with No Data in It

Retrofitting language models to operate over bytes

Deveggs – a self evolving developer eggsperience

The mysterious pneumonia in Russia deserves attention, not panic

Where Are the Builders?

RetinaRelay – A Second Life for Your iMac

Runtime – Your AI Agents Have a Home

Trust Me, You Want SunOS 4.1.4 on Your Older Sun Boxes

Show HN: Agentc: <1MB static, no Libc, minimal, embeddable agent with Rust/C API

SaaS RFP – post and bid on SaaS in public

Trump plans to charge international students $70k for work authorization

Agent Collaboration over Unreliable Channels

Free Unlimited Fish Audio Text to Speech

The Dot and the Swarm

Building alone, faster: a panel on what AI is doing to the product trio

A common language for game telemetry

Don't make me type my business in twice: what tour operators need from software

Exodus AI – Affordable face swapping tool for creators

What I learned leaving a Ruth AI in charge

Evolutionary Refactoring: Let Agents Invent Codebase-Specific Patterns