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?

Windows, Linux, Oracle and the Internet – BBC, 2000 [video]

Show HN: An MCP server where AI agents confess, in their own name

AI Can Cut Film Budgets by Up to 40%, Says 'The Outlaws' Director Kang Yoon-Sung

Auto Vectorizing the RISC-V Linux Kernel Shows Promising Results

Zinky Boys

MCP servers that tell your agent "dont tell the user" are stopping it from lying

Artex AI, Claude agents used in cyberattacks on South Korean banks

Point: Free URL Shortener with deeper analytics than bitly and zero ads

How Tabasco Became the World's Hot Sauce

Show HN: Put yourself in a street freestyle video with one photo

Open-Source Microsoft Office Excel, PowerPoint, and Word Replications

Show HN: Polywick Blue VSCode Theme

Show HN: FileoPDF, PDF tools that process your files in the browser

Show HN: A Safari extension to accelerate animated WebP images

SQLAlchemy 2.1.0 Released

Terence Tao: Math 2.0 [pdf]

Show HN: My radio station calls its listeners

MicroG: [Bounty] RCS Support [$14999]

About the Book: Solving the Bottom Turtle

AWS AgentCore security undone by prompt requesting credentials

How HN: Go-dev-auth zero-dependency authentication library for Go

Choreographic Programming in Rust

Measuring Cryptanalytic Effort

Twenty-two pending curl vulnerabilities

Bot traffic plunged to near 0 following the strike on its Vladimir data center

Memory Management (2022)

Building Houses with Rice Waste

Singapore's government team that kills its own products

Show HN: The great-grandfather of Oberon: Algol 60 running on LuaJIT

Ferroni – Oniguruma's regex engine, modernized in Rust