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?

Chromatone spectrogram written in Rust for the terminal

The death and rebirth of my home server

Agent Arena: Benchmarking AI Agent Devtool Onboarding

Qwen 3.8 Max

The Economic Mirage of Local LLMs

Israel's $50M Experiment to Change U.S. Public Opinion

Trump Media plans to sell priority access to Truth Social posts

ChatGPT convinced an Alabama woman to end her life to fulfill a divine prophecy

What I learned selling 2,500 MIDI recorders: Hardware is not so hard

France, Germany vow to develop Palantir rival

Show HN: CheckRun – a checklist runner for the Chrome side panel

Show HN: AI Buddy – Free STT and Screenshot Tool for Mac (Requires Gemini)

Web-ext 10.5 – A command line tool to help build, run, and test web extensions

Hyperblam lets you make music with HTML

Babylon Lite: A Fresh Take on Babylon.js

Who's Subsidizing Chinese AI

The U.S. saw the first 'China Shock.' Now the world gets the sequel

Save GPT-5.5

Ask HN: Is float divergence/drift a real issue in many industries?

From Algorithms to Autonomy:How AI Is Rewriting Architecture of SW and Mobility

QR Coupon Generator That Unlocks Discounts After Social Actions

Claude Code 50% higher weekly limits continuing through August 19

Scrapping My Vibecoded Project After 24 Hours and 1.5B Tokens

Show HN: We ran 79 MCP servers in microVMs, only 31 passed

Victoria proposes 'demasking' powers to identify anonymous social media accounts

San Francisco Demands Apple and Google Delete AI 'Nudify' Apps from App Stores

Modern Harcker News (A Chrome extension to make Hacker News look moder)

Claude Code uses Bun written in Rust now

AI coding agents should optimize for less owned code

Claude Code now uses the new (unreleased) version of Bun (in Rust)