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?

Updates to JWT Client Authentication and Assertion-Based Authorization Grants

Canada's AI translation tool keeps making hilarious mistakes

US Bonds’ Election Rally Skids to Halt After Strong Jobs Data

Eggnomic.com – Mac app that researches sites from screenshot

For learning self help content, deciding what to believe is most important

A new web bsed Markdown editor WASM

Craft: A Tendon-Driven Hand with Hybrid Hard-Soft Compliance

The Heavy Cloud: Hydrosocial Dispossession and the Water Coloniality of AI Infra

Two Dimensional Version Control

Open dataset of prompt-injection CVEs with a monthly threat index

Silicon Valley Promises AI Will Cure Disease. Drugmaker CEOs Aren't Buying It

Web frameworks overtrust the HTTP Forwarded: header

New drug could be cure for common cause of high blood pressure

Show HN: LLM-cost-watch – Ask Claude why your LLM bill jumped

A Unicode Escape Can Turn a Java Comment into Executable Code

Playing Zork 1 on a CP/M emulator on Linux

Show HN: Hackertube for Roku TV

I built a mailing list where strangers write every email

Show HN: Is your product AI slop?

Show HN: Elo Ratings for Tests, ODIs, and T20Is

Torrents Are Perfect for Model Distribution

What Should We Learn? What LLMs Taught Me: Understanding Isn't Producing

Show HN: 3-SAT: Let me show you 500K variables

(Artificial) Intelligence as a political construct

Show HN: Recto – A tool that lets you visually edit what coding agents create

Goldman Sachs Is Pulling Claude Code from Its Bankers and Traders

Western Design Center

Sem86: A Full-System Emulator Without Hard-Coded Semantics

NASA Seeks Next Generation of Explorers to Join Astronaut Corps

Rethinking Virtual Machine Monitors for Better Security in Clouds [pdf]