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?

First Alfred 6 Sneak Peek: Alfred UI

Social Reality in China

Fossil – A Coherent Software Configuration Management System

European payments groups join forces to challenge US dominance

TikTok User Finder – See User ID and Region, No Login

Final Cut Pro Cannot Render Speed Ramps with Optical Flow

Introducing the Pixi Audit Beta

Interview with Richard Ho, OpenAI – By Dr. Ian Cutress

A table of 1,200 model benchmarks since 2019, updated daily

An AI-assembled crew exfiltrating ERP data from Spanish SMBs

Hucked and Shucked

A Man Who Listens to Whales

11% of Americans Are Currently Taking a GLP-1 Weight Loss Drug

Faster model, slower chatbot: What we learned from testing Jev

Blogging with Gleam, Org-Mode and Pandoc

New Hands for Atlas – Boston Dynamics [video]

Cormac McCarthy's Marriage Was Ending When an Editor Changed His Life

DESI Collaboration instrument results challenge the cosmological constant

They're Known as Swarm Chasers–and They Spring into Action When AI Goes Rogue

Microsoft launches MAI-Transcribe-2-Streaming

Github suddenly broke org-mode rendering

Financing the AI Buildout

Show HN: Truth, druid, dryad, tar and dendrite share the same PIE root as tree

Show HN: Yokka – Simple project management for coding agents

Pi Coding Agent and Jev integration use cases

What Is Factorio? (2021)

Phantom of Heilbronn

Pretending to Be WordPress

OpenAI Fires Researchers for Allegedly Sharing Information with AI Safety Group

Jev for Vulnerability and Attack Surface Analysis