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?

Tests suggest Russian satellites can jam GPS on a continental scale

Elon Musk says SpaceX doesn't need 'magic' to put AI data centers up in space

Meta Deletes Face-Recognition System from Smart Glasses App After Wired Report

Show HN: I recreated AOL Instant Messenger in the browser

Loop Engineering

Rutger Bregman and His School for Moral Ambition Lacks Moral Ambition

Supporting Exchange and beyond

A new study says people love working from home, but does it love them back?

Exposing the Solid State Donut Battery. It's Over. [video]

GNU Binutils 2.46.1 Released

Semantics for 2D Rasterization

SpaceX has just officially unveiled its AI1 satellite

Remembering the USS Liberty – and why it still matters

170k Claude queries per gallon of gas?

AI Is Upending One of Finance's Cushiest Jobs

JNU, an Vibe Coded Operating System

AI Has Broken Hiring

BofA Warns It's Time to 'Take Profits' as Red Flags Multiply

Show HN: Mach – A compiled systems language looking for contributions

Show HN: Ustps (UDP Speedy Transmission Protocol Secure) and USSH

Show HN: Sudo Report – Drudge closne for AI/tech/product

WhatsApp disrupted spear phishing attempts, asks court to hold NSO in contempt

Why Compiler Engineers Avoid Strassen's Algorithm for Matrix Multiplication

How to Measure Time to First Token (TTFT)

Germany and France Scrapped the FCAS

Tim Cook's Final WWDC Showed Why Apple Still Always Wins in the End

Rediscovered: The Lost Audio of Sherlock Holmes

Life Cycle Costing Approach of Carbon Capture and Storage at Hunter Unit 3

Hiring Co-Founder

Major earthquake off Cuba's coast felt across Florida