Harmony Technical Whitepaper

The problem the paper names

If an adversary can predict which validators land in a shard, they can concentrate stake there. Harmony's paper is about the assignment problem as much as about the fast path inside a shard.

What the design proposes

• Validators stake and are randomly assigned. Resharding is part of the security argument.
• Consensus inside a shard is a BFT protocol on a small committee, not a global race.
• A beacon or randomness source is load-bearing. The paper has to say where the randomness comes from.

How the mechanism is specified

• Cross-shard messages are receipts, not free function calls. That constraint is the design.
• Effective proof-of-stake in the paper is a response to one-address dominance, not a general fairness theorem.
• Later network parameters are not frozen by the PDF.

What this page does not treat as proven

• Do not treat the white paper's target throughput as a measured result.
• Randomness that is biasable recreates the shard-capture problem the design set out to avoid.
• This page does not review Harmony's subsequent treasury or bridge incidents. Those are separate facts.

Why a venture studio still reads it

For a studio, the transferable question is: is shard membership unpredictable to the attacker who is about to join? If the answer is no, the rest of the diagram does not matter.