Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Transformer.js v4

GitHub backs down, kills Copilot pull-request ads after backlash

High memory usage in Postgres is good

6o6 v1.1: Faster 6502-on-6502 virtualization for a C64/Apple II Apple-1 emulator

Show HN: I made a cheaper alternative to Claude Code or Codex CLI

Hermes Agent v0.6.0 solves its biggest weakness against OpenClaw

Judge halts Nexstar/Tegna merger after FCC let firms exceed TV ownership limit

Delve into Compliance Theatre

Love Dart

Quay.io down: Nginx 502 bad gateway

Glyphs 3

When the Real World Came to Wicker Park (2021)

AgentHandover: Watches you work then teaches your AI agents to do it like you

Run open-source AI skills in one click in the cloud

Is it safe to turn off your ad blocker?

Mistral raises $830M to build Nvidia-powered AI centres in Europe

Explore the top 1000 most-starred repositories on GitHub

Ask HN: What's your favorite number, and why?

Office, Messaging and Verbs

Kelsey Hightower: "Everyone is a junior engineer when it comes to AI"

A Crisis Merely Postponed

Ask HN: Is Google down or is it just me?

Joins Are Not Expensive

Market Participation Is Exhausting

A curated corpus of incidents and attack vectors for autonomous AI agents

Microsoft plan 100% native Windows 11 apps in major shift away from web wrappers

White House Renamed 'Epstein Island' on Google Pixel Phones

There are no happy endings on the internet

UK Politicians Continue to Miss the Point in Latest Social Media Ban Proposal

Ubuntu MATE Is Seeking a New Primary Maintainer