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?

OpenAI apologises for Medicare breach, shelves next gen ChatGPT

Singapore Govt Dating App Uses Gale-Shapley Stable Marriage Algorithm

All Windows Sounds

FlyDubai flight to Tel Aviv diverts to Tabuk amid onboard incident

Anonymous Tech Confessions

Ask HN: Why is there no free S/MIME CA like Let's Encrypt?

Japan's fusion energy startup to begin power-on tests at pilot reactor in 2027

OpenAI halts release of Astra 6.1 over safety concerns

Mathematicians Harness Randomness to Crack a 55-Year-Old Conjecture

White House asks OpenAI, Anthropic hold new models from UK testers until review

Ollama now supports Jev-style decision models

Jacques Barzun, Cultural historian and critic (1980)

Show HN: I built a proxy scraper that checks 700 sources and verifies proxy

AI scientist autonomously generates and validates new biological discoveries

How to Mediate Reality (2022)

New Cancer Drugs Are Revolutionary. Why Don't More Patients Get Them?

Using the same hostnames at home and over Tailscale

From Pbxproj to Xcproj: Xcode Project Configuration Gets a JSON Format

Show HN: A React data grid that sorts and filters in a Web Worker

McDonalds to show ads on drive thru screens

UK rail cops' £320K face-scanning spree nets zero matches

Show HN: Layout – Order food anywhere with AI

Into the darkness

Ask HN: How will the AI endgame play out?

The 90% Case

Everything you need to deploy your next AI CEO

A calm, technical bedtime guide to Jev and Laya [video]

AI Code Mirroring Monomorphic TypeScript into Zig

Design of Linkage Systems to Draw Specified Plane Curves(2017) [pdf]

OpenDLSS: A Vulkan Reimplementation of Nvidia's DLSS 5 Neural Rendering Network