-
Notifications
You must be signed in to change notification settings - Fork 116
/
ccv_model.qnt
1212 lines (1123 loc) · 51.7 KB
/
ccv_model.qnt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// -*- mode: Bluespec; -*-
module ccv_model {
// A basic stateful model that utilizes the CCV protocol.
import ccv_types.* from "./ccv"
import Time.* from "./libraries/Time"
import extraSpells.* from "./libraries/extraSpells"
import ccv_utils.* from "./ccv_utils"
pure val consumerChainList = List("consumer1", "consumer2", "consumer3")
pure val consumerChains = consumerChainList.toSet()
pure val chains = consumerChains.union(Set(PROVIDER_CHAIN))
pure val defUnbondingPeriod = 2 * Week
pure val unbondingPeriods = chains.mapBy(chain => defUnbondingPeriod)
pure val trustingPeriods = chains.mapBy(chain => defUnbondingPeriod - 1 * Hour)
pure val ccvTimeouts = chains.mapBy(chain => 3 * Week)
pure val downtimeJailTime = 5 * Day
// taken from the sdk, jail time ends at maximum of a certain datatype
// see https://github.com/cosmos/cosmos-sdk/blob/03d578b9de5136ffc658f2b0c07434373b07b7da/x/evidence/types/params.go#L11
pure val doubleSignJailEndTime = 253402300799
pure val nodes = Set("node1", "node2", "node3", "node4", "node5", "node6", "node7", "node8", "node9", "node10")
// possible consumer addresses that nodes can assign their key to
pure val consumerAddresses = Set("consAddr1", "consAddr2", "consAddr3", "consAddr4", "consAddr5", "consAddr6", "consAddr7", "consAddr8", "consAddr9", "consAddr10")
pure val InitialValidatorSet = nodes.mapBy(node => 100)
import ccv(
VscTimeout = 5 * Week,
CcvTimeout = ccvTimeouts,
UnbondingPeriodPerChain = unbondingPeriods,
ConsumerChains = consumerChains,
TrustingPeriodPerChain = trustingPeriods,
DowntimeJailTime = downtimeJailTime,
DoubleSignJailEndTime = doubleSignJailEndTime,
DowntimeSlashPercentage = 5,
DoubleSignSlashPercentage = 10
).* from "./ccv"
type Parameters = {
VscTimeout: Time,
CcvTimeout: Chain -> Time,
UnbondingPeriodPerChain: Chain -> Time,
TrustingPeriodPerChain: Chain -> Time,
ConsumerChains: Set[Chain],
Nodes: Set[Node],
ConsumerAddresses: Set[ConsumerAddr],
InitialValidatorSet: Node -> int,
DowntimeSlashPercentage: int,
DoubleSignSlashPercentage: int,
DowntimeJailDuration: Time,
}
// The params variable is never actually changed, and
// just exists so the parameters are entered into the .itf file when we generate traces.
// This should be removed when/if Quint adds support to put the
// constant initializations in its output.
var params: Parameters
var currentState: ProtocolState
// a type storing the parameters used in actions.
// this is used in the trace to store
// the name of the last action, plus the parameters we passed to it.
// Note: This type holds ALL parameters that are used in ANY action,
// so not all of these fields are relevant to each action.
type Action =
{
kind: str,
consumerChain: Chain,
timeAdvancement: Time,
consumersToStart: Set[Chain],
consumersToStop: Set[Chain],
validator: Node,
changeAmount: int,
consumerAddr: ConsumerAddr,
vscId: VscId,
isDowntime: bool,
}
var trace: List[Action]
// a few different values for time advancements.
// to keep the number of possible steps small, we only have a few different values.
// Roughly, 1s for very small advances (like between blocks),
// and then longer values for increasingly severe downtime scenarios.
// Note that these can still be combined, so in effect we can get all time advancements by any amount of seconds.
// These should be smaller than the minimal TrustingPeriodPerChain,
// otherwise connections will break down.
pure val timeAdvancements = Set(1 * Second, 1 * Day, 1 * Week - 1 * Hour)
pure def emptyAction: Action =
{
kind: "",
consumerChain: "",
timeAdvancement: 0 * Second,
consumersToStart: Set(),
consumersToStop: Set(),
validator: "",
changeAmount: 0,
consumerAddr: "",
vscId: 0,
isDowntime: false,
}
// some utility stateful vals to make invariants easier to define
val providerValidatorHistory = currentState.providerState.chainState.votingPowerHistory
val runningConsumers = getRunningConsumers(currentState.providerState)
val nonConsumers = getNonConsumers(currentState.providerState)
val providerCurValSet = currentState.providerState.chainState.currentValidatorPowers
action init: bool = all {
val providerState = GetEmptyProviderState
val consumerStates = ConsumerChains.mapBy(chain => GetEmptyConsumerState)
val providerStateWithConsumers = providerState.with(
"consumerStatus",
ConsumerChains.mapBy(chain => NOT_CONSUMER)
).with(
"outstandingPacketsToConsumer",
ConsumerChains.mapBy(chain => List())
).with(
"sentVscPacketsToConsumer",
ConsumerChains.mapBy(chain => List())
).with(
// set the validator set to be the initial validator set in the history
"chainState", providerState.chainState.with(
"votingPowerHistory", List(InitialValidatorSet)
).with(
"currentValidatorPowers", InitialValidatorSet
)
).with(
"keyAssignedValSetHistory", ConsumerChains.mapBy(chain => List(InitialValidatorSet))
)
currentState' = {
providerState: providerStateWithConsumers,
consumerStates: consumerStates
},
trace' = List(emptyAction.with("kind", "init")),
params' = {
VscTimeout: VscTimeout,
CcvTimeout: CcvTimeout,
UnbondingPeriodPerChain: UnbondingPeriodPerChain,
ConsumerChains: ConsumerChains,
Nodes: nodes,
InitialValidatorSet: InitialValidatorSet,
TrustingPeriodPerChain: TrustingPeriodPerChain,
ConsumerAddresses: consumerAddresses,
DowntimeSlashPercentage: DowntimeSlashPercentage,
DoubleSignSlashPercentage: DoubleSignSlashPercentage,
DowntimeJailDuration: DowntimeJailTime,
}
}
action VotingPowerChange(validator: Node, changeAmount: int): bool =
val result = votingPowerChange(currentState, validator, changeAmount)
all {
result.hasError() == false,
currentState' = result.newState,
trace' = trace.append(emptyAction.with("kind", "VotingPowerChange").with("validator", validator).with("changeAmount", changeAmount)),
params' = params,
}
// The receiver receives the next outstanding VscPacket from the provider.
// This will time out the consumer if the packet timeout has passed on the receiver.
action DeliverVscPacket(receiver: Chain): bool =
val resultAndTimeout = deliverPacketToConsumer(currentState, receiver)
val result = resultAndTimeout._1
all {
result.hasError() == false,
currentState' = result.newState,
trace' = trace.append(emptyAction.with("kind", "DeliverVscPacket").with("consumerChain", receiver)),
params' = params,
}
// The provider receives the next outstanding packet from the sender.
// This will time out the consumer if the packet timeout has passed on the provider.
action DeliverPacketToProvider(sender: Chain): bool =
val resultAndTimeout = deliverPacketToProvider(currentState, sender)
val result = resultAndTimeout._1
all {
result.hasError() == false,
currentState' = result.newState,
trace' = trace.append(emptyAction.with("kind", "DeliverPacketToProvider").with("consumerChain", sender)),
params' = params,
}
action EndAndBeginBlockForProvider(
timeAdvancement: Time,
consumersToStart: Set[Chain],
consumersToStop: Set[Chain]): bool =
val result = endAndBeginBlockForProvider(currentState, timeAdvancement, consumersToStart, consumersToStop)
all {
result.hasError() == false,
currentState' = result.newState,
trace' = trace.append(emptyAction.with("kind", "EndAndBeginBlockForProvider").with("timeAdvancement", timeAdvancement).with("consumersToStart", consumersToStart).with("consumersToStop", consumersToStop)),
params' = params,
}
action EndAndBeginBlockForConsumer(
chain: Chain,
timeAdvancement: Time): bool =
val result = endAndBeginBlockForConsumer(currentState, chain, timeAdvancement)
all {
result.hasError() == false,
currentState' = result.newState,
trace' = trace.append(emptyAction.with("kind", "EndAndBeginBlockForConsumer").with("consumerChain", chain).with("timeAdvancement", timeAdvancement)),
params' = params,
}
// stepCommon is the core functionality of steps that does not have anything to do with time.
action stepCommon = any {
nondet node = oneOf(nonJailedNodes(currentState.providerState))
// very restricted set of voting powers. exact values are not important,
// and this keeps the state space smaller.
nondet newVotingPower = oneOf(Set(-50, 50))
VotingPowerChange(node, newVotingPower),
// try to send a packet. we could filter by chains that can actually send,
// but it's probably not much faster than just trying and failing.
all {
runningConsumers.size() > 0, // ensure there is a running consumer, otherwise this action does not make sense
nondet sender = oneOf(runningConsumers)
DeliverPacketToProvider(sender),
},
// again, we could filter by chains that can actually receive,
// but it's probably not much faster than just trying and failing.
all {
runningConsumers.size() > 0, // ensure there is a running consumer, otherwise this action does not make sense
nondet receiver = oneOf(runningConsumers)
DeliverVscPacket(receiver),
},
ConsumerInitiatedSlash
}
// step allows the most generic nondeterminism, in particular it becomes relatively likely
// that over a long enough runtime, all consumers would time out by mismatching their time advancements,
// and each endblock has a good chance to stop consumers, ...
// step is thus suited to test also unhappy paths.
action step = any {
all {
runningConsumers.size() > 0, // ensure there is a running consumer, otherwise this action does not make sense
nondet chain = oneOf(runningConsumers)
nondet timeAdvancement = oneOf(timeAdvancements)
EndAndBeginBlockForConsumer(chain, timeAdvancement),
},
val consumerStatus = currentState.providerState.consumerStatus
nondet consumersToStart = oneOf(nonConsumers.powerset())
nondet consumersToStop = oneOf(runningConsumers.powerset())
nondet timeAdvancement = oneOf(timeAdvancements)
EndAndBeginBlockForProvider(timeAdvancement, consumersToStart, consumersToStop),
stepCommon
}
// ==================
// UTILITY FUNCTIONS
// ==================
pure def removeZeroPowers(valSet: ValidatorSet): ValidatorSet =
valSet.keys().fold(
Map(),
(acc, node) =>
if (valSet.get(node) == 0) {
acc
} else {
acc.put(node, valSet.get(node))
}
)
pure def oldest(packets: Set[VscPacket]): VscPacket =
val newestPossiblePacket: VscPacket = {
id: 0,
validatorSet: Map(),
sendingTime: 9999999999999 * Second,
timeoutTime: 9999999999999 * Second,
downtimeSlashAcks: List(),
}
packets.fold(
newestPossiblePacket,
(res, pack) => if(res.sendingTime < pack.sendingTime) { res } else { pack }
)
pure def newest(packets: Set[VscPacket]): VscPacket =
val oldestPossiblePacket: VscPacket = {
id: 0,
validatorSet: Map(),
sendingTime: -9999999999 * Second,
timeoutTime: -9999999999 * Second,
downtimeSlashAcks: List(),
}
packets.fold(
oldestPossiblePacket,
(res, pack) => if(res.sendingTime >= pack.sendingTime) { res } else { pack }
)
run oldestnewestTest = {
val packet1 = {
id: 1,
validatorSet: Map(),
sendingTime: 1 * Second,
timeoutTime: 1 * Second,
downtimeSlashAcks: List(),
}
val packet2 = {
id: 2,
validatorSet: Map(),
sendingTime: 2 * Second,
timeoutTime: 2 * Second,
downtimeSlashAcks: List(),
}
val packet3 = {
id: 3,
validatorSet: Map(),
sendingTime: 3 * Second,
timeoutTime: 3 * Second,
downtimeSlashAcks: List(),
}
all {
assert(oldest(Set(packet1, packet2, packet3)) == packet1),
assert(oldest(Set(packet3, packet2, packet1)) == packet1),
assert(newest(Set(packet1, packet2, packet3)) == packet3),
assert(newest(Set(packet3, packet2, packet1)) == packet3),
}
}
// ==================
// INVARIANT CHECKS
// ==================
// Every validator set on any consumer chain MUST either be or have been
// a validator set on the provider chain.
val ValidatorSetHasExistedInv =
runningConsumers.forall(chain => // for all running consumers
currentState.consumerStates.get(chain).chainState.votingPowerHistory.toSet().forall(
// go through all its historical and current validator sets
validatorSet => providerValidatorHistory.toSet().contains(validatorSet)
// and check that they are also historical or current validator sets on the provider
)
)
// Any update in the power of a validator on the provider
// MUST be present in a ValidatorSetChangePacket that is sent to all registered consumer chains
val ValUpdatePrecondition = trace[trace.length()-1].kind == "EndAndBeginBlockForProvider"
val ValidatorUpdatesArePropagatedInv =
// when the provider has just entered a validator set into a block...
ValUpdatePrecondition and currentState.providerState.providerValidatorSetChangedInThisBlock
implies
val providerValSetInCurBlock = providerValidatorHistory.head()
// ... for each consumer that is running then ...
runningConsumers.forall(
// ...the validator set is in a sent packet...
consumer => currentState.providerState.sentVscPacketsToConsumer.get(consumer).toSet().exists(
packet => packet.validatorSet == providerValSetInCurBlock
)
)
// Every consumer chain receives the same sequence of
// ValidatorSetChangePackets in the same order.
// NOTE: since not all consumer chains are running all the time,
// we need a slightly weaker invariant:
// For consumer chains c1, c2, if both c1 and c2 received a packet p1 sent at t1 and a packet p2 sent at t2,
// then both have received ALL packets that were sent between t1 and t2.
val SameVscPacketsInv =
runningConsumers.forall(
consumer1 => runningConsumers.forall(
consumer2 => {
val packets1 = currentState.consumerStates.get(consumer1).receivedVscPackets
val packets2 = currentState.consumerStates.get(consumer2).receivedVscPackets
val commonPackets = packets1.toSet().intersect(packets2.toSet())
if (commonPackets.size() == 0) {
true // they don't share any packets, so nothing to check
} else {
val newestCommonPacket = commonPackets.newest()
val oldestCommonPacket = commonPackets.oldest()
// get all packets sent between the oldest and newest common packet
val packetsBetween1 = packets1.select(
packet => packet.sendingTime >= oldestCommonPacket.sendingTime and packet.sendingTime <= newestCommonPacket.sendingTime
)
val packetsBetween2 = packets2.select(
packet => packet.sendingTime >= oldestCommonPacket.sendingTime and packet.sendingTime <= newestCommonPacket.sendingTime
)
// these should be the same on both chains
packetsBetween1 == packetsBetween2
}
}
)
)
// For every ValidatorSetChangePacket received by a consumer chain at
// time t, a MaturedVscPacket is sent back to the provider when we end the first block
// with a timestamp >= t + UnbondingPeriod
// NOTE: because we remove the maturationTimes entry when we send the packets,
// it suffices to check that after we end/begin a block, there is never an entry in maturationTimes
// that has already matured, i.e. where the maturationTime is smaller-or-equal than the
// timestamp of the block we just ended
val MaturationPrecondition = trace[trace.length()-1].kind == "EndAndBeginBlockForConsumer"
val ConsumerWithPotentialMaturations = trace[trace.length()-1].consumerChain
val lastTimeAdvancement = trace[trace.length()-1].timeAdvancement
val lastBlockTime = currentState.consumerStates.get(ConsumerWithPotentialMaturations).chainState.lastTimestamp - lastTimeAdvancement
val MatureOnTimeInv =
// if a consumer ended a block
MaturationPrecondition
implies
// then all matured packets need to have been processed and removed from the packets
// waiting to mature
currentState.consumerStates.get(ConsumerWithPotentialMaturations).maturationTimes.toSet().forall(
pair =>
val maturationTime = pair._2
maturationTime > lastBlockTime
)
// If we send a VscPacket, this is eventually responded to by all consumers
// that were running at the time the packet was sent (and are still running).
// Since we remove sentVscPacketsToConsumer when we receive responses for them,
// we just check that if a sentVscPacket has been sent more than
// VscTimeout ago, the consumer must have been dropped.
// In practice, when this is true, a pending unbonding can mature.
val EventuallyMatureOnProviderInv =
runningConsumers.forall(
consumer => {
val sentPackets = currentState.providerState.sentVscPacketsToConsumer.getOrElse(consumer, List()).toSet()
sentPackets.forall(
packet =>
// consumer still has time to respond
not(packet.sendingTime + VscTimeout < currentState.providerState.chainState.lastTimestamp) or
// consumer was dropped
currentState.providerState.consumerStatus.get(consumer) == STOPPED or
currentState.providerState.consumerStatus.get(consumer) == TIMEDOUT
)
}
)
// for all consumers, waitingForSlachPacketAck is either empty or has a single element
val WaitingForSlashPacketAckInv =
runningConsumers.forall(
consumer =>
currentState.consumerStates.get(consumer).waitingForSlashPacketAck.size() <= 1
)
// =================
// SANITY CHECKS
// =================
// some invariants that should fail,
// to check that certain behaviours can be exhibited.
// The name of the invariants is the name of the behaviour
// we want to see, and its definition will *negate* that behaviour, so
// we expect these to fail when checked as invariants.
// We can run consumers.
val CanRunConsumer =
not(ConsumerChains.exists(
consumer =>
currentState.providerState.consumerStatus.get(consumer) == RUNNING
))
val CanStopConsumer =
not(ConsumerChains.exists(
consumer =>
currentState.providerState.consumerStatus.get(consumer) == STOPPED
))
val CanTimeoutConsumer =
not(ConsumerChains.exists(
consumer =>
currentState.providerState.consumerStatus.get(consumer) == TIMEDOUT
))
val CanSendVscPackets =
not(ConsumerChains.exists(
consumer =>
currentState.providerState.outstandingPacketsToConsumer.getOrElse(consumer, List()).length() > 0
))
val CanReceiveVscPackets =
not(trace[length(trace)-1].kind == "DeliverVscPacket")
val CanSendVscMaturedPackets =
not(ConsumerChains.exists(
consumer =>
currentState.consumerStates.get(consumer)
.outstandingPacketsToProvider
.select(IsVscMaturedPacket).length() > 0
))
val CanSendSlashPacket =
not(ConsumerChains.exists(
consumer =>
currentState.consumerStates.get(consumer)
.outstandingPacketsToProvider
.select(IsSlashPacket).length() > 0
))
val CanJail =
not(
currentState.providerState.chainState.jailedUntil.keys().size() > 0
)
val CanJailMany =
not(
currentState.providerState.chainState.jailedUntil.keys().size() > 3
)
val CanReceiveMaturations =
not(ConsumerChains.exists(
consumer =>
currentState.providerState.receivedMaturations.size() > 0
))
// ==================
// MANUAL TEST CASES
// ==================
// Manually written test cases to get confidence in the base operation of the protocol.
/// Test a simple happy path where:
/// * the consumer chain is set to running
/// * a validator set change happens
/// * a block is ended on the provider, i.e. a packet is sent to the consumer
/// * the consumer receives the packet
/// * the chains wait until the unbonding period is over
/// * the consumer sends a VscMaturedPacket to the provider
/// * the provider receives the VscMaturedPacket
run HappyPathTest: bool = {
init.then(
all {
assert(currentState.providerState.consumerStatus == Map(
"consumer1" -> NOT_CONSUMER,
"consumer2" -> NOT_CONSUMER,
"consumer3" -> NOT_CONSUMER
)),
assert(currentState.providerState.outstandingPacketsToConsumer == Map(
"consumer1" -> List(),
"consumer2" -> List(),
"consumer3" -> List()
)),
assert(currentState.providerState.sentVscPacketsToConsumer == Map(
"consumer1" -> List(),
"consumer2" -> List(),
"consumer3" -> List()
)),
assert(currentState.consumerStates.keys() == consumerChains),
assert(currentState.providerState.chainState.votingPowerHistory == List(InitialValidatorSet)),
assert(currentState.providerState.chainState.currentValidatorPowers == InitialValidatorSet),
assert(currentState.providerState.chainState.lastTimestamp == -1),
assert(currentState.providerState.chainState.runningTimestamp == 0),
VotingPowerChange("node1", 50)
})
.then(
all {
// the validator set has changed
assert(currentState.providerState.chainState.currentValidatorPowers == InitialValidatorSet.put("node1", 150)),
// start consumer1
EndAndBeginBlockForProvider(1 * Second, Set("consumer1"), Set())
})
.then(
all {
// consumer1 was started
assert(currentState.providerState.consumerStatus.get("consumer1") == RUNNING),
// but no packet was sent to consumer 1
assert(currentState.providerState.outstandingPacketsToConsumer.getOrElse("consumer1", List()).length() == 0),
// the validator set on the provider was entered into the history
assert(currentState.providerState.chainState.votingPowerHistory == List(InitialValidatorSet.put("node1", 150), InitialValidatorSet)),
// change voting power on provider again
VotingPowerChange("node1", 50).then(
// end another block
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
).then(
// deliver packet to consumer1
DeliverVscPacket("consumer1")
)
}
)
.then(
all {
// make sure the packet was removed from the provider
assert(currentState.providerState.outstandingPacketsToConsumer.get("consumer1").length() == 0),
// ensure the maturation time was entered on the consumer
assert(currentState.consumerStates.get("consumer1").maturationTimes.length() == 1),
// the validator set was put as the current validator set
assert(currentState.consumerStates.get("consumer1").chainState.currentValidatorPowers == InitialValidatorSet.put("node1", 200)),
// advance time on provider and consumer until unbonding period is over - ensure that the consumer and provider
// stay in sync relative to each other
// We want to make sure the steps we make are shorter the trusting period,
// since that would time out clients in reality.
4.reps(
i =>
EndAndBeginBlockForProvider(UnbondingPeriodPerChain.get("consumer1")/4, Set(), Set()).then(
EndAndBeginBlockForConsumer("consumer1", UnbondingPeriodPerChain.get("consumer1")/4)
)
)
}
)
.then(
all {
// the packet has not matured yet - the timestamp for the current block is after the naturation time,
// but packets are only sent on EndBlock
assert(currentState.consumerStates.get("consumer1").outstandingPacketsToProvider.length() == 0),
// the packet is still waiting to mature
assert(currentState.consumerStates.get("consumer1").maturationTimes.length() == 1),
// end another block, this time after the time has been reached
EndAndBeginBlockForConsumer("consumer1", 1 * Second)
}
)
.then(
all {
// the packet now was sent by the consumer
assert(currentState.consumerStates.get("consumer1").outstandingPacketsToProvider.length() == 1),
// it was removed from the maturationTimes
assert(currentState.consumerStates.get("consumer1").maturationTimes.length() == 0),
// receive the packet on the provider
DeliverPacketToProvider("consumer1")
}
)
.then(
all {
// the packet was received on the provider
assert(currentState.providerState.receivedMaturations.size() == 1),
// the packet was removed from the consumer
assert(currentState.consumerStates.get("consumer1").outstandingPacketsToProvider.length() == 0),
VotingPowerChange("node1", 50) // just so this still has an effect
}
)
}
/// a manual test case for the SameVscPacketsInv, since it needs very specific behaviour to even apply.
run SameVscPacketsManualTest =
init.then(
// start all consumers except for consumer3
EndAndBeginBlockForProvider(1 * Second, Set("consumer1", "consumer2"), Set())
).then(
// change voting power
VotingPowerChange("node1", 50)
).then(
// send packet to consumer1 and consumer2
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
).then(
// deliver the packets
DeliverVscPacket("consumer1")
).then(
// deliver to consumer2
DeliverVscPacket("consumer2")
).then(
// start consumer3
EndAndBeginBlockForProvider(1 * Second, Set("consumer3"), Set())
).then(
// do another voting power change
VotingPowerChange("node2", 50)
).then(
// send packets
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
).then(
//deliver to consumer1
DeliverVscPacket("consumer1")
).then(
// deliver to consumer2
DeliverVscPacket("consumer2")
).then(
// deliver to consumer3
DeliverVscPacket("consumer3")
)
.then(
// the SameVscPacketInv should hold here
all {
assert(SameVscPacketsInv),
// action does not matter, but needed to have uniform effect
VotingPowerChange("node1", 50)
}
)
// a manual test for the EventuallyMatureOnProvider invariant
run VscTimeoutManualTest =
init
.then(
// start all consumer chains
EndAndBeginBlockForProvider(1 * Second, ConsumerChains, Set())
)
.then(
// change voting power
VotingPowerChange("node1", 50)
)
.then(
// send packets
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
)
.then(
// advance time on provider by VscTimeout + 1 Second
EndAndBeginBlockForProvider(VscTimeout + 1 * Second, Set(), Set())
)
.then(
// enter the advanced time on chain
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
)
.then(
all {
// the consumer chains should have timed out
assert(ConsumerChains.forall(
chain => currentState.providerState.consumerStatus.get(chain) == TIMEDOUT
)),
VotingPowerChange("node1", 50) // action needs to be there but does not matter what it is
}
)
// ===== KEY ASSIGNMENT =======
action stepKeyAssignment =
any {
step,
nondetKeyAssignment,
}
action nondetKeyAssignment =
all {
runningConsumers.size() > 0,
nondet node = oneOf(nodes)
nondet consumerAddr = oneOf(consumerAddresses)
nondet consumer = oneOf(runningConsumers)
KeyAssignment(consumer, node, consumerAddr),
}
action KeyAssignment(
chain: Chain,
validator: Node,
consumerAddr: ConsumerAddr
): bool =
val result = assignConsumerKey(currentState, chain, validator, consumerAddr)
all {
hasError(result) == false,
currentState' = result.newState,
trace' = trace.append(
{...emptyAction,
kind: "KeyAssignment",
consumerChain: chain,
validator: validator,
consumerAddr: consumerAddr
}
),
params' = params,
}
// Make the consumer send a slash request for the given node
// (which must be the nodes address on the consumer)
// and a given validator set id, which indicates during which
// time period the infraction occurred.
action ConsumerInitiatedSlashDet(
consumer: Chain,
consumerNode: Node,
vscId: VscId,
isDowntime: bool
): bool = {
val result = sendSlashRequest(currentState, consumer, consumerNode, vscId, isDowntime)
all {
hasError(result) == false,
currentState' = result.newState,
trace' = trace.append(
{...emptyAction,
kind: "ConsumerInitiatedSlash",
consumerChain: consumer,
validator: consumerNode,
vscId: vscId,
isDowntime: isDowntime
}
),
params' = params,
}
}
// Nondeterministic version of consumer initiated slashing,
// which first chooses sensible arguments, and then invokes the deterministic version.
action ConsumerInitiatedSlash(): bool = {
all {
runningConsumers.size() > 0,
// pick a running consumer to slash from
nondet consumer = oneOf(runningConsumers)
// we want to be able to slash for past infractions,
// and we need both the validator address and the
// vsc id of the packet to send to the provider
// pick a validator to slash...
val consumerState = currentState.consumerStates.get(consumer)
// ...by getting all received vsc packets...
val rcvdVscPackets = consumerState.receivedVscPackets
all {
rcvdVscPackets.length() > 0,
// ...picking one of the packets...
nondet packet = oneOf(rcvdVscPackets.toSet())
val vscId = packet.id
val valSet = packet.validatorSet.keys()
// ...and picking one of the validators in the packet
nondet validator = oneOf(valSet)
// finally, choose whether to slash for downtime or double-signing
nondet isDowntime = oneOf(Set(true, false))
// then we can invoke the deterministic slash
ConsumerInitiatedSlashDet(consumer, validator, vscId, isDowntime)
}
}
}
// invariants for key assignment - some invariants are in addition, some need to be adjusted from the original model
// Every validator set on any consumer chain MUST either be or have been
// a validator set on the provider chain, under the key assignment at the time.
val providerKeyAssignedValSetHistory = currentState.providerState.keyAssignedValSetHistory
val ValidatorSetHasExistedKeyAssignmentInv =
runningConsumers.forall(chain => // for every running consumer
currentState.consumerStates.get(chain).chainState.votingPowerHistory.toSet().forall(
// for every validator set the consumer ever had
validatorSet => providerKeyAssignedValSetHistory.getOrElse(chain, List()).toSet().exists(
// that validator set needs to also have existed on the provider
provValSet => removeZeroPowers(provValSet) == removeZeroPowers(validatorSet)
)
)
)
// Any update in the power of a validator on the provider
// MUST be present in a ValidatorSetChangePacket that is sent to all registered consumer chains,
// and the key assignment of each validator should be applied in that VSCPacket.
val ValidatorUpdatesArePropagatedKeyAssignmentInv =
// when the provider has just entered a validator set into a block...
ValUpdatePrecondition and currentState.providerState.providerValidatorSetChangedInThisBlock
implies
val providerValSetInCurBlock = providerValidatorHistory.head()
// ... for each consumer that is running then ...
runningConsumers.forall(
// ...the validator set under key assignment is in a sent packet...
val providerState = currentState.providerState
consumer => providerState.sentVscPacketsToConsumer.get(consumer).toSet().exists(
packet =>
packet.validatorSet ==
applyKeyAssignmentToValSet(providerState, consumer, providerValSetInCurBlock)
)
)
// Every consumer chain receives the same sequence of
// ValidatorSetChangePackets in the same order.
// NOTE: since not all consumer chains are running all the time,
// we need a slightly weaker invariant:
// For consumer chains c1, c2, if both c1 and c2 received a packet p1 sent at t1 and a packet p2 sent at t2,
// then both have received ALL packets that were sent between t1 and t2.
val SameVscPacketsKeyAssignmentInv =
runningConsumers.forall(
consumer1 => runningConsumers.forall(
consumer2 => {
val packets1 = currentState.consumerStates.get(consumer1).receivedVscPackets
val packets2 = currentState.consumerStates.get(consumer2).receivedVscPackets
val commonPackets = packets1.toSet().intersect(packets2.toSet())
if (commonPackets.size() == 0) {
true // they don't share any packets, so nothing to check
} else {
val newestCommonPacket = newest(commonPackets)
val oldestCommonPacket = oldest(commonPackets)
// get all packets sent between the oldest and newest common packet
val packetsBetween1 = packets1.select(
packet => packet.sendingTime >= oldestCommonPacket.sendingTime and packet.sendingTime <= newestCommonPacket.sendingTime
)
val packetsBetween2 = packets2.select(
packet => packet.sendingTime >= oldestCommonPacket.sendingTime and packet.sendingTime <= newestCommonPacket.sendingTime
)
// revert key assignments
val packetsBetween1noKeyAssignment = packetsBetween1.foldl(
List(),
(acc, packet) =>
acc.concat(List({...packet,
validatorSet: revertKeyAssignment(
currentState.providerState.keyAssignmentsForVSCPackets
.getOrElse(packet.id, Map())
.getOrElse(consumer1, Map()),
packet.validatorSet)
}))
)
val packetsBetween2noKeyAssignment = packetsBetween2.foldl(
List(), (acc, packet) =>
acc.concat(List({...packet,
validatorSet: revertKeyAssignment(
currentState.providerState.keyAssignmentsForVSCPackets
.getOrElse(packet.id, Map())
.getOrElse(consumer2, Map()),
packet.validatorSet)
}))
)
// check that the packets between the common packets are equal
// when key assignment is reversed
packetsBetween1noKeyAssignment == packetsBetween2noKeyAssignment
}
}
)
)
// Rules for key assignment:
val KeyAssignmentRulesInv =
NoProviderReuse and NoDuplicationOnSameConsumer
// validator A cannot assign consumer key K to consumer chain X if there is already a validator B (B!=A) using K on the provider
val NoProviderReuse =
consumerChains.forall(
consumer =>
val valConsPk = currentState.providerState.validatorToConsumerAddr.getOrElse(consumer, Map())
valConsPk.keys().forall(
node =>
val consAddr = valConsPk.get(node)
// either the key is the nodes key itself (B == A)
consAddr == node or
// or the consAddr must not be a validator on the provider
not(currentState.providerState.chainState.currentValidatorPowers.keys().contains(consAddr))
)
)
// validator A cannot assign consumer key K to consumer chain X if there is already a validator B using K on X
val NoDuplicationOnSameConsumer =
consumerChains.forall(
consumer =>
val valConsPk = currentState.providerState.validatorToConsumerAddr.getOrElse(consumer, Map())
valConsPk.keys().forall(
node =>
val consAddr = valConsPk.get(node)
// no other node may use consAddr
not(valConsPk.keys().exists(
otherNode => otherNode != node and valConsPk.get(otherNode) == consAddr
))
)
)
// sanity checks
val CanAssignConsumerKey =
not(consumerChains.exists(
consumer =>
currentState.providerState.consumerAddrToValidator.getOrElse(consumer, Map()).keys().size() > 0
))
val CanHaveConsumerAddresses =
not(consumerChains.exists(
consumer =>
currentState.consumerStates.get(consumer).chainState.currentValidatorPowers.keys().exists(
addr => addr.in(consumerAddresses)
)
))
// == tests for key assignment ==
run KeyAssignmentTest =
init
.then(
// start all consumer chains
EndAndBeginBlockForProvider(1 * Second, consumerChains, Set())
)
.then(
// node 1 assigns a key on consumer1
KeyAssignment("consumer1", "node1", "consAddr1")
)
.then(
// end and begin block to make sure the key assignment is processed and the packet is sent
EndAndBeginBlockForProvider(1 * Second, Set(), Set())
)
.then(
// receive the packet on the consumer
DeliverVscPacket("consumer1")
)
.then(
// end and begin block to make sure the packet is processed
EndAndBeginBlockForConsumer("consumer1", 1 * Second)
)
.then(
all {
// the key should be present in the valset on the consumer, and the node itself should not
assert(currentState.consumerStates.get("consumer1").chainState.currentValidatorPowers.getOrElse("node1", 0) == 0),
assert(currentState.consumerStates.get("consumer1").chainState.currentValidatorPowers.get("consAddr1") == 100),
// try some key assignments that should fail/succeed without committing to state
val res = assignConsumerKey(currentState, "consumer1", "node1", "consAddr1")
// fail - key already assigned (even if it is the same node)
assert(hasError(res)),
val res2 = assignConsumerKey(currentState, "consumer1", "node2", "consAddr1")
// fail - key assigned to other node
assert(hasError(res2)),
val res3 = assignConsumerKey(currentState, "consumer2", "node2", "consAddr1")
// ok - may reuse the key on a different consumer
assert(not(hasError(res3))),
val res4 = assignConsumerKey(currentState, "consumer1", "node2", "node1")
// fail - may not reuse a provider key of a different val
assert(hasError(res4)),
val res5 = assignConsumerKey(currentState, "consumer1", "node1", "consAddr2")
// ok - assigning unused key to node
assert(not(hasError(res5))),
val res6 = assignConsumerKey(currentState, "consumer1", "node1", "node1")
// ok - going back to original key
assert(not(hasError(res6))),
// mature the vsc packet on the consumer
EndAndBeginBlockForConsumer("consumer1", unbondingPeriods.get("consumer1") + 1 * Hour)
}