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?

Show HN: Multi person realtime location tracking

Perforce and Unreal Lore's alternative, another way to use Git

How dementia is being defeated

Wlctl – a Rust TUI for Managing Wi-Fi/ETH/VPN Using NetworkManager

Noisia: Harmful Workload Generator for PostgreSQL

The Four-Color Problem and Its Philosophical Significance (1979) [pdf]

Curious case, comparing output from multiple LLMs

How Do You Steal $1,500M in 3 Minutes? [video]

Meta removes AI feature on Instagram after global backlash

Managing a small local AI budget (Mac M2 16gb)

Microgrants!

The Prover, the Skeptic, and the Judge

Web Scraper Bright Data Sets $1M 'Bug Bounty' as Industry Scrutinized

Marble - (Education) Skill Taxonomy

No Assembler, No Linker

Omegele for Weed

SpaceX's near-term AI payoff seen tethered to Earth, not outer space

The crypto billionaires building a world where money buys you a vote

Dither Kit

Revving up Microsoft's 10x faster TypeScript 7

Big Tech Doubles Debt Load to $350B in AI Spending Spree

Skillburst: Sync Skills with Team

I tried NetBSD as a desktop,it felt like stepping into the 90s in a good way

Young Indonesians fear for future after startup founder jailed

The Origins of Heikki's Garden of Flowers

Engineer

Local open-source system design tool

Apple sues OpenAI, its employees claiming theft of trade secrets

OpenAI Safety Head Heidecke to Leave Firm After Reshuffle: Wired

Show HN: Warmbly, open-source cold email outreach