Split replicator doc into what is implemented and what is not
This commit is contained in:
parent
2d03ae2fae
commit
bad48ce83c
|
@ -0,0 +1,39 @@
|
|||
# Ledger Replication
|
||||
|
||||
Replication behavior yet to be implemented.
|
||||
|
||||
### Validator behavior
|
||||
|
||||
3. Every NUM\_KEY\_ROTATION\_TICKS it also validates samples received from
|
||||
replicators. It signs the PoH hash at that point and uses the following
|
||||
algorithm with the signature as the input:
|
||||
- The low 5 bits of the first byte of the signature creates an index into
|
||||
another starting byte of the signature.
|
||||
- The validator then looks at the set of storage proofs where the byte of
|
||||
the proof's sha state vector starting from the low byte matches exactly
|
||||
with the chosen byte(s) of the signature.
|
||||
- If the set of proofs is larger than the validator can handle, then it
|
||||
increases to matching 2 bytes in the signature.
|
||||
- Validator continues to increase the number of matching bytes until a
|
||||
workable set is found.
|
||||
- It then creates a mask of valid proofs and fake proofs and sends it to
|
||||
the leader. This is a storage proof confirmation transaction.
|
||||
5. After a lockout period of NUM\_SECONDS\_STORAGE\_LOCKOUT seconds, the
|
||||
validator then submits a storage proof claim transaction which then causes the
|
||||
distribution of the storage reward if no challenges were seen for the proof to
|
||||
the validators and replicators party to the proofs.
|
||||
|
||||
### Replicator behavior
|
||||
|
||||
9. The replicator then generates another set of offsets which it submits a fake
|
||||
proof with an incorrect sha state. It can be proven to be fake by providing the
|
||||
seed for the hash result.
|
||||
- A fake proof should consist of a replicator hash of a signature of a PoH
|
||||
value. That way when the replicator reveals the fake proof, it can be
|
||||
verified on chain.
|
||||
10. The replicator monitors the ledger, if it sees a fake proof integrated, it
|
||||
creates a challenge transaction and submits it to the current leader. The
|
||||
transacation proves the validator incorrectly validated a fake storage proof.
|
||||
The replicator is rewarded and the validator's staking balance is slashed or
|
||||
frozen.
|
||||
|
|
@ -123,25 +123,8 @@ transaction which tells the network how many proofs it can process in a given
|
|||
period defined by NUM\_KEY\_ROTATION\_TICKS.
|
||||
2. Every NUM\_KEY\_ROTATION\_TICKS the validator stores the PoH value at that
|
||||
height.
|
||||
3. Every NUM\_KEY\_ROTATION\_TICKS it also validates samples received from
|
||||
replicators. It signs the PoH hash at that point and uses the following
|
||||
algorithm with the signature as the input:
|
||||
- The low 5 bits of the first byte of the signature creates an index into
|
||||
another starting byte of the signature.
|
||||
- The validator then looks at the set of storage proofs where the byte of
|
||||
the proof's sha state vector starting from the low byte matches exactly
|
||||
with the chosen byte(s) of the signature.
|
||||
- If the set of proofs is larger than the validator can handle, then it
|
||||
increases to matching 2 bytes in the signature.
|
||||
- Validator continues to increase the number of matching bytes until a
|
||||
workable set is found.
|
||||
- It then creates a mask of valid proofs and fake proofs and sends it to
|
||||
the leader. This is a storage proof confirmation transaction.
|
||||
3. Validator generates a storage proof confirmation transaction.
|
||||
4. The storage proof confirmation transaction is integrated into the ledger.
|
||||
5. After a lockout period of NUM\_SECONDS\_STORAGE\_LOCKOUT seconds, the
|
||||
validator then submits a storage proof claim transaction which then causes the
|
||||
distribution of the storage reward if no challenges were seen for the proof to
|
||||
the validators and replicators party to the proofs.
|
||||
6. Validator responds to RPC interfaces for what the last storage epoch PoH
|
||||
value is and its entry\_height.
|
||||
|
||||
|
@ -179,17 +162,7 @@ segment.
|
|||
8. The replicator sends a PoRep proof transaction which contains its sha state
|
||||
at the end of the sampling operation, its seed and the samples it used to the
|
||||
current leader and it is put onto the ledger.
|
||||
9. The replicator then generates another set of offsets which it submits a fake
|
||||
proof with an incorrect sha state. It can be proven to be fake by providing the
|
||||
seed for the hash result.
|
||||
- A fake proof should consist of a replicator hash of a signature of a PoH
|
||||
value. That way when the replicator reveals the fake proof, it can be
|
||||
verified on chain.
|
||||
10. The replicator monitors the ledger, if it sees a fake proof integrated, it
|
||||
creates a challenge transaction and submits it to the current leader. The
|
||||
transacation proves the validator incorrectly validated a fake storage proof.
|
||||
The replicator is rewarded and the validator's staking balance is slashed or
|
||||
frozen.
|
||||
|
||||
|
||||
### Finding who has a given block of ledger
|
||||
|
||||
|
|
Loading…
Reference in New Issue