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?

ChatGPT self-distances when admitting fault

The bad science polluting our media landscape

UniEvo-VL: Self-Distillation Training for Multimodal Model Self-Improvement

AI Hasn't Replaced Interpreters but It Has Degraded Their Working Conditions

The uphill climb of making diff lines performant

Flow Typing: A New Lens on Linearity [pdf]

SpaceX looks to raise $40B to buy Nvidia chips in financing led by Apollo

Ask HN: How would you feel if we nationalized Google?

Six Masks

Building Git infrastructure for agent-scale development

Linux Setup Was a Hazing Ritual. Agents Changed It

Show HN: I build a newsreader-like alternative interface for my website

Toward provably private learning from federated data

Janet on the x32 ABI: 32-bit Pointers, 64-bit Speed, 25% Less RAM

Show HN: Vokalu – Windows/Mac dictation, free on-device or 2¢/min in the cloud

You Are an Expert Software Engineer [Krazam] [video]

Apple's Smart Home Push Includes Doorbell, Lock, Thermostat Codeveloped with LG

Bitcoin Rebound Revives Debate over a New Crypto Cycle

Vecos a windows like operating system for the vectrex for the UVMC2 [video]

Mathematical manuscripts and supporting proof artifacts produced by OpenAI

toks: the best tokenizer on Earth

Passion driven web arcade by students with no ads, sign ups, etc.

Solving Open Research Problems Together

An Open Letter to Steven Pinker on AI

Over My Dead Pencil

One Minnesotan's longshot plan to take down the company behind Flock cameras

The Performance of Open Source Software: Ninja

Sharing AI Progress in Mathematics

Tuesday Morning Topline: Waymos Not Allowed Near Waterfront for Fleet Week

Replay agentic workflows with Epiq