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?

Use-media-stream 2.0.0 – React hook for getUserMedia that cleans up after itself

GrokImage – AI Visual Generator Integrating Grok, Gemini and Nano Banana

TriageBox – quick Gmail checker, sorting and AI summaries

The Road to MS-DOS 2.0

Cost-per-success, not cost-per-call: the LLM routing number nobody measures

Avoiding Digital Productivity Traps

Has anyone built a way to measure attention during meetings?

Why 'open' AI systems are closed, and why this matters (2024)

All Your Projects Are Now Brownfield

Show HN: Salary raise calculator with tax and inflation estimates

Evaluate the profanity used working with Codex and Claude Code

Mainline Closed Beta: Open-source, science-based chess training

First Binary Distribution of the OpenSSL Library: Windows Installer Test Release

"I used Fable 5 to bring Command and Conquer: Red Alert 2 to iPhone and iPad"

Electric Is Joining Databricks

An Advanced Attacker Is Targeting Salesforce and ServiceNow

Facebook is paying controversial creators to produce rage-bait content

Turbo Pascal on CP/M, MSX-DOS and MS-DOS – Pascal for Small Machines

Life Lessons from Reinforcement Learning

Finding Metrics That Matter

Beef and dairy drive 41% of biodiversity damage linked to global farmland

The Principal-Agent vs. Agents Problem

Why sexualisation of women by Grok's GenAI is a data privacy issue

Worms: The Directors Cut (Amiga) – A Playguide and Review – By Lemonamiga.com [video]

Inflation Peaks – drive over India's inflation

It's time to sue Sony, join us [video]

Discovery of 'slow' electrons in 2D material could lead to new memory device

Show HN: Craft (Minecraft clone) rewritten in Rust under a $120 budgeted (Grok)

AI Infrastructure Leadership Summit

I deleted 60% of my subscribers on purpose