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?

TIL: You can make HTTP requests without curl using Bash /dev/TCP

The British Social Media Ban Is Silly

British Colombia, Time Zones, and Postgres

The AiCopalypse

Sam Bankman-Fried's Prison Experiment

Show HN: NumUp – A Daily Math Puzzle

A Vision for a Rust Formal Specification

The Pokémon Trading Card Game AI Battle Challenge

Show HN: Memento – Self-hosted agentic search and LLM wiki over your email

Show HN: Dino – An AI coding agent that keeps you in the loop

The European Commission is turning Google Search into a national-security risk

Snyk VulnBench JavaScript 1.0: Can LLMs Find the Same Bugs Twice?

Fake Viral Guitarists Strike Again

Hackers Publish Knicks and Madison Square Garden Data Online

Biff.fx: lightweight effects system for Clojure

Yes, we still need engineers

Ask HN: What do you think about blockchain's current trajectory

Google's Training Supercomputers from TPU v2 to Ironwood: Five Generations

Can LLM Agents Infer World Models? Evidence from Agentic Automata Learning

Apache Fory Serialization 1.2.0: JDK 25 support without sun.misc.Unsafe

Earth's underground fungal network would span 10% of the Milky Way

Qwen-RobotWorld Technical Report

JoyAI-VL-Interaction: Real-Time Vision-Language Interaction Intelligence

Making ast.walk 220x Faster

A Short Explanation of the Zettelkasten Method

Robinhood to cut 10% of workforce in restructuring

The ongoing debacle of hiring a fake coworker

Uncritical use of AI causes countrywide scandal at Starbucks Korea

Agent Architecture Is a Compute Allocation Problem: The Advisor Strategy

How we evaluate our LLM judge