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?

Just Send Me the Prompt

Botnet of more than 17M devices dismantled

Macsurf, "modern" web browser for macOS 9

Show HN: Totpgate – Single-packet authorization via TOTP

Lisa Su Address to MIT Class of 2026 [video]

NPM Packages Attacks

Let's talk about encrypted reasoning

WikiLambda the Ultimate

Paint .NET is now at paint.net

Anatomy of a 5-4 Champions League Thriller: A Football Data Case Study

Sandboxed dev envs that are composable and repeatable with a single command

Acer's launching a Linux handheld for streaming your PC games

A Brief, Incomplete, and Mostly Wrong History of Programming Languages (2009)

Company Blew $500M on Claude AI in One Month Due to No Usage Limit on Licenses

Nvidia says it has largely conceded China's AI chip market to Huawei

Show HN: Clinglang – A shorthand language for doctors to write structured cases

OpenRCT2 v0.5.1 "Swamp Castle" released Last version to support Windows 7

Guitar Tools – PWA for Scales, Circle of Fifths and More

Sleuths uncover 100 suspicious images in Thermo Fisher antibody catalogue

Cathy Tie's mission to genetically modify babies

Boom shakes S Carolina, rattling Columbia and raising questions about the cause

Show HN: I built an Android OS in the browser

A Weekend in Claude Design Saves 3 Weeks of Claude Code

The 12 Futures of AI

The Biggest Tell That Something Was Written by AI

Indian court ruling on Google keyword ads could reshape online advertising

The next frontier of the luxury airline arms race might be waged in the toilet

Poor sleep linked to rising cancer risk in under-50s

Records Show UC Sharing Data with US Customs and Border Protection

Ask HN: What could happen if human beings become obsolete?