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?

Self-Hosting Behind Cgnat – Be Libre

Thread Trace Part 1: ROCprof Compute Viewer – ROCm Blogs

Show HN: Audit your site's structure for AI search crawlers (ChatGPT, Claude)

Amazon blocks Meta's Muse AI agent from checkouts

Project Lily Video is getting censored by Google

WTFs per Minute (2008)

Show HN: An extension to capture and annotate screenshots, with a terminal skin

Show HN: Witdem – Did your AI Agent accomplish its task? and at what cost?

Replacing Linear MCP with linear-CLI

Show HN: Skillgesture – versioned, on-demand skills for AI agents

US and China Discuss Alerting Each Other to AI National Security Threats

What re AI in software engineering are you struggling with the most?

The Bounding Simplex: A SIMD-Era Rejection Primitive [pdf]

I built a small Instagram backup tool for my own posts, stories, and highlights

Neural Texture Compression in Metal 4

Show HN: Search API for 3M govt contracts in 63 countries

First Shader from Zero in Godot 4

Australia banned these Chinese CCTV cameras. Now they're turning up in EVs

ROM Magazine Interviews Roberta Williams (1983)

Show HN: Maki, an open-source multi-agent LLM framework (local or hosted)

Show HN: Proxy-benchmark – is it the proxy, the browser, or your machine?

New low-cost burstable Amazon EC2 T8i instances are generally available

Microsoft Systems Journal Interviews Gordon Letwin (1987)

Been thinking about our platforms and information diet we consume lately

How to export ChatGPT to Google Docs without losing formatting [video]

AI is reaching new highs with AROM Labs

On Contagion (2019) – Boris Cherny

ZuckOff Know when a camera is in the room

Forward Deployed Engineers from the Trenches

Are We Free?