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?

Superbad.com if it came from the mind of an AI

JsxCore – A TSX/JSX View Engine for Asp.net Core

Token use for exact prompt across models

Telegram says app restored on Apple's App Store

A modern Saga/TCC orchestration engine for microservices

Show HN: Velokey – One Task API for Kling, Veo, Seedance, and Sora

Socket.dev warns about Rust Tokio library obfuscation

Eval-driven development: Lessons from evaluating GenAI at scale

Billion-dollar property collapse highlights private credit danger

Hollow-LLM Attack: Ghost Weights That Fool Zero-Knowledge LLM Verification

George Orwell's 1984 (Hinge Dating App)

QRiosity Killed the Cat

Palantir Shares Jump on 'Otherworldly' Sales, Improved Forecast

Full-Stack AI Engineer, Clinical Systems – NYC Based – Healthtech

Telegram Removed from AppStore?

Nvidia NemotronLabs VoiceChat 11B – real-time full duplex with tool calling

Birth order and disease risk across the human phenome

Telegram Removed from App Store

The Skylar Semigroup Framework for Prime Numbers

Winamp Announces Strategic Partnership with Deezer

What I Learned Growing an Engineering Blog from 0 to 463,000 Pageviews

BYOC Is Not Just 'Deploy into Their Cloud'

AI Is Breaking the SaaS Deployment Model: 10 Commandments for BYOC

The day my sneaky link made me gag (and not in the fun way)

How human hearing is shaping high-end audio

Snakes aren't simple tubes. Their bodies have 5 regions, including a short neck

The Myth, the Mythos, and the Man

Show HN: Every plaintext HTTP request on your Linux box captured via eBPF

Cruising for Shells in Flowise – 6 RCEs That Rode Flowise Low and Slow

Show CVBoosta:Resume Optimizer that tailors your resume to every job