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?

Public data and an AI evidence engine for Swedish politics

The company behind explosive diarrhea

A grumpy screed about AI in software engineering

Idea would turn the Earth into a giant space telescope

Open Source is not immune to monopoly

Nadella Blasts AI Industry's Double Standard

The Netdna-Ssl.com Takeover

Native C# CEL Implementation

New Jersey Couple Aids Meteorite Discovery After It Crashes Through Their Roof

Merck's Lipfendra becomes first oral PCSK9 treatment

Open Problems Solved by LLMs? A Survey of Verifiable Mathematical Discovery [pdf]

Credit Card Points Are a Transfer from the Broke to the Comfortable

Why X Is Not Our Ideal Window System

ReFrame – The EPaper Camera

PSA about abuse of cat(1) command. Don't abuse cats

Aside – Reddit-like circles with AI-ranked feeds

People Counter with Infrared Sensor: Build Your Own System in a Few Hours

Sourced ranking of the AI infrastructure build-out

Loop Library for Engineers

Common diet tips about water intake and spicy foods could be dead wrong

Figma for Email?

M17 rev B done, rev C next

My C and Assembler 3D Real Time Renderer from 1997

Clang: Hardware-Assisted AddressSanitizer Design Documentation

A Functional Taxonomy of World Models by Fei-Fei Li

Goiânia Accident

Tyler Cowen: the future belongs to AI maniacs

Repeal of national park rule could impact drinking water for millions

Things you didn't know about indexes

Claude Code(Fable) refused my slow down instruction