Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•9mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

The interesting AI debate isn't capability – it's ownership [video]

Can the shingles vaccine slow ageing? The evidence is surprisingly strong

From 3 Minutes to 7.8 Seconds: Improving on RocksDB performance

Simple CUDA-checkpoint wrapper to freeze and restore GPU processes quickly

OpenClaw Joins OpenAI

How Air Lubrication System for Ships Works

Actual-Size Eniac Replica Is the Coolest Thing You'll See Today

Show HN: AgentKV – SQLite for AI agent memory (MMAP vector+graph DB)

Rendering the Visible Spectrum

Building a Home Cloud (2019)

Show HN: DetectZeStack – Tech stack detection API with 4 detection layers

CCPA Assists a Private Right of Action–Shah vs. MyFitnessPal

Deep Blue

Physicists Make Electrons Flow Like Water

Drop-In Minimal CSS

Natural and Artificial Ice

AI agents found a credential stealer in their skill marketplace

Show HN: Stockdata.dev – Free stock market API with 15-min delayed US quotes

Rod Dreher Thinks the Enlightenment Was a Mistake

Plan for Centre Pompidou in New Jersey is 'dead', local official says

Startup Credits – Every Startup Perk Program in One Place

Show HN: SkillSandbox – Capability-based sandbox for AI agent skills (Rust)

Privacy Preserving DNS Telemetry in Debian PHP Packages

Ask HN: Ranking sliders on a personal blog?

Hyper-Scalers Are Using CXL to Lower the Impact of DDR5 Supply Constraints

Uncle Sam – By Proxy – Wants You. Big Brother Does, Too

Pulp Fiction Writer: 'Impossible' to Get Movies Made Without 'AI' Company

Show HN: CrossX – iOS/macOS App to Convert web/X articles to ePub for e-reader

How AI slop is causing a crisis in computer science

Dutch Defence Secretary Boldly Claims F-35 Software Could Be 'Jailbroken'