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: We made a full-featured Python HTTP client work inside WASI

Netflix Sued for $105M After Hard Drive of Nicolas Cage Movie Stolen from Office

Freesocks: Free uncensored proxies for users in heavily-censored regions

Fed up with Big Tech, communities turn to data collectives for control

Another Reason Not to Use "AI" for Your Writing

Mass Psychosis in Food Science

Figma for Agents: How Airflow's Creator Coordinates AI Ft. Maxime Beauchemin

What Comes After the End of Reading? [video]

RL and search is a terrifying way to build AGI (an FAQ)

Kongtrol – orchestrate multiple VPN clients from one CLI

Models Write Messier Code Than the Human Who Fixed the Same Bug

IP Camera Live Streaming: How to Set Up RTSP to WebRTC Streaming

Show HN: Provenance and decay for AI agent memory

Money, Money, Money (and Investing) (2015)

One embed for all your affiliate ads

Ask HN: Security advisory Azure trusted launch VMs

Show HN: macOS PortKiller

Resource Curse

Sleek for a Better Future

The Voyage 4 model family: shared embedding space with MoE architecture

Seedance 2.5

Autoregressive Language Model on the 6502 Processor

Right to repair: New consumer rights for easy and attractive repairs

Which job schedulers fire on time? We tested ten

Free photo tools, no signup, no watermark

Government Ownership Stakes in Companies Becoming Routine Under Trump

GSC and GA4 and technical SEO audit

The Bayeux Tapestry: how optical techniques have let this artwork come home

Palette Vault – color palettes and extractor Chrome plugin

Duane Arnold