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?

Show HN: News Aggregator for Science and Technology

Xbox PC and Game Pass titles coming to Linux through 'Xodus' open-source project

Yen sinks as effect of US-Japan intervention fades

My Homelab Got Hacked – A Postmortem

Show HN: AI-powered App Store replies that sound like you

Trump signs order calling for spacing out childhood vaccines

Separating sex and gender is statistical malpractice

Learning Sed or Using Claude?

A Watermark for Large Language Models

Simulation of the light pollution effects of Reflect Orbital's mirror satellites

Why Reykjavik, Iceland Banned Dogs (2023)

Olix raises $312M from Netflix's Reed Hastings, Arm, to build Nvidia rival

World Train Map – 1247 train routes around the world

Dark mode toggles: two states are enough

The Practice of Address: Loneliness and the Machines That Answer

Google Search Is Dying. What Comes Next Is Worse

Trump Crypto Took $100M from a Businessman with Red Flags

MCP for Live NBA Game Recaps with Reddit Threads

Bernie Sanders calls for AI development pause

Being a senior can get you fired early

Show HN: Pyrig – A tool that automates project setup and maintenance

OpenAI has bought back $7B worth of shares in a secondary employee tender

Jensen Huang tells CNBC his chips are 'investable asset'

We host YouTube videos on this site – and why we recommend uBlock Origin

Mark Zuckerberg's Yacht Refused to Help Ship in Distress

Catholic expert: "Security issues show AI needs greater human oversight"

Termdom – Build Terminal Apps with HTML, CSS and the DOM

The Surveillance Network Tracking Cars Across the U.S.

Nvidia AI Factory Compute Is Becoming an Investable Asset Class

Tracking down a Zsh history data loss bug