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?

Social dynamics of toxic metal industry in medieval Europe

Gradium open-sourced its on-device TTS

Show HN: Hackingscreenfake.com- Fake Hacking Screen Simulator/Prank Tool

SoloMCN – Claude Code as the runtime for a one-person video studio

Is it possible to be bigger than a Blue Whale?

Show HN: Skillsync – Coding agent memory but it's just search

My Thinking about School Reform Has Changed over Decades (Part 1)

The Technopolitics of Ad-Tech

Kash Patel's FBI stats are bolstered by arrests made by state and local agencies

A photo of a patient's face could predict whether they'll survive cancer

The Gospel According to Peter (Thiel)

The Download: the claim shaking up AI and the internet's agent problem

Show HN: Contrack – Self-hosted contact manager and people search

Go Conventions That Clicked Too Late for an AI Engineer

Parametric Error Rendering and Interactive Diagnostics

Stop Waiting on a Failed Build

Scope Creep

Alignment is correct, safe, reproducible behavior under explicit constraints

Show HN: My attempt to get Claude to run a business

Roguelike Tutorial 2020

Compound Memory Models

Citrini Therapeutics

Whoops: Grok Bot Spills Tech CEO's Bank Data in Public Slack

Patch your Plex media server before someone hacks it

Ask HN: What is/was your strategy which landed you a JOB in this market?

Show HN: we made every cloud work like one giant computer

Datacenters 2027: The Year of Acceleration, +50GW in a Single Year

Getting Agents to Tell on Themselves

Show HN: Megapop – a Populous-style god game in the browser, WebGPU, no engine

Managing Agents in Shifts