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?

Free Gpt.im

International cyber attack disrupts swathe of universities and schools

A Man Who Almost Never Succeeded (2012)

Help Needed Seeking Contributors for a Pure C Compiler and Runtime

Simplifying camera trap image analysis with AI

Yesterday I had some news that has left me feeling

Show HN: I Built a Retro Survival RPG in Vanilla JavaScript

Astroberry – OS for controlling astronomy equipment

Show HN: Digits – Encrypted calls from gutted vintage desk phones

IPO: Lime (SEC S-1 Form, Neutron Holdings)

Hondurasgate: US, Israeli Plot to Destabilize Mexico, Latin America

Everything you need to know about recently released UFO files by Dow

Is Opus 4.7 a Downgrade?

Instagram DMs Lose End-to-End Encryption Starting Today

A JSON parser in 2k standard cells: a Tiny Tapeout design walkthrough

ABA Games (1D Pac-Man, etc) Agentic Gamedev Skills

An experimental Rust-to-CUDA compiler from Nvidia

La Suite Docs v5.0.0 released

Dirty Frag: Ongoing Linux Kernel Privilege Escalation Vulnerability Since 2017

Caligra c100 Developer Terminal – Industrial design of computer hardware

iDF soldiers are putting cigarettes in Virgin Mary statues in occupied Lebanon

NREL best research cell (photovoltaic) efficiency chart [pdf]

Lunar Impact Flashes NASA Artemis

Intel shares soar on Apple chip deal report

Rakudo – Raku on MoarVM, JVM, and JavaScript

All my clients wanted a carousel, now it's an AI chatbot

What Color Is a Tennis Ball?

Databricks Apps Tutorial: Scalable Streamlit Modular Template for Production

Chaos erupts as cyberattack disrupts learning platform Canvas amid finals

Hobonichi Digital Planner