Read repair, hinted handoff, and anti-entropy (using Merkle trees) are mechanisms in eventually consistent distributed databases that fix data inconsistencies across replicas, ensuring all nodes eventually hold the same data state.

Introduction to Eventual Consistency

In an eventually consistent system, data updates are not immediately synchronized across all replicas.

Instead, the system guarantees that if no new updates occur, all replicas will eventually converge to the latest value.

This [weak consistency](https://www.designgurus