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?

Why Canadians can now get cheaper generic Ozempic – and Americans can't

California – Lowest Wholesale Electricity Prices in USA

Fear and Social Pressure Are 'Overarming' the U.S.

The Quiet Numbers Station: Decoding Nineteen Years of GPS Cryptography

Academic-Brain vs. Founder-Brain

Software Quality Is Not Goal Anymore

Show HN: Claude-o-meter, a tachometer for your Claude use

Airlines Uses AI to Fake Empathy Rather Than Fix Problems: Passenger Sent Prompt

The Desperation of NYTimes

Anno 1800 Cured my Chronic Pain

Instagram Launches Plus

Kea >= 1:3.0.3-6 update requires manual intervention

"Visually math concepts which are easy to explain"

Single Responsibility, the Distorted Principle

Goodbye Flow State

Double Ender

Ask HN: Why do my Show HN submissions get flagged immediately?

Goldman Sachs expects SpaceX's AI revenue to increase 100-fold by 2030

Hacker News Security

The AI-Driven Resurgence of Native Mac App Development

MCP Needs an Approval Button

Show HN: Clickfyre Ping – send app notifications to yourself

Agent Arena: Causal Evaluation of Agents in the Real World

Ad Free Alberta Learner Practice Test

Multi-stage distributed query execution in ClickHouse Cloud

Astronomers just solved a 50-year-old mystery about the Milky Way's black hole

Your 401(k) is about to become Elon Musk's exit liquidity

Cargo Cult Process

Parallelize yourself, not your agents

Show HN: Resume – manage Claude and codex sessions in one CLI