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?

You're Not an Extension of Anyone's Self

Show HN: Nobel Prizes explained six ways, with a public fix log

Microsoft Quicksand

AI Institute for Human-AI Cooperation

How Does Yamamoto Do What He Does? Toyota-Like Mechanics

Intelligence Explosion

Secret protection must scale with software: <2ms classifier in the push path

Thinking Will Become a Hobby

Strands Box: another open source sandbox

CrowdStrike finds possible bank hacker's CV among exposed AI logs

Broke Prod

Tigrisdata/objgit: Git backed by object storage

Bloom Pod

Show HN: Ember – your day never goes as planned, your calendar should adjust

4-hour battery storage is cheaper to install than gas turbines all across globe

German search engine ditches Mistral, bets on Chinese open-source AI

The Fastest Way to Be Done

Ario: Decentralized AI Inference and Systemic Transparency Architecture

Apps that run on your Claude or ChatGPT plan

Healthcare for Seniors

How to Engineer Flowers [audio]

They just merged my PR for the bound on the integer multiplication problem

Ask HN: Thoughts on OSC 7501?

Show HN: Convertix – Fast browser-based image to text extractor

Cheaters and Whistleblowers in the Agent Swarm

New gTLD Application for .lan

Introducing Spotify Technology

A peer-to-peer computer management framework

HawkEye 360 – the space RF modality imagery can't replace, down 38% since IPO

Trump administration is suspending Microsoft from a green card program