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?

Latticework

Terminal-Bench 4.1

A Microsoft 365 outage is hitting users in regions around the world

Show HN: Edit menu food arts like a Matplotlib plot

Researchers find plastic-degrading enzymes in nature

Binance lost $6.43B from a fake job interview

Man's use of synthetic testosterone for cows nearly destroyed his heart

Show HN: Mudroom – Unified inbox for support requests

United to block customers from using AI agents, citing cyber threats

What if the best product you'll ever build is something only 10 people need?

SF company designs and assembles PCBs with AI in weeks instead of months

Nvidia Can Replace Its CEO. It Cannot Replace Jensen Huang's Vision

MCP vs. CLI vs. Skills: What Each Costs in Context

Palantir's Karp says he and the company's products are actually 'progressive'

Weft: A voxel sandbox engine built for modding

Cortao: Circular Occluder Ray-Traced Ambient Occlusion

Amid US-Russia Talks, Ukraine Says Its Starlink Access Is Restricted Again

American Inequality and the Future of AI

Postgres can handle 1M durable workflows per second

Data centers need power – lower income, rural residents pay the price

We tracked AI key theft over 35 days. Here's what we learned

Former Nvidia CEO Huang had a relationship with a second employee, sources say

Grow your Llama army, win the territory

From Lufthansa's crane to United's tulip, the stories behind 12 airline logos

Start and Restore GPU Workloads in Seconds with Nvidia Snapshot

The fall of "what you can do" and the rise of "who you know"

Brian Halligan Returns as CEO of HubSpot To

I Made an AI Animated Short Film: Here Is the Full Process [video]

AI search is recommending fake retail websites

The inexorable rise of NIMBY psychosis