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?

Beauty In My Backyard

Polynomial Trajectory Optimization for Quadrotors

Show HN: ZenResume – Free, local-first ATS resume builder with AI import

YouTube Shorts Scraper and MCP Connector

Decode resistor color bands instantly

AdaMAST: Adaptive Failure Taxonomies for Improving LLM Agents

Longtime Bay Area tech conference is leaving San Francisco after a 50-year run

The Cities That Said Yes to Drugs

Should Airbnb Add Ads?

What does China's 15th '5-year plan' for renewables mean for climate change?

Tempered – AI-Powered PC optimizer that won't show a metric it can't measure

Forgotten memories can leave silent traces in the brain

Teen hackers tell BBC how police are helping them use their skills for good

DeepSeek-V4-Flash Update

SodaSlim Natural Weight Management Supplement for Wellness

ChatGPT has been silently routing Pro to mini for several months

LinkedIn adds a button to report AI-generated 'slop'

US Government map of Africa mislabels every country at global conference

Remote

SAP's Big Push for Tabular AI. What It Means for Enterprises

k-Coloring is Faster than Computing the Chromatic Number

Show HN: Tileroot – save/restore tiling WM layouts (sway, Hyprland, i3)

Psychedelic images reveal what your weather app isn't telling you

x86 AMX/ACE with >8 tiles

Show HN: QuizPaste – paste any text or doc, get an instant quiz

Show HN: Gander, an Android file viewer that asks for no permissions at all

Book Time: Automatic Page Turner from Japan [video]

U.S. FCC approves giant space mirror to deliver 'sunlight on demand'

It's Time to Give Up on the Nonstick Pan as We Know It

I built a website cost calculator with 9 engines