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?

Breitling Navitimer

Air-Traffic Resilience Portfolio

Transitive Policies for Agents: Agent Permissions Don't Automatically Compose

Why platform teams fail (and AI makes it worse)

The Data Driven Illusion

UBM, and a lament for the software industry (2020)

AWS Nitro Sandboxes: Hardware-Enforced Workload Isolation on Amazon EKS

Psychoanalyzing a Megalomaniac

Polymarket and Kalshi now host bets on measles and other US health crises

Advanced paper aircraft construction (1991)

DocCrisp: Image to Editable Office Documents

The girl who loved rape

Build Your Own AI Coding Agent Harness

Amazon's plan to own the product data and fight AI shopping agents

Show HN: Free GitHub Repo Security Scanner –finds leaked secrets,exposed configs

App like GitHub for your conversations with AI

Do what must be done

Literary Map of the U.S.

Show HN: Bright Lines – a fail-closed guard hook for Claude Code

Brave strips hidden Meta identifiers from Facebook and Instagram photos

Organized crime steals millions through an Apple gift card scam

So Far, AI Pessimism Is Observationally Equivalent to AI Optimism

Global Optimization for Combinatorial Geometry Problems Revisited in Era of LLMs

Show HN: Ledge – a shelf for files, clipboard history, and music

In 1 in 6 repos with both files, Claude Code never loads the AGENTS.md

A Chromium Bug Caused by a 25-Hour Day

A few drawings about Linux (2016)

The Curse of Recursion: Training on Generated Data Makes Models Forget (2024)

Light Pollution Map

Tetragon Outgoing Guard