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?

AI will not trigger employment collapse, staffing company Adecco Group says

Flux 3: From AI image generation to visual intelligence

Why hasn't AI increased unemployment?

Ageless Atlas – a biological age proxy across the 12 hallmarks of aging

A Great Deal of Information About Hacker News

Kat-Coder-v2.5 Technical Report (Qwen3.6-35B-A3B base for post-training)

Midscroll – Windows mm autoscroll for Linux, works on Wayland and X11

De-link: open-source eInk reader (hardware)

UK AISI / Caisi Preliminary Assessment of Kimi K3's Cyber Capabilities

Intel committed to manufacturing 14A node

The cost model of microfront ends, from first principles

Russian head of World Chess suspends activity over EU sanctions

Tinfoil – Private AI

Starlink v5 flat vs. v4 flat (standard) dimension and weight comparison

Show HN: GlossaryPage – Turn customer questions into knowledge pages

Elon Musk Melts Down over Perfectly Normal Questions in Wild New Interview

Seeing Is Not Believing: Realistic AI Videos Disrupt Confidence in Real Videos

just surf

Gigatoken-rb – A Ruby port of gigatoken that's 1.6x faster

Show HN: Bohay – Mission control for your AI coding agents

MLFlow Alternative Written in Go

In the 1950s, a Soviet engineer proposed damming the Bering Strait

Ask HN: Is HN's duplicate url detection broken?

Show HN: RefurbAlert – Never miss a refurbished deal again

Tesla Sinks on Investor Angst over AI Spending, Profit Drop

U of T mathematician Jacob Tsimerman awarded prestigious Fields Medal

Show HN: I built a local Node.js conduit for the BorgIOS network

Don't Trust the Label: License Laundering in AI Supply Chains

Uber's New Litigation Funding Terms Would Hinder Accountability

AI Was Supposed to Lift Everybody., The Price Tag Says Otherwise