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?

Are high-end knife shops worth markup above big cutlery chains?

UK PM gives tech firms ultimatum to block explicit images on children's phones

RayforceDB: Columnar Analytics and Graph Traversal in One Pipeline

Buy a train, bridge or tracks from the Swiss Railway

Let the agents democratize open source

TrailText – an ESP32 and LoRa off-grid messaging app

Prompts I Reach for Every Week to Stay Unblocked as an Engineer

Show HN: CogCore – An API-native TypeScript runtime for building agents

Show HN: Email and identity stack for AI Agents

A Sustainable Git Option for Sovereign Solutions

Substrate vs. Broker: Two Emerging Strategies for Enterprise AI

GoSeofy

Doing Nothing at Work

Gemini is currently charging us $1K per hour due a bug with the cache feature

Argentina's 'Madman': Inside the World of Javier Milei

AI Has Come for Serif Fonts

UK PM Starmer set to ban 'harmful' social media for under-16s

The Cypherpunk Library

LLMs and Performative Productivity

Owning Your Dependencies

In Defense of YAML

Show HN: Free read-only script to find wasted AWS spend

The GitHub Copilot Bill Came Due. Here's What Engineering Leaders Should Do

Dao Heart 3.13 a symbolic safety layer for value drift and AI alignment research

OneDrive data now has an expiry date

String theory may be inevitable from basic assumptions about the universe

Cancelling Billionaires: A Review

GitHub is (partially) down again. Do you look for alternatives?

Bitcoin pump to $63,700 triggers the most short liquidations since late April

Mimo v2.5 is better deal than DeepSeek v4 flash