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?

SingPost launches trial of digital stamps

Bidding on competitor names when buyers ask agents

A unique piece of Internet history: A RFC1149 packet on auction at Christie's

Show HN: Tide, simple self-hosted video meetings. URL is a demo anon deployment

64k demo for the Pebble Time 2

Embedding Gemma2 Use Cases

Lily-Qwen3.8-Flash-Next

AHM Statement on OpenAI's October 6 Release of Mathematical Documents

Automattic Wants .wordpress. It Doesn't Own WordPress

Scientists get a new clue to the origin of solar wind 'switchbacks'

Show HN: Squidly – Track CEX, DEX and wallet balances in one place

Does ClickHouse need its own storage format?

Sources: Apple Planning Two Sets of Product Launches in October

Mumsnet denies using AI for content after prompt appears on message board

Mistral's Le Chonk Arrives with a Trillion Parameters–and Something to Prove

The open-source 3D modeler for architecture and engineering

Browser-in-browser attacks use fake Meta Muse Ad lure to steal credentials

The AI Price War Is Heating Up–and OpenAI Is Gaining Ground on Anthropic

Show HN: Forward Deployed Engineering Jobs

Teenage Engineering Is Going to Stop Making Synths

A lot of Danish data as Parquet files

Can we talk about the world economy?

Show HN: Pocket Commander – a two-pane file manager for Mac ↔ Android over ADB

Allegedly a student using AI behind South Korean banks cyberattack

Ask HN: Are we trading model capacity for compute?

Show HN: LLMSchema – Dump your database schema as compact Markdown for AI agents

Near-Total Liquid Heat Capture Keeps AI Racks Cool

Azure Sphere is Retiring in 2031

Allclear Tool

Absolute Disaster Jeremy Clarkson Reveals Brutal Reality Facing British Farmers [video]