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?

We Reduced Development Time by 50%, Users Didn't Notice

The Secret Life of Computers – The Chip Letter

NASA races to save Swift telescope

Cognitive Bias

SQL Alerting in Cloud Monitoring Observability

The Humanoid That Runs Until Someone Steps In

ePulz.io

Making a Meal of the Family Meal: Cooking Dinner [audio]

A Beginner's Guide to Reopening the Strait (Of Hormuz)

AI-Enhanced Writing

Pizza wheels are bad, Japanese toilets are great

Ask HN: AI robbed my joy of reading books?

Search, Discovery, Pills, and Portals

Route Phone Calls to an AI Agent with the Telnyx Voice API

Dragon's Egg: a formally verified, distributed object-capability OS

Ask HN: Building a minimal to-do app based on Signal vs. Noise

Migratrom: Schema migrations you can trust your agent to write

Rocket Lab Buys Satellite Operator Iridium in Bid to Challenge SpaceX

Tesla FSD v14 Lite

Has anyone here used the AI trading bot "Zentriq"? Looking for honest feedback

Turning Risk Appetite into Impact – By Eric Gilliam

Anatomy of an Agent – By Stephen Gruppetta

CRISPR's next act: the companies editing the epigenome to treat disease

Fame, an external memory and tool-safety gateway for local coding agents

The Science of Play

Comcast Plans Company Split, Sending Shares Soaring 20%

Ask HN: Favorite Online Magazines?

The Black Holes That Burp Years After They Eat

A Simulated Attack Story on React Server Components to Exploit React2Shell

Aerial Photographs (2017)