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?

Have you noticed any changes in the way people communicate now we have chatbots?

The Breaks – A Breaking Encyclopedia

Mom-as-a-Service

PowerContext, Context for work that humans and agents hand off and continue

Microsoft AI Publishes Its Humanist AI Code of Conduct

Volkswagen Mission Efficiency Sets 3 World Records

XProtect behavioral flop: the Golden Gasp

Show HN: Daemon OS – An intelligence layer for infrastructure

We are all Product Engineers now

The Hardness of 4-to-1 Games with Perfect Completeness

Purely Functional Operating Systems

DeepMind's new genome 'atlas' charts effects of all 9B human gene mutations

METR Anthropic Network

One Pass to Parse Them All: Fused Parallel CSV Processing [pdf]

India's Dedicated Freight Corridor's last mile challenge

Mouse

CrofAI Is an OpenRouter Wrapper

Internet Guestbooks: The Rise, Decline, and Afterlife

An open-source interactive 3D PC Anatomy explore what's inside a computer

Does Scaling Web-Video Pre-Training Help Real Robots Do Real Work?

The Physical Agent Harness: a portable interface to persistent agents

Air Force secretary acknowledges the US has weapons in space

World AI Cooperation Organization

Show HN: Day week calendar app inspired by the French Revolutionary calendar

US-China AI strategic planning

The harms of short-form video on the brain are starting to show

I worked at Google DeepMind. You should listen to the warnings about AI

The Rise of the Forward Deployed Engineer – and How to Do the Job Right

Exploring mathematics with your computer (1993)

Why is nobody signing up even though I launched an unlimited plan on my website?