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?

Andrej Karpathy breaks down the capability gap

OpenCode 2.0

Ask HN: Have you ever spoken truth to power?

Show HN: Proc-stats – a task manager for Claude Code sessions

Build your founders' agreement before things get complicated

Driving directions from LLM memory

Fetching AMD SEV Reports (With Zig)

What happens inside AI Chip when you ask a question

Turning IDN edge cases into typosquats

Cognitive Decline or Sanity Incline?

Creative plugins for your agent wrapping Artcraft

The Apollo 11 Code Is Open Source (and it's hilarious) [video]

Spot SponsorBlock: automatically skip sponsor segments in Spotify podcasts

Talking to /Dev/Sev-Guest

Ask HN: How do swarms of AI agents work?

Barnette's Conjecture proof AI explained

ninjatracing – convert .ninja_log files to Chrome's about:tracing format

Why are my posts banned?

Flights for Agents

Why we turn Left

USDCraft: Programmatic Modeling of Articulated 3D Assets for Simulation

HyperNormalisation (2016)

The probability of data loss in large clusters (2017)

Cartographers of North Korea

Yandex: Ukraine strikes data centre in third attack on Russian tech giant

Taskmaster as a Thermodynamic System

Artificial Insanity

Inside the mind of Solveig Lovseth, the world’s fittest woman

Be The Onion's Hero for Once

Scoop: AI companies plot "day after" scenarios for public revolt