Source file raw_context.ml
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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
module Int_set = Set.Make (Compare.Int)
type consensus_pk = {
delegate : Signature.Public_key_hash.t;
consensus_pk : Signature.Public_key.t;
consensus_pkh : Signature.Public_key_hash.t;
}
let consensus_pk_encoding =
let open Data_encoding in
conv
(fun {delegate; consensus_pk; consensus_pkh} ->
if Signature.Public_key_hash.equal consensus_pkh delegate then
(consensus_pk, None)
else (consensus_pk, Some delegate))
(fun (consensus_pk, delegate) ->
let consensus_pkh = Signature.Public_key.hash consensus_pk in
let delegate =
match delegate with None -> consensus_pkh | Some del -> del
in
{delegate; consensus_pk; consensus_pkh})
(obj2
(req "consensus_pk" Signature.Public_key.encoding)
(opt "delegate" Signature.Public_key_hash.encoding))
module Raw_consensus = struct
(** Consensus operations are indexed by their [initial slots]. Given
a delegate, the [initial slot] is the lowest slot assigned to
this delegate. *)
type t = {
current_endorsement_power : int;
(** Number of endorsement slots recorded for the current block. *)
allowed_endorsements : (consensus_pk * int) Slot_repr.Map.t option;
(** Endorsements rights for the current block. Only an endorsement
for the lowest slot in the block can be recorded. The map
associates to each initial slot the [pkh] associated to this
slot with its power. This is [None] only in mempool mode. *)
allowed_preendorsements : (consensus_pk * int) Slot_repr.Map.t option;
(** Preendorsements rights for the current block. Only a preendorsement
for the lowest slot in the block can be recorded. The map
associates to each initial slot the [pkh] associated to this
slot with its power. This is [None] only in mempool mode, or in
application mode when there is no locked round (so the block
cannot contain any preendorsements). *)
endorsements_seen : Slot_repr.Set.t;
(** Record the endorsements already seen. Only initial slots are indexed. *)
preendorsements_seen : Slot_repr.Set.t;
(** Record the preendorsements already seen. Only initial slots
are indexed. *)
locked_round_evidence : (Round_repr.t * int) option;
(** Record the preendorsement power for a locked round. *)
preendorsements_quorum_round : Round_repr.t option;
(** in block construction mode, record the round of preendorsements
included in a block. *)
endorsement_branch : (Block_hash.t * Block_payload_hash.t) option;
}
(** Invariant:
- [slot \in endorsements_seen => Int_map.mem slot allowed_endorsements]
- [slot \in preendorsements_seen => Int_map.mem slot allowed_preendorsements]
- [ |endorsements_seen| > 0 => |included endorsements| > 0]
*)
let empty : t =
{
current_endorsement_power = 0;
allowed_endorsements = Some Slot_repr.Map.empty;
allowed_preendorsements = Some Slot_repr.Map.empty;
endorsements_seen = Slot_repr.Set.empty;
preendorsements_seen = Slot_repr.Set.empty;
locked_round_evidence = None;
preendorsements_quorum_round = None;
endorsement_branch = None;
}
type error += Double_inclusion_of_consensus_operation
let () =
register_error_kind
`Branch
~id:"operation.double_inclusion_of_consensus_operation"
~title:"Double inclusion of consensus operation"
~description:"double inclusion of consensus operation"
~pp:(fun ppf () ->
Format.fprintf ppf "Double inclusion of consensus operation")
Data_encoding.empty
(function
| Double_inclusion_of_consensus_operation -> Some () | _ -> None)
(fun () -> Double_inclusion_of_consensus_operation)
let record_endorsement t ~initial_slot ~power =
error_when
(Slot_repr.Set.mem initial_slot t.endorsements_seen)
Double_inclusion_of_consensus_operation
>|? fun () ->
{
t with
current_endorsement_power = t.current_endorsement_power + power;
endorsements_seen = Slot_repr.Set.add initial_slot t.endorsements_seen;
}
let record_preendorsement ~initial_slot ~power round t =
error_when
(Slot_repr.Set.mem initial_slot t.preendorsements_seen)
Double_inclusion_of_consensus_operation
>|? fun () ->
let locked_round_evidence =
match t.locked_round_evidence with
| None -> Some (round, power)
| Some (_stored_round, evidences) ->
Some (round, evidences + power)
in
{
t with
locked_round_evidence;
preendorsements_seen =
Slot_repr.Set.add initial_slot t.preendorsements_seen;
}
let set_preendorsements_quorum_round round t =
match t.preendorsements_quorum_round with
| Some round' ->
assert (Round_repr.equal round round') ;
t
| None -> {t with preendorsements_quorum_round = Some round}
let initialize_with_endorsements_and_preendorsements ~allowed_endorsements
~allowed_preendorsements t =
{t with allowed_endorsements; allowed_preendorsements}
let locked_round_evidence t = t.locked_round_evidence
let endorsement_branch t = t.endorsement_branch
let set_endorsement_branch t endorsement_branch =
{t with endorsement_branch = Some endorsement_branch}
end
type dal_committee = {
pkh_to_shards :
(Dal_attestation_repr.shard_index * int) Signature.Public_key_hash.Map.t;
shard_to_pkh : Signature.Public_key_hash.t Dal_attestation_repr.Shard_map.t;
}
let empty_dal_committee =
{
pkh_to_shards = Signature.Public_key_hash.Map.empty;
shard_to_pkh = Dal_attestation_repr.Shard_map.empty;
}
type back = {
context : Context.t;
constants : Constants_parametric_repr.t;
round_durations : Round_repr.Durations.t;
cycle_eras : Level_repr.cycle_eras;
level : Level_repr.t;
predecessor_timestamp : Time.t;
timestamp : Time.t;
fees : Tez_repr.t;
origination_nonce : Origination_nonce.t option;
temporary_lazy_storage_ids : Lazy_storage_kind.Temp_ids.t;
internal_nonce : int;
internal_nonces_used : Int_set.t;
remaining_block_gas : Gas_limit_repr.Arith.fp;
unlimited_operation_gas : bool;
consensus : Raw_consensus.t;
non_consensus_operations_rev : Operation_hash.t list;
dictator_proposal_seen : bool;
sampler_state : (Seed_repr.seed * consensus_pk Sampler.t) Cycle_repr.Map.t;
stake_distribution_for_current_cycle :
Tez_repr.t Signature.Public_key_hash.Map.t option;
tx_rollup_current_messages :
Tx_rollup_inbox_repr.Merkle.tree Tx_rollup_repr.Map.t;
sc_rollup_current_messages : Sc_rollup_inbox_merkelized_payload_hashes_repr.t;
dal_slot_fee_market : Dal_slot_repr.Slot_market.t;
dal_attestation_slot_accountability : Dal_attestation_repr.Accountability.t;
dal_committee : dal_committee;
}
type t = {remaining_operation_gas : Gas_limit_repr.Arith.fp; back : back}
type root = t
let[@inline] context ctxt = ctxt.back.context
let[@inline] current_level ctxt = ctxt.back.level
let[@inline] predecessor_timestamp ctxt = ctxt.back.predecessor_timestamp
let[@inline] current_timestamp ctxt = ctxt.back.timestamp
let[@inline] round_durations ctxt = ctxt.back.round_durations
let[@inline] cycle_eras ctxt = ctxt.back.cycle_eras
let[@inline] constants ctxt = ctxt.back.constants
let[@inline] tx_rollup ctxt = ctxt.back.constants.tx_rollup
let[@inline] sc_rollup ctxt = ctxt.back.constants.sc_rollup
let[@inline] zk_rollup ctxt = ctxt.back.constants.zk_rollup
let[@inline] recover ctxt = ctxt.back.context
let[@inline] fees ctxt = ctxt.back.fees
let[@inline] origination_nonce ctxt = ctxt.back.origination_nonce
let[@inline] internal_nonce ctxt = ctxt.back.internal_nonce
let[@inline] internal_nonces_used ctxt = ctxt.back.internal_nonces_used
let[@inline] remaining_block_gas ctxt = ctxt.back.remaining_block_gas
let[@inline] unlimited_operation_gas ctxt = ctxt.back.unlimited_operation_gas
let[@inline] temporary_lazy_storage_ids ctxt =
ctxt.back.temporary_lazy_storage_ids
let[@inline] remaining_operation_gas ctxt = ctxt.remaining_operation_gas
let[@inline] non_consensus_operations_rev ctxt =
ctxt.back.non_consensus_operations_rev
let[@inline] dictator_proposal_seen ctxt = ctxt.back.dictator_proposal_seen
let[@inline] sampler_state ctxt = ctxt.back.sampler_state
let[@inline] update_back ctxt back = {ctxt with back}
let[@inline] update_remaining_block_gas ctxt remaining_block_gas =
update_back ctxt {ctxt.back with remaining_block_gas}
let[@inline] update_remaining_operation_gas ctxt remaining_operation_gas =
{ctxt with remaining_operation_gas}
let[@inline] update_unlimited_operation_gas ctxt unlimited_operation_gas =
update_back ctxt {ctxt.back with unlimited_operation_gas}
let[@inline] update_context ctxt context =
update_back ctxt {ctxt.back with context}
let[@inline] update_constants ctxt constants =
update_back ctxt {ctxt.back with constants}
let[@inline] update_origination_nonce ctxt origination_nonce =
update_back ctxt {ctxt.back with origination_nonce}
let[@inline] update_internal_nonce ctxt internal_nonce =
update_back ctxt {ctxt.back with internal_nonce}
let[@inline] update_internal_nonces_used ctxt internal_nonces_used =
update_back ctxt {ctxt.back with internal_nonces_used}
let[@inline] update_fees ctxt fees = update_back ctxt {ctxt.back with fees}
let[@inline] update_temporary_lazy_storage_ids ctxt temporary_lazy_storage_ids =
update_back ctxt {ctxt.back with temporary_lazy_storage_ids}
let[@inline] update_non_consensus_operations_rev ctxt
non_consensus_operations_rev =
update_back ctxt {ctxt.back with non_consensus_operations_rev}
let[@inline] update_dictator_proposal_seen ctxt dictator_proposal_seen =
update_back ctxt {ctxt.back with dictator_proposal_seen}
let[@inline] update_sampler_state ctxt sampler_state =
update_back ctxt {ctxt.back with sampler_state}
type error += Too_many_internal_operations
type error += Block_quota_exceeded
type error += Operation_quota_exceeded
type error += Stake_distribution_not_set
type error += Sampler_already_set of Cycle_repr.t
let () =
let open Data_encoding in
register_error_kind
`Permanent
~id:"too_many_internal_operations"
~title:"Too many internal operations"
~description:
"A transaction exceeded the hard limit of internal operations it can emit"
empty
(function Too_many_internal_operations -> Some () | _ -> None)
(fun () -> Too_many_internal_operations) ;
register_error_kind
`Temporary
~id:"gas_exhausted.operation"
~title:"Gas quota exceeded for the operation"
~description:
"A script or one of its callee took more time than the operation said it \
would"
empty
(function Operation_quota_exceeded -> Some () | _ -> None)
(fun () -> Operation_quota_exceeded) ;
register_error_kind
`Temporary
~id:"gas_exhausted.block"
~title:"Gas quota exceeded for the block"
~description:
"The sum of gas consumed by all the operations in the block exceeds the \
hard gas limit per block"
empty
(function Block_quota_exceeded -> Some () | _ -> None)
(fun () -> Block_quota_exceeded) ;
register_error_kind
`Permanent
~id:"delegate.stake_distribution_not_set"
~title:"Stake distribution not set"
~description:"The stake distribution for the current cycle is not set."
~pp:(fun ppf () ->
Format.fprintf
ppf
"The stake distribution for the current cycle is not set.")
empty
(function Stake_distribution_not_set -> Some () | _ -> None)
(fun () -> Stake_distribution_not_set) ;
register_error_kind
`Permanent
~id:"sampler_already_set"
~title:"Sampler already set"
~description:
"Internal error: Raw_context.set_sampler_for_cycle was called twice for \
a given cycle"
~pp:(fun ppf c ->
Format.fprintf
ppf
"Internal error: sampler already set for cycle %a."
Cycle_repr.pp
c)
(obj1 (req "cycle" Cycle_repr.encoding))
(function Sampler_already_set c -> Some c | _ -> None)
(fun c -> Sampler_already_set c)
let fresh_internal_nonce ctxt =
if Compare.Int.(internal_nonce ctxt >= 65_535) then
error Too_many_internal_operations
else
ok
(update_internal_nonce ctxt (internal_nonce ctxt + 1), internal_nonce ctxt)
let reset_internal_nonce ctxt =
let ctxt = update_internal_nonce ctxt 0 in
update_internal_nonces_used ctxt Int_set.empty
let record_internal_nonce ctxt k =
update_internal_nonces_used ctxt (Int_set.add k (internal_nonces_used ctxt))
let internal_nonce_already_recorded ctxt k =
Int_set.mem k (internal_nonces_used ctxt)
let get_collected_fees ctxt = fees ctxt
let credit_collected_fees_only_call_from_token ctxt fees' =
let previous = get_collected_fees ctxt in
Tez_repr.(previous +? fees') >|? fun fees -> update_fees ctxt fees
let spend_collected_fees_only_call_from_token ctxt fees' =
let previous = get_collected_fees ctxt in
Tez_repr.(previous -? fees') >|? fun fees -> update_fees ctxt fees
type error += Undefined_operation_nonce
let () =
let open Data_encoding in
register_error_kind
`Permanent
~id:"undefined_operation_nonce"
~title:"Ill timed access to the origination nonce"
~description:
"An origination was attempted out of the scope of a manager operation"
empty
(function Undefined_operation_nonce -> Some () | _ -> None)
(fun () -> Undefined_operation_nonce)
let init_origination_nonce ctxt operation_hash =
let origination_nonce = Some (Origination_nonce.initial operation_hash) in
update_origination_nonce ctxt origination_nonce
let increment_origination_nonce ctxt =
match origination_nonce ctxt with
| None -> error Undefined_operation_nonce
| Some cur_origination_nonce ->
let origination_nonce =
Some (Origination_nonce.incr cur_origination_nonce)
in
let ctxt = update_origination_nonce ctxt origination_nonce in
ok (ctxt, cur_origination_nonce)
let get_origination_nonce ctxt =
match origination_nonce ctxt with
| None -> error Undefined_operation_nonce
| Some origination_nonce -> ok origination_nonce
let unset_origination_nonce ctxt = update_origination_nonce ctxt None
let gas_level ctxt =
let open Gas_limit_repr in
if unlimited_operation_gas ctxt then Unaccounted
else Limited {remaining = remaining_operation_gas ctxt}
let block_gas_level = remaining_block_gas
let consume_gas_limit_in_block ctxt gas_limit =
let open Gas_limit_repr in
check_gas_limit
~hard_gas_limit_per_operation:(constants ctxt).hard_gas_limit_per_operation
~gas_limit
>>? fun () ->
let block_gas = block_gas_level ctxt in
let limit = Arith.fp gas_limit in
if Arith.(limit > block_gas) then error Block_quota_exceeded
else
let level = Arith.sub (block_gas_level ctxt) limit in
let ctxt = update_remaining_block_gas ctxt level in
Ok ctxt
let set_gas_limit ctxt (remaining : 'a Gas_limit_repr.Arith.t) =
let open Gas_limit_repr in
let remaining_operation_gas = Arith.fp remaining in
let ctxt = update_unlimited_operation_gas ctxt false in
{ctxt with remaining_operation_gas}
let set_gas_unlimited ctxt = update_unlimited_operation_gas ctxt true
let consume_gas ctxt cost =
match Gas_limit_repr.raw_consume (remaining_operation_gas ctxt) cost with
| Some gas_counter -> Ok (update_remaining_operation_gas ctxt gas_counter)
| None ->
if unlimited_operation_gas ctxt then ok ctxt
else error Operation_quota_exceeded
let check_enough_gas ctxt cost =
consume_gas ctxt cost >>? fun (_ : t) -> Result.return_unit
let gas_consumed ~since ~until =
match (gas_level since, gas_level until) with
| Limited {remaining = before}, Limited {remaining = after} ->
Gas_limit_repr.Arith.sub before after
| _, _ -> Gas_limit_repr.Arith.zero
type missing_key_kind = Get | Set | Del | Copy
type storage_error =
| Incompatible_protocol_version of string
| Missing_key of string list * missing_key_kind
| Existing_key of string list
| Corrupted_data of string list
let storage_error_encoding =
let open Data_encoding in
union
[
case
(Tag 0)
~title:"Incompatible_protocol_version"
(obj1 (req "incompatible_protocol_version" @@ string Plain))
(function Incompatible_protocol_version arg -> Some arg | _ -> None)
(fun arg -> Incompatible_protocol_version arg);
case
(Tag 1)
~title:"Missing_key"
(obj2
(req "missing_key" (list @@ string Plain))
(req
"function"
(string_enum
[("get", Get); ("set", Set); ("del", Del); ("copy", Copy)])))
(function Missing_key (key, f) -> Some (key, f) | _ -> None)
(fun (key, f) -> Missing_key (key, f));
case
(Tag 2)
~title:"Existing_key"
(obj1 (req "existing_key" (list @@ string Plain)))
(function Existing_key key -> Some key | _ -> None)
(fun key -> Existing_key key);
case
(Tag 3)
~title:"Corrupted_data"
(obj1 (req "corrupted_data" (list @@ string Plain)))
(function Corrupted_data key -> Some key | _ -> None)
(fun key -> Corrupted_data key);
]
let pp_storage_error ppf = function
| Incompatible_protocol_version version ->
Format.fprintf
ppf
"Found a context with an unexpected version '%s'."
version
| Missing_key (key, Get) ->
Format.fprintf ppf "Missing key '%s'." (String.concat "/" key)
| Missing_key (key, Set) ->
Format.fprintf
ppf
"Cannot set undefined key '%s'."
(String.concat "/" key)
| Missing_key (key, Del) ->
Format.fprintf
ppf
"Cannot delete undefined key '%s'."
(String.concat "/" key)
| Missing_key (key, Copy) ->
Format.fprintf
ppf
"Cannot copy undefined key '%s'."
(String.concat "/" key)
| Existing_key key ->
Format.fprintf
ppf
"Cannot initialize defined key '%s'."
(String.concat "/" key)
| Corrupted_data key ->
Format.fprintf
ppf
"Failed to parse the data at '%s'."
(String.concat "/" key)
type error += Storage_error of storage_error
let () =
register_error_kind
`Permanent
~id:"context.storage_error"
~title:"Storage error (fatal internal error)"
~description:
"An error that should never happen unless something has been deleted or \
corrupted in the database."
~pp:(fun ppf err ->
Format.fprintf ppf "@[<v 2>Storage error:@ %a@]" pp_storage_error err)
storage_error_encoding
(function Storage_error err -> Some err | _ -> None)
(fun err -> Storage_error err)
let storage_error err = error (Storage_error err)
let version_key = ["version"]
let version_value = "nairobi_017"
let version = "v1"
let protocol_migration_internal_message =
Sc_rollup_inbox_message_repr.Protocol_migration version_value
let protocol_migration_serialized_message =
match
Sc_rollup_inbox_message_repr.serialize
(Internal protocol_migration_internal_message)
with
| Ok msg -> msg
| Error trace ->
Format.kasprintf
failwith
"%s: Could not serialize protocol message : %a"
__LOC__
pp_trace
trace
let cycle_eras_key = [version; "cycle_eras"]
let constants_key = [version; "constants"]
let protocol_param_key = ["protocol_parameters"]
let get_cycle_eras ctxt =
Context.find ctxt cycle_eras_key >|= function
| None -> storage_error (Missing_key (cycle_eras_key, Get))
| Some bytes -> (
match
Data_encoding.Binary.of_bytes_opt Level_repr.cycle_eras_encoding bytes
with
| None -> storage_error (Corrupted_data cycle_eras_key)
| Some cycle_eras -> ok cycle_eras)
let set_cycle_eras ctxt cycle_eras =
let bytes =
Data_encoding.Binary.to_bytes_exn Level_repr.cycle_eras_encoding cycle_eras
in
Context.add ctxt cycle_eras_key bytes >|= ok
type error += Failed_to_parse_parameter of bytes
type error += Failed_to_decode_parameter of Data_encoding.json * string
let () =
register_error_kind
`Temporary
~id:"context.failed_to_parse_parameter"
~title:"Failed to parse parameter"
~description:"The protocol parameters are not valid JSON."
~pp:(fun ppf bytes ->
Format.fprintf
ppf
"@[<v 2>Cannot parse the protocol parameter:@ %s@]"
(Bytes.to_string bytes))
Data_encoding.(obj1 (req "contents" @@ bytes Hex))
(function Failed_to_parse_parameter data -> Some data | _ -> None)
(fun data -> Failed_to_parse_parameter data) ;
register_error_kind
`Temporary
~id:"context.failed_to_decode_parameter"
~title:"Failed to decode parameter"
~description:"Unexpected JSON object."
~pp:(fun ppf (json, msg) ->
Format.fprintf
ppf
"@[<v 2>Cannot decode the protocol parameter:@ %s@ %a@]"
msg
Data_encoding.Json.pp
json)
Data_encoding.(obj2 (req "contents" json) (req "error" @@ string Plain))
(function
| Failed_to_decode_parameter (json, msg) -> Some (json, msg) | _ -> None)
(fun (json, msg) -> Failed_to_decode_parameter (json, msg))
let get_proto_param ctxt =
Context.find ctxt protocol_param_key >>= function
| None -> failwith "Missing protocol parameters."
| Some bytes -> (
match Data_encoding.Binary.of_bytes_opt Data_encoding.json bytes with
| None -> tzfail (Failed_to_parse_parameter bytes)
| Some json -> (
Context.remove ctxt protocol_param_key >|= fun ctxt ->
match Data_encoding.Json.destruct Parameters_repr.encoding json with
| exception (Data_encoding.Json.Cannot_destruct _ as exn) ->
Format.kasprintf
failwith
"Invalid protocol_parameters: %a %a"
(fun ppf -> Data_encoding.Json.print_error ppf)
exn
Data_encoding.Json.pp
json
| param ->
Parameters_repr.check_params param >>? fun () -> ok (param, ctxt))
)
let add_constants ctxt constants =
let bytes =
Data_encoding.Binary.to_bytes_exn
Constants_parametric_repr.encoding
constants
in
Context.add ctxt constants_key bytes
let get_constants ctxt =
Context.find ctxt constants_key >|= function
| None -> failwith "Internal error: cannot read constants in context."
| Some bytes -> (
match
Data_encoding.Binary.of_bytes_opt
Constants_parametric_repr.encoding
bytes
with
| None -> failwith "Internal error: cannot parse constants in context."
| Some constants -> ok constants)
let patch_constants ctxt f =
let constants = f (constants ctxt) in
add_constants (context ctxt) constants >|= fun context ->
let ctxt = update_context ctxt context in
update_constants ctxt constants
let check_inited ctxt =
Context.find ctxt version_key >|= function
| None -> failwith "Internal error: un-initialized context."
| Some bytes ->
let s = Bytes.to_string bytes in
if Compare.String.(s = version_value) then Result.return_unit
else storage_error (Incompatible_protocol_version s)
let check_cycle_eras (cycle_eras : Level_repr.cycle_eras)
(constants : Constants_parametric_repr.t) =
let current_era = Level_repr.current_era cycle_eras in
assert (
Compare.Int32.(current_era.blocks_per_cycle = constants.blocks_per_cycle)) ;
assert (
Compare.Int32.(
current_era.blocks_per_commitment = constants.blocks_per_commitment))
let prepare ~level ~predecessor_timestamp ~timestamp ctxt =
Raw_level_repr.of_int32 level >>?= fun level ->
check_inited ctxt >>=? fun () ->
get_constants ctxt >>=? fun constants ->
Round_repr.Durations.create
~first_round_duration:constants.minimal_block_delay
~delay_increment_per_round:constants.delay_increment_per_round
>>?= fun round_durations ->
get_cycle_eras ctxt >|=? fun cycle_eras ->
check_cycle_eras cycle_eras constants ;
let level = Level_repr.level_from_raw ~cycle_eras level in
let sc_rollup_current_messages =
Sc_rollup_inbox_repr.init_witness_no_history
in
{
remaining_operation_gas = Gas_limit_repr.Arith.zero;
back =
{
context = ctxt;
constants;
level;
predecessor_timestamp;
timestamp;
round_durations;
cycle_eras;
fees = Tez_repr.zero;
origination_nonce = None;
temporary_lazy_storage_ids = Lazy_storage_kind.Temp_ids.init;
internal_nonce = 0;
internal_nonces_used = Int_set.empty;
remaining_block_gas =
Gas_limit_repr.Arith.fp
constants.Constants_parametric_repr.hard_gas_limit_per_block;
unlimited_operation_gas = true;
consensus = Raw_consensus.empty;
non_consensus_operations_rev = [];
dictator_proposal_seen = false;
sampler_state = Cycle_repr.Map.empty;
stake_distribution_for_current_cycle = None;
tx_rollup_current_messages = Tx_rollup_repr.Map.empty;
sc_rollup_current_messages;
dal_slot_fee_market =
Dal_slot_repr.Slot_market.init
~length:constants.Constants_parametric_repr.dal.number_of_slots;
dal_attestation_slot_accountability =
Dal_attestation_repr.Accountability.init
~length:constants.Constants_parametric_repr.dal.number_of_slots;
dal_committee = empty_dal_committee;
};
}
type previous_protocol = Genesis of Parameters_repr.t | Mumbai_016
let check_and_update_protocol_version ctxt =
(Context.find ctxt version_key >>= function
| None ->
failwith "Internal error: un-initialized context in check_first_block."
| Some bytes ->
let s = Bytes.to_string bytes in
if Compare.String.(s = version_value) then
failwith "Internal error: previously initialized context."
else if Compare.String.(s = "genesis") then
get_proto_param ctxt >|=? fun (param, ctxt) -> (Genesis param, ctxt)
else if Compare.String.(s = "mumbai_016") then return (Mumbai_016, ctxt)
else Lwt.return @@ storage_error (Incompatible_protocol_version s))
>>=? fun (previous_proto, ctxt) ->
Context.add ctxt version_key (Bytes.of_string version_value) >|= fun ctxt ->
ok (previous_proto, ctxt)
let[@warning "-32"] get_previous_protocol_constants ctxt =
Context.find ctxt constants_key >>= function
| None ->
failwith
"Internal error: cannot read previous protocol constants in context."
| Some bytes -> (
match
Data_encoding.Binary.of_bytes_opt
Constants_parametric_previous_repr.encoding
bytes
with
| None ->
failwith
"Internal error: cannot parse previous protocol constants in \
context."
| Some constants -> Lwt.return constants)
let prepare_first_block ~level ~timestamp ctxt =
check_and_update_protocol_version ctxt >>=? fun (previous_proto, ctxt) ->
(match previous_proto with
| Genesis param ->
Raw_level_repr.of_int32 level >>?= fun first_level ->
let cycle_era =
{
Level_repr.first_level;
first_cycle = Cycle_repr.root;
blocks_per_cycle = param.constants.blocks_per_cycle;
blocks_per_commitment = param.constants.blocks_per_commitment;
}
in
Level_repr.create_cycle_eras [cycle_era] >>?= fun cycle_eras ->
set_cycle_eras ctxt cycle_eras >>=? fun ctxt ->
add_constants ctxt param.constants >|= ok
| Mumbai_016 ->
get_previous_protocol_constants ctxt >>= fun c ->
let tx_rollup =
Constants_parametric_repr.
{
enable = false;
origination_size = c.tx_rollup.origination_size;
hard_size_limit_per_inbox = c.tx_rollup.hard_size_limit_per_inbox;
hard_size_limit_per_message =
c.tx_rollup.hard_size_limit_per_message;
max_withdrawals_per_batch = c.tx_rollup.max_withdrawals_per_batch;
max_ticket_payload_size = c.tx_rollup.max_ticket_payload_size;
commitment_bond = c.tx_rollup.commitment_bond;
finality_period = c.tx_rollup.finality_period;
withdraw_period = c.tx_rollup.withdraw_period;
max_inboxes_count = c.tx_rollup.max_inboxes_count;
max_messages_per_inbox = c.tx_rollup.max_messages_per_inbox;
max_commitments_count = c.tx_rollup.max_commitments_count;
cost_per_byte_ema_factor = c.tx_rollup.cost_per_byte_ema_factor;
rejection_max_proof_size = c.tx_rollup.rejection_max_proof_size;
sunset_level = c.tx_rollup.sunset_level;
}
in
let cryptobox_parameters =
{
Dal.page_size = c.dal.cryptobox_parameters.page_size;
number_of_shards = c.dal.cryptobox_parameters.number_of_shards;
slot_size = c.dal.cryptobox_parameters.slot_size;
redundancy_factor = c.dal.cryptobox_parameters.redundancy_factor;
}
in
let dal =
Constants_parametric_repr.
{
feature_enable = c.dal.feature_enable;
number_of_slots = c.dal.number_of_slots;
attestation_lag = c.dal.attestation_lag;
attestation_threshold = c.dal.availability_threshold;
blocks_per_epoch = 32l;
cryptobox_parameters;
}
in
let sc_rollup =
Constants_parametric_repr.
{
enable = true;
arith_pvm_enable = false;
origination_size = c.sc_rollup.origination_size;
challenge_window_in_blocks = c.sc_rollup.challenge_window_in_blocks;
stake_amount = c.sc_rollup.stake_amount;
commitment_period_in_blocks =
c.sc_rollup.commitment_period_in_blocks;
max_lookahead_in_blocks = c.sc_rollup.max_lookahead_in_blocks;
max_active_outbox_levels = c.sc_rollup.max_active_outbox_levels;
max_outbox_messages_per_level =
c.sc_rollup.max_outbox_messages_per_level;
number_of_sections_in_dissection =
c.sc_rollup.number_of_sections_in_dissection;
timeout_period_in_blocks = c.sc_rollup.timeout_period_in_blocks;
max_number_of_stored_cemented_commitments =
c.sc_rollup.max_number_of_stored_cemented_commitments;
max_number_of_parallel_games =
c.sc_rollup.max_number_of_parallel_games;
}
in
let zk_rollup =
Constants_parametric_repr.
{
enable = c.zk_rollup.enable;
origination_size = c.zk_rollup.origination_size;
min_pending_to_process = c.zk_rollup.min_pending_to_process;
}
in
let proof_of_work_threshold =
let mainnet_previous_proof_of_work_threshold =
Int64.(sub (shift_left 1L 46) 1L)
in
let new_proof_of_work_threshold = Int64.(sub (shift_left 1L 48) 1L) in
if
Compare.Int64.(
c.proof_of_work_threshold = mainnet_previous_proof_of_work_threshold)
then new_proof_of_work_threshold
else c.proof_of_work_threshold
in
let constants =
Constants_parametric_repr.
{
preserved_cycles = c.preserved_cycles;
blocks_per_cycle = c.blocks_per_cycle;
blocks_per_commitment = c.blocks_per_commitment;
nonce_revelation_threshold = c.nonce_revelation_threshold;
blocks_per_stake_snapshot = c.blocks_per_stake_snapshot;
cycles_per_voting_period = c.cycles_per_voting_period;
hard_gas_limit_per_operation = c.hard_gas_limit_per_operation;
hard_gas_limit_per_block = c.hard_gas_limit_per_block;
proof_of_work_threshold;
minimal_stake = c.minimal_stake;
vdf_difficulty = c.vdf_difficulty;
seed_nonce_revelation_tip = c.seed_nonce_revelation_tip;
origination_size = c.origination_size;
max_operations_time_to_live = c.max_operations_time_to_live;
baking_reward_fixed_portion = c.baking_reward_fixed_portion;
baking_reward_bonus_per_slot = c.baking_reward_bonus_per_slot;
endorsing_reward_per_slot = c.endorsing_reward_per_slot;
cost_per_byte = c.cost_per_byte;
hard_storage_limit_per_operation =
c.hard_storage_limit_per_operation;
quorum_min = c.quorum_min;
quorum_max = c.quorum_max;
min_proposal_quorum = c.min_proposal_quorum;
liquidity_baking_subsidy = c.liquidity_baking_subsidy;
liquidity_baking_toggle_ema_threshold =
c.liquidity_baking_toggle_ema_threshold;
minimal_block_delay = c.minimal_block_delay;
delay_increment_per_round = c.delay_increment_per_round;
consensus_committee_size = c.consensus_committee_size;
consensus_threshold = c.consensus_threshold;
minimal_participation_ratio = c.minimal_participation_ratio;
max_slashing_period = c.max_slashing_period;
frozen_deposits_percentage = c.frozen_deposits_percentage;
double_baking_punishment = c.double_baking_punishment;
ratio_of_frozen_deposits_slashed_per_double_endorsement =
c.ratio_of_frozen_deposits_slashed_per_double_endorsement;
testnet_dictator = c.testnet_dictator;
initial_seed = c.initial_seed;
cache_script_size = c.cache_script_size;
cache_stake_distribution_cycles = c.cache_stake_distribution_cycles;
cache_sampler_state_cycles = c.cache_sampler_state_cycles;
tx_rollup;
dal;
sc_rollup;
zk_rollup;
}
in
add_constants ctxt constants >>= fun ctxt -> return ctxt)
>>=? fun ctxt ->
prepare ctxt ~level ~predecessor_timestamp:timestamp ~timestamp
>|=? fun ctxt -> (previous_proto, ctxt)
let activate ctxt h = Updater.activate (context ctxt) h >|= update_context ctxt
type key = string list
type value = bytes
type tree = Context.tree
module type T =
Raw_context_intf.T
with type root := root
and type key := key
and type value := value
and type tree := tree
let mem ctxt k = Context.mem (context ctxt) k
let mem_tree ctxt k = Context.mem_tree (context ctxt) k
let get ctxt k =
Context.find (context ctxt) k >|= function
| None -> storage_error (Missing_key (k, Get))
| Some v -> ok v
let get_tree ctxt k =
Context.find_tree (context ctxt) k >|= function
| None -> storage_error (Missing_key (k, Get))
| Some v -> ok v
let find ctxt k = Context.find (context ctxt) k
let find_tree ctxt k = Context.find_tree (context ctxt) k
let add ctxt k v = Context.add (context ctxt) k v >|= update_context ctxt
let add_tree ctxt k v =
Context.add_tree (context ctxt) k v >|= update_context ctxt
let init ctxt k v =
Context.mem (context ctxt) k >>= function
| true -> Lwt.return @@ storage_error (Existing_key k)
| _ ->
Context.add (context ctxt) k v >|= fun context ->
ok (update_context ctxt context)
let init_tree ctxt k v : _ tzresult Lwt.t =
Context.mem_tree (context ctxt) k >>= function
| true -> Lwt.return @@ storage_error (Existing_key k)
| _ ->
Context.add_tree (context ctxt) k v >|= fun context ->
ok (update_context ctxt context)
let update ctxt k v =
Context.mem (context ctxt) k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Set))
| _ ->
Context.add (context ctxt) k v >|= fun context ->
ok (update_context ctxt context)
let update_tree ctxt k v =
Context.mem_tree (context ctxt) k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Set))
| _ ->
Context.add_tree (context ctxt) k v >|= fun context ->
ok (update_context ctxt context)
let remove_existing ctxt k =
Context.mem (context ctxt) k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Del))
| _ ->
Context.remove (context ctxt) k >|= fun context ->
ok (update_context ctxt context)
let remove_existing_tree ctxt k =
Context.mem_tree (context ctxt) k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Del))
| _ ->
Context.remove (context ctxt) k >|= fun context ->
ok (update_context ctxt context)
let remove ctxt k = Context.remove (context ctxt) k >|= update_context ctxt
let add_or_remove ctxt k = function
| None -> remove ctxt k
| Some v -> add ctxt k v
let add_or_remove_tree ctxt k = function
| None -> remove ctxt k
| Some v -> add_tree ctxt k v
let list ctxt ?offset ?length k = Context.list (context ctxt) ?offset ?length k
let fold ?depth ctxt k ~order ~init ~f =
Context.fold ?depth (context ctxt) k ~order ~init ~f
let config ctxt = Context.config (context ctxt)
module Proof = Context.Proof
let length ctxt key = Context.length (context ctxt) key
module Tree :
Raw_context_intf.TREE
with type t := t
and type key := key
and type value := value
and type tree := tree = struct
include Context.Tree
let empty ctxt = Context.Tree.empty (context ctxt)
let get t k =
find t k >|= function
| None -> storage_error (Missing_key (k, Get))
| Some v -> ok v
let get_tree t k =
find_tree t k >|= function
| None -> storage_error (Missing_key (k, Get))
| Some v -> ok v
let init t k v =
mem t k >>= function
| true -> Lwt.return @@ storage_error (Existing_key k)
| _ -> add t k v >|= ok
let init_tree t k v =
mem_tree t k >>= function
| true -> Lwt.return @@ storage_error (Existing_key k)
| _ -> add_tree t k v >|= ok
let update t k v =
mem t k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Set))
| _ -> add t k v >|= ok
let update_tree t k v =
mem_tree t k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Set))
| _ -> add_tree t k v >|= ok
let remove_existing t k =
mem t k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Del))
| _ -> remove t k >|= ok
let remove_existing_tree t k =
mem_tree t k >>= function
| false -> Lwt.return @@ storage_error (Missing_key (k, Del))
| _ -> remove t k >|= ok
let add_or_remove t k = function None -> remove t k | Some v -> add t k v
let add_or_remove_tree t k = function
| None -> remove t k
| Some v -> add_tree t k v
end
let verify_tree_proof proof f = Context.verify_tree_proof proof f
let verify_stream_proof proof f = Context.verify_stream_proof proof f
let equal_config = Context.equal_config
let project x = x
let absolute_key _ k = k
let description = Storage_description.create ()
let fold_map_temporary_lazy_storage_ids ctxt f =
f (temporary_lazy_storage_ids ctxt) |> fun (temporary_lazy_storage_ids, x) ->
(update_temporary_lazy_storage_ids ctxt temporary_lazy_storage_ids, x)
let map_temporary_lazy_storage_ids_s ctxt f =
f (temporary_lazy_storage_ids ctxt)
>|= fun (ctxt, temporary_lazy_storage_ids) ->
update_temporary_lazy_storage_ids ctxt temporary_lazy_storage_ids
module Cache = struct
type key = Context.Cache.key
type value = Context.Cache.value = ..
let key_of_identifier = Context.Cache.key_of_identifier
let identifier_of_key = Context.Cache.identifier_of_key
let pp fmt ctxt = Context.Cache.pp fmt (context ctxt)
let find c k = Context.Cache.find (context c) k
let set_cache_layout c layout =
Context.Cache.set_cache_layout (context c) layout >>= fun ctxt ->
Lwt.return (update_context c ctxt)
let update c k v = Context.Cache.update (context c) k v |> update_context c
let sync c cache_nonce =
Context.Cache.sync (context c) ~cache_nonce >>= fun ctxt ->
Lwt.return (update_context c ctxt)
let clear c = Context.Cache.clear (context c) |> update_context c
let list_keys c ~cache_index =
Context.Cache.list_keys (context c) ~cache_index
let key_rank c key = Context.Cache.key_rank (context c) key
let cache_size_limit c ~cache_index =
Context.Cache.cache_size_limit (context c) ~cache_index
let cache_size c ~cache_index =
Context.Cache.cache_size (context c) ~cache_index
let future_cache_expectation c ~time_in_blocks =
Context.Cache.future_cache_expectation (context c) ~time_in_blocks
|> update_context c
end
let record_non_consensus_operation_hash ctxt operation_hash =
update_non_consensus_operations_rev
ctxt
(operation_hash :: non_consensus_operations_rev ctxt)
let non_consensus_operations ctxt = List.rev (non_consensus_operations_rev ctxt)
let record_dictator_proposal_seen ctxt = update_dictator_proposal_seen ctxt true
let dictator_proposal_seen ctxt = dictator_proposal_seen ctxt
let init_sampler_for_cycle ctxt cycle seed state =
let map = sampler_state ctxt in
if Cycle_repr.Map.mem cycle map then error (Sampler_already_set cycle)
else
let map = Cycle_repr.Map.add cycle (seed, state) map in
let ctxt = update_sampler_state ctxt map in
ok ctxt
let sampler_for_cycle ~read ctxt cycle =
let map = sampler_state ctxt in
match Cycle_repr.Map.find cycle map with
| Some (seed, state) -> return (ctxt, seed, state)
| None ->
read ctxt >>=? fun (seed, state) ->
let map = Cycle_repr.Map.add cycle (seed, state) map in
let ctxt = update_sampler_state ctxt map in
return (ctxt, seed, state)
let stake_distribution_for_current_cycle ctxt =
match ctxt.back.stake_distribution_for_current_cycle with
| None -> error Stake_distribution_not_set
| Some s -> ok s
let init_stake_distribution_for_current_cycle ctxt
stake_distribution_for_current_cycle =
update_back
ctxt
{
ctxt.back with
stake_distribution_for_current_cycle =
Some stake_distribution_for_current_cycle;
}
module Internal_for_tests = struct
let add_level ctxt l =
let new_level = Level_repr.Internal_for_tests.add_level ctxt.back.level l in
let new_back = {ctxt.back with level = new_level} in
{ctxt with back = new_back}
let add_cycles ctxt l =
let blocks_per_cycle = Int32.to_int (constants ctxt).blocks_per_cycle in
let new_level =
Level_repr.Internal_for_tests.add_cycles
~blocks_per_cycle
ctxt.back.level
l
in
let new_back = {ctxt.back with level = new_level} in
{ctxt with back = new_back}
end
module type CONSENSUS = sig
type t
type 'value slot_map
type slot_set
type slot
type round
type consensus_pk
val allowed_endorsements : t -> (consensus_pk * int) slot_map option
val allowed_preendorsements : t -> (consensus_pk * int) slot_map option
type error += Slot_map_not_found of {loc : string}
val current_endorsement_power : t -> int
val initialize_consensus_operation :
t ->
allowed_endorsements:(consensus_pk * int) slot_map option ->
allowed_preendorsements:(consensus_pk * int) slot_map option ->
t
val record_endorsement : t -> initial_slot:slot -> power:int -> t tzresult
val record_preendorsement :
t -> initial_slot:slot -> power:int -> round -> t tzresult
val endorsements_seen : t -> slot_set
val get_preendorsements_quorum_round : t -> round option
val set_preendorsements_quorum_round : t -> round -> t
val locked_round_evidence : t -> (round * int) option
val set_endorsement_branch : t -> Block_hash.t * Block_payload_hash.t -> t
val endorsement_branch : t -> (Block_hash.t * Block_payload_hash.t) option
end
module Consensus :
CONSENSUS
with type t := t
and type slot := Slot_repr.t
and type 'a slot_map := 'a Slot_repr.Map.t
and type slot_set := Slot_repr.Set.t
and type round := Round_repr.t
and type consensus_pk := consensus_pk = struct
let[@inline] allowed_endorsements ctxt =
ctxt.back.consensus.allowed_endorsements
let[@inline] allowed_preendorsements ctxt =
ctxt.back.consensus.allowed_preendorsements
let[@inline] current_endorsement_power ctxt =
ctxt.back.consensus.current_endorsement_power
let[@inline] get_preendorsements_quorum_round ctxt =
ctxt.back.consensus.preendorsements_quorum_round
let[@inline] locked_round_evidence ctxt =
Raw_consensus.locked_round_evidence ctxt.back.consensus
let[@inline] update_consensus_with ctxt f =
{ctxt with back = {ctxt.back with consensus = f ctxt.back.consensus}}
let[@inline] update_consensus_with_tzresult ctxt f =
f ctxt.back.consensus >|? fun consensus ->
{ctxt with back = {ctxt.back with consensus}}
let[@inline] initialize_consensus_operation ctxt ~allowed_endorsements
~allowed_preendorsements =
update_consensus_with
ctxt
(Raw_consensus.initialize_with_endorsements_and_preendorsements
~allowed_endorsements
~allowed_preendorsements)
let[@inline] record_preendorsement ctxt ~initial_slot ~power round =
update_consensus_with_tzresult
ctxt
(Raw_consensus.record_preendorsement ~initial_slot ~power round)
let[@inline] record_endorsement ctxt ~initial_slot ~power =
update_consensus_with_tzresult
ctxt
(Raw_consensus.record_endorsement ~initial_slot ~power)
let[@inline] endorsements_seen ctxt = ctxt.back.consensus.endorsements_seen
let[@inline] set_preendorsements_quorum_round ctxt round =
update_consensus_with
ctxt
(Raw_consensus.set_preendorsements_quorum_round round)
let[@inline] endorsement_branch ctxt =
Raw_consensus.endorsement_branch ctxt.back.consensus
let[@inline] set_endorsement_branch ctxt branch =
update_consensus_with ctxt (fun ctxt ->
Raw_consensus.set_endorsement_branch ctxt branch)
type error += Slot_map_not_found of {loc : string}
let () =
register_error_kind
`Permanent
~id:"raw_context.consensus.slot_map_not_found"
~title:"Slot map not found"
~description:"Pre-computed map by first slot not found."
Data_encoding.(obj1 (req "loc" (string Plain)))
(function Slot_map_not_found {loc} -> Some loc | _ -> None)
(fun loc -> Slot_map_not_found {loc})
end
module Tx_rollup = struct
let add_message ctxt rollup message =
let root = ref Tx_rollup_inbox_repr.Merkle.(root empty) in
let updater element =
let tree =
Option.value element ~default:Tx_rollup_inbox_repr.Merkle.(empty)
in
let tree = Tx_rollup_inbox_repr.Merkle.add_message tree message in
root := Tx_rollup_inbox_repr.Merkle.root tree ;
Some tree
in
let map =
Tx_rollup_repr.Map.update
rollup
updater
ctxt.back.tx_rollup_current_messages
in
let back = {ctxt.back with tx_rollup_current_messages = map} in
({ctxt with back}, !root)
end
module Sc_rollup_in_memory_inbox = struct
let current_messages ctxt = ctxt.back.sc_rollup_current_messages
let set_current_messages ctxt witness =
{ctxt with back = {ctxt.back with sc_rollup_current_messages = witness}}
end
module Dal = struct
type cryptobox = Dal.t
let make ctxt =
let open Result_syntax in
let Constants_parametric_repr.{dal = {cryptobox_parameters; _}; _} =
ctxt.back.constants
in
match Dal.make cryptobox_parameters with
| Ok cryptobox -> return cryptobox
| Error (`Fail explanation) ->
error (Dal_errors_repr.Dal_cryptobox_error {explanation})
let number_of_slots ctxt = ctxt.back.constants.dal.number_of_slots
let record_attested_shards ctxt attestation shards =
let dal_attestation_slot_accountability =
Dal_attestation_repr.Accountability.record_attested_shards
ctxt.back.dal_attestation_slot_accountability
attestation
shards
in
{ctxt with back = {ctxt.back with dal_attestation_slot_accountability}}
let ctxt =
match
Dal_slot_repr.Slot_market.register
ctxt.back.dal_slot_fee_market
slot_header
with
| None ->
let length =
Dal_slot_repr.Slot_market.length ctxt.back.dal_slot_fee_market
in
error
(Dal_errors_repr.Dal_register_invalid_slot_header
{length; slot_header})
| Some (dal_slot_fee_market, updated) ->
if not updated then
error
(Dal_errors_repr.Dal_publish_slot_header_duplicate {slot_header})
else ok {ctxt with back = {ctxt.back with dal_slot_fee_market}}
let candidates ctxt =
Dal_slot_repr.Slot_market.candidates ctxt.back.dal_slot_fee_market
let is_slot_index_attested ctxt =
let threshold =
ctxt.back.constants.Constants_parametric_repr.dal.attestation_threshold
in
let number_of_shards =
ctxt.back.constants.Constants_parametric_repr.dal.cryptobox_parameters
.number_of_shards
in
Dal_attestation_repr.Accountability.is_slot_attested
ctxt.back.dal_attestation_slot_accountability
~threshold
~number_of_shards
type committee = dal_committee = {
pkh_to_shards :
(Dal_attestation_repr.shard_index * int) Signature.Public_key_hash.Map.t;
shard_to_pkh : Signature.Public_key_hash.t Dal_attestation_repr.Shard_map.t;
}
let compute_committee ctxt pkh_from_tenderbake_slot =
let Constants_parametric_repr.
{
dal = {cryptobox_parameters = {number_of_shards; _}; _};
consensus_committee_size;
_;
} =
ctxt.back.constants
in
let update_committee committee pkh ~slot_index ~power =
{
pkh_to_shards =
Signature.Public_key_hash.Map.update
pkh
(function
| None -> Some (slot_index, power)
| Some (initial_shard_index, old_power) ->
Some (initial_shard_index, old_power + power))
committee.pkh_to_shards;
shard_to_pkh =
List.fold_left
(fun shard_to_pkh slot ->
Dal_attestation_repr.Shard_map.add slot pkh shard_to_pkh)
committee.shard_to_pkh
Misc.(slot_index --> (slot_index + (power - 1)));
}
in
let rec compute_power index committee =
if Compare.Int.(index < 0) then return committee
else
let shard_index = index mod consensus_committee_size in
Slot_repr.of_int shard_index >>?= fun slot ->
pkh_from_tenderbake_slot slot >>=? fun (_ctxt, pkh) ->
let slot_index = Slot_repr.to_int slot in
let committee = update_committee committee pkh ~slot_index ~power:1 in
compute_power (index - 1) committee
in
compute_power (number_of_shards - 1) empty_dal_committee
>>=? fun unordered_committee ->
let dal_committee =
Signature.Public_key_hash.Map.fold
(fun pkh (_, power) (total_power, committee) ->
let committee =
update_committee committee pkh ~slot_index:total_power ~power
in
let new_total_power = total_power + power in
(new_total_power, committee))
unordered_committee.pkh_to_shards
(0, empty_dal_committee)
|> snd
in
return dal_committee
let init_committee ctxt committee =
{ctxt with back = {ctxt.back with dal_committee = committee}}
let shards_of_attestor ctxt ~attestor:pkh =
let rec make acc (initial_shard_index, power) =
if Compare.Int.(power <= 0) then List.rev acc
else make (initial_shard_index :: acc) (initial_shard_index + 1, power - 1)
in
Signature.Public_key_hash.Map.find_opt
pkh
ctxt.back.dal_committee.pkh_to_shards
|> Option.map (fun pre_shards -> make [] pre_shards)
end
type local_context = {
tree : tree;
path : key;
remaining_operation_gas : Gas_limit_repr.Arith.fp;
unlimited_operation_gas : bool;
}
let with_local_context ctxt key f =
(find_tree ctxt key >|= function None -> Tree.empty ctxt | Some tree -> tree)
>>= fun tree ->
let local_ctxt =
{
tree;
path = key;
remaining_operation_gas = remaining_operation_gas ctxt;
unlimited_operation_gas = unlimited_operation_gas ctxt;
}
in
f local_ctxt >>=? fun (local_ctxt, res) ->
add_tree ctxt key local_ctxt.tree >|= fun ctxt ->
update_remaining_operation_gas ctxt local_ctxt.remaining_operation_gas
|> fun ctxt ->
update_unlimited_operation_gas ctxt local_ctxt.unlimited_operation_gas
|> fun ctxt -> ok (ctxt, res)
module Local_context : sig
include
Raw_context_intf.VIEW
with type t = local_context
and type key := key
and type value := value
and type tree := tree
val consume_gas :
local_context -> Gas_limit_repr.cost -> local_context tzresult
val absolute_key : local_context -> key -> key
end = struct
type t = local_context
let consume_gas local cost =
match Gas_limit_repr.raw_consume local.remaining_operation_gas cost with
| Some gas_counter -> Ok {local with remaining_operation_gas = gas_counter}
| None ->
if local.unlimited_operation_gas then ok local
else error Operation_quota_exceeded
let tree local = local.tree
let update_root_tree local tree = {local with tree}
let absolute_key local key = local.path @ key
let find local = Tree.find (tree local)
let find_tree local = Tree.find_tree (tree local)
let mem local = Tree.mem (tree local)
let mem_tree local = Tree.mem_tree (tree local)
let get local = Tree.get (tree local)
let get_tree local = Tree.get_tree (tree local)
let update local key b =
Tree.update (tree local) key b >|=? update_root_tree local
let update_tree local key b =
Tree.update_tree (tree local) key b >|=? update_root_tree local
let init local key b =
Tree.init (tree local) key b >|=? update_root_tree local
let init_tree local key t =
Tree.init_tree (tree local) key t >|=? update_root_tree local
let add local i b = Tree.add (tree local) i b >|= update_root_tree local
let add_tree local i t =
Tree.add_tree (tree local) i t >|= update_root_tree local
let remove local i = Tree.remove (tree local) i >|= update_root_tree local
let remove_existing local key =
Tree.remove_existing (tree local) key >|=? update_root_tree local
let remove_existing_tree local key =
Tree.remove_existing_tree (tree local) key >|=? update_root_tree local
let add_or_remove local key vopt =
Tree.add_or_remove (tree local) key vopt >|= update_root_tree local
let add_or_remove_tree local key topt =
Tree.add_or_remove_tree (tree local) key topt >|= update_root_tree local
let fold ?depth local key ~order ~init ~f =
Tree.fold ?depth (tree local) key ~order ~init ~f
let list local ?offset ?length key =
Tree.list (tree local) ?offset ?length key
let config local = Tree.config (tree local)
let length local i = Tree.length (tree local) i
end