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?

Taxonomy of the Occlupanida (parasitoids on bread bag tags)

StackOverflow closed my OpenClaw and paperclipAI integration q. as "irrelevant"

License Plate Cameras Will Soon Track Phones, Wearables, Infotainment and Pets

Clojure Hosted on Go

Show HN: ML condenses billions of logs into a tiny snapshot your LLM can debug

A Secret Microsoft Tool Fixed Windows Performance [video]

Build in Lovable, from Claude

Tensordyne is making AI compute more efficient using logarithms

The Free and Open Web Is Under Attack at the IETF

The (real) dead economy theory

The No Fakes Act Could Silence Satire, Commentary, and News

Salvager, Undo for AI agents that edit your files

Show HN: Criterion Closet as a website – pull any of 1,247 films off the shelf

Hydra – a one-line Gradle RASP that seals app secrets until the device is clean

Treating Agent Reasoning as a Span

Compiles any HuggingFace model into a single persistent megakernel

Apple Reveals Plans to Raise Prices

Show HN: Righthand – Autonomous AI assistants with skills, goals, and a CLI

Vyrse – Social Bible reader for skeptics

Play Snake in Your Favicon

China: Free AI for developing world; G7: who gets access to American models?

Show HN: WaylandClientKit – a Swift Wayland client substrate for Linux

List of video game console color palettes

HandoffKit: Coordinate agents by passing messages, not sharing memory

America's bull market has entered its manic phase

BytePack: Header-only message serialization library for C++17

Border Enforcement Does Affect American Workers' Wallets

A Chrome extension for AI routing that reduces friction when selecting AI models

Chinese open source model better than Fable [video][13 mins]

Report on Titan Submarine Destruction