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?

Show HN: Bob

SQLite 3.54.0 Released

AI's leaders (probably) aren't faking their fear

Orkut: You deserve better from social media

From WordPress to Astro: Zero Maintenance, Maximum Control

Neuroscience Can Make Decluttering Easier

TasteRoute: Personalized Routing for Video Generation

Show HN: Infinite – open-source node-based DAW for visuals, music and code

LiteReview: A self-hosted plane for configuring PR review agents

Distanser – Measure Anything on Screen

Luke Nichols' (Outdoor Boys YouTube channel) full commencement speech [video]

LineageOS 24.0

Ask Claude Code for a Svelte table and it writes 1k lines of its own

DARPA Selects Companies for Final Stage C Verification Under QBI

Europol urges early action to protect crypto and data from quantum threats

Data Engineering Is the Cache Invalidation Problem FT. Josh Wills

No Doodle

Tech firms pledge $2.4B in computing power to Trump's Genesis Mission

Show HN: Suta – A skill to reduce AI slop in generated UIs

Show HN: Another App Store Screenshot Creator, but with high quality images

Simple heuristics to run a research group (2022)

Stackoverflow 2026 Developer Survey

Show HN: SynoRing – An input ring for smart glasses and everything

Spotify Partners With Bookshop.org for physical book sales

Does Fast Mode Do Anything?

Max severity SonicWall SMA1000 flaw now exploited in attacks

Resident Evil 1995-08-04 Prototype: Full Disk and ASM Disassembly Analysis [video]

Ukraine hits second major tech site, expanding range of targets inside Russia

Every lawsuit against an AI company

District Six