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: Quantum computing experiments with honest classical baselines

In race with U.S., China struggles to recruit foreign AI researchers

Apple's App Icon HOA

NTS: Authenticated Time at Meta

Treg (OpenRouter for Tools)

Software developers are not okay

You have to be able to reason about the verification

k-space (a.k.a. Reciprocal Space)

Python's two modules for random numbers

Using Conditional Value at Risk to Illustrate Two Risk Paradigms in Golf

Show HN: SPrav Job AI Client-side career tool with WebGPU and direct ATS queries

Routing PCBs on a hex cell grid

AI is now capable of developing its own inference hardware

Hark Pro – Personal AI that can use the web and get things done for you

Bolt Playground

Flatpak from the CLI Sucks

Process vs. Talent (Workflow vs. Model)

I gave an AI agent one bug 11 times. 6 commits had files it never knew about

Google enters 3.6-GW power deal with Constellation Energy

Scrimshaw Jukebox

Animated Git Cheat Sheet

Hacking the Go compiler to efficiently map IPv4 to IPv6

Google AI Edge Gallery

Hopf Spherical Quantization (& Compression)

Chrome sneakily downloads Google Meet code

How Machines Learned Precision

UBS CEO warns 'hard measures' are needed to tackle French debt crisis

Escaping the Tyranny of Worktrees

Proving Rust Web Application Correctness with Lean 4

Show HN: Capo-S3 – Modern S3 client for Python