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?

Ask HN: OpenSEO inspiration for other tools, asking for opinion

Efficient Image Steganography Method

Anthropic's $518B AI buildout hinges largely on deals that cannot be canceled

Spencer Pratt on X: most political advisors are so bafflingly incompetent

Spaghetti Celesti – Devour the Heavens

OpenAI Agent Bypasses Internet Restrictions Through DNS

Annalist – required GitHub check for what a coding agent wrote

Why has Shopify dropped React Native?

The AI margin collapse is gathering pace

An LLM Workflow That Reproduces, Improves, Extends Published Economics Research

Show HN: Relay – a harness for AI coding agents that recover and verify

Show HN: Mluva – Dictation and editable rewrites for Omarchy

You Said No MCP

Car Is Sharing Data with Big Tech

Agentic Hacks, Real Proofs: Inside Google's PageBreak Project

GPT-6.1 Sol (Max): Intelligence, Performance and Price Analysis

Codex Security Cloud

Attack your own AI agent in under 10 minutes – then secure it before deploying

Password-protecting an Nginx proxied site

Automating eval design and hillclimbing with Claude

The Life and Death of Microsoft Clippy, the Paper Clip the World Loved to Hate

Electrification efficiency: The world will need less energy after the transition

GPT6.1 Sol

Sonnet 5.5 has the heaviest token use we've measured; pricing matches GPT-6 Sol

Wrong, Not Broken

A Brief Perspective on Deep Learning Using Common Lisp [video]

Unix File and Directory Permissions and Modes

Show HN: Dialedin.bio – Upload lab PDFs, log how you feel, see what lines up

OpenAI officially allows using ChatGPT subscriptions with 3rd party apps

Plugin Extensions