@aztec/protocol-contracts 1.2.1 → 2.0.0-nightly.20250814

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (73) hide show
  1. package/README.md +2 -2
  2. package/artifacts/AuthRegistry.json +778 -680
  3. package/artifacts/ContractClassRegistry.json +8374 -0
  4. package/artifacts/ContractInstanceRegistry.json +3636 -0
  5. package/artifacts/FeeJuice.json +729 -647
  6. package/artifacts/MultiCallEntrypoint.json +670 -544
  7. package/artifacts/Router.json +1204 -932
  8. package/dest/{class-registerer/contract_class_registered_event.d.ts → class-registry/contract_class_published_event.d.ts} +5 -5
  9. package/dest/class-registry/contract_class_published_event.d.ts.map +1 -0
  10. package/dest/{class-registerer/contract_class_registered_event.js → class-registry/contract_class_published_event.js} +5 -5
  11. package/dest/class-registry/index.d.ts +8 -0
  12. package/dest/class-registry/index.d.ts.map +1 -0
  13. package/dest/{class-registerer → class-registry}/index.js +6 -6
  14. package/dest/{class-registerer → class-registry}/lazy.d.ts +3 -3
  15. package/dest/class-registry/lazy.d.ts.map +1 -0
  16. package/dest/{class-registerer → class-registry}/lazy.js +7 -7
  17. package/dest/{class-registerer → class-registry}/private_function_broadcasted_event.d.ts +1 -1
  18. package/dest/class-registry/private_function_broadcasted_event.d.ts.map +1 -0
  19. package/dest/{class-registerer → class-registry}/private_function_broadcasted_event.js +3 -3
  20. package/dest/{class-registerer → class-registry}/utility_function_broadcasted_event.d.ts +1 -1
  21. package/dest/class-registry/utility_function_broadcasted_event.d.ts.map +1 -0
  22. package/dest/{class-registerer → class-registry}/utility_function_broadcasted_event.js +3 -3
  23. package/dest/{instance-deployer/contract_instance_deployed_event.d.ts → instance-registry/contract_instance_published_event.d.ts} +5 -5
  24. package/dest/instance-registry/contract_instance_published_event.d.ts.map +1 -0
  25. package/dest/{instance-deployer/contract_instance_deployed_event.js → instance-registry/contract_instance_published_event.js} +5 -5
  26. package/dest/{instance-deployer → instance-registry}/contract_instance_updated_event.d.ts +1 -1
  27. package/dest/{instance-deployer → instance-registry}/contract_instance_updated_event.d.ts.map +1 -1
  28. package/dest/{instance-deployer → instance-registry}/contract_instance_updated_event.js +3 -3
  29. package/dest/{instance-deployer → instance-registry}/index.d.ts +3 -3
  30. package/dest/instance-registry/index.d.ts.map +1 -0
  31. package/dest/{instance-deployer → instance-registry}/index.js +5 -5
  32. package/dest/{instance-deployer → instance-registry}/lazy.d.ts +3 -3
  33. package/dest/{instance-deployer → instance-registry}/lazy.d.ts.map +1 -1
  34. package/dest/{instance-deployer → instance-registry}/lazy.js +7 -7
  35. package/dest/make_protocol_contract.js +2 -2
  36. package/dest/protocol_contract_data.d.ts +4 -4
  37. package/dest/protocol_contract_data.d.ts.map +1 -1
  38. package/dest/protocol_contract_data.js +14 -14
  39. package/dest/provider/bundle.js +4 -4
  40. package/dest/provider/lazy.js +6 -6
  41. package/dest/scripts/generate_data.js +8 -8
  42. package/dest/tests/fixtures.d.ts +2 -2
  43. package/dest/tests/fixtures.d.ts.map +1 -1
  44. package/dest/tests/fixtures.js +4 -4
  45. package/package.json +6 -6
  46. package/src/class-registry/__snapshots__/README.md +9 -0
  47. package/src/{class-registerer/contract_class_registered_event.ts → class-registry/contract_class_published_event.ts} +7 -7
  48. package/src/{class-registerer → class-registry}/index.ts +6 -8
  49. package/src/{class-registerer → class-registry}/lazy.ts +7 -7
  50. package/src/{class-registerer → class-registry}/private_function_broadcasted_event.ts +4 -4
  51. package/src/{class-registerer → class-registry}/utility_function_broadcasted_event.ts +4 -4
  52. package/src/instance-registry/__snapshots__/README.md +9 -0
  53. package/src/{instance-deployer/contract_instance_deployed_event.ts → instance-registry/contract_instance_published_event.ts} +6 -6
  54. package/src/{instance-deployer → instance-registry}/contract_instance_updated_event.ts +4 -4
  55. package/src/{instance-deployer → instance-registry}/index.ts +6 -6
  56. package/src/{instance-deployer → instance-registry}/lazy.ts +7 -7
  57. package/src/make_protocol_contract.ts +2 -2
  58. package/src/protocol_contract_data.ts +14 -14
  59. package/src/provider/bundle.ts +4 -4
  60. package/src/provider/lazy.ts +6 -6
  61. package/src/tests/fixtures.ts +4 -4
  62. package/artifacts/ContractClassRegisterer.json +0 -7806
  63. package/artifacts/ContractInstanceDeployer.json +0 -3525
  64. package/dest/class-registerer/contract_class_registered_event.d.ts.map +0 -1
  65. package/dest/class-registerer/index.d.ts +0 -8
  66. package/dest/class-registerer/index.d.ts.map +0 -1
  67. package/dest/class-registerer/lazy.d.ts.map +0 -1
  68. package/dest/class-registerer/private_function_broadcasted_event.d.ts.map +0 -1
  69. package/dest/class-registerer/utility_function_broadcasted_event.d.ts.map +0 -1
  70. package/dest/instance-deployer/contract_instance_deployed_event.d.ts.map +0 -1
  71. package/dest/instance-deployer/index.d.ts.map +0 -1
  72. /package/artifacts/{ContractClassRegisterer.d.json.ts → ContractClassRegistry.d.json.ts} +0 -0
  73. /package/artifacts/{ContractInstanceDeployer.d.json.ts → ContractInstanceRegistry.d.json.ts} +0 -0
package/artifacts/MultiCallEntrypoint.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "transpiled": true,
3
- "noir_version": "1.0.0-beta.7+0000000000000000000000000000000000000000",
3
+ "noir_version": "1.0.0-beta.10+0000000000000000000000000000000000000000",
4
4
  "name": "MultiCallEntrypoint",
5
5
  "functions": [
6
6
  {
@@ -83,7 +83,7 @@
83
83
  "name": "historical_header",
84
84
  "type": {
85
85
  "kind": "struct",
86
- "path": "aztec::protocol_types::block_header::BlockHeader",
86
+ "path": "aztec::protocol_types::abis::block_header::BlockHeader",
87
87
  "fields": [
88
88
  {
89
89
  "name": "last_archive",
@@ -139,7 +139,7 @@
139
139
  "name": "state",
140
140
  "type": {
141
141
  "kind": "struct",
142
- "path": "aztec::protocol_types::state_reference::StateReference",
142
+ "path": "aztec::protocol_types::abis::state_reference::StateReference",
143
143
  "fields": [
144
144
  {
145
145
  "name": "l1_to_l2_message_tree",
@@ -168,7 +168,7 @@
168
168
  "name": "partial",
169
169
  "type": {
170
170
  "kind": "struct",
171
- "path": "aztec::protocol_types::partial_state_reference::PartialStateReference",
171
+ "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference",
172
172
  "fields": [
173
173
  {
174
174
  "name": "note_hash_tree",
@@ -362,7 +362,7 @@
362
362
  "name": "tx_context",
363
363
  "type": {
364
364
  "kind": "struct",
365
- "path": "aztec::protocol_types::transaction::tx_context::TxContext",
365
+ "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext",
366
366
  "fields": [
367
367
  {
368
368
  "name": "chain_id",
@@ -676,351 +676,450 @@
676
676
  {
677
677
  "name": "include_by_timestamp",
678
678
  "type": {
679
- "kind": "struct",
680
- "path": "aztec::protocol_types::abis::include_by_timestamp::IncludeByTimestamp",
681
- "fields": [
682
- {
683
- "name": "_opt",
684
- "type": {
685
- "kind": "struct",
686
- "path": "std::option::Option",
687
- "fields": [
688
- {
689
- "name": "_is_some",
690
- "type": {
691
- "kind": "boolean"
692
- }
693
- },
694
- {
695
- "name": "_value",
696
- "type": {
697
- "kind": "integer",
698
- "sign": "unsigned",
699
- "width": 64
700
- }
701
- }
702
- ]
703
- }
704
- }
705
- ]
679
+ "kind": "integer",
680
+ "sign": "unsigned",
681
+ "width": 64
706
682
  }
707
683
  },
708
684
  {
709
685
  "name": "note_hash_read_requests",
710
686
  "type": {
711
- "kind": "array",
712
- "length": 16,
713
- "type": {
714
- "kind": "struct",
715
- "path": "aztec::protocol_types::abis::read_request::ReadRequest",
716
- "fields": [
717
- {
718
- "name": "value",
719
- "type": {
720
- "kind": "field"
721
- }
722
- },
723
- {
724
- "name": "counter",
687
+ "kind": "struct",
688
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
689
+ "fields": [
690
+ {
691
+ "name": "array",
692
+ "type": {
693
+ "kind": "array",
694
+ "length": 16,
725
695
  "type": {
726
- "kind": "integer",
727
- "sign": "unsigned",
728
- "width": 32
696
+ "kind": "struct",
697
+ "path": "aztec::protocol_types::abis::read_request::ReadRequest",
698
+ "fields": [
699
+ {
700
+ "name": "value",
701
+ "type": {
702
+ "kind": "field"
703
+ }
704
+ },
705
+ {
706
+ "name": "counter",
707
+ "type": {
708
+ "kind": "integer",
709
+ "sign": "unsigned",
710
+ "width": 32
711
+ }
712
+ }
713
+ ]
729
714
  }
730
715
  }
731
- ]
732
- }
716
+ },
717
+ {
718
+ "name": "length",
719
+ "type": {
720
+ "kind": "integer",
721
+ "sign": "unsigned",
722
+ "width": 32
723
+ }
724
+ }
725
+ ]
733
726
  }
734
727
  },
735
728
  {
736
729
  "name": "nullifier_read_requests",
737
730
  "type": {
738
- "kind": "array",
739
- "length": 16,
740
- "type": {
741
- "kind": "struct",
742
- "path": "aztec::protocol_types::abis::read_request::ReadRequest",
743
- "fields": [
744
- {
745
- "name": "value",
746
- "type": {
747
- "kind": "field"
748
- }
749
- },
750
- {
751
- "name": "counter",
731
+ "kind": "struct",
732
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
733
+ "fields": [
734
+ {
735
+ "name": "array",
736
+ "type": {
737
+ "kind": "array",
738
+ "length": 16,
752
739
  "type": {
753
- "kind": "integer",
754
- "sign": "unsigned",
755
- "width": 32
740
+ "kind": "struct",
741
+ "path": "aztec::protocol_types::abis::read_request::ReadRequest",
742
+ "fields": [
743
+ {
744
+ "name": "value",
745
+ "type": {
746
+ "kind": "field"
747
+ }
748
+ },
749
+ {
750
+ "name": "counter",
751
+ "type": {
752
+ "kind": "integer",
753
+ "sign": "unsigned",
754
+ "width": 32
755
+ }
756
+ }
757
+ ]
756
758
  }
757
759
  }
758
- ]
759
- }
760
+ },
761
+ {
762
+ "name": "length",
763
+ "type": {
764
+ "kind": "integer",
765
+ "sign": "unsigned",
766
+ "width": 32
767
+ }
768
+ }
769
+ ]
760
770
  }
761
771
  },
762
772
  {
763
773
  "name": "key_validation_requests_and_generators",
764
774
  "type": {
765
- "kind": "array",
766
- "length": 16,
767
- "type": {
768
- "kind": "struct",
769
- "path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_generator::KeyValidationRequestAndGenerator",
770
- "fields": [
771
- {
772
- "name": "request",
775
+ "kind": "struct",
776
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
777
+ "fields": [
778
+ {
779
+ "name": "array",
780
+ "type": {
781
+ "kind": "array",
782
+ "length": 16,
773
783
  "type": {
774
784
  "kind": "struct",
775
- "path": "aztec::protocol_types::abis::validation_requests::key_validation_request::KeyValidationRequest",
785
+ "path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_generator::KeyValidationRequestAndGenerator",
776
786
  "fields": [
777
787
  {
778
- "name": "pk_m",
788
+ "name": "request",
779
789
  "type": {
780
790
  "kind": "struct",
781
- "path": "std::embedded_curve_ops::EmbeddedCurvePoint",
791
+ "path": "aztec::protocol_types::abis::validation_requests::key_validation_request::KeyValidationRequest",
782
792
  "fields": [
783
793
  {
784
- "name": "x",
794
+ "name": "pk_m",
785
795
  "type": {
786
- "kind": "field"
796
+ "kind": "struct",
797
+ "path": "std::embedded_curve_ops::EmbeddedCurvePoint",
798
+ "fields": [
799
+ {
800
+ "name": "x",
801
+ "type": {
802
+ "kind": "field"
803
+ }
804
+ },
805
+ {
806
+ "name": "y",
807
+ "type": {
808
+ "kind": "field"
809
+ }
810
+ },
811
+ {
812
+ "name": "is_infinite",
813
+ "type": {
814
+ "kind": "boolean"
815
+ }
816
+ }
817
+ ]
787
818
  }
788
819
  },
789
820
  {
790
- "name": "y",
821
+ "name": "sk_app",
791
822
  "type": {
792
823
  "kind": "field"
793
824
  }
794
- },
795
- {
796
- "name": "is_infinite",
797
- "type": {
798
- "kind": "boolean"
799
- }
800
825
  }
801
826
  ]
802
827
  }
803
828
  },
804
829
  {
805
- "name": "sk_app",
830
+ "name": "sk_app_generator",
806
831
  "type": {
807
832
  "kind": "field"
808
833
  }
809
834
  }
810
835
  ]
811
836
  }
812
- },
813
- {
814
- "name": "sk_app_generator",
815
- "type": {
816
- "kind": "field"
817
- }
818
837
  }
819
- ]
820
- }
838
+ },
839
+ {
840
+ "name": "length",
841
+ "type": {
842
+ "kind": "integer",
843
+ "sign": "unsigned",
844
+ "width": 32
845
+ }
846
+ }
847
+ ]
821
848
  }
822
849
  },
823
850
  {
824
851
  "name": "note_hashes",
825
852
  "type": {
826
- "kind": "array",
827
- "length": 16,
828
- "type": {
829
- "kind": "struct",
830
- "path": "aztec::protocol_types::abis::note_hash::NoteHash",
831
- "fields": [
832
- {
833
- "name": "value",
834
- "type": {
835
- "kind": "field"
836
- }
837
- },
838
- {
839
- "name": "counter",
853
+ "kind": "struct",
854
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
855
+ "fields": [
856
+ {
857
+ "name": "array",
858
+ "type": {
859
+ "kind": "array",
860
+ "length": 16,
840
861
  "type": {
841
- "kind": "integer",
842
- "sign": "unsigned",
843
- "width": 32
862
+ "kind": "struct",
863
+ "path": "aztec::protocol_types::abis::note_hash::NoteHash",
864
+ "fields": [
865
+ {
866
+ "name": "value",
867
+ "type": {
868
+ "kind": "field"
869
+ }
870
+ },
871
+ {
872
+ "name": "counter",
873
+ "type": {
874
+ "kind": "integer",
875
+ "sign": "unsigned",
876
+ "width": 32
877
+ }
878
+ }
879
+ ]
844
880
  }
845
881
  }
846
- ]
847
- }
882
+ },
883
+ {
884
+ "name": "length",
885
+ "type": {
886
+ "kind": "integer",
887
+ "sign": "unsigned",
888
+ "width": 32
889
+ }
890
+ }
891
+ ]
848
892
  }
849
893
  },
850
894
  {
851
895
  "name": "nullifiers",
852
896
  "type": {
853
- "kind": "array",
854
- "length": 16,
855
- "type": {
856
- "kind": "struct",
857
- "path": "aztec::protocol_types::abis::nullifier::Nullifier",
858
- "fields": [
859
- {
860
- "name": "value",
861
- "type": {
862
- "kind": "field"
863
- }
864
- },
865
- {
866
- "name": "counter",
867
- "type": {
868
- "kind": "integer",
869
- "sign": "unsigned",
870
- "width": 32
871
- }
872
- },
873
- {
874
- "name": "note_hash",
897
+ "kind": "struct",
898
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
899
+ "fields": [
900
+ {
901
+ "name": "array",
902
+ "type": {
903
+ "kind": "array",
904
+ "length": 16,
875
905
  "type": {
876
- "kind": "field"
906
+ "kind": "struct",
907
+ "path": "aztec::protocol_types::abis::nullifier::Nullifier",
908
+ "fields": [
909
+ {
910
+ "name": "value",
911
+ "type": {
912
+ "kind": "field"
913
+ }
914
+ },
915
+ {
916
+ "name": "counter",
917
+ "type": {
918
+ "kind": "integer",
919
+ "sign": "unsigned",
920
+ "width": 32
921
+ }
922
+ },
923
+ {
924
+ "name": "note_hash",
925
+ "type": {
926
+ "kind": "field"
927
+ }
928
+ }
929
+ ]
877
930
  }
878
931
  }
879
- ]
880
- }
932
+ },
933
+ {
934
+ "name": "length",
935
+ "type": {
936
+ "kind": "integer",
937
+ "sign": "unsigned",
938
+ "width": 32
939
+ }
940
+ }
941
+ ]
881
942
  }
882
943
  },
883
944
  {
884
945
  "name": "private_call_requests",
885
946
  "type": {
886
- "kind": "array",
887
- "length": 5,
888
- "type": {
889
- "kind": "struct",
890
- "path": "aztec::protocol_types::abis::private_call_request::PrivateCallRequest",
891
- "fields": [
892
- {
893
- "name": "call_context",
947
+ "kind": "struct",
948
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
949
+ "fields": [
950
+ {
951
+ "name": "array",
952
+ "type": {
953
+ "kind": "array",
954
+ "length": 5,
894
955
  "type": {
895
956
  "kind": "struct",
896
- "path": "aztec::protocol_types::abis::call_context::CallContext",
957
+ "path": "aztec::protocol_types::abis::private_call_request::PrivateCallRequest",
897
958
  "fields": [
898
959
  {
899
- "name": "msg_sender",
960
+ "name": "call_context",
900
961
  "type": {
901
962
  "kind": "struct",
902
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
963
+ "path": "aztec::protocol_types::abis::call_context::CallContext",
903
964
  "fields": [
904
965
  {
905
- "name": "inner",
966
+ "name": "msg_sender",
967
+ "type": {
968
+ "kind": "struct",
969
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
970
+ "fields": [
971
+ {
972
+ "name": "inner",
973
+ "type": {
974
+ "kind": "field"
975
+ }
976
+ }
977
+ ]
978
+ }
979
+ },
980
+ {
981
+ "name": "contract_address",
982
+ "type": {
983
+ "kind": "struct",
984
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
985
+ "fields": [
986
+ {
987
+ "name": "inner",
988
+ "type": {
989
+ "kind": "field"
990
+ }
991
+ }
992
+ ]
993
+ }
994
+ },
995
+ {
996
+ "name": "function_selector",
997
+ "type": {
998
+ "kind": "struct",
999
+ "path": "aztec::protocol_types::abis::function_selector::FunctionSelector",
1000
+ "fields": [
1001
+ {
1002
+ "name": "inner",
1003
+ "type": {
1004
+ "kind": "integer",
1005
+ "sign": "unsigned",
1006
+ "width": 32
1007
+ }
1008
+ }
1009
+ ]
1010
+ }
1011
+ },
1012
+ {
1013
+ "name": "is_static_call",
906
1014
  "type": {
907
- "kind": "field"
1015
+ "kind": "boolean"
908
1016
  }
909
1017
  }
910
1018
  ]
911
1019
  }
912
1020
  },
913
1021
  {
914
- "name": "contract_address",
1022
+ "name": "args_hash",
915
1023
  "type": {
916
- "kind": "struct",
917
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
918
- "fields": [
919
- {
920
- "name": "inner",
921
- "type": {
922
- "kind": "field"
923
- }
924
- }
925
- ]
1024
+ "kind": "field"
926
1025
  }
927
1026
  },
928
1027
  {
929
- "name": "function_selector",
1028
+ "name": "returns_hash",
930
1029
  "type": {
931
- "kind": "struct",
932
- "path": "aztec::protocol_types::abis::function_selector::FunctionSelector",
933
- "fields": [
934
- {
935
- "name": "inner",
936
- "type": {
937
- "kind": "integer",
938
- "sign": "unsigned",
939
- "width": 32
940
- }
941
- }
942
- ]
1030
+ "kind": "field"
1031
+ }
1032
+ },
1033
+ {
1034
+ "name": "start_side_effect_counter",
1035
+ "type": {
1036
+ "kind": "integer",
1037
+ "sign": "unsigned",
1038
+ "width": 32
943
1039
  }
944
1040
  },
945
1041
  {
946
- "name": "is_static_call",
1042
+ "name": "end_side_effect_counter",
947
1043
  "type": {
948
- "kind": "boolean"
1044
+ "kind": "integer",
1045
+ "sign": "unsigned",
1046
+ "width": 32
949
1047
  }
950
1048
  }
951
1049
  ]
952
1050
  }
953
- },
954
- {
955
- "name": "args_hash",
956
- "type": {
957
- "kind": "field"
958
- }
959
- },
960
- {
961
- "name": "returns_hash",
962
- "type": {
963
- "kind": "field"
964
- }
965
- },
966
- {
967
- "name": "start_side_effect_counter",
968
- "type": {
969
- "kind": "integer",
970
- "sign": "unsigned",
971
- "width": 32
972
- }
973
- },
974
- {
975
- "name": "end_side_effect_counter",
976
- "type": {
977
- "kind": "integer",
978
- "sign": "unsigned",
979
- "width": 32
980
- }
981
1051
  }
982
- ]
983
- }
1052
+ },
1053
+ {
1054
+ "name": "length",
1055
+ "type": {
1056
+ "kind": "integer",
1057
+ "sign": "unsigned",
1058
+ "width": 32
1059
+ }
1060
+ }
1061
+ ]
984
1062
  }
985
1063
  },
986
1064
  {
987
1065
  "name": "public_call_requests",
988
1066
  "type": {
989
- "kind": "array",
990
- "length": 16,
991
- "type": {
992
- "kind": "struct",
993
- "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
994
- "fields": [
995
- {
996
- "name": "inner",
1067
+ "kind": "struct",
1068
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
1069
+ "fields": [
1070
+ {
1071
+ "name": "array",
1072
+ "type": {
1073
+ "kind": "array",
1074
+ "length": 16,
997
1075
  "type": {
998
1076
  "kind": "struct",
999
- "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest",
1077
+ "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
1000
1078
  "fields": [
1001
1079
  {
1002
- "name": "msg_sender",
1080
+ "name": "inner",
1003
1081
  "type": {
1004
1082
  "kind": "struct",
1005
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
1083
+ "path": "aztec::protocol_types::abis::public_call_request::PublicCallRequest",
1006
1084
  "fields": [
1007
1085
  {
1008
- "name": "inner",
1086
+ "name": "msg_sender",
1009
1087
  "type": {
1010
- "kind": "field"
1088
+ "kind": "struct",
1089
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
1090
+ "fields": [
1091
+ {
1092
+ "name": "inner",
1093
+ "type": {
1094
+ "kind": "field"
1095
+ }
1096
+ }
1097
+ ]
1011
1098
  }
1012
- }
1013
- ]
1014
- }
1015
- },
1016
- {
1017
- "name": "contract_address",
1018
- "type": {
1019
- "kind": "struct",
1020
- "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
1021
- "fields": [
1099
+ },
1022
1100
  {
1023
- "name": "inner",
1101
+ "name": "contract_address",
1102
+ "type": {
1103
+ "kind": "struct",
1104
+ "path": "aztec::protocol_types::address::aztec_address::AztecAddress",
1105
+ "fields": [
1106
+ {
1107
+ "name": "inner",
1108
+ "type": {
1109
+ "kind": "field"
1110
+ }
1111
+ }
1112
+ ]
1113
+ }
1114
+ },
1115
+ {
1116
+ "name": "is_static_call",
1117
+ "type": {
1118
+ "kind": "boolean"
1119
+ }
1120
+ },
1121
+ {
1122
+ "name": "calldata_hash",
1024
1123
  "type": {
1025
1124
  "kind": "field"
1026
1125
  }
@@ -1029,30 +1128,26 @@
1029
1128
  }
1030
1129
  },
1031
1130
  {
1032
- "name": "is_static_call",
1033
- "type": {
1034
- "kind": "boolean"
1035
- }
1036
- },
1037
- {
1038
- "name": "calldata_hash",
1131
+ "name": "counter",
1039
1132
  "type": {
1040
- "kind": "field"
1133
+ "kind": "integer",
1134
+ "sign": "unsigned",
1135
+ "width": 32
1041
1136
  }
1042
1137
  }
1043
1138
  ]
1044
1139
  }
1045
- },
1046
- {
1047
- "name": "counter",
1048
- "type": {
1049
- "kind": "integer",
1050
- "sign": "unsigned",
1051
- "width": 32
1052
- }
1053
1140
  }
1054
- ]
1055
- }
1141
+ },
1142
+ {
1143
+ "name": "length",
1144
+ "type": {
1145
+ "kind": "integer",
1146
+ "sign": "unsigned",
1147
+ "width": 32
1148
+ }
1149
+ }
1150
+ ]
1056
1151
  }
1057
1152
  },
1058
1153
  {
@@ -1109,26 +1204,41 @@
1109
1204
  {
1110
1205
  "name": "l2_to_l1_msgs",
1111
1206
  "type": {
1112
- "kind": "array",
1113
- "length": 2,
1114
- "type": {
1115
- "kind": "struct",
1116
- "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
1117
- "fields": [
1118
- {
1119
- "name": "inner",
1207
+ "kind": "struct",
1208
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
1209
+ "fields": [
1210
+ {
1211
+ "name": "array",
1212
+ "type": {
1213
+ "kind": "array",
1214
+ "length": 2,
1120
1215
  "type": {
1121
1216
  "kind": "struct",
1122
- "path": "aztec::protocol_types::messaging::l2_to_l1_message::L2ToL1Message",
1217
+ "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
1123
1218
  "fields": [
1124
1219
  {
1125
- "name": "recipient",
1220
+ "name": "inner",
1126
1221
  "type": {
1127
1222
  "kind": "struct",
1128
- "path": "aztec::protocol_types::address::eth_address::EthAddress",
1223
+ "path": "aztec::protocol_types::messaging::l2_to_l1_message::L2ToL1Message",
1129
1224
  "fields": [
1130
1225
  {
1131
- "name": "inner",
1226
+ "name": "recipient",
1227
+ "type": {
1228
+ "kind": "struct",
1229
+ "path": "aztec::protocol_types::address::eth_address::EthAddress",
1230
+ "fields": [
1231
+ {
1232
+ "name": "inner",
1233
+ "type": {
1234
+ "kind": "field"
1235
+ }
1236
+ }
1237
+ ]
1238
+ }
1239
+ },
1240
+ {
1241
+ "name": "content",
1132
1242
  "type": {
1133
1243
  "kind": "field"
1134
1244
  }
@@ -1137,53 +1247,80 @@
1137
1247
  }
1138
1248
  },
1139
1249
  {
1140
- "name": "content",
1250
+ "name": "counter",
1141
1251
  "type": {
1142
- "kind": "field"
1252
+ "kind": "integer",
1253
+ "sign": "unsigned",
1254
+ "width": 32
1143
1255
  }
1144
1256
  }
1145
1257
  ]
1146
1258
  }
1147
- },
1148
- {
1149
- "name": "counter",
1150
- "type": {
1151
- "kind": "integer",
1152
- "sign": "unsigned",
1153
- "width": 32
1154
- }
1155
1259
  }
1156
- ]
1157
- }
1260
+ },
1261
+ {
1262
+ "name": "length",
1263
+ "type": {
1264
+ "kind": "integer",
1265
+ "sign": "unsigned",
1266
+ "width": 32
1267
+ }
1268
+ }
1269
+ ]
1158
1270
  }
1159
1271
  },
1160
1272
  {
1161
1273
  "name": "private_logs",
1162
1274
  "type": {
1163
- "kind": "array",
1164
- "length": 16,
1165
- "type": {
1166
- "kind": "struct",
1167
- "path": "aztec::protocol_types::abis::private_log::PrivateLogData",
1168
- "fields": [
1169
- {
1170
- "name": "log",
1275
+ "kind": "struct",
1276
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
1277
+ "fields": [
1278
+ {
1279
+ "name": "array",
1280
+ "type": {
1281
+ "kind": "array",
1282
+ "length": 16,
1171
1283
  "type": {
1172
1284
  "kind": "struct",
1173
- "path": "aztec::protocol_types::abis::log::Log",
1285
+ "path": "aztec::protocol_types::abis::private_log::PrivateLogData",
1174
1286
  "fields": [
1175
1287
  {
1176
- "name": "fields",
1288
+ "name": "log",
1177
1289
  "type": {
1178
- "kind": "array",
1179
- "length": 18,
1180
- "type": {
1181
- "kind": "field"
1182
- }
1290
+ "kind": "struct",
1291
+ "path": "aztec::protocol_types::abis::log::Log",
1292
+ "fields": [
1293
+ {
1294
+ "name": "fields",
1295
+ "type": {
1296
+ "kind": "array",
1297
+ "length": 18,
1298
+ "type": {
1299
+ "kind": "field"
1300
+ }
1301
+ }
1302
+ },
1303
+ {
1304
+ "name": "length",
1305
+ "type": {
1306
+ "kind": "integer",
1307
+ "sign": "unsigned",
1308
+ "width": 32
1309
+ }
1310
+ }
1311
+ ]
1312
+ }
1313
+ },
1314
+ {
1315
+ "name": "note_hash_counter",
1316
+ "type": {
1317
+ "kind": "integer",
1318
+ "sign": "unsigned",
1319
+ "width": 32
1183
1320
  }
1184
1321
  },
1185
1322
  {
1186
- "name": "length",
1323
+ "name": "counter",
1187
1324
  "type": {
1188
1325
  "kind": "integer",
1189
1326
  "sign": "unsigned",
@@ -1192,50 +1329,59 @@
1192
1329
  }
1193
1330
  ]
1194
1331
  }
1195
- },
1196
- {
1197
- "name": "note_hash_counter",
1198
- "type": {
1199
- "kind": "integer",
1200
- "sign": "unsigned",
1201
- "width": 32
1202
- }
1203
- },
1204
- {
1205
- "name": "counter",
1206
- "type": {
1207
- "kind": "integer",
1208
- "sign": "unsigned",
1209
- "width": 32
1210
- }
1211
1332
  }
1212
- ]
1213
- }
1333
+ },
1334
+ {
1335
+ "name": "length",
1336
+ "type": {
1337
+ "kind": "integer",
1338
+ "sign": "unsigned",
1339
+ "width": 32
1340
+ }
1341
+ }
1342
+ ]
1214
1343
  }
1215
1344
  },
1216
1345
  {
1217
1346
  "name": "contract_class_logs_hashes",
1218
1347
  "type": {
1219
- "kind": "array",
1220
- "length": 1,
1221
- "type": {
1222
- "kind": "struct",
1223
- "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
1224
- "fields": [
1225
- {
1226
- "name": "inner",
1348
+ "kind": "struct",
1349
+ "path": "aztec::protocol_types::utils::arrays::ClaimedLengthArray",
1350
+ "fields": [
1351
+ {
1352
+ "name": "array",
1353
+ "type": {
1354
+ "kind": "array",
1355
+ "length": 1,
1227
1356
  "type": {
1228
1357
  "kind": "struct",
1229
- "path": "aztec::protocol_types::abis::log_hash::LogHash",
1358
+ "path": "aztec::protocol_types::abis::side_effect::counted::Counted",
1230
1359
  "fields": [
1231
1360
  {
1232
- "name": "value",
1361
+ "name": "inner",
1233
1362
  "type": {
1234
- "kind": "field"
1363
+ "kind": "struct",
1364
+ "path": "aztec::protocol_types::abis::log_hash::LogHash",
1365
+ "fields": [
1366
+ {
1367
+ "name": "value",
1368
+ "type": {
1369
+ "kind": "field"
1370
+ }
1371
+ },
1372
+ {
1373
+ "name": "length",
1374
+ "type": {
1375
+ "kind": "integer",
1376
+ "sign": "unsigned",
1377
+ "width": 32
1378
+ }
1379
+ }
1380
+ ]
1235
1381
  }
1236
1382
  },
1237
1383
  {
1238
- "name": "length",
1384
+ "name": "counter",
1239
1385
  "type": {
1240
1386
  "kind": "integer",
1241
1387
  "sign": "unsigned",
@@ -1244,17 +1390,17 @@
1244
1390
  }
1245
1391
  ]
1246
1392
  }
1247
- },
1248
- {
1249
- "name": "counter",
1250
- "type": {
1251
- "kind": "integer",
1252
- "sign": "unsigned",
1253
- "width": 32
1254
- }
1255
1393
  }
1256
- ]
1257
- }
1394
+ },
1395
+ {
1396
+ "name": "length",
1397
+ "type": {
1398
+ "kind": "integer",
1399
+ "sign": "unsigned",
1400
+ "width": 32
1401
+ }
1402
+ }
1403
+ ]
1258
1404
  }
1259
1405
  },
1260
1406
  {
@@ -1277,7 +1423,7 @@
1277
1423
  "name": "historical_header",
1278
1424
  "type": {
1279
1425
  "kind": "struct",
1280
- "path": "aztec::protocol_types::block_header::BlockHeader",
1426
+ "path": "aztec::protocol_types::abis::block_header::BlockHeader",
1281
1427
  "fields": [
1282
1428
  {
1283
1429
  "name": "last_archive",
@@ -1333,7 +1479,7 @@
1333
1479
  "name": "state",
1334
1480
  "type": {
1335
1481
  "kind": "struct",
1336
- "path": "aztec::protocol_types::state_reference::StateReference",
1482
+ "path": "aztec::protocol_types::abis::state_reference::StateReference",
1337
1483
  "fields": [
1338
1484
  {
1339
1485
  "name": "l1_to_l2_message_tree",
@@ -1362,7 +1508,7 @@
1362
1508
  "name": "partial",
1363
1509
  "type": {
1364
1510
  "kind": "struct",
1365
- "path": "aztec::protocol_types::partial_state_reference::PartialStateReference",
1511
+ "path": "aztec::protocol_types::abis::partial_state_reference::PartialStateReference",
1366
1512
  "fields": [
1367
1513
  {
1368
1514
  "name": "note_hash_tree",
@@ -1556,7 +1702,7 @@
1556
1702
  "name": "tx_context",
1557
1703
  "type": {
1558
1704
  "kind": "struct",
1559
- "path": "aztec::protocol_types::transaction::tx_context::TxContext",
1705
+ "path": "aztec::protocol_types::abis::transaction::tx_context::TxContext",
1560
1706
  "fields": [
1561
1707
  {
1562
1708
  "name": "chain_id",
@@ -1705,15 +1851,15 @@
1705
1851
  }
1706
1852
  }
1707
1853
  },
1708
- "bytecode": "H4sIAAAAAAAA/+19CbyN1ff+uffca0xIKk2ozNPedzxXAyVjiSTzeLnXPI9p0pzMQwhJEpIkIUmSJMmUJElSkiRJkiT5r8U5X2/H0f/3+961/M5z2+/n83zuuefcu8+znmftvd5hv/uN8Z3e+uXy+ZJznn4dQ/AHf8YSioW9F/rpfR0f4e/yRHjvggjvXRjhvQIR3isU4b3ChKph711GGBz2XpEI710dob2iEd4rFuG94hHeuybCd1wb4b3rIrxXIsJ7JSN8R+kI75WN4Ee5CO9ViPC/lSL8nYnwXkKE/02K8HfJEd5LjfC/aRH+rnLwp3cL/V41+DPRpCQlZaQmZNhE29YkpKUHkk1ScnpKwAZsciC5fUIgMTEjkBRITUtPSzVpNikxw2YmpyVmmtNbUf+ZtkyWtoR2mjyL/dc8bUr4O8ztIkKchyvr8FfwdSnfmdelPa+LBf8m9H/F6fdrCNcSrvOfeT+0+cM0MFnbbBnBtor75bwpIZZDxmjqV1awrWsE9SsJol85wbauFdSvlKB+kcaGEp6xoaR3nPC8vi5sbChNv5chlCWUOw9jQ3nBtkoLelMeJLcrCLZVRlC/CiD6VRRsq6ygfhWVx4bynjGggud1Rc/rcmFjQyX63RAsIeE8jA2VJNsS9CYRJLeNZFuC+iWB6Gcl2xLUL1l5bEj0jAFJntfJntcJYWNDCv2eSggQ0s7D2JAg2FaKoDeVQXI7UbCtVEH9rgfRL0mwrYCgfjcojw2VPWPA9Z7XN3hep4WNDTfS7zcRqjC38zA2JAu2daOgNzeD5HaKYFs3Cep3C4h+qYJtVRHUr5ry2HCzZwy4xfO6mud11bCx4Vb6vTqhBqHmeRgbAoJt3SroTS2Q3E4TbKu6oH61QfSrLNhWDUH96iiPDbU8Y0Btz+s6ntc1w8aG2+j32wl1CXech7HhesG2bhP0pp6yN/U8HtzueV3X8/qOMG/q0+93EhoQ7orgTaywNyV9cno2lNPTeq97crvFghrF+s6+BurznX190WRtk7y2Zrx87/YrEubGpdttJNjhtOJu5D8jsFC7fytW0p2uoaCmjQU7XSR/ssqvbNAfaQ3LCnJsIryTI53j7HETv7w3TYULYGjAbuoZsH2+s4uYhkaSA7Ymz1IgPBsq94ms5m65YL5Jjyt+wbYEJ0iYcJ/FDW8S5YazMSHTEQzParzNBP2I852ZhRq+/VsH4tIgPP+tBUOLp2S/ivXwbB4cmFrwjprGURjv8YZXO4m9c6m2Gikd/jcP7k16N+mq31zwiKyl8hGZydpmQ0dkfpBcympbraLcD86XVgpHd62Vju5a/w/6o6RnWW2rjbD/0rE2DB7dS3Hktpr6o/usVdsoP+PC7WmccUmP8rjLKMXdLsrj5pibKcTdPsrjLqXkd0aUx91Q6YxqpvBB+/m63CU4Xf9vl7s6+BUJd1C43NUxyi93cdwdlS53SXPlnbjWCp0sLmd0x807nG0V4o4Xjju0SR8IdhLcmRX02grqp3KptFKwb0vvuFcS5Ng5ygs7515nhb7XRelgust5OJjuLFjTugofTIc26TGoW/Yfg8z5vLwuuYOoybM8CM9uyuNoVvsPNxrtl9cF78PUv7zeWfjI0GuOBt82wSNkn1C7mae3v3UqobZt6IVXj+5B7j1ClTb0s7v/7JV1eniqsMappTZ+saqeEOyhtrtgVe/hlzVYejTiztMd5KiXvU5X2APtGeV73hx3O4W4ewHE3V4h7t4AcWcoxN0HIO5Mhbj7nqf5M1nl2U+QJw/pvApi/WB7PMZxf+fc5zxgTfo5/I9xLs9N1rbk0D6MdC71j/K+zvsd/RXiHiAYd2ywD4VvkrpqaDvAH/0cB0pzlD6c5oAlT+9xWwP98jwHCnK8B6fz2H9z57lHmiNKVRvkl00gjao2SCHue11Vs/cCdMz7or2q8cUG6ap2n0JVu0+Q4/2uqkF0nvv/rVXtAbnAEzSM4U7+gELcD7qqZh8E6JiDtTumxA2socuqkoH7BdsygvE+JGyI0AW0v+0VCCbNqQHoIYW9jMGCexkPu70MiMHs4X/rXsYjcoEnahjDnfwRhbgfdXsZ9lGAjvlYtB878wQ46WPnxxSq2mOCHB93VQ2i8zz+b61qT8gFnqRhDHfyJxTiftJVNfskQMccEu1VjRO0m3BVG6JQ1YYIcnzKVTWIziPpkw91lOsHYNRQBY4RiWa15w8TPCuFmlDDABJqOEpCjRC8doOaUCMAEmokSkKNEjxNh5pQowASajRKQo0RPEJGTagxAAk1FiWhxskRTUZNqHEACfU0SkKNlyOagppQ4wESagJKQk2UI5qKmlATARLqGZSEmiRHNICaUJMAEmoySkJNkSOahppQUwAS6lmUhJoqR7QtakJNBUio51ASapoc0XTUhJoGkFDPoyTUdDmi7VATajpAQr2AklAz5Ii2R02oGQAJ9SJKQs2UI5qBmlAzARJqFkpCzZYjmomaULMBEuollISaI0bUws76nAOQUC+jJNRcuYSCnQ81FyChXkFJqHlyCQU7H2oeQEK9ipJQ8+USCnY+1HyAhHoNJaEWyCUU7HyoBQAJ9TpKQi2USyjY+VALARJqEUpCLZZLKNj5UIsBEuoNlIRaIpdQsPOhlgAk1JsoCbVULqFg50MtBUiot1ASaplcQsHOh1oGkFBvoyTUcrmEgp0PtRwgod5BSagVcgkFOx9qBUBCvYuSUCvlEgp2PtRKgIR6DyWhVsklFOx8qFUACfU+SkKtlkso2PlQqwES6gOUhFojl1Cw86HWACTUhygJtVaMaALsfKi1AAn1EUpCrZNLKNj5UOsAEmo9SkJtkEso2PlQGwASaiNKQm2SSyjY+VCbABLqY5SE2iyXULDzoTYDJNQnKAm1RS6hYOdDbQFIqE9REmqrXELBzofaCpBQn6Ek1Da5hIKdD7UNIKE+R0mo7XIJBTsfajtAQn2BklA75BIKdj7UDoCE+hIloXbKJRTsfKidAAn1FUpC7ZJLKNj5ULsAEuprSY6oRhUFMOoblJ6/W67nw84z2g2QUN+iJNQeuYSCnWe0ByChvkNJqL1yCQU7z2gvQEJ9j5JQ+8SIJsLOM9oHkFA/oCTUfrmEgp1ntB8goX5ESagDcgkFO8/oAEBC/YSSUAflEgp2ntFBgIT6GSWhDsklFOw8o0MACfULSkIdlkso2HlGhwES6leUhDoil1Cw84yOACTUbygJdVQuoWDnGR0FSKjfURLqmFxCwc4zOgaQUH+gJNRxuYSCnWd0HCCh/kRJqBNyCQU7z+gEQEL9hZJQJ+USCnae0UmAhPLFgSRUjBjRRNh1l2Liop9jLEpC+eUSCnY+lB8goeJQEipeLqFg50PFAyRUDpSEyimXULDzoXICJFQulITKLUY0CXY+VG6AhMqDklB55RIKdj5UXoCEugAlofLJJRTsfKh8AAl1IUpC5ZdLKNj5UPkBEqoASkIVlEso2PlQBQES6iKUhCokl1Cw86EKASTUxSgJVVguoWDnQxUGSKhLUBLqUrmEgp0PdSlAQl2GklBF5BIKdj5UEYCEuhwloa6QSyjY+VBXACTUlSgJdZVcQsHOh7oKIKGuRkmoonIJBTsfqihAQhVDSajicgkFOx+qOEBCXYOSUNfKJRTsfKhrARLqOpSEKiGXULDzoUoAJFRJlIQqJZdQsPOhSgEkVGlpjtIEm/h9vjZ++QQtIxe4RYq7rKDhccG4431nb9J6VPTpjHzSPCuA8CwvzDNWmF9nyv0ucjfl2K7UVjf/GT0RPHpI8KakWA/PcnGnf5annzHSpDsS6UoREiKrA1clwbY6CiYW6+cPms/CFqOfccH3vKJrdJBWwh2klWAHyTy9pfsibFls24ZeePWtEEzqiqGqFDKFP4gJe69i0CifT77XsoidFSp3gZyyo5ZG3F0V4i6YU2e0jpPhmRDkaSvEycVcUXDvVDBvrIQXkQYG6WIh6UWlKD9S4MLIBc0vrKFWwc1qWyba/SB+Jk5+HDRx0T3+c3utFMZ/G+Vxl1GKOyHK4y6tFHdilMfdzK8Td1KUx11Kye/kKI+7hZLfKVEed0OluFOjPO7mSnEHBOPmfb28hNLB9rhGcr3gsZPHEe5TnF+sNX9vP///LcI36X3VNDltA4LHS4GCUX7MzvuUaQr7qpUFcz02mOvhm6SuGtpWjot+jtdLc4wVJsgBG8GDeW6Lg5bmeb0gxxtwOo/9N3eeGxQ4ntqkq+ON2b86qpzJ4cHiRoXqeJOrjvYmgA5eJdqrI0+KkK6OVRSqYxVBjlVddYToPFVRquPN2b86JmgYzIPFzQrV8RZXHe0tAB28WrRXR56KJ10dqylUx2qCHG911RGi89yKUh2rZ//qmKhhMA8W1RWqYw1XHW0NgA5eM9qrI08ulq6ONRWqY01BjrVcdYToPLVQqmPt7F8dkzQM5sGitkJ1rOOqo60D0MFvi/bqyLdHSVfH2xSq422CHG931RGi89yOUh3rZv/qmKxhMA8WdRWq4x2uOto7ADp4vaivjnHy1bGeQnWsJ8ixvquOEJ2nPkp1vDP7V8cUDYN5sLhToTo2cNXRNgDo4HdFe3XUWrpCOuEbRvmNGNzRGyp09OLKk/Il9oY4yf2KHSerHO8WvAlX0g/UPSuEgfdulD2rRtl/zypVw2AeeBopDLiN3Z6VbQzQwZtE+55VOYXzDk0Uzjs0EeTY1J13gOg8TVGqYzPBXbdoW1so1JaGwTxYNFOojs0FE8e7xhm3W0wp2UMDsfTAKTm4t1DStUVQV9Q9kX7+6OfYUnIwRTVqGIBRrZxRxo4AMKq1M8rYUQBGtXFGGTsGwKi2zihjxwEYle6MMnY8gFHtnFHGTgQwqr0zythJAEZlOKOMnQJgVKYzytipAEZ1cEYZOw3AqI7OKGOnAxjVyRll7AwAozo7o4ydCWBUF2eUsbMBjOrqjDJ2DoBR3ZxRxs4FMKq7M8rYeQBG9XBGGTsfwKiezihjFwAY1csZZexCAKN6O6OMXQxgVB9nlLFLAIzq64wydimAUf2cUcYuAzCqvzPK2OUARg1wRhm7AsCogc4oY1cCGHWPM8rYVQBGDXJGGbsawKh7nVHGrgEw6j5nlLFrAYy63xll7DoAox5wRhm7AcCoB51Rxm4CMGqwM8rYzQBGPeSMMnYLgFEPO6OM3Qpg1CPOKGO3ARj1qNZaMLFhRCUWQJJq6zHBdWW8MUuvf/N49l//xkTKFZO17dSypmUEteNlTcsqrKfzhGDniwvqGOM7e5MeNBLl2jJevk/GKRJ+Mk6+3SGCg5JW3EPizggs1K7aGrotFDpZyZw6FS5OOP6Ggrn0lGBbgmve2pLKC6dlNdakYH+RLkhJghyHRvla2Jx7QxX68TClRdKGeRafC23SO69DBfvjcKWd12gez0Zk//FMZUeYa6rgoo2WD5weV+jbI4V3hL357N2ieUdYk6cF4TlCubZlNU/5GWpcN6T7qV+wrWQFr2O0DB8q3PG95vh8OgPqE8ID6hOCB2iZp7e/n4qTaduGXnj1HRXkPjoumByhvapRwSrhfW+04jK/IWOke3wZ5SewmKxt/0kg6bjLnqej5v+SZ0KQpx0luGc4WrBjC+aNlfDCOzBI5woP4qOUzjJpnBoeKvzEq54KT7waExf9Og4X1rGXgo5jAXQcKaxjbwUdxwHoOFpYxz4KOj4NoONYYR37Kug4PsrPgrKOTyvEPQEg7gkKcU8EiPsZhbifAYh7skLckwDiflYh7skAcT+nEPcUgLifV4j7WYC4X1CIeypA3C8qxP0cQNyzFOKeBhD3SwpxPw8Q98sKcU8HiPsVhbhfAIj7VYW4ZwDE/ZpC3C8CxP26QtwzAeJepBD3LIC431CIezZA3G8qxP0SQNxvKcQ9ByDutxXifhkg7ncU4p4LEPe7CnG/AhD3ewpxzwOI+32FuF8FiPsDhbjnA8T9oULcrwHE/ZFC3AsA4l6vEPfrAHFvVIh7IUDcHyvEvQgg7k8U4l4MEPenCnG/ARD3ZwpxLwGI+3OFuN8EiPsLhbiXAsT9pULcbwHE/ZVC3MsA4v5aIe63AeL+RiHu5QBxf6sQ9zsAcX+nEPcKgLi/V4j7XYC4f1CIeyVA3D8qxP0eQNw/KcS9CiDunxXifh8g7l8U4l4NEPevCnF/ABD3bwpxrwGI+3eFuD8EiPsPhbjXAsT9p0LcHwHE/ZdC3OsA4vYp3Oe9HiDuWIW4NwDEHacQ90aAuHMoxL0JIO5cCnF/DBB3HoW4NwPEfYFC3J8AxH2hQtxbAOIuoBD3pwBxX6QQ91aAuC9WiPszgLgvUYh7G0DclynE/TlA3JcrxL0dIO4rFeL+AiDuqxXi3gEQdzGFuL8EiPsahbh3AsR9nULcXwHEXVIh7l0AcZdWiPtrwbj5FOAFhPrB9niNOF7fjNfm4nWleE0kXh+I18rhdWN4DRVeT4TX1uB1JnjNBV5/gO/F5/vS+R5tvl+Z793l+1j5nk6+v5Hv9eP73vgeML4fiu8N4vtk+J4Rvn+C7yXgefU8x5znW/PcY56Hy3NSeX4mz1XkeXs8h43nc/HcJp7nw3NeeP4Hz4XgeQF8jZyvF/O1U76OyNfU+PoSX2vh6w58Dp7PR/O5WT5Pyefs+PwVn8vh8xp8jM/Hu3zsx8dBfEzA+8e8r8j7TbwPwfWUawuPszzmcP/jXGRfwje/sPffyHmfLLieZHLZKF/TlNeT/EahL+4W7Iuxwb4YvknqqqGtpAZaHL+V5hgrTJADlnykA7fFQUvz/FaQ4x6czmP/zZ1njwLHU5t0dfwu+1fHiM8oMlnbTlXH7xSq415XHe1egA7+fbRXR34oinR1/F6hOn4vyHGfq44QnWcfSnX8IftXxwQNg3mw+EGhOu531dHuB+jgP0pzlE4kHihCj5GSDNwv2FayYLwHhA2JFfaDBwzBpDk1AB1Q2Fv5UXBv5Se3twIxmP2EsrdyMPvvrSRqGMyDxUGFvZWf3d6K/Rmggx+K9mN5Hn6lj+UPKVTHQ4Icf3HVEaLz/IJSHQ9n/+qYpGEwDxaHFarjr6462l8BOviRaK+OnKAjhKvjEYXqeESQ42+uOkJ0nt9QquNRwZMv0fbU3VBbGgbzYHFUoTr+Lpg4Mb4zT//mdov5Tg9uiBWznz/6OR6T7PSoRg0DMOoPZ5SxIwCMOu6MMnYUgFF/OqOMHQNg1AlnlLHjAIz6yxll7HgAo046o4ydCGCUL94ZZScBGBXjjDJ2CoBRsc4oY6cCGOV3Rhk7DcCoOGeUsdMBjIp3Rhk7A8CoHM4oY2cCGJXTGWXsbACjcjmjjJ0DYFRuZ5SxcwGMyuOMMnYegFF5nVHGzgcw6gJnlLELAIzK54wydiGAURc6o4xdDGBUfmeUsUsAjCrgjDJ2KYBRBZ1Rxi4DMOoiZ5SxywGMKuSMMnYFgFEXO6OMXQlgVGFnlLGrAIy6xBll7GoAoy51Rhm7BsCoy5xRxq4FMKqIM8rYdQBGXe6MMnYDgFFXOKOM3QRg1JXOKGM3Axh1lTPK2C0ARl3tjDJ2K4BRRZ1Rxm4DMKqYM8rY7QBGFXdGGbsDwKhrnFHG7gQw6lpnlLG7AIy6zhlFe1QARpVwRhm7G8Coks4oY/cAGFXKGWXsXgCjSjujjN0HYFQZZ5Sx+wGMKuuMMvYAgFHlnFHGHgQwqrwzythDAEZVcEYZexjAqIrOKGOPABhVyRll7FEAo4wzythjAEZZZ5SxxwGMSnBGGXsCwKhEZ5SxJwGMSnJGGRsD8ECeZGeUsX4Ao1KcUcbGAxiV6owyNieAUQFnlLG5AYxKc0YZmxfAqMrOKGPzARh1vTPK2PwARt3gjDK2IIBRNzqjjC0EYNRNzihjCwMYVcUZZeylAEZVdUYZWwTAqJudUcZeAWDULc4oY68CMKqaM8rYogBG3eqMMrY4gFHVnVHGXgtgVA1nlLElAIyq6YwythSAUbXi5Tme2vxhRBNNSlJSRmpChk20bU1CWnog2SQlp6cEbMAmB5LbJwQSEzMCSYHUtPS0VJNmkxIzbGZyWmJmsPHackRtmZxybZWVa8vEBQ2O9529ic9q8ukYLz5NDoSnFeYZK8xvKCXXMLkByQ6ntkbEndETwaMDggNyrIdnnWCHvY1+xkiTHkKkkyIkRFYH1CTBtoYIJhbr5w+az8IWo59xwfe8omt0kJHCHWSkYAfJPL2l+yJsWWzbhl549b09mNR144NmhEzhD2LC3qsbNMrnk++1IWPC281q0lbJKTtqScc9XCnuqjl1Rus4GZ4JQZ729ni5mOsK7j0K5o2V8CLSwCBdLCS9uEPQC41+x4WRC5r0EYxWwc1qW/Wi3A/Ol3rx8uNgPeFDX+k+x4eDVnCHhNtrGSe/42QFc7E+gCcJwp60UvAkQdCTOwE8SRT2pLWCJ4mCnjQA8CRJ2JM2Cp4kCXpyF4AnycKetFXwJFnQk4YAnqQIe5Ku4EmKoCd3A3iSKuxJOwVPUgU9aQTgSUDYk/YKngQEPWks7In4kiAUa4bC+akmAHFnKsTdFCDuDgpxNwOIu6NC3M0B4u6kEHcLgLg7K8TdEiDuLgpxtwKIu6tC3K0B4u6mEHcbgLi7K8TdFiDuHgpxpwPE3VMh7nYAcfdSiLs9QNy9FeLOAIi7j0LcmQBx91WIuwNA3P0U4u4IEHd/hbg7AcQ9QCHuzgBxD1SIuwtA3PcoxN0VIO5BCnF3A4j7XoW4uwPEfZ9C3D0A4r5fIe6eAHE/oBB3L4C4H1SIuzdA3IMV4u4DEPdDCnH3BYj7YYW4+wHE/YhC3P0B4n5UIe4BgnHzXO58hNLB9nieKc9r5Hl0PG+L5wnxvBSeB8HX3fkaNF+P5WuTfJ2Or1nx9Ru+lsHn9fkcN5/v5XOffB6Qz4nx+SE+V8LnDfgYmo8n+diKjzN4n5v3P3lfjPdLuEZzveKxm8cx7tOc3+z1gAi3f0rPRR8op21A8H6IQNUovyeH54wPVJiLfo9grscGcz18k9RVQ1tJDbQ4DpLmGCtMkAOuJ3izDrfFQUvzHCTI8V6czmP/zZ3nXgWOpzbp6nhf9q+OKndq8WBxn0J1vN9VR3s/QAd/INqrIy96Il0dH1Cojg8IcnzQVUeIzvMgSnUcnP2rY4KGwTxYDFaojg+56mgfAujgD0d7deSsl66ODytUx4cFOT7iqiNE53kEpTo+mv2rY6KGwTxYPKpQHR9z1dE+BtDBH4/26siLB0pXx8cVquPjghyfcNURovM8gVIdn8z+1TFJw2AeLJ5UqI5DXHW0QwA6+FPRXh15+JWujk8pVMenBDkOddURovMMRamOw7J/dUzWMJgHi2EK1XG4q452OEAHHxHt1ZEXhpeujiMUquMIQY4jXXWE6DwjUarjqOxfHVM0DObBYpRCdRztqqMdDdDBx0R7ddR6NI10wo+N8hsxuKOPVejobZQn5UvsDXGS+xU7TlY5jpPLHSvpB+qeFcLAOw5lz+rp7L9nlaphMA88TysMuOPdnpUdD9DBJ0T7nlUdhfMOExTOO0wQ5DjRnXeA6DwTUarjM4K7btH27LBQWxoG82DxjEJ1nCSYODG+M88w5HaLKSV7aCCWHjglB/fJSrpODuqKuifSzx/9HKdIDqaoRg0DMOpZZxRdZgIwaqozythRAEY954yiU5UARk1zRtE5QQCjnndG0SE0gFHTnVF0HgHAqBecUcZOAjBqhjOKDiYBjHrRGUXHKABGzXRG0a4vgFGznFG0RwVg1GxnFBVqAKNeckbR+A9g1BxnFA0rAEa97IyibAUwaq4zikQAMOoVZ5Sx8wCMmueMMnY+gFGvOqOMXQBg1HxnlLELAYx6zRll7GIAoxY4o4xdAmDU684oY5cCGLXQGWXsMgCjFjmjjF0OYNRiZ5SxKwCMesMZZexKAKOWOKOMXQVg1JvOKGNXAxi11Bll7BoAo95yRhm7FsCoZc4oY9cBGPW2M8rYDQBGLXdGGbsJwKh3nFHGbgYwaoUzytgtAEa964wydiuAUSudUcZuAzDqPa21YGLDiEosgCTV1irBdWW8MUuvf/N+9l//xkTKFZO17dSypr8LL2taW2E9ndWCnS8uqGOM7+xNetAIyLVlvHw/iFck/EG8wpkywUFJK+418WcEFmpXbQ3dyQqdLCOnToWLE45/rGAufSjYluCatzZDeeG0rMaaFuwv0gUpTZDj2ihfC5tzb61CP/5IaZG0jzyLz4U26Z3XtYL9cZ3Szms0j2frs/94prIjzDVVcNFGywdO7yv07Q3CO8LefPZu0bwjrMkzBYTneuXaltU8rew7XTek+6lfsK3KCl7HaBm+Vrjje83x+XQG1NXCA+pqwQO0zNPb30/FybRtQy+8+m4Mct8UH0yO0F7VxmCV8L63SXGZ35Ax0j2+o/ITWEzWtv8kkHTcnc7TUfN/yTMhyNNuFNwz3CTYsQXzxkp44R0YpHOFB/GNSmeZNE4NHxM+NTxG4YlXH8dHv45/COs4VkHHzQA6HhfWcZyCjp8A6PinsI5PK+i4BUDHE8I6jlfQ8VMAHf8S1nGCgo5bAXQ8KazjRAUdPwPQ0Rcvq+MzCjpuA9AxRljHSQo6fg6gY6ywjpMVdNwOoKNfWMcpCjp+AaBjnLCOzyrouANAx3hhHacq6PglgI45hHV8TkHHnQA65hTWcZqCjl8B6JhLWMfnFXTcBaBjbmEdpyvo+DWAjnmEdXxBQcdvAHTMK6zjDAUddwPoeIGwji8q6PgtgI75hHWcqaDjHgAdLxTWcZaCjt8B6JhfWMfZCjruBdCxgLCOLyno+D2AjgWFdZyjoOM+AB0vEtbxZQUdfwDQsZCwjnMVdNwPoOPFwjq+oqDjjwA6FhbWcZ6CjgcAdLxEWMdXFXT8CUDHS4V1nK+g40EAHS8T1vE1BR1/BtCxiLCOCxR0PASg4+XCOr6uoOMvADpeIazjQgUdDwPoeKWwjosUdPwVQMerhHVcrKDjEQAdrxbW8Q0FHX8D0LGosI5LFHQ8CqBjMWEd31TQ8XcAHYsL67hUQcdjADpeI6zjWwo6/gGg47XCOi5T0PE4gI7XCev4toKOfwLoWEJYx+UKOp4A0LGksI7vKOj4F4COpYR1XKGg40kAHUsL6/iugo6+HNGvYxlhHVcq6BgDoGNZYR3fU9AxFkDHcsI6rlLQ0Q+gY3lhHd9X0DEOQMcKwjquVtAxHkDHisI6fqCgYw4AHSsJ67hGQcecADoaYR0/VNAxF4COVljHtQo65gbQMUFYx48UdMwDoGOisI7rFHTMC6BjkrCO6xV0vABAx2RhHTco6JgPQMcUYR03Kuh4IYCOqcI6blLQMT+AjgFhHT9W0LEAgI5pwjpuVtCxIICOlYV1/ERBx4sAdLxeWMctCjoWAtDxBmEdP1XQ8WIAHW8U1nGrgo6FAXS8SVjHzxR0vARAxyrCOm5T0PFSAB2rCuv4uYKOlwHoeLOwjtsVdCwCoOMtwjp+oaDj5QA6VhPWcYeCjlcA6HirsI5fKuh4JYCO1YV13Kmg41UAOtYQ1vErBR2vBtCxprCOuxR0LAqgYy1hHb9W0LGYoI783KoLCfWD7fEzWfh5IvwsDH6OAz+DgNfP57Xfed1yXnOb14vmtY55nV5eY5bXR+W1PXldSl5TkdcD5LXseB02XkOM17/itZt43SFeM4fXe+G1SnidDV4jgtc34Hvz+b5yviea7+fle1H5Pkq+B5DvX+N7r/i+Ib7nhe/X4HsNeJ48z/Hm+ck8t5bnhfKcRp6Px3PJeB4Uz+Hh+Sc8d4Kv+/M1a77eytcK+ToXX6Ph6wt8bpzP6/I5ST6fxueC+DwGH4Pz8SMf+/B+O+9z8v4S13quUzzG8vjAuc2+hG9+Ye+Ly3mfLPj8puROUf4MMX5+E2sn3RevEeyLscG+GL5J6qqhraQGWhyvleYoXXw4YMlHKHNbHLQ0T6+QWeV4HU7nsf/mznOdAsdTm3R1LJH9q6PVMJgHixIK1bGkq462JEAHLxXt1ZEfQi5dHUspVMdSgtWxtKuOEJ2nNEp1LJP9q2OChsE8WJRRqI5lXXW0ZQE6eDlpjuI3TlIblX1nDxgma5v1C7ZVWTDe8sonkiX2LgST5tQAVF5hb6Wc4N5KBbe3AjGYVUDZW6mY/fdWEjUM5sGiosLeSiW3t2IrAXRwE+3H8ik++WN5o1AdjWB1tK46QnQei1IdE7J/dUzSMJgHiwSF6pjoqqNNBOjgSdFeHTlB1wtXxySF6pgkWB2TXXWE6DzJKNUxRfDki2B1tAjXgVMUqmOqYOLEBPOFf3K7xXynBzfEitnPH/0cA5KdHtWoYQBGpTmjjB0BYFRlZ5SxowCMut4ZZewYAKNucEYZOw7AqBudUcaOBzDqJmeUsRMBjKrijDJ2EoBRVZ1Rxk4BMOpmZ5SxUwGMusUZZew0AKOqOaOMnQ5g1K3OKGNnABhV3Rll7EwAo2o4o4ydDWBUTWeUsXMAjKrljDJ2LoBRtZ1Rxs4DMKqOM8rY+QBG3eaMMnYBgFG3O6OMXQhgVF1nlLGLAYy6wxll7BIAo+o5o4xdCmBUfWeUscsAjLrTGWXscgCjGjijjF0BYNRdzihjVwIY1dAZZewqAKPudkYZuxrAqEbOKGPXABjV2Bll7FoAo5o4o4xdB2BUU2eUsRsAjGrmjDJ2E4BRzZ1Rxm4GMKqFM8rYLQBGtXRGGbsVwKhWzihjtwEY1doZZex2AKPaOKOM3QFgVFtnlLE7AYxKd0YZuwvAqHbOKGOLAhjV3hll7G4AozKcUcbuATAq0xll7F4Aozo4o4zdB2BUR2eUsfsBjOrkjDL2AIBRnZ1Rxh4EMKqLM8rYQwBGdXVGGXsYwKhuzihjjwAY1d0ZZexRAKN6OKOMPQZgVE9nlLHHAYzq5Ywy9gSAUb2dUcaeBDCqjzPK2Ji46OfY1xllrB/AqH7OKGPjAYzq74wyNieAUQOcUcbmBjBqoDPK2LwARt3jjDI2H4BRg5xRxuYHMOpeZ5SxBQGMus8ZZWwhAKPud0YZWxjAqAecUcZeCmDUg84oY4sAGDXYGWXsFQBGPeSMMvYqAKMedkYZWxTAqEecUcYWBzDqUWeUsdcCGPWYM8rYEgBGPe6MMrYUgFFPSBoVFyQYf7ZX4sQDPnlxNXimgvBMEeYZK8xvLSXVR/Fy7a2jttZ7EhXBo/KCnTXWw/PJHKd/DqGfMeKrlpLIaRESItGkJCVlpCZk2ETb1iSkpQeSTVJyekrABmxyILl9QiAxMSOQFEhNS09LNWk2KTHDZianJWYGG04TbGuNYGKxfv6g+SxsMfoZF3zPK7pGB9kg3EE2CHaQzNNbui/ClsW2beiFV9+ngkk9NEfQjJAp/EFM2HtDg0b5fAqrwQaFDG83q0l7cS7ZUUt8cVWluAvn0hmt42R4JgR52qdyyMU8VG7kt4J5YyW8iDQwSBcLSS+GCXqh0e+4MHJB8wtrqFVws9rW8Cj3g/NleA75cXB4DtlxULrP1SOP6wvukHB7U+Lld5zqC+biCABP7hT25FkFT+4U9GQkgCcNhD2ZquBJA0FPRgF4cpewJ88peHKXoCejATxpKOzJNAVPGgp6MgbAk7uFPXlewZO7BT0ZC+BJI2FPpit40kjQk3EAnjQW9uQFBU8aC3ryNIAnTYQ9maHgSRNBT8YDeNJU2JMXFTxpKujJBABPmgl7MlPBk2aCnkwE8KS5sCezFDxpLujJMwCetBD2ZLaCJy0EPZkE4ElLYU9eUvCkpaAnkwE8aSXsyRwFT1oJejIFwJPWwp68rOBJa0FPngXwpI2wJ3MVPGkj6MlUAE/aCnvyioInbQU9eQ7Ak3RhT+YpeJIu6Mk0AE/aCXvyqoIn7QQ9eR7Ak/bCnsxX8KS9oCfTATzJEPbkNQVPMgQ9eQHAk0xhTxYoeJIp6MkMAE86CHvyuoInHQQ9eRHAk47CnixU8KSjoCczATzpJOzJIgVPOgl6MgvAk87CnixW8KSzoCezATzpIuzJGwqedBH05CUAT7oKe7JEwZOugp7MAfCkm7Anbyp40k3Qk5cBPOku7MlSBU+6C3oyF8CTHsKevKXgSQ9BT14B8KSnsCfLFDzpKejJPABPegl78raCJ70EPXkVwJPewp4sV/Ckt6An8wE86SPsyTsKnvQR9OQ1AE/6CnuyQsGTvoKeLADwpJ+wJ+8qeNJP0JPXATzpL+zJSgVP+gt6shDAkwHCnryn4MkAQU8WCXrCaynkJ5QOtsf3efN9xXwfK983yffp8X1hfB8S3/fC91nwvH6eR87zlnmeLM/L5HmAPO+M5znxvBqex8HzBvg6NV8X5etwfN2HrzPweW0+j8rn7fg8EZ+X4ONgPu7i/Xzer+T9GK6bPE7zuMB5uCi48I13k14LYrGctgHB9UgChaN8TRxes2GxwloQbwivDJb/7BQS1VVDW0kNtDgukeYoPQBzwMMFF8vhtjhoaZ5LBDm+idN57L+587ypwPHUJl0dl2b/6qiyUhIPFksVquNbrjratwA6+LJor4686LB0dVymUB2XCXJ821VHiM7zNkp1XJ79q2OChsE8WCxXqI7vuOpo3wHo4CuivTryUvfS1XGFQnVcIcjxXVcdITrPuyjVcWX2r46JGgbzYLFSoTq+56qjfQ+gg6+K9upYPod8dVylUB1XCXJ831VHiM7zPkp1XJ39q2OShsE8WKxWqI4fuOpoPwDo4GuivTry48ekq+Maheq4RpDjh646QnSeD1Gq49rsXx2TNQzmwWKtQnX8yFVH+xFAB18X7dVxiMKx4zqF6rhOkON6Vx0hOs96lOq4IftXxxQNg3mw2KBQHTe66mg3AnTwTdFeHbUeDS2d8B8LC6nR0T9W6Oj9lCflS+wNcZL7FTtOVjlulssdK+kH6p4VwsC7GWXP6pPsv2eVqmEwDzyfKAy4W9yeld0C0ME/jfY9qycVzjt8qnDe4VNBjlvdeQeIzrMVpTp+JrjrJlgdLcLdQJ8pVMdtgokTE8wX/sntFlNK9tBALD1wSg7unyvp+nlQV9Q9kX7+6Oe4XXIwRTVqGIBRXzijjB0BYNQOZ5SxowCM+tIZZewYAKN2OqOMHQdg1FfOKGPHAxi1yxll7EQAo752Rhk7CcCob5xRxk4BMGq3M8rYqQBGfeuMMnYagFF7nFHGTgcw6jtnlLEzAIza64wydiaAUd87o4ydDWDUPmeUsXMAjPrBGWXsXACj9jujjJ0HYNSPzihj5wMYdcAZZewCAKN+ckYZuxDAqIPOKGMXAxj1szPK2CUARh1yRhm7FMCoX5xRxi4DMOqwM8rY5QBG/eqMMnYFgFFHnFHGrgQw6jdnlLGrAIw66owydjWAUb87o4xdA2DUMWeUsWsBjPrDGWXsOgCjjjujjN0AYNSfzihjNwEYdcIZZexmAKP+ckYZuwXAqJPOKGO3Ahjly+mMstsAjIrJKc/x1BYbRjSra2RIBn2DTydo6ZhjBGO+ESTmWMGYbwKJ2S8Yc5XzFLPJ2marCupX368Ts/Rge7MPg+ctIDyrgfC8FYRndRCeNUB41gThWQuEZ20QnnVAeN4GwvN2EJ51QXjeAcKzHgjP+iA87wTh2QCE510gPBuC8LwbhGcjEJ6NQXg2AeHZFIRnMxCezUF4tgDh2RKEZysQnq1BeLYB4dkWhGc6CM92IDzbg/DMAOGZCcKzAwjPjiA8O4Hw7AzCswsIz64gPLuB8OwOwrMHCM+eIDx7gfDsDcKzDwjPviA8+4Hw7A/CcwAIz4EgPO8B4TkIhOe9IDzvA+F5PwjPB0B4PgjCczAIz4dAeD4MwvMREJ6PgvB8DITn4yA8nwDh+SQIzyEgPJ8C4TkUhOcwEJ7DQXiOAOE5EoTnKBCeo0F4jgHhORaE5zgQnk+D8BwPwnMCCM+JIDyfAeE5CYTnZBCeU0B4PgvCcyoIz+dAeE4D4fk8CM/pIDxfAOE5A4TniyA8Z4LwnAXCczYIz5dAeM4B4fkyCM+5IDxfAeE5D4TnqyA854PwfA2E5wIQnq+D8FwIwnMRCM/FIDzfAOG5BITnmyA8l4LwfAuE5zIQnm+D8FwOwvMdEJ4rQHi+C8JzJQjP90B4rgLh+T4Iz9UgPD8A4bkGhOeHIDzXgvD8CITnOhCe60F4bgDhuRGE5yYQnh+D8NwMwvMTEJ5bQHh+CsJzKwjPz0B4bgPh+TkIz+0gPL8A4bkDhOeXIDx3gvD8CoTnLhCeX4Pw/AaE524Qnt+C8NwDwvM7EJ57QXh+D8JzHwjPH0B47gfh+SMIzwMgPH8C4XkQhOfPIDwPgfD8BYTnYRCev4LwPALC8zcQnkdBeP4OwvMYCM8/QHgeB+H5JwjPEyA8/wLheRKEJzeIwDMGhGcsCE8/CM84EJ7xIDxzgPDMCcIzFwjP3CA884DwzAvC8wIQnvlAeF4IwjM/CM8CIDwLgvC8CIRnIRCeF4PwLAzC8xIQnpeC8LwMhGcREJ6Xg/C8AoTnlSA8rwLheTUIz6IgPIuB8CwOwvMaEJ7XgvC8DoRnCWGescL8hufw+UbkONNeoklJSspITciwibatSUhLDySbpOT0lIAN2ORAcvuEQGJiRiApkJqWnpZq0mxSYobNTE5LzAw2yO1tzyHPs2SMHEdvvCaLm5YnI4U9+ULBk1KCnowE8GSUsCc7FDwpLejJKABPRgt78qWCJ2UEPRkN4MkYYU92KnhSVtCTMQCejBX25CsFT8oJejIWwJNxwp7sUvCkvKAn4wA8eVrYk68VPKkg6MnTAJ6MF/bkGwVPKgp6Mh7AkwnCnuxW8KSSoCcTADyZKOzJtwqeGEFPJgJ48oywJ3sUPLGCnjwD4MkkYU++U/AkQdCTSQCeTBb2ZK+CJ4mCnkwG8GSKsCffK3iSJOjJFABPnhX2ZJ+CJ8mCnjwL4MlUYU9+UPAkRdCTqQCePCfsyX4FT1IFPXkOwJNpwp78qOBJQNCTaQCePC/syQEFT9IEPXkewJPpwp78pOBJZUFPpgN48oKwJwcVPLle0JMXADyZIezJzwqe3CDoyQwAT14U9uSQgic3CnryIoAnM4U9+UXBk5sEPZkJ4MksYU8OK3hSRdCTWQCezBb25FcFT6oKejIbwJOXhD05ouDJzYKevATgyRxhT35T8OQWQU/mAHjysrAnRxU8qSboycsAnswV9uR3BU9uFfRkLoAnrwh7ckzBk+qCnrwC4Mk8YU/+UPCkhqAn8wA8eVXYk+MKntQU9ORVAE/mC3vyp4IntQQ9mQ/gyWvCnpxQ8KS2oCevAXiyQNiTvxQ8qSPoyQIAT14X9uSkgie3CXryOoAnC4U98eWU53m7oCcLATxZJOxJjIIndQU9WaTsSVb5rY33+QKCnqyj9j6Ol19n4I6Y6NcxTVjHzQo61gPQsbKwjp8o6FgfQMfrhXXcoqDjnQA63iCs46cKOjYA0PFGYR23Kuh4F4CONwnr+JmCjg0BdKwirOM2BR3vBtCxqrCOnyvo2AhAx5uFddyuoGNjAB1vEdbxCwUdmwDoWE1Yxx0KOjYF0PFWYR2/VNCxGYCO1YV13KmgY3MAHWsI6/iVgo4tAHSsKazjLgUdWwLoWEtYx68VdGwFoGNtYR2/UdCxNYCOdYR13K2gYxsAHW8T1vFbBR3bAuh4u7COexR0TAfQsa6wjt8p6NgOQMc7hHXcq6BjewAd6wnr+L2CjhkAOtYX1nGfgo6ZADreKazjDwo6dgDQsYGwjvsVdOwIoONdwjr+qKBjJwAdGwrreEBBx84AOt4trONPCjp2AdCxkbCOBxV07AqgY2NhHX9W0LEbgI5NhHU8pKBjdwAdmwrr+IuCjj0AdGwmrONhBR17AujYXFjHXxV07AWgYwthHY8o6NgbQMeWwjr+pqBjHwAdWwnreFRBx74AOrYW1vF3BR37AejYRljHYwo69gfQsa2wjn8o6DgAQMd0YR2PK+g4EEDHdsI6/qmg4z0AOrYX1vGEgo6DAHTMENbxLwUd7wXQMVNYx5MKOt4HoGMHYR19OeR1vB9Ax47COsYo6PgAgI6dhHWMVdDxQQAdOwvr6FfQcTCAjl2EdYxT0PEhAB27CusYr6DjwwA6dhPWMYeCjo8A6NhdWMecCjo+CqBjD2Edcyno+BiAjj2FdcytoOPjADr2EtYxj4KOTwDo2FtYx7wKOj4JoGMfYR0vUNBxCICOfYV1zKeg41MAOvYT1vFCBR2HAujYX1jH/Ao6DgPQcYCwjgUUdBwOoONAYR0LKug4AkDHe4R1vEhBx5EAOg4S1rGQgo6jAHS8V1jHixV0HA2g433COhZW0HEMgI73C+t4iYKOYwF0fEBYx0sVdBwHoOODwjpepqDj0wA6DhbWsYiCjuMBdHxIWMfLFXScAKDjw8I6XqGg40QAHR8R1vFKBR2fAdDxUWEdr1LQcRKAjo8J63i1go6TAXR8XFjHogo6TgHQ8QlhHYsp6PissI6hTZrnVBCez4HwnAbC83kQntNBeL4AwnMGCM8XQXjOBOE5C4TnbBCeL4HwnAPC82UQnnNBeL4CwnMeCM9XQXjOB+H5GgjPBSA8XwfhuRCE5yIQnotBeL4BwnMJCM83QXguBeH5FgjPZSA83wbhuRyE5zsgPFeA8HwXhOdKEJ7vgfBcBcLzfRCeq0F4fgDCcw0Izw9BeK4F4fkRCM91IDzXg/DcAMJzIwjPTSA8PwbhuRmE5ycgPLeA8PwUhOdWEJ6fgfDcBsLzcxCe20F4fgHCcwcIzy9BeO4E4fkVCM9dIDy/BuH5DQjP3SA8vwXhuQeE53cgPPeC8PwehOc+EJ4/gPDcD8LzRxCeB0B4/gTC8yAIz59BeB4C4fkLCM/DIDx/BeF5BITnbyA8j4Lw/B2E5zEQnn+A8DwOwvNPEJ4nQHj+BcLzJAhPXywGzxgQnrEgPP0gPONAeMaD8MwBwjMnCM9cIDxzg/DMA8IzLwjPC0B45gPheSEIz/wgPAuA8CwIwvMiEJ6FQHheDMKzMAjPS0B4XgrC8zIQnkVAeF4OwvMKEJ5XgvC8CoTn1SA8i4LwLAbCszgIz2tAeF4LwvM6EJ4lQHiWBOFZCoRnaRCeZUB4lgXhWQ6EZ3kQnhVAeFYE4VkJhKcB4WlBeCaA8EwE4ZkEwjMZhGcKCM9UEJ4BEJ5pIDwrg/C8HoTnDSA8bwTheRMIzyogPKuC8LwZhOctIDyrgfC8FYRndRCeNUB41gThWQuEZ20QnnVAeN4GwvN2EJ51QXjeAcKzHgjP+iA87wTh2QCE510gPBuC8LwbhGcjEJ6NQXg2AeHZFIRnMxCezUF4tgDh2RKEZysQnq1BeLYB4dkWhGc6CM92IDzbg/DMAOGZCcKzAwjPjiA8O4Hw7AzCswsIz64gPLuB8OwOwrMHCM+eIDx7gfDsDcKzDwjPviA8+4Hw7A/CcwAIz4EgPO8B4TkIhOe9IDzvA+F5PwjPB0B4PgjCczAIz4dAeD4MwvMREJ6PgvB8DITn4yA8nwDh+SQIzyEgPJ8C4TkUhOcwEJ7DQXiOAOE5EoTnKBCeo0F4jgHhORaE5zgQnk+D8BwPwnMCCM+JIDyfAeE5CYTnZBCeU0B4PgvCcyoIz+dAeE4D4fk8CM/pIDxfAOE5A4TniyA8Z4LwnAXCczYIz5dAeM4B4fkyCM+5IDxfAeE5D4TnqyA854PwfA2E5wIQnq+D8FwIwnMRCM/FIDzfAOG5BITnmyA8l4LwfAuE5zIQnm+D8FwOwvMdEJ4rQHi+C8JzJQjP90B4rgLh+T4Iz9UgPD8A4bkGhOeHIDzXgvD8CITnOhCe60F4bgDhuRGE5yYQnh+D8NwMwvMTEJ5bQHh+CsJzKwjPz0B4bgPh+TkIz+0gPL8A4bkDhOeXIDx3gvD8CoTnLhCeX4Pw/AaE524Qnt+C8NwDwvM7EJ57QXh+D8JzHwjPH0B47gfh+SMIzwMgPH8C4XkQhOfPIDwPgfD8BYTnYRCev4LwPALC8zcQnkdBeP4OwvMYCM8/lHjGhvFMNClJSRmpCRk20bY1CWnpgWSTlJyeErABmxxIbp8QSEzMCCQFUtPS01JNmk1KzLCZyWmJmcG2SwrGfFw45hjhWIfn8Pk+J/iFvf4zVo7jxznkePXLhZGDcYJenADpd/GCMf8FEnMOwZhPgsScUzBmHrgQYs4lGHMMSMy5BWOOBYk5j2DMfpCY8wrGHAcS8wWCMceDxJxPMOYcIDFfKBhzTpCY8wvGnAsk5gKCMecGibmgYMx5QGK+SDDmvCAxFxKM+QKQmC8WjDkfSMyFBWO+ECTmSwRjzg8S86WCMRcAifkywZgLgsRcRDDmi0Bivlww5kIgMV8hGPPFIDFfKRhzYZCYrxKM+RKQmK8WjPlSkJiLCsZ8GUjMxQRjLgISc3HBmC8HifkawZivAIn5WsGYrwSJ+TrBmK8CibmEYMxXC8bsD8a6OxjwDYQbCTcRqgQ530y4hVCNcCuhOqEGoSahFqE2oQ7hNsLthLqEOwj1CPUJdxIaEO4iNCTcTWhEaExoQmhKaEZoTmhBaEloRWhNaENoS0gntCO0J2QQMgkdCB0JnQidCV0IXQndCN0JPQg9Cb0IvQl9CH0J/Qj9CQMIAwn3EAYR7iXcR7if8ADhQcJgwkOEhwmPEB4lPEZ4nPAE4UnCEMJThKGEYYThhBGEkYRRhNGEMYSxhHGEpwnjCRMIEwnPECYRJhOmEJ4lTCU8R5hGeJ4wnfACYQbhRcJMwizCbMJLhDmElwlzCa8Q5hFeJcwnvEZYQHidsJCwiLCY8AZhCeFNwlLCW4RlhLcJywnvEFYQ3iWsJLxHWEV4n7Ca8AFhDeFDwlrCR4R1hPWEDYSNhE2EjwmbCZ8QthA+JWwlfEbYRvicsJ3wBWEH4UvCTsJXhF2ErwnfEHYTviXsIXxH2Ev4nrCP8ANhP+FHwgHCT4SDhJ8Jhwi/EA4TfiUcIfxGOEr4nXCM8AfhOOFPwgnCX4STBJ4UFUOIJfgJcYR4Qg5CTkIuQm5CHkJewgWEfIQLCfkJBQgFCRcRChEuJhQmXEK4lHAZoQjhcsIVhCsJVxGuJhQlFCMUJ1xDuJZwHaEEoSShFKE0oQyhLKEcoTyhAqEioRLBECwhgZBISCIkE1IIqYQAIY1QmXA94QbCjYSbCFUIVQk3E24hVCPcSqhOqEGoSahFqE2oQ7iNcDuhLuEOQj1CfcKdhAaEuwgNCXcTGhEaE5oQmhKaEZoTWhBaEloRWhPaENoS0gntCO0JGYRMQgdCR0InQmdCF0JXQjdCd0IPQk9CL0JvQh9CX0I/Qn/CAMJAwj2EQYR7CfcR7ic8QHiQMJjwEOFhwiOERwmPER4nPEF4kjCE8BRhKGEYYThhBGEkYRRhNGEMYSxhHOFpwnjCBMJEwjOESYTJhCmEZwlTCc8RphGeJ0wnvECYQXiRMJMwizCb8BJhDuFlwlzCK4R5hFcJ8wmvERYQXicsJCwiLCa8QVhCeJOwlPAWYRnhbcJywjuEFYR3CSsJ7xFWEd4nrCZ8QFhD+JCwlvARYR1hPWEDYSNhE+FjwmbCJ4QthE8JWwmfEbYRPidsJ3xB2EH4krCT8BVhF+FrwjeE3YRvCXsI3xH2Er4n7CP8QNhP+JFwgPAT4SDhZ8Ihwi+Ew4RfCUcIvxGOEn4nHCP8QThO+JNwgvAX4SSBi2MMIZbgJ8QR4gk5CDkJuQi5CXkIeQkXEPIRLiTkJxQgFCRcRChEuJhQmHAJ4VLCZYQihMsJVxCuJFxFuJpQlFCMUJxwDeFawnWEEoSShFKE0oQyhLKEcoTyhAqEioRKBEOwhARCIiGJkExIIaQSAoQ0QmXC9YQbCDcSbiJUIVQl3Ey4hVCNcCuhOqEGoSahFqE2oQ7hNsLthLqEOwj1CPUJdxIaEO4iNCTcTWhEaExoQmhKaEZoTmhBaEloRWhNaENoS0gntCO0J2QQMgkdCB0JnQidCV0IXQndCN0JPQg9Cb0IvQl9CH0J/Qj9CQMIAwn3EAYR7iXwc+/5mfL8vHZ+FvpgAj/Dm5+Pzc+e5uc68zOT+XnE/Kxffo4uP6OWn//Kz1bl55byM0H5eZv8LEt+TiQ/g5Gfb8jPDuTn8vEz7/h5cvysNn4OGj9jjJ/fxc/G4udO8TOd+HlJ/CyiaQR+hg4/n4af/cLPVeFnlvDzQPhZG/wcC35GBD9/gZ9twM8N4DX5eb17Xkue12nnNdB5fXFeu5vXxeY1p3k9Z14rmdch5jV+ef1cXpuW133lNVV5vVJeC3QFgdew5PUhee1FXteQ1wzk9fh4rTteR47XaOP1z3htMV63i9fE4vWmeC0nXieJ1yDi9X147Rxel4bXfOH1VHitEl4HhNfY4PUreG0IXneB1zTg9QL4XvxdBL6HnO/P5n1Uvq+Y79nl+2H5XlO+j5PvkeT7D/nePr5vju9J4/u9+F4qvk+J7wHi+2v43hW+L4TvueD7GfheAZ6Hz3Pcef44z6fmucU8p5XnePKcR54DyHPieI4Yz5niOUQ8p4bnmPCcC56DwNfk+Ro1X7Pla5h8TY+vcfE1H74GwtcE+Bw5nzPmc6h8TpHPsfE5Jz4Hw+ck+Bidj1n5GI6PaXgfP/b07oeP5+vydoPvzBYcmk7NrebPeX4rz/fk+Y88H5Dnx/F8MZ4/xfOJeH4Nzzfh+Rc8H4Gvz/P1ar5+y9cz+foeX+/i6z98PYSvD/D5cj5/zOdT+fwin2/j80/FCMUJ1xD4+JWP5/j4hue2lyKUJpQhlCWUI5QnVCBUJFQi8IGWJSQQEglJhGRCCiGVECCkESoTrvedvV3seX1T8Gfhb28u0mvtrOrev6v+D5/V/YfPWv7DZxnBn9u/2dKgZ49B9byf8X7WuT7rEHPuNjv9w2dT/uGzWf/wfVxjzvV/vWLP/X8f/MP/ffgPn/35D5/l9J/7+/r5z/1/m/7h/0rGnfv/Sp/js1A/uiL4M3fwZ5D6qT7FX1k1+LvJ2mZze9qVbj9gkgK5fX/fhPkn5g62Ga/TflKo/Rw67Z+aC87brYPPtO+NJfS9wTTz1Rh8Rssag//OKfQ3NT1/U9PzN7zlC76OOfMn//nu0Gexns+qh33m9539/aHP4nxnfy+P8wV9Z15fFHydO4yHRt55Y5H2rVAE/qHvyhuMtXDwd65txYKvu/fo2ynznurde/XL6JfRvn6/9K6d2tXo171d3049uldr27WrL2zzahruW7hX4f54PYnznXvz/l+MJ4ZQ340b/Pe/qxp832RhSw0YE/ouf7D9eN/f+fvCvj8+7O8vD/6eJ4x7KO6q/yXPzNS2NjOxbWbb5Lbt2ye1a3tRWPu8eb1uFnwNPlann6+xWmksTQ61n1On/YhjtTeW0OehHA6Nnd7X/9Ox2vs3tTx/U8vzN7yd7/E89Fm872xO3jGPX1/i4chb7cFnuMeEfVbH81mIb27f2WOTYL6n5Q6LUzhfEgpF4B/6rlCNqOz7u66hfAr9vVcHpbxOjAn7Pp/v7Hrg/f48PtV+bGPCvi/EJ1yfUJ5wfS0UfN2Oamj93p36t+2bESqr3hC8zcZGCNErgfdvvOmelTIc+j0+Qrvn+v/w9/6p68ec46cvwv/7PLwL+M7enckR9j2xAt+j2aV5K+CLvNvn/W6l7p4caWj0hWno7TLhPnq7d3hu+iLo6/P8TSgm722W+SL8XTgfrw/eQw1vHJH88vvO1jI+jOO5hr7Q+8qHbimRhtTw+L2ah/uRy/PZ/9aPUEz/Wz+8GuUM+yx8t8/7mZeft8RE+y58leDv/9e78N5SnN93du7GhH3m9Sl8bFPK54QQj1A+h7Q+Vz+MxMcnx8fGh/GpFfzJWjYM087bB8PHBp/v7/nrzX3v33vHzlC8+SPEmDMs/v+L3RSvH+FjfmhcyXGOvw+1F9I39Pf1gz/598bB15Hqtj/sM6+2/zSmhDTk/iDdH9slp6S3S0puazIs/5rw/+uP0t9PX53arm2qtWlJNiPJJv//vj80boZ+Fg7T97/lEbb955D+Yp32jTc3fWGxeL83/NSFT5BDqL1QXkbaPwrfzw79ba4wfjHy/Gw4l0j7r6EtdJjhvbzjPeT1cvXmsGQdCLWfV6f9iDmTx/M6b9hnIe8inWKMOcfvsWE//+lvY/6h3XwRPgu1GfLKyzcUx/8DTJ6sxF8FCAA=",
1709
- "debug_symbols": "pZvdbhTXEkbfxde+6F27fnmVIxQR4kRICJADRzpCvPvpnt6rbEeakQM31GfAq3q6p2ZWTdvf7/54+P3bX799+PTn57/v3vzn+93vjx8+fvzw128fP79/9/XD50/7336/244/Rt29qR/3d+P4Qubdm3F/J3oWO4ufJc6SZ9m/Te7v5naWcRY5yzyLnsXOslN0L3GWPEtdim5nGWeRs8yz7BTbi53Fz7JTfC95lroU284yziJnmWfRS3E7i5/lpPhJ8ZMSJyVOSuyU2Ms8i55lp+Re/CxxljxLXUpuZ9kp+WM/u5z3374+PjwcZ/rZhdgvz5d3jw+fvt69+fTt48f7u/+++/jt8p/+/vLu06V+ffe4/+t2f/fw6Y+97sA/P3x8ONKP+6fv3q5/q89a35yb9bcP09cCUhqg+VOAVABVVwHzOmC6LcAMbcDM7ScAOa8CbjyEEl+AmvEz50CUIxCPnzkCiQBQP/UQNGQBXPTZQ/DXAmzTsQg2tmeI8fIYxg3GyK04kyPH9vR8nsNefSpM+1z4kKcD2V4+liE3GDMmjFlPcxH/QNx6Uokkz6q5jasIvXE6LKNPh2U+TccBfEGxGxQ3DmR4PHt2jXzJ8BsMyT4QeTal/4oxnXM6dGy/fBxz+HXGrfMR2ozQG+fj5pWp0Q/GSuLqlZFx41k2+nVDhtrVIxH59SvzWsats3qT8cqre/N8iPMiJBLXz8fNF9IcT8M/rw6/xI2XwqG8I+n+itQMf/VRqDJxGk/HYC9fCI/3zevP0eiZff6+bC9fBeet1+PZB2H7tWmE7G9xrz8M3XpUrK4dxk1Eej+36tkF+ecjufFKOiqeXsEqnj0x/nFFpt6aNR9Pw+Z6HXLzSPJp7Cu9fhKSnFXZtjmvQm48R8sQhrFP79X361tXZn/1kacT4levzK2L6zr7fLjr9fNx80mWoy9v5I0rcwtisfUZsfDxM8+R1znQrWsrm/QJ2bNfvbZ64zA8jdcfz3j2SF5PqD4Z/vzN6d8Q+jXQy64Rbj83PLYn79iuXpHjZeoXT0X+8qnIXz0Vt1Ys2WY/r0a8fE96u3/57v2Hx5cL+LEvH0NxLMyXqqvaqr5qrJqr1lmPvflSx6qLp4uni6eLp4uni6eLp4tni2eLZ4tni2eLZ4tni2eLZ4tnx4cD+/XwbdXj44H9711Wnce7/V51VVt15007F/NLzVXrrMduPvNczufazo+3rmM9v1Q93svPBf1SfdVYNVetsx7r+dxfDFJOXs71tZ7Hmeu40leNVddx5Tqu2lYdq8qqc1Vd1Vb183HUcVzH17lqnXVfiQiDcDxUP8IkKMEITghCEmqFsREGAfKAPCAPyAPygDwgD8gCWSALZIEskAWyQBbIAlkgT8gT8oQ8IU/Ix+wcm+G4fOB0CUFIQq1w+eDpEgZBCJOgBMgKWSErZIVskA2yQTbIBtkgG2SDbJANskN2yA7ZITtkh+yQHbJDdsgBOSAH5IAckANyQA7IATkgJ+SEnJATckJOyAk5ISfkhFyQC3JBLsgFuSAX5IJckGuRZdsIgyCESVCCEZwQhCRAHpAH5AF5QB6QB+QBeUAekAdkgSyQBbJAFsgCWSALZIEskCfkCXlCnpAnZGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZFGZQmEFhBoUZlMsMbkdwwkGuIyShzjAvM3gJgyCESVCCEY6bBNsRgpCEWuGYwTMMghAmQQlGgDwgD8gDskAWyAJZIAtkgSyQBbJAFsgT8oQ8IU/IE/KEPCFPyBPyhKyQFbJCVsgKWSErZIWskBWyQTbIBtkgG2SDbJCPGbRxhCTUCpcZvIRBEMIkKMEITghCEpYVzoAckANyQEY1J645kc2JbU50c+KbMyEn5ISckBNyQk7ICTkhJ+SCXJALckEuyAW5IBfkglyLrNtGGAQ5L4EeM3gG5Z+WMevmhCAsadZtWbOOjTAIQpgEJRzHPI+w5FnHsmcdSVj+rLIRBkEIk7CMUXFRxUUVF1VcVHFRxUUVF1VcVHFRxUV1Qp6QJ+QJeUJWyApZIStkhayQFbJCVsgK2SAbZINskA2yQTbIBtkgG2SH7JAdskN2yA7ZITtkh+yQA3JADsgBOSAH5IAckANyQE7ICTkhJ+SEnJATckJOyAm5IBfkglyQC3JBLsgFuSDXItu2EQZBCJOgBCM4IQhJgMw+aOyDxj5o7IPGPmjsg8Y+aOyDxj5o7IPGPmjsg8Y+aOyDxgwaM2jMoDGDxgwaM2jMoOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qOGihosaLmq4qLEPGvugsQ8a+6CxDzr7oLMPOvugsw86+6CzDzr7oLMPOvugsw86+6CzDzr7oLMPOvugj+XPPpyw/NlHEpY/u2yEQRDCJCjBCMu+HBd1XNRxUcdFHRd1XNRxUcdFHRd1XNRxUcdFHRd1XNRxUcdFHRd1XNRxUcdFHRd1XNRxUcdFHRd1XNRxUcdFHRd1XNQNskE2yA7ZITtkh+yQHbJDdsgO2SEH5IAckANyQA7IATkgB+SAnJATckJOyAk5ISfkhJyQE3JBLsgFuSAX5IJckAtyQa5Fjm0jDIIQJkEJRnBCEJKwtom47IOXMAjLn2NMAh8vDz5fHnzAPPiEefAR81j+HLIRBgGyQBbIAlkgC2SBLJAn5Al5Qp6QJ+QJeUKekCfkCVkhK2SFrJAVskJWyApZIStkg2yQDbJBvszgJRgBsq1tIo4ZPEOt4GubCB8EIUyCEozghOOY5xFy3WTwtU1EbIRBEMIkKMEIy2QCFw1cNHDRwEUDFw1cNHDRwEUDFw1cNHDRwEUDFw1cNHDRwEUDFw1cNHDRwEUDFw1cNHDRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTfTDZB5N9MNkHk30w2QeTGUxmMJnBZAaTGUxmMJnBxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDR4t5EcW+iuDdR3Jso7k0U9yaKexPFvYni3kRxb6K4N1HcmyjuTRT3Jop7E8W9iWIfLPbBYh8s9sFiHyz2wWIfLPbBYh8s9sFiHyz2wWIfLPbBYh8s9sFiHyz2wWIfLPbBYh8s9sFiHyz2wWIfLPbBYh8s9sFiHyz2wWIfLPbBYh8s9sFiHyxf20RdZvAS1jZRvraJio0wCEKYBCUYwQnLvgoXLVy0cNHCRQsXLVy0cNHCRQsXLVy0cNHCRQsXLVy0cNHCRQsXLVy0cNHCRQsXLVx0v0e/dRqdpNPspJ2sk3eKTtmpe4zuMbrH6B6je4zuMbrH6B6je4zuMbqHdA/pHtI9pHtI95DuId1Duod0D+kes3vM7jG7x+wes3vM7jG7x+wes3vM7qHdQ7uHdg/tHto9tHto99Duod1Du4d1D+se1j2se1j3sO5h3cO6h3UP6x6+VpE9jU7SaVnynrSTdfJO0Sk7FYlbHHsanaRT94juEd0jukd0j+ge0T2ye2T3yO6R3SO7R3aP7B7ZPbJ7ZPeo7lHdo7pHdY/qHtU9qntU96juwf2PMbgBMgZ3QMb54zhnmp0uPX4cPyH2+OHd7x8f/r578/34MbBvn97zI1/7l1//94V/4beyvjx+fv/wx7fHh+PHw579atb+539k3Iu/5Re0Ln9lee/z7dFy/yLjPuvtj+NHzP4P",
1854
+ "bytecode": "H4sIAAAAAAAA/+1dCbyN1dc+9557zVOG0iyVOfa+47kSKlNFZqJMl3vNY+ZKpJRCypQkJCFJkiQJSaYkSZIkSUqSJEnSt1bO+bwdh+/7/nct33nY7+/3/O6555y777OeZ+293mG/+43xndx65/D5AtlPvo4h+IM/YwnFwt4L/fS+jo/wvVwR3ssT4b18Ed4rEOG9QhHeK0KoGvZeUcLgsPcujfDeVRHauzrCe8UivHdNhPeKR/gf10Z477oI710f4b0SEf5HqQjvlYngR9kI790Q4W8rRPieifBeQoS/TYrwveQI76VG+Nu0CN+rGPzp3UK/Vw3+TDQpSUkZqQkZNtG2MQlp6YFkk5ScnhKwAZscSG6XEEhMzAgkBVLT0tNSTZpNSsywmclpiZnm5FbKf6otk6Utoa0mz9L/MU+bEv4OcytIiPNwZR1OBF+X9J16XcrzunTwO6G/K0O/lyWUI9zgP/V+aPOHaWCyttnSgm2V8ct5U14sh4zR1K+MYFtlBfWrAKJfWcG2ygnqZwT1izQ2lPeMDRU8r43n9Q1hY4Ol3xMIiYSkczA2lBNsywp6kwyS2zcItpUgqF8KiH7lBdtKFNQvVXlsSPaMASme16me10lhY0OAfk8jVCTceA7GhgqCbQUEvakEkttGsK00Qf1uAtHPCrZVUVC/yspjQyXPGHCT53Vlz+sbw8aGKsyJcDPhlnMwNiQItlVF0JtbQXI7UbCtqoL6VQPRL0mwrZsF9auuPDbc6hkDqnleV/e8viVsbKhBv9ck1CLcdg7GhmTBtmoIenM7SG6nCLZVU1C/O0D0SxVsq5agfrWVx4bbPWPAHZ7XtT2vbwsbG+rQ73cS6hLqnYOxISDYVh1Bb+qD5HaaYFt3CurXAES/ioJt1RXUr6Hy2FDfMwY08Lxu6HldL2xsaES/NyY0ITQ9B2PDjYJtNRL05i5lb+7yeNDY87qJ53XTMG+a0e/NCXcT7ongTaywN0V8cnq2kNHTJtuA8V739LarpUMJQR1ayuWV9erA7RYL5kqs7/RrwT7f6ddZTdY2yWuMxsu3lV+RMDcu3W5rwYFHK+7W/lMCC7X7r6It3elaCmraRrDTRfInq/zKBP2R1rCMIMd04Z096Rxnj9P98t60Fd4RCA3YbT0Dts93ejHX0EhywNbkWRKEZ0vlPpHV3C0bzDfpccUv2JbgRBET7rO44elRbjgbEzIdwfCsxttO0I8436nZuOHbhToQlwLheaEWDC2ekv0q1sMzIzgwZfKOmsZRGO/xhlc7ib1zqbZaKx3+ZwT3Jr2bdNXPEDwia698RGayttnQEZkfJJey2laHKPeD86WDwtFdR6Wju47/i/4o6VlW2+ok7L90rC2DR/dSHLmttv7oPmvVOcrPuHB7GmdcukR53KWV4u4a5XFzzO0U4u4W5XGXVPK7e5TH3VLpjGoP4YP2c3W5S/C2hX9d7urpVyTcU+FyV68ov9zFcfdSutwlzZV34joqdDJ/9uiOm3c4OyvEHSccd2iTPhC8V3BnVtBrK6ifyqXSCsG+Lb3jXkGQY+8oL+yce70V+l4fpYPpPufgYLq3YE3rK3wwHdqkx6B+5/8YZM7l5XXJHURNnuVAePZTHkezvJaAL/ovrwvej6p/eb238JGh1xwNvp2CR8g+oXYzT27/6lRCbdvQC68e/YPcB4Qqbehnf//pKwwN8FRhjVNLnfxiVT0h2ENtf8GqPsAva7D0aMSdpz/IUW/Ib2kNBkb5njd7NFAh7vuU9rzv8//7rgVJLdj/Lgpa3B/lOcBxd1WI+wGAuLspxD0IIO7uCnE/CBB3D4W4B5+jOVRZ5TlEkCePx7wiaL1gezzGcX/n3Oc8YE2GOPyvcSbPTda2ZK36/pBgLsUGcyl8k2pfSVsrqYEWx6HSHKVPLXDAkqc6ua2hfnmeQwU5PozTeeyF3HkeluaoNbpLJ7tkh3zEVQr7CECyD4v2SsEXM6QrxTCFzjNMkOOjrlJAdJ5HL9BKkSDZIR9zlcI+BpDsw7WTXeKm09ClUMnA/YJtGcF4Hxc2RGMqi2DS/LN7+rhC5R4uOJg94So3xGD2xAVauRMlK/cIV7ntCIBkHxntx3g8EUz6GG+kQqUYKchxlKsUEJ1n1AVaKZIkO+STrlLYJwGSfXS0VwpOyn7ClWK0QqUYLcjxKVcpIDqPpE8+1FFuCIBRTytwjEg0qz1/jODZE9SEGgOQUGNREmqcHNEE1IQaB5BQ41ESaoIc0UTUhJoAkFDPoCTURDmiSagJNREgoZ5FSahJckSTURNqEkBCPYeSUJPliKagJtRkgIR6HiWhpsgRTUVNqCkACTUVJaGmyRENoCbUNICEegEloabLEU1DTajpAAn1IkpCzZAj2gY1oWYAJNRLKAk1U45oOmpCzQRIqFkoCTVbjmhb1ISaDZBQL6Mk1Bw5ou1QE2oOQEK9gpJQc+WIZqAm1FyAhHoVJaHmyRHNRE2oeQAJ9RpKQs0XI2phZ33OB0io11ESaoFcQsHOh1oAkFBvoCTUQrmEgp0PtRAgod5ESahFcgkFOx9qEUBCvYWSUIvlEgp2PtRigIR6GyWhlsglFOx8qCUACfUOSkItlUso2PlQSwES6l2UhFoml1Cw86GWASTUcpSEWiGXULDzoVYAJNR7KAm1Ui6hYOdDrQRIqPdREmqVXELBzodaBZBQH6Ak1Gq5hIKdD7UaIKHWoCTUWrmEgp0PtRYgodahJNR6uYSCnQ+1HiChPkRJqA1yCQU7H2oDQEJ9hJJQG+USCnY+1EaAhPoYJaE2iRFNgJ0PtQkgoT5BSajNcgkFOx9qM0BCfYqSUFvkEgp2PtQWgIT6DCWhtsolFOx8qK0ACfU5SkJtk0so2PlQ2wAS6guUhNoul1Cw86G2AyTUlygJtUMuoWDnQ+0ASKivUBJqp1xCwc6H2gmQUF+jJNQuuYSCnQ+1CyChvkFJqN1yCQU7H2o3QEJ9i5JQe+QSCnY+1B6AhPoOJaH2yiUU7HyovQAJ9b0kR1SjSgEY9QNKz98n1/Nh5xntA0ioH1ESar9cQsHOM9oPkFA/oSTUAbmEgp1ndAAgoX5GSaiDYkQTYecZHQRIqF9QEuqQXELBzjM6BJBQv6Ik1GG5hIKdZ3QYIKF+Q0moI3IJBTvP6AhAQv2OklBH5RIKdp7RUYCE+gMloY7JJRTsPKNjAAn1J0pCHZdLKNh5RscBEuovlIQ6IZdQsPOMTgAk1N8oCeWLE0so2HlGchrocYyJA0moWLmEgp1nFAuQUH6UhIqTSyjYeUZxAAkVj5JQ2eQSCnaeUTaAhMqOklA55BIKdt2lHAAJlRMloXLJJRTsfKhcAAmVGyWh8sglFOx8qDwACZUXJaHyySUU7HyofAAJlR8loQqIEU2CnQ9VACChLkJJqIJyCQU7H6ogQEIVQkmownIJBTsfqjBAQhVBSaiL5RIKdj7UxQAJdQlKQhWVSyjY+VBFARLqUpSEukwuoWDnQ10GkFCXoyTUFXIJBTsf6gqAhLoSJaGukkso2PlQVwEk1NUoCVVMLqFg50MVA0ioa1ASqrhcQsHOhyoOkFDXoiTUdXIJBTsf6jqAhLoeJaFKyCUU7HyoEgAJVRIloUrJJRTsfKhSAAlVGiWhysglFOx8qDIACVUWJaHKySUU7HyocgAJdQNKQpWXSyjY+VDlARKqgiTHuCDB+NO9khfXp9MTxHssCM9ywjxjhfn19vt8feRuIrV9qa1+/lN6Inj0uOBNtLEenibu5E9LP2OkSfci0hUiJERWK0wFwbZ6CSYW6+cPms/CFqOfccH3vKJrdJAOwh2kg2AHyTy5pfsibFls24ZeePVNCCZ1YqgqhUzhD2LC3ksMGuXzyfdaFpHNkd7Fyp9ddtTSiLuvQtwFsuuM1nEyPBOCPG1CnFzMiXK7aVYwb6yEF5EGBuliIelFkqAXGv2OCyMXNL+whloFN6ttJUe5H5wvyXHy42ByXHSP/9xeB4XxPyXK4y6tFHdqlMddSinuQJTH3c6vE3dalMddUsnvilEed6aS3zdGedwtleKuFOVxZyjFfZNg3Lyvl5tQKtge10iuFzx28jjCfYrzi7Xm/zvE//+L8E16X7WynLYBweOlQIEoP2bnfcrKCvuqVQRzPTaY6+GbpK4a2laJi36OVaU5xgoT5ICTBQ/m/2krTp5nVUGON+N0Hnshd56bFTj+s0lXx1vO/+qociaHB4tbFKrjra462lsBOni1aK+OPClCujpWU6iO1QQ5VnfVEaLzVEepjjXO/+qYoGEwDxY1FKpjTVcdbU2ADl4r2qsjT8WTro61FKpjLUGOt7nqCNF5bkOpjref/9UxUcNgHixuV6iOd7jqaO8A6OC1o7068uRi6epYW6E61hbkWMdVR4jOUwelOt55/lfHJA2DebC4U6E61nXV0dYF6OD1or068u1R0tWxnkJ1rCfIsb6rjhCdpz5KdWxw/lfHZA2DebBooFAdG7rqaBsCdPBG0V4dbZx8dWykUB0bCXJs7KojROdpjFIdm5z/1TFFw2AeLJooVMemrjrapgAd/K5or45aS1dIJ3yzKL8Rgzt6M4WOXkx5Ur7E3hAnuV+x42SVY3PBm3Al/UDds0IYeJuj7Fndff7vWaVqGMwDz90KA+49bs/K3gPQwVtE+56VUTjv0ELhvEMLQY4t3XkHiM7TEqU6thLcdYu2tYVCbWkYzINFK4Xq2FowcbxrnHG7xZSSPTQQSw+ckoN7GyVd2wR1Rd0TGeKPfo7pkoMpqlFjAIxq64wydhyAUe2cUcZOADAqwxll7EQAozKdUcZOAjCqvTPK2MkARnVwRhk7BcCojs4oY6cBGNXJGWXsdACjOjujjJ0BYFQXZ5SxMwGM6uqMMnY2gFHdnFHGzgEwqrszyti5AEb1cEYZOw/AqJ7OKGPnAxjVyxll7AIAo+51Rhm7EMCo3s4oYxcBGNXHGWXsYgCj+jqjjF0CYFQ/Z5SxSwGM6u+MMnYZgFEDnFHGrgAwaqAzytiVAEbd54wydhWAUfc7o4xdDWDUA84oY9cCGDXIGWXsegCjHnRGGbsBwKjBzihjNwIYNcQZZewmAKMeckYZuxnAqKHOKGO3ABj1sDPK2K0ARj3ijDJ2G4BRw5xRxm4HMOpRZ5SxOwCMeswZZexOAKOGa60FExtGVORx6EJtPS64row3Zun1b544/9e/MZFyxWRt+2dZ04HCy5pyexo8pXJlhGBHjgt6EuM7fZMegBLl2jJeviPjFAmPjJNvd5TgAKcV96i4UwILtau2Hm8bhQWwrs+uUy3jhONvJphLTwq2Jbh+rr1eeRG2rMaaFOwv0kUjSZDj6ChfV5tzb7RCP35KacG1pzwL2YU26R3h0YL98WmlHeFoHs/GnP/jmcpONddUwQUgLR+EPaHQt8cK7wh789m7RfOOsCZPC8JzjHJty/IJDd/JuiHdT/2CbSUreB2jZfho4Y7vNcfn0xlQRwgPqCMED9AyT27/Pq0n07YNvfDqOy7IfXxcMDlCe1XjglXC+954xSWDQ8ZI9/hSyk9zMVnb/juBpOMufY6Omv9DnglBnnac4J7heMGOLZg3VsIL78AgnSs8iI9TOssU2qRP0084j70ObZG8Nlnb/inYExTGm2eUju653VBqalwKeFr4ksX9Ck9imyi8V62h41hhHR9Q0PFZAB3HC+s4SEHHSQA6PiOs44MKOj4HoOOzwjoOVtBxcpSfUWcdn1OI+3mAuJ9XiHsKQNxTFeKeChD3CwpxTwOI+0WFuF8AiPslhbinA8Q9SyHuFwHiflkh7hkAcb+iEPdLAHG/qhD3TIC4X1OIexZA3K8rxD0bIO43FOJ+GSDuNxXingMQ91sKcb8CEPfbCnHPBYj7HYW4XwWI+12FuOcBxL1cIe7XAOJ+TyHu+QBxv68Q9+sAcX+gEPcCgLjXKMT9BkDc6xTiXggQ94cKcb8JEPdHCnEvAoj7Y4W43wKI+xOFuBcDxP2pQtxvA8T9mULcSwDi/lwh7ncA4v5CIe6lAHF/qRD3uwBxf6UQ9zKAuL9WiHs5QNzfKMS9AiDubxXifg8g7u8U4l4JEPf3CnG/DxD3DwpxrwKI+0eFuD8AiPsnhbhXA8T9s0LcawDi/kUh7rUAcf+qEPc6gLh/U4h7PUDcvyvE/SFA3H8oxL0BIO4/FeL+CCDuvxTi3ggQ998KcX8MEHeMwr2NmwDi9ivE/QlA3PEKcW8GiDu7QtyfAsSdUyHuLQBx51aI+zOAuPMqxL0VIO78CnF/DhD3RQpxbwOIu5BC3F8AxF1EIe7tAHFfohD3lwBxX6oQ9w6AuC9XiPsrgLivVIh7J0DcVyvE/TVA3NcoxL0LIO5rFeL+BiDu6xXi3g0Qd0mFuL8FiLu0Qtx7AOIuqxD3dwBx36AQ916AuCsoxP29YNxE0ZeHUC/YHq8Rx+ub8dpcvK4Ur4nE6wPxWjm8bgyvocLrifDaGrzOBK+5wOsP8L34fF8636PN9yvzvbt8Hyvf08n3N/K9fnzfG98DxvdD8b1BfJ8M3zPC90/wvQQ8r57nmPN8a557zPNweU4qz8/kuYo8b4/nsPF8Lp7bxPN8eM4Lz//guRA8L4CvkfP1Yr52ytcR+ZoaX1/iay183YHPwfP5aD43y+cp+Zwdn7/iczl8XoOP8fl4l4/9+DiIjwl4/5j3FXm/ifchuJ5ybeFxlscc7n+ci+xLaBPOpWSt9RZ/EMyl2GAuhW9S7StpayU10OK4T5pjrDBBDljy8RbcFgctzXOfIMcfcTqPvZA7z4/SHLVGd+lkl+yQ+12lsPsBkv2naK8U/LAU6Urxk0Ln+UmQ4wFXKSA6z4ELtFIkSHbIn12lsD8DJPtB7WTPaiLxyYnQo5YkA/cLtpUsGO8vwobECvvBg4Rg0vyze/qLQuU+KDiYHXKVG2IwO3SBVu5Eycr9q6vc9leAZD8c7cd4PBRJH+MdVqgUhwU5/uYqBUTn+e0CrRRJkh3yiKsU9ghAsv8e7ZWCk3KMcKX4XaFS/C7I8airFBCd52iUVwqLcN3oD0ERWT9/UEdut5jvZOyI1WOIP/o5HpPsAKhGjQEw6k9nlLHjAIw67owydgKAUX85o4ydCGDUCWeUsZMAjPrbGWXsZACjfPHOKDsFwKgYZ5Sx0wCMinVGGTsdwCi/M8rYGQBGxTmjjJ0JYFS8M8rY2QBGZXNGGTsHwKjszihj5wIYlcMZZew8AKNyOqOMnQ9gVC5nlLELAIzK7YwydiGAUXmcUcYuAjAqrzPK2MUARuVzRhm7BMCo/M4oY5cCGFXAGWXsMgCjLnJGGbsCwKiCzihjVwIYVcgZZewqAKMKO6OMXQ1gVBFnlLFrAYy62Bll7HoAoy5xRhm7AcCoos4oYzcCGHWpM8rYTQBGXeaMMnYzgFGXO6OM3QJg1BXOKGO3Ahh1pTPK2G0ARl3ljDJ2O4BRVzujjN0BYFQxZ5SxOwGMusYZZewuAKOKO6OM3Q1g1LXOKGP3ABh1nTPK2L0ARl3vjDK2FIBRJZxRxu4DMKqkM8rY/QBGlXJGGXsAwKjSzihjDwIYVcYZZewhAKPKOqOMPQxgVDlnlLFHAIy6wRll7FEAo8o7o4w9BmBUBWeUsccBjDLOKGNPABhlnVHG+gAW/k9wRhkbC2BUojPK2DgAo5KcUcZmAzAq2RllbA4Ao1KcUcbmAjAq1RllbB4AowLOKGPzARiV5owytgCAURWdUcYWBDDqRmeUsYUBjKrkjDL2YgCjbnJGGVsUwKjKzihjLwMwqoozytgrAIyq6owy9ioAo252RhlbDMCoW5xRxhYHMOpWZ5Sx1wEYVc0ZZWwJAKOqO6OMLQVgVA1nlLFlAIyq6YwythyAUbWcUcaWBzDqNkmj4oIE40/3Sn76lE9eXA2eCSA8rTDPWGF+oym5npLrUPZpamtM3Ck9ETz6RXBAifXwvD3YYe+gnzHSpEcR6aQICZFoUpKSMlITMmyibWMS0tIDySYpOT0lYAM2OZDcLiGQmJgRSAqkpqWnpZo0m5SYYTOT0xIzgw0nCbY1SjCxWD9/0HwWthj9jAu+5xVdo4OMFe4gYwU7SObJLd0XYcti2zb0wqtv7WBS14kPmhEyhT+ICXuvTtAon0++14aMCW83q0lbObvsqCUd99NKcVfJrjNax8nwTAjytLXj5WKuI7ebZgXzxkp4EWlgkC4Wkl7cKeiFRr/jwsgFzS+soVbBzWpbdaPcD86XuvHy42DdeNlxULrPJZPHKYI7JNxeepz8jlOKYC7WA/AkVdiTtgqepAp6Uh/Ak4CwJ+0UPAkIetIAwJM0YU8yFDxJE/SkIYAnFYU9yVTwpKKgJ40APLlR2JP2Cp7cKOhJYwBPKgl70kHBk0qCnjQB8OQmYU86Knhyk6AnTYU9Eb9dmGLtpHB+6i6AuDsrxN0MIO4uCnE3B4i7q0LcdwPE3U0h7nsA4u6uEHcLgLh7KMTdEiDungpxtwKIu5dC3K0B4r5XIe42AHH3Vog7HSDuPgpxtwWIu69C3O0A4u6nEHcGQNz9FeLOBIh7gELc7QHiHqgQdweAuO9TiLsjQNz3K8TdCSDuBxTi7gwQ9yCFuLsAxP2gQtxdAeIerBB3N4C4hyjE3R0g7ocU4u4BEPdQhbh7AsT9sELcvQDifkQh7nsB4h6mEHdvgLgfVYi7D0DcjynE3Rcg7uEKcfcTjJvncucllAq2x/NMeV4jz6PjeVs8T4jnpfA8CL7uzteg+XosX5vk63R8zYqv3/C1DD6vz+e4+Xwvn/vk84B8TozPD/G5Ej5vwMfQfDzJx1Z8nMH73Lz/yftivF/CNZrrFY/dPI5xn+b8Zq/7Rbj9U3ouen85bQOC90MEqkT5PTk8Z7y/wlz0AYK5HhvM9fBNUlcNbSU10OI4UJpjrDBBDriu4M063BYHLc1zoCDH+3A6j72QO899Chz/2aSr4/3nf3VUuVOLB4v7FarjA6462gcAOvigaK+OvOiJdHUcpFAdBwlyfNBVR4jO8yBKdRx8/lfHBA2DebAYrFAdh7jqaIcAdPCHor06ctZLV8eHFKrjQ4Ich7rqCNF5hqJUx4fP/+qYqGEwDxYPK1THR1x1tI8AdPBh0V4defFA6eo4TKE6DhPk+KirjhCd51GU6vjY+V8dkzQM5sHiMYXqONxVRzscoIM/Hu3VkYdf6er4uEJ1fFyQ4xOuOkJ0nidQquOI8786JmsYzIPFCIXqONJVRzsSoIOPivbqyAvDS1fHUQrVcZQgxydddYToPE+iVMfR5391TNEwmAeL0QrV8SlXHe1TAB386WivjlqPppFO+DFRfiMGd/QxCh29lfKkfIm9IU5yv2LHySrHsXK5YyX9QN2zQhh4x6LsWY07//esUjUM5oFnnMKAO97tWdnxAB18QrTvWd2ucN5hgsJ5hwmCHJ9x5x0gOs8zKNVxouCuW7Q9OyzUlobBPFhMVKiOzwomTozv1DMMud1iSskeGoilB07JwX2Skq6Tgrqi7okM8Uc/x+ckB1NUo8YAGDXZGWXsOACjnndG0X45gFFTnFHGTgQwaqozythJAEZNc0ZRoQYw6gVnFI3/AEZNd0bRsAJg1IvOKMpWAKNmOKNIBACjXnJGGTsTwKiZzihjZwMYNcsZZewcAKNmO6OMnQtg1MvOKGPnARg1xxll7HwAo15xRhm7AMCouc4oYxcCGPWqM8rYRQBGzXNGGbsYwKjXnFHGLgEwar4zytilAEa97owydhmAUQucUcauADDqDWeUsSsBjFrojDJ2FYBRbzqjjF0NYNQiZ5SxawGMessZZex6AKMWO6OM3QBg1NvOKGM3Ahi1xBll7CYAo95xRhm7GcCopc4oY7cAGPWuM8rYrQBGLXNGGbsNwKjlzihjtwMYtcIZZewOAKPec0YZuxPAqJVaa8HEhhGVWABJqq33BdeV8cYsvf7NqvN//RsTKVdM1rZ/ljX9Q3hZ0wkKy5p+INj54oI6xvhO36QHjYBcW8bLd3W8IuHV8fLtrhEclLTiXhN/SmChdtXW0J2ksGhVu+w6FS5OOP4xgrm0VrAtwTVvbTvlhdOyGmtasL9IF6Q0QY7ronwtbM69dQr9eL3SImnrPYvPhTbpndd1gv3xQ6Wd12gezzac/+OZyo4w11TBRRstHzitUujbHwnvCHvz2btF846wJs8UEJ4blGtbVvO0ou9k3ZDup37BtioqeB2jZfg64Y7vNcfn0xlQPxAeUD8QPEDLPLn9+1ScTNs29MKr78Yg94/jg8kR2qvaGKwS3vc+VlzmN2SMdI9vr/wEFpO17b8TSDruDufoqPk/5JkQ5Gk3Cu4ZfizYsQXzxkp44R0YpHOFB/GNSmeZQpv0qfVN57HXoS2S1yZr2z8Fe5PCePOJ0tE9txsaczQuMxwTvswwUeEyw2bhvWoNHf8U1vFZBR0/BdDxuLCOkxR03AKg41/COj6noONnADqeENZxsoKOWwF0/FtYx+cVdPwcQEdfvKyOUxR03AagY4ywjlMVdPwCQMdYYR2nKei4HUBHv7COLyjo+CWAjnHCOk5X0HEHgI7xwjq+qKDjVwA6ZhPWcYaCjjsBdMwurONLCjp+DaBjDmEdZyrouAtAx5zCOs5S0PEbAB1zCes4W0HH3QA65hbW8WUFHb8F0DGPsI5zFHTcA6BjXmEdX1HQ8TsAHfMJ6zhXQce9ADrmF9bxVQUdvwfQsYCwjvMUdPwBQMeLhHV8TUHHfQA6FhTWcb6Cjj8C6FhIWMfXFXTcD6BjYWEdFyjo+BOAjkWEdXxDQccDADpeLKzjQgUdfwbQ8RJhHd9U0PEggI5FhXVcpKDjLwA6Xiqs41sKOh4C0PEyYR0XK+j4K4COlwvr+LaCjocBdLxCWMclCjr+BqDjlcI6vqOg4xEAHa8S1nGpgo6/A+h4tbCO7yroeBRAx2LCOi5T0PEPAB2vEdZxuYKOxwB0LC6s4woFHf8E0PFaYR3fU9DxOICO1wnruFJBx78AdLxeWMf3FXQ8AaBjCWEdVyno+DeAjiWFdfxAQUdftujXsZSwjqsVdIwB0LG0sI5rFHSMBdCxjLCOaxV09APoWFZYx3UKOsYB6FhOWMf1CjrGA+h4g7COHyromA1Ax/LCOm5Q0DE7gI4VhHX8SEHHHAA6GmEdNyromBNARyus48cKOuYC0DFBWMdNCjrmBtAxUVjHTxR0zAOgY5KwjpsVdMwLoGOysI6fKuiYD0DHFGEdtyjomB9Ax1RhHT9T0LEAgI4BYR23Kuh4EYCOacI6fq6gY0EAHSsK67hNQcdCADreKKzjFwo6FgbQsZKwjtsVdCwCoONNwjp+qaDjxQA6VhbWcYeCjpcA6FhFWMevFHQsCqBjVWEddyroeCmAjjcL6/i1go6XAeh4i7COuxR0vBxAx1uFdfxGQccrAHSsJqzjbgUdrwTQsbqwjt8q6HgVgI41hHXco6Dj1QA61hTW8TsFHYsB6FhLWMe9CjpeA6DjbcI6fq+gY3FBHfl5NPkI9YLt8TNZ+Hki/CwMfo4DP4OA18/ntd953XJec5vXi+a1jnmdXl5jltdH5bU9eV1KXlOR1wPktex4HTZeQ4zXv+K1m3jdIV4zh9d74bVKeJ0NXiOC1zfge/P5vnK+J5rv5+V7Ufk+Sr4HkO9f43uv+L4hvueF79fgew14njzP8eb5yTy3lueF8pxGno/Hc8l4HhTP4eH5Jzx3gq/78zVrvt7K1wr5Ohdfo+HrC3xunM/r8jlJPp/G54L4PAYfg/PxIx/78H4773Py/hLXeq5TPMby+MC5zb6ENuHnGyVrPd/oWsFcig3mUvgm1b6StlZSAy2O10lzlB48OWDJx0lzWxy0NE+vkFnleD1O57EXcue5Xpqj1uguneySHbKEqxS2BECyl4z2SsEPJ5euFCUVKkVJwUpRylUKiM5T6gKtFAmSHbK0qxS2NECyl9FO9izfoEhtVPSd/pBlk7XN+gXbqigYb1nlE2QSlVYwaf7ZPS2rULnLCFbucq5yQwxm5S7Qyp0oWblvcJXb3gCQ7OWj/RgvxSd/jFdeoVKUF6wUFVylgOg8FS7QSpEk2SGNqxTWACS7jfZKwUm5QbhSWIVKYQUrRYKrFBCdJyHKK4VFuG6UKCgi6+cP6sjtFvOdjB2xegzxRz/HJMkOgGrUGACjkp1Rxo4DMCrFGWXsBACjUp1Rxk4EMCrgjDJ2EoBRac4oYycDGFXRGWXsFACjbnRGGTsNwKhKzihjpwMYdZMzytgZAEZVdkYZOxPAqCrOKGNnAxhV1Rll7BwAo252Rhk7F8CoW5xRxs4DMOpWZ5Sx8wGMquaMMnYBgFHVnVHGLgQwqoYzythFAEbVdEYZuxjAqFrOKGOXABh1mzPK2KUARt3ujDJ2GYBRdzijjF0BYFRtZ5SxKwGMquOMMnYVgFF3OqOMXQ1gVF1nlLFrAYyq54wydj2AUfWdUcZuADCqgTPK2I0ARjV0Rhm7CcCoRs4oYzcDGNXYGWXsFgCjmjijjN0KYFRTZ5Sx2wCMussZZex2AKOaOaOM3QFgVHNnlLE7AYy62xll7C4Ao+5xRhm7G8CoFs4oY/cAGNXSGWXsXgCjWjmjjC0FYFRrZ5Sx+wCMauOMMnY/gFHpzihjDwAY1dYZZexBAKPaOaOMPQRgVIYzytjDAEZlOqOMPQJgVHtnlLFHAYzq4Iwy9hiAUR2dUcYeBzCqkzPK2BMARnV2Rhnri4t+jl2cUcbGAhjV1RllbByAUd2cUcZmAzCquzPK2BwARvVwRhmbC8Cons4oY/MAGNXLGWVsPgCj7nVGGVsAwKjezihjCwIY1ccZZWxhAKP6OqOMvRjAqH7OKGOLAhjV3xll7GUARg1wRhl7BYBRA51Rxl4FYNR9zihjiwEYdb8zytjiAEY94Iwy9joAowY5o4wtAWDUg84oY0sBGDXYGWVsGQCjhjijjC0HYNRDzihjywMYNVTSqLggwfjTvRInHvDJi6vBMxWEZ4owz1hhfusoqdbHy7X3IbW1wZOoCB6VFeyssR6eD2c7+fMR+hkjTXoNiZwWISESTUpSUkZqQoZNtG1MQlp6INkkJaenBGzAJgeS2yUEEhMzAkmB1LT0tFSTZpMSM2xmclpiZrDhNMG21ggmFuvnD5rPwhajn3HB97yia3SQj4Q7yEeCHSTz5Jbui7BlsW0beuHVd1gwqR/NFjQjZAp/EBP23qNBo3w++V4bMia83awmbaEcsqOWdNwfKsVdOIfOaB0nwzMhyNMOyyYX86NyI78VzBsr4UWkgUG6WEh68ZigFxr9jgsjFzS/sIZaBTerbQ2Pcj84X4Znkx8Hh2eTHQel+1xd8rie4A4Jt/dcvPyOUz3BXHwcwJP6wp5MVvCkvqAnTwB40kDYk+cVPGkg6MkIAE8aCnsyRcGThoKejATwpJGwJ1MVPGkk6MkoAE8aC3syTcGTxoKePAngSRNhT15Q8KSJoCejATxpKuzJdAVPmgp68hSAJ3cJe/Kigid3CXryNIAnzYQ9maHgSTNBT8YAeNJc2JOXFDxpLujJWABP7hb2ZKaCJ3cLejIOwJN7hD2ZpeDJPYKejAfwpIWwJ7MVPGkh6MkEAE9aCnvysoInLQU9eQbAk1bCnsxR8KSVoCcTATxpLezJKwqetBb05FkAT9oIezJXwZM2gp5MAvAkXdiTVxU8SRf05DkAT9oKezJPwZO2gp5MBvCknbAnryl40k7Qk+cBPMkQ9mS+gicZgp5MAfAkU9iT1xU8yRT0ZCqAJ+2FPVmg4El7QU+mAXjSQdiTNxQ86SDoyQsAnnQU9mShgicdBT2ZDuBJJ2FP3lTwpJOgJy8CeNJZ2JNFCp50FvRkBoAnXYQ9eUvBky6CnrwE4ElXYU8WK3jSVdCTmQCedBP25G0FT7oJejILwJPuwp4sUfCku6AnswE86SHsyTsKnvQQ9ORlAE96CnuyVMGTnoKezAHwpJewJ+8qeNJL0JNXADy5V9iTZQqe3CvoyVwAT3oLe7JcwZPegp68CuBJH2FPVih40kfQk3kAnvQV9uQ9BU/6CnryGoAn/YQ9WangST9BT+YLesJrKeQnlAq2x/d5833FfB8r3zfJ9+nxfWF8HxLf98L3WfC8fp5HzvOWeZ4sz8vkeYA874znOfG8Gp7HwfMG+Do1Xxfl63B83YevM/B5bT6Pyuft+DwRn5fg42A+7uL9fN6v5P0Yrps8TvO4wHk4P7jwjXeTXgvidTltA4LrkQQKR/maOLxmw+sKa0EsEF4ZLP/pKSSqq4a2khpocXxDmqP0AMwBDxdcLIfb4qCleb4hyHEhTuexF3LnWajA8Z9Nujq+ef5XR5WVkniweFOhOi5y1dEuAujgb0V7deRFh6Wr41sK1fEtQY6LXXWE6DyLUarj2+d/dUzQMJgHi7cVquMSVx3tEoAO/k60V0de6l66Or6jUB3fEeS41FVHiM6zFKU6vnv+V8dEDYN5sHhXoTouc9XRLgPo4MujvTqWzSZfHZcrVMflghxXuOoI0XlWoFTH987/6pikYTAPFu8pVMeVrjralQAd/P1or478+DHp6vi+QnV8X5DjKlcdITrPKpTq+MH5Xx2TNQzmweIDheq42lVHuxqgg6+J9ur4iMKx4xqF6rhGkONaVx0hOs9alOq47vyvjikaBvNgsU6hOq531dGuB+jgH0Z7ddR6NLR0wm8QFlKjo29Q6Oi9lSflS+wNcZL7FTtOVjl+JJc7VtIP1D0rhIH3I5Q9q43n/55VqobBPPBsVBhwP3Z7VvZjgA6+Kdr3rB5WOO+wSeG8wyZBjp+48w4QnecTlOq4WXDXTbA6WoS7gTYrVMdPBRMnJpgv/JPbLaaU7KGBWHrglBzctyjpuiWoK+qeyBB/9HP8THIwRTVqDIBRW51Rxo4DMOpzZ5SxEwCM2uaMMnYigFFfOKOMnQRg1HZnlLGTAYz60hll7BQAo3Y4o4ydBmDUV84oY6cDGLXTGWXsDACjvnZGGTsTwKhdzihjZwMY9Y0zytg5AEbtdkYZOxfAqG+dUcbOAzBqjzPK2PkARn3njDJ2AYBRe51Rxi4EMOp7Z5SxiwCM+sEZZexiAKP2OaOMXQJg1I/OKGOXAhi13xll7DIAo35yRhm7AsCoA84oY1cCGPWzM8rYVQBGHXRGGbsawKhfnFHGrgUw6pAzytj1AEb96owydgOAUYedUcZuBDDqN2eUsZsAjDrijDJ2M4BRvzujjN0CYNRRZ5SxWwGM+sMZZew2AKOOOaOM3Q5g1J/OKGN3ABh13Bll7E4Ao/7SWgsmNoyoxAJIUm2dEFxXxhuz9Po3f5//69+YSLlisrb9s6xpoqB2vKzpJoVlTX3ZdTqfdN+T9KaSDyPmGMGYbwKJOVYw5sogMfsFY65yjmI2WdtsVUH9mvl1Ypbe0bnZh8HzFhCet/owcr2aYK63AMn16j4MnjVAeNYE4VkLhOdtIDxvB+F5BwjP2iA864DwvBOEZ10QnvVAeNYH4dkAhGdDEJ6NQHg2BuHZBIRnUxCed4HwbAbCszkIz7tBeN4DwrMFCM+WIDxbgfBsDcKzDQjPdBCebUF4tgPhmQHCMxOEZ3sQnh1AeHYE4dkJhGdnEJ5dQHh2BeHZDYRndxCePUB49gTh2QuE570gPHuD8OwDwrMvCM9+IDz7g/AcAMJzIAjP+0B43g/C8wEQnoNAeD4IwnMwCM8hIDwfAuE5FITnwyA8HwHhOQyE56MgPB8D4TkchOfjIDyfAOE5AoTnSBCeo0B4PgnCczQIz6dAeD4NwnMMCM+xIDzHgfAcD8JzAgjPZ0B4TgTh+SwIz0kgPJ8D4TkZhOfzIDyngPCcCsJzGgjPF0B4Tgfh+SIIzxkgPF8C4TkThOcsEJ6zQXi+DMJzDgjPV0B4zgXh+SoIz3kgPF8D4TkfhOfrIDwXgPB8A4TnQhCeb4LwXATC8y0QnotBeL4NwnMJCM93QHguBeH5LgjPZSA8l4PwXAHC8z0QnitBeL4PwnMVCM8PQHiuBuG5BoTnWhCe60B4rgfh+SEIzw0gPD8C4bkRhOfHIDw3gfD8BITnZhCen4Lw3ALC8zMQnltBeH4OwnMbCM8vQHhuB+H5JQjPHSA8vwLhuROE59cgPHeB8PwGhOduEJ7fgvDcA8LzOxCee0F4fg/C8wcfBs99IDx/BOG5H4TnTyA8D4Dw/BmE50EQnr+A8DwEwvNXEJ6HQXj+BsLzCAjP30F4HgXh+QcIz2MgPP8E4XkchOdfIDxPgPD8G4QnN4jAMwaEZywITz8IzzgQnvEgPLOB8MwOwjMHCM+cIDxzgfDMDcIzDwjPvCA884HwzA/CswAIz4tAeBYE4VkIhGdhEJ5FQHheDMLzEhCeRUF4XgrC8zIQnpeD8LwChOeVIDyvAuF5NQjPYiA8rwHhWRyE57UgPK8D4Xk9CM8SIDxLgvAsBcKztDDPWGF+w7P5fI9nO9VeoklJSspITciwibaNSUhLDySbpOT0lIAN2ORAcruEQGJiRiApkJqWnpZq0mxSYobNTE5LzAw2yO19lk2eZ5kYOY7eeE0WNy1PnhD2ZKuCJ2UFPXkCwJMRwp58ruBJOUFPRgB4MlLYk20Kntwg6MlIAE9GCXvyhYIn5QU9GQXgyZPCnmxX8KSCoCdPAngyWtiTLxU8MYKejAbw5ClhT3YoeGIFPXkKwJOnhT35SsGTBEFPngbwZIywJzsVPEkU9GQMgCdjhT35WsGTJEFPxgJ4Mk7Yk10KniQLejIOwJPxwp58o+BJiqAn4wE8mSDsyW4FT1IFPZkA4Mkzwp58q+BJQNCTZwA8mSjsyR4FT9IEPZkI4Mmzwp58p+BJRUFPngXwZJKwJ3sVPLlR0JNJAJ48J+zJ9wqeVBL05DkATyYLe/KDgic3CXoyGcCT54U92afgSWVBT54H8GSKsCc/KnhSRdCTKQCeTBX2ZL+CJ1UFPZkK4Mk0YU9+UvDkZkFPpgF48oKwJwcUPLlF0JMXADyZLuzJzwqe3CroyXQAT14U9uSggifVBD15EcCTGcKe/KLgSXVBT2YAePKSsCeHFDypIejJSwCezBT25FcFT2oKejITwJNZwp4cVvCklqAnswA8mS3syW8Kntwm6MlsAE9eFvbkiIIntwt68jKAJ3OEPfldwZM7BD2ZA+DJK8KeHFXwpLagJ68AeDJX2JM/FDypI+jJXABPXhX25JiCJ3cKevIqgCfzhD35U8GTuoKezAPw5DVhT44reFJP0JPXADyZL+zJXwqe1Bf0ZL6yJxIafiroyQlq6+9s8usMNIiJbh3Xxft8SYI6fkjtbY6X17EhgI7Jwjp+qqBjIwAdU4R13KKgY2MAHVOFdfxMQccmADoGhHXcqqBjUwAd04R1/FxBx7sAdKworOM2BR2bAeh4o7COXyjo2BxAx0rCOm5X0PFuAB1vEtbxSwUd7wHQsbKwjjsUdGwBoGMVYR2/UtCxJYCOVYV13KmgYysAHW8W1vFrBR1bA+h4i7COuxR0bAOg463COn6joGM6gI7VhHXcraBjWwAdqwvr+K2Cju0AdKwhrOMeBR0zAHSsKazjdwo6ZgLoWEtYx70KOrYH0PE2YR2/V9CxA4COtwvr+IOCjh0BdLxDWMd9Cjp2AtCxtrCOPyro2BlAxzrCOu5X0LELgI53Cuv4k4KOXQF0rCus4wEFHbsB6FhPWMefFXTsDqBjfWEdDyro2ANAxwbCOv6ioGNPAB0bCut4SEHHXgA6NhLW8VcFHe8F0LGxsI6HFXTsDaBjE2Edf1PQsQ+Ajk2FdTyioGNfAB3vEtbxdwUd+wHo2ExYx6MKOvYH0LG5sI5/KOg4AEDHu4V1PKag40AAHe8R1vFPBR3vA9CxhbCOxxV0vB9Ax5bCOv6loOMDADq2EtbxhIKOgwB0bC2s498KOj4IoGMbYR19Cve7DgbQMV1YxxgFHYcA6NhWWMdYBR0fAtCxnbCOfgUdhwLomCGsY5yCjg8D6JgprGO8go6PAOjYXljHbAo6DgPQsYOwjtkVdHwUQMeOwjrmUNDxMQAdOwnrmFNBx+EAOnYW1jGXgo6PA+jYRVjH3Ao6PgGgY1dhHfMo6DgCQMduwjrmVdBxJICO3YV1zKeg4ygAHXsI65hfQccnAXTsKaxjAQUdRwPo2EtYx4sUdHwKQMd7hXUsqKDj0wA69hbWsZCCjmMAdOwjrGNhBR3HAujYV1jHIgo6jgPQsZ+wjhcr6DgeQMf+wjpeoqDjBAAdBwjrWFRBx2cAdBworOOlCjpOBNDxPmEdL1PQ8VkAHe8X1vFyBR0nAej4gLCOVyjo+ByAjoOEdbxSQcfJADo+KKzjVQo6Pg+g42BhHa9W0HEKgI5DhHUspqDjVAAdHxLW8RoFHacB6DhUWMfiCjq+EOU68nN8fNnl2jsRbE9ax+nCOoY2aZ4vgvCcAcLzJRCeM0F4zgLhORuE58sgPOeA8HwFhOdcEJ6vgvCcB8LzNRCe80F4vg7CcwEIzzdAeC4E4fkmCM9FIDzfAuG5GITn2yA8l4DwfAeE51IQnu+C8FwGwnM5CM8VIDzfA+G5EoTn+yA8V4Hw/ACE52oQnmtAeK4F4bkOhOd6EJ4fgvDcAMLzIxCeG0F4fgzCcxMIz09AeG4G4fkpCM8tIDw/A+G5FYTn5yA8t4Hw/AKE53YQnl+C8NwBwvMrEJ47QXh+DcJzFwjPb0B47gbh+S0Izz0gPL8D4bkXhOf3IDx/AOG5D4TnjyA894Pw/AmE5wEQnj+D8DwIwvMXEJ6HQHj+CsLzMAjP30B4HgHh+TsIz6MgPP8A4XkMhOefIDyPg/D8C4TnCRCef4Pw9MVi8IwB4RkLwtMPwjMOhGc8CM9sIDyzg/DMAcIzJwjPXCA8c4PwzAPCMy8Iz3wgPPOD8CwAwvMiEJ4FQXgWAuFZGIRnERCeF4PwvASEZ1EQnpeC8LwMhOflIDyvAOF5JQjPq0B4Xg3CsxgIz2tAeBYH4XktCM/rQHheD8KzBAjPkiA8S4HwLA3CswwIz7IgPMuB8LwBhGd5EJ4VQHgaEJ4WhGcCCM9EEJ5JIDyTQXimgPBMBeEZAOGZBsKzIgjPG0F4VgLheRMIz8ogPKuA8KwKwvNmEJ63gPC8FYRnNRCe1UF41gDhWROEZy0QnreB8LwdhOcdIDxrg/CsA8LzThCedUF41gPhWR+EZwMQng1BeDYC4dkYhGcTEJ5NQXjeBcKzGQjP5iA87wbheQ8IzxYgPFuC8GwFwrM1CM82IDzTQXi2BeHZDoRnBgjPTBCe7UF4dgDh2RGEZycQnp1BeHYB4dkVhGc3EJ7dQXj2AOHZE4RnLxCe94Lw7A3Csw8Iz74gPPuB8OwPwnMACM+BIDzvA+F5PwjPB0B4DgLh+SAIz8EgPIeA8HwIhOdQEJ4Pg/B8BITnMBCej4LwfAyE53AQno+D8HwChOcIEJ4jQXiOAuH5JAjP0SA8nwLh+TQIzzEgPMeC8BwHwnM8CM8JIDyfAeE5EYTnsyA8J4HwfA6E52QQns+D8JwCwnMqCM9pIDxfAOE5HYTniyA8Z4DwfAmE50wQnrNAeM4G4fkyCM85IDxfAeE5F4TnqyA854HwfA2E53wQnq+D8FwAwvMNEJ4LQXi+CcJzEQjPt0B4Lgbh+TYIzyUgPN8B4bkUhOe7IDyXgfBcDsJzBQjP90B4rgTh+T4Iz1UgPD8A4bkahOcaEJ5rQXiuA+G5HoTnhyA8N4Dw/AiE50YQnh+D8NwEwvMTEJ6bQXh+CsJzCwjPz0B4bgXh+TkIz20gPL8A4bkdhOeXIDx3gPD8CoTnThCeX4Pw3AXC8xsQnrtBeH4LwnMPCM/vQHjuBeH5PQjPH0B47gPh+SMIz/0gPH8C4XkAhOfPIDwPgvD8BYTnIRCev4LwPAzC8zcQnkdAeP4OwvMoCM8/QHgeA+H5JwjP4yA8/wLheQKE598gPH1+DJ4xIDxjQXj6lXjGhvFMNClJSRmpCRk20bYxCWnpgWSTlJyeErABmxxIbpcQSEzMCCQFUtPS01JNmk1KzLCZyWmJmcG2SwjGHCccc4xwrMOz+XxbCH5hr+P9chw3ZJPj1TsHRg7GCXqRDaTfxQvGnB0k5myCMecAiTm7YMw5QWLOIRhzLpCYcwrGnBsk5lyCMecBiTm3YMx5QWLOIxhzPpCY8wrGnB8k5nyCMRcAiTm/YMwXgcRcQDDmgiAxXyQYcyGQmAsKxlwYJOZCgjEXAYm5sGDMF4PEXEQw5ktAYr5YMOaiIDFfIhjzpSAxFxWM+TKQmC8VjPlykJgvE4z5CpCYLxeM+UqQmK8QjPkqkJivFIz5apCYrxKMuRhIzFcLxnwNSMzFBGMuDhLzNYIxXwsSc3HBmK8DiflawZivB4n5OsGYS4DEfL1gzCUFY/YHY90fDLgS4SZCZUKVIOebCbcQbiVUI1Qn1CDUJNQi3Ea4nXAHoTahDuFOQl1CPUJ9QgNCQ0IjQmNCE0JTwl2EZoTmhLsJ9xBaEFoSWhFaE9oQ0gltCe0IGYRMQntCB0JHQidCZ0IXQldCN0J3Qg9CT0Ivwr2E3oQ+hL6EfoT+hAGEgYT7CPcTHiAMIjxIGEwYQniIMJTwMOERwjDCo4THCMMJjxOeIIwgjCSMIjxJGE14ivA0YQxhLGEcYTxhAuEZwkTCs4RJhOcIkwnPE6YQphKmEV4gTCe8SJhBeIkwkzCLMJvwMmEO4RXCXMKrhHmE1wjzCa8TFhDeICwkvElYRHiLsJjwNmEJ4R3CUsK7hGWE5YQVhPcIKwnvE1YRPiCsJqwhrCWsI6wnfEjYQPiIsJHwMWET4RPCZsKnhC2EzwhbCZ8TthG+IGwnfEnYQfiKsJPwNWEX4RvCbsK3hD2E7wh7Cd8TfiDsI/xI2E/4iXCA8DPhIOEXwiHCr4TDhN8IRwi/E44S/iAcI/xJOE74i3CC8DeBJ0XFEGIJfkIcIZ6QjZCdkIOQk5CLkJuQh5CXkI+Qn1CAcBGhIKEQoTChCOFiwiWEooRLCZcRLidcQbiScBXhakIxwjWE4oRrCdcRrieUIJQklCKUJpQhlCWUI9xAKE+oQDAES0ggJBKSCMmEFEIqIUBII1Qk3EioRLiJUJlQhVCVcDPhFsKthGqE6oQahJqEWoTbCLcT7iDUJtQh3EmoS6hHqE9oQGhIaERoTGhCaEq4i9CM0JxwN+EeQgtCS0IrQmtCG0I6oS2hHSGDkEloT+hA6EjoROhM6ELoSuhG6E7oQehJ6EW4l9Cb0IfQl9CP0J8wgDCQcB/hfsIDhEGEBwmDCUMIDxGGEh4mPEIYRniU8BhhOOFxwhOEEYSRhFGEJwmjCU8RniaMIYwljCOMJ0wgPEOYSHiWMInwHGEy4XnCFMJUwjTCC4TphBcJMwgvEWYSZhFmE14mzCG8QphLeJUwj/AaYT7hdcICwhuEhYQ3CYsIbxEWE94mLCG8Q1hKeJewjLCcsILwHmEl4X3CKsIHhNWENYS1hHWE9YQPCRsIHxE2Ej4mbCJ8QthM+JSwhfAZYSvhc8I2wheE7YQvCTsIXxF2Er4m7CJ8Q9hN+Jawh/AdYS/he8IPhH2EHwn7CT8RDhB+Jhwk/EI4RPiVcJjwG+EI4XfCUcIfhGOEPwnHCX8RThD+JnBxjCHEEvyEOEI8IRshOyEHISchFyE3IQ8hLyEfIT+hAOEiQkFCIUJhQhHCxYRLCEUJlxIuI1xOuIJwJeEqwtWEYoRrCMUJ1xKuI1xPKEEoSShFKE0oQyhLKEe4gVCeUIFgCJaQQEgkJBGSCSmEVEKAkEaoSLiRUIlwE6EyoQqhKuFmwi2EWwnVCNUJNQg1CbUItxFuJ9xBqE2oQ7iTUJdQj1Cf0IDQkNCI0JjQhNCUcBehGaE54W7CPYQWhJaEVoTWhDaEdEJbQjtCBiGT0J7QgdCR0InQmdCF0JXQjdCd0IPQk9CLcC+hN6EPoS+hH6E/YQBhIOE+wv2EBwiDCA8SBhOGEB4iDCU8THiEwM+d52e68/PS+Vnk/JxvfoY2P5+an/3Mz1XmZxbz84D5Wbv8HFt+Riw/f5WfbcrPDeVncvLzLvlZkvycRn4GIj9fkJ/dx8/F42fOTSXws9L4OWT8jC9+fhY/m4qf+8TPVOLnFfGzgPg5O/wMG34+DD97hZ9rws8M4edx8LMu+DkS/IwGfv4BP1uA1+3nNfF5vXley53XSec1yHl9b147m9el5jWflxN4rWJeB5jX2OX1a3ltWF53ldc05fVCeS1OXueS15Dk9Rl57UNeV5DX7OP18HitOV7HjddI4/XHeG0vXjeL16Ti9Z54LSVep4jXAOL1dXjtGl4Xhtdc+ZrAa4XwOhy8xgWvH8FrM/C6B7ymAN+vz/fC833mfA8378fyvcd8Xy/fM8v3o/K9nnwfJd+jyPf/8b11fN8a3xPG91vxvUx8nxDfg8P3t/C9I3xfBt/zwJOXea4+z4PnOeY855rnH/O8V54HyvMieZ4gz5vjeWQ8r4rnGfG8G56HwvMyeJ4CX7fn69h8XZevc/J1P74OxteF+DoJXzfg8+h8XpnPs/J5Rz4Px+el+DwNn7fg43g+ruXjPD7u4eOA2JO7KD6e08tbJd+pLTh8/TP/mj/nObA8J5TnSPKcQZ5Dx3PKeI4VzzniOTg8J4XnaPCcBb6Gz9e0+RovX/Pka4B8TYyvEfE1E76GwOfU+Rwzn3Plc5B8To7PURUjXEMoTriWwMd8fAzE899LEkoRShPKEMoSyhFuIJQnVCDwwZglJBASCUmEZEIKIZUQIKQRKhJu9J2+FfW8rhz8WeTbmy/tuW5mde/3qp7ls5pn+azuWT5rdZbP2gd/fvHNpw16dB9Y1/tZp+DPWF+BfM3f77zK+xnvy53p7zJizvL/zvLZs2f5bMZZ/t+smDPz5Hp3pjY7x565zRVn+buVZ/nsyFk+i/Gf+f/F+c8cQxf/mdtcfZY2r4w7899dfYbPQv328uDPnL4Qr2AMvpP9t2rwd5O1zeb0tCvdfsAkBXL6/r0J80/MGWwzXqf9pFD72XTa/2d+Om/VBp9q3xtL6P8G08xXY/ApLWsM/jen0Hdqer5T0/Md3vIGX8ec+sp//+/QZ7Gez6qHfeb3nf7/Q5/F+U7/v1xXLvKdel0w+DpnGA+NvPPGIu1boQj8Q/8rdzDWIsHfuZaWDL7u0atj3za9M+7s3rtj5oDq3Xr2yeiT0a5en/QuHdvW6NOtbe+O3bvd2qZLF1/Y5pU23L5wy8Jt8loT5zvz5v27GE8ooS4cN/jf36safN9kYUsNGBP6X/5g+/G+f/P3hf3/+LDvXxb8PVcY91DcVf9DnpmpbWxmYpvMNslt2rVLatumYFj7vHktbx58DT5kp5+rIVtpSE0OtZ9dp/2IQ7Y3ltDnoRwODaHe1//bIdv7nVqe79TyfIe3cz2shz6L953OyTv08euLPRx5u23wKe4xYZ/d7vksxDen7/SxSTDf03KGxSmcLwmFIvAP/a9Qqajo+7euoXwKfd+rg1JeJ8aE/T+f7/R64P3/uXyq/djGhP2/EJ9wfUJ5wmU2VAuCZZZLab2TL0PV1RuJt/XYCJF6lfB+x5v1WanGod/jI7R7pr8Pf+9sI0DMGX76Ivy9z8O7gO/0nZtsYf8nVuD/aPZs3gr4Iu8Eev+3Uq9PjjRC+sI09PaccB+9vTw8N30R9PV5vhOKyXsjaN4I3wvn4/XBe+DhjSOSX37f6VrGh3E80wgYel/5QC4l0sgaHr9X83A/cng++7/6EYrp/+qHV6PsYZ+F7/15P/Py81aaaN+TrxL8/f97T95bkfP7Ts/d2LDPvD6FV2ulfE4I/a9QPoe0DucafxY+Pjk+Nj6MT63gT9ayUZg+3j4YPnb4fP/OX2/ue78fvtfBW/4IMWYPi///Y28l0rga+n5oXMl2hu+H2osP+3694E/+vWnwdaS6HRf2WWyEtiONKSENuT9I98e2ySnpbZOS25gMy78m/E/9Ufr/079Obdsm1dq0JJuRZJP/p/8fGjdDP4t4vq9xZF9Yp33jzU1fWCze/xt+BsMnyCHUXijHI+0fhe9nh76bI4xfjDw/G84l0v5raCsU/FnY8573yNfL1ZvDknUg1H5unfYj5kwuz+vcYZ+FvIt0pjHmDL/Hhv0823djztJu3gifhdoMeeXlG4rjvwAEQZUVAQYIAA==",
1855
+ "debug_symbols": "rZvbbhRXE0bfxde+6F27jrxKhCKHOJElyyADv/QL8e7pw17bA9K0wHCT+oCwqqena2ZVt/ly8/f9X5///fPh6Z/3H2/e/PHl5q/nh8fHh3//fHz/7u7Tw/un9Xe/3Czbf1rdvKmvtzdt+4X0mzft9kb0KHYUP0ocJY+y/jW5venLUdpR5Cj9KHoUO8pK0bXEUfIotRddjtKOIkfpR1kpthY7ih9lpfha8ii1F1uO0o4iR+lH0b24HcWPclD8oPhBiYMSByVWSqylH0WPslJyLX6UOEoepfaSy1FWSn5dzy7n/c9Pz/f325m+eCPWt+fD3fP906ebN0+fHx9vb/539/h5/58+frh72uunu+f1T5fbm/unv9e6Av95eLzf0tfbl7+9XP+rrj7+cjaZf72Z/Cgg+wSYvQpQbQBq8auAfh3Q3Qagh05Aj3oFIPtVwMlLqN55CaqvOQeiHIF4vOYIJAJAveolaNQAeG8XL0F/FGDNuRBMpF4Qy7fH0M4uRlNehvvycjV3+Y7RTl6IJm+Gal0w7HUMW04Y/Te8Fr3OiBZcFyGS1xl2ndFszlfzRa+/lpPjsOQwrPIq4ezyFJnXp9TF58xi3x5EnjB68KZIr5ePmvgOUSeDvp5EJr0v7RpClrPT2YuXsk5Hu3hj23eUkwuspc03Je3lfPR19n6YEc75aJEnjJOLtPWXi0MvL46fYajnPCHNfv04pF1nnL4z2vXlndG8/s7E2ZXa27xSbbl+JPkbzmr+hjOSv+GdOTsf3efk9rx+Ps6Gv/nLKb34dvp++PvZBbLIy2tZ+oVpeP4ERLtNiEa7BllOvxr4ZoiXl2Lf+tamRCdjO19IXHyM2Xcn4+Q9UfOXr6d4uc6lfuYw+jIPQ+vqYfjphxjf+K2Wfg2hJ2czlgiujTVnXntH9OSDMCprfk1WiV6FnB5Jis8jyYvP05+DFO9MrFeYX4WcfNmWC2e1dbuqYmfvjLQGQ5r51XfmBOHdsk0jjIqrL+UMojWlcM0Xs/8zEEnjpPp6iddrrpEf09vT97bJXJXWHFffWzs5DE/jK8rz8vPnxwm1cK17SbyKoPMYyq4Rzq+NbDlPZ+rVd8Tsl0+F/fKpsF89FWcLy/pdBKC1+Par7e36y7t3D8/f3lvZb4XYuBdi42aIjbshdtwO2WuMmqPWUbdbInttow6eDp4Ong6eDp4Ong6eDp4Nng2eDZ4Nng2eDZ4Nng2eDZ7VJlrr3ZJl1JW3+ZjLqH3bGNaqo9q2bh+3XPYao243gOS467LV7bbLXtuo200gO+68aD9uvei497LX7XbSuPui4/aLjvsvOm7A6LgDs9ftuNYPh9SDlzZ+7cdx5jiuzFHrqDWOq8ZxlYzaR9VRbVQfNUbN43VUbQvzepttWQiNIIROUIIRnLByt8/JtiShRmgLoRGE0AlKMIITIDfIDbJAFsgCWSALZIEskAWyQBbIHXKH3CF3yB3yNjvbp0nbhucIQUhCjbAN0BEaQQidoATIClkhK2SFbJANskE2yAbZIBtkg2yQDbJDdsgO2SE7ZIfskB2yQ3bIATkgB+SAHJADckAOyAE5ICfkhJyQE3JCTsgJOSEn5IRckAtyQS7IBbkgF+SCXJBrkGVZCI0ghE5QghGcEIQkQG6QG+QGuUFukBvkBrlBbpAbZIEskAWyQBbIAlkgC2SBLJA75A65Q+6QO2RmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhBYQaFGRRmUJhB2b8BYwtK2Mi+BScEIQl1hL7P4B4aQQidsB1zbMEITghCEmqEfQb30AhC6ATIDXKD3CA3yA2yQBbIAlkgC2SBLJAFskAWyB1yh9whd8gdcofcIXfIHXKHrJAVskJWyApZIStkhayQFbJBNsgG2SAb5H0GcwtOCMJQt27D3bovhEYQQicowQhOCAJkhxyQA3JADsgBOSAjmx3b7Ohmxzc7wtkxzp6QE3JCTsgJOSEn5IRckAtyQS7IBbkgF+SCXJBrkHWfwT00gvBH/fBf3WbwCEYYiqtLEJIwbF7bQmgEIWzXxrIFPdRY27BcbU4IQhKGP6sshEYQQicoYbio4qKKiyouqrio4qKKiyouqrio4qLaIXfIHXKH3CErZIWskBWyQlbIClkhK2SFbJANskE2yAbZIBtkg2yQDbJDdsgO2SE7ZIfskB2yQ3bIATkgB+SAHJADckAOyAE5ICfkhJyQE3JCTsgJOSEn5IRckAtyQS7IBbkgF+SCXJBrkG1ZCI0ghE5QghGcEIQkQGYfNPZBYx809kFjHzT2QWMfNPZBYx809kFjHzT2QWMfNPZBYx80ZtCYQcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc1XNRwUcNFDRc19kFjHzT2QWMfNPZBYx809kFnH3T2QWcfdPZBZx909kFnH3T2QWcf9P17MLa7YwthWK43IXSCEozghCAkYfiz46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6rio46KOizou6gbZIBtkg2yQHbJDdsgO2SE7ZIfskB2yQw7IATkgB+SAHJADckAOyAE5ISfkhJyQE3JCTsgJOSEn5IJckAtyQS7IBbkgF+SCXIMcy0JoBCFs5O3e7j6DezACt4EX7gMv3AhehuVGWwiNIIROUIIRIDfIDXKDLJAFskAWyAJZIAtkgSyQBXKH3CF3yB1yh9whd8gdcofcIStkhayQFbJCVsgKWSHvM7iHGsEgbzPY9yCEThi3y8OM4IQgJIFnA87DgX0Gly3weMCH84crwQhOCEISxjYRsRAaQQjDZAIXDVw0cNHARQMXDVw0cNHARQMXDVw0cNHARQMXDVw0cNHARQMXDVw0cNHARQMXDVw0cNHARQMXDVw0cdHERRMXTVw0cdHERRMXTVw0cdHERRMXTVw0cdHERRMXTVw0cdHERRMXTVw0cdHERRMXTVw0cdHERRMXTfbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0z2wWQfTPbBZB9M9sFkH0xmMJnBxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEUTF01cNHHRxEULFy1ctHDRwkULFy1ctHDRwkULFy2eTRTPJopnE8WzieLZRPFsong2UTybKJ5NFM8mimcTxbOJ4tlE8WyieDZRPJsonk0UzyaKfbDYB4t9sNgHi32w2AeLfbDYB4t9sNgHi32w2AeLfbDYB4t9sNgHi32w2AeLfbDYB4t9sNgHi32w2AeLfbDYB4t9sNgHi32w2Adr/x6MLSRhOH/5QmgEIXSCEozghCAM+ypctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkULFy1ctHDRwkXXZ/TLTG0mmanPpDPZTD5TzJQzzR5t9mizR5s92uzRZo82e7TZo80ebfZos4fMHjJ7yOwhs4fMHjJ7yOwhs4fMHjJ79Nmjzx599uizR589+uzRZ48+e/TZo88eOnvo7KGzh84eOnvo7KGzh84eOnvo7GGzh4274WuSmfpMQ47XZDP5TDFTzlQkHmysqc0kM/WZZg+fPXz28NnDZw+fPWL2iNkjZo+YPWL2iNkjZo+YPWL2iNkjZ4+cPXL2yNkjZ4+cPXL2yNkjZ4+cPWr2qNmjZo+aPWr2qNmjnHerYqa9x9ftp7yeH+7+erz/ePPmy/ajXJ+f3vFjW+svP/3/A3/CP5r78Pz+3f3fn5/vtx/xuviXc+t//5B2K/6Wfz+3/9bazvvb9XfW3/oj4zbr7dftx8T+Aw==",
1710
1856
  "brillig_names": [
1711
1857
  "notify_enqueued_public_function_call_wrapper",
1712
1858
  "call_private_function_internal",
1713
1859
  "directive_invert",
1714
1860
  "directive_integer_quotient"
1715
1861
  ],
1716
- "verification_key": "AAAAAAAEAAAAAAAAAAAAEgAAAAAAAAAQAAAAAAAAVgkAAAAA//////////8AIVDj/7UTuLam3UEzp0dqrmvDJJxbUKSyHJzzXz2qzj8imnVSvjxbrymrn3+jpHguabT3mmTShkYk5BKY4AtI5hRQhEfQnsvlYKYnMUeL5RYjEmWZF0aDFiyl3RzRLvnPDZad2YH07Tq/FbJ8wI6dCEPvZV/otOv6Io7AV1abUuUkfclgsajdS8qbQK+FZ+sPzSBhAw1yH/udTCeaLTKBegcAzhZyG5UUHTBmB+OxeDITM89UJCUf5vBXB94aA00DIfi+sQtbwAsznV0dtF/TL3AuReluLNVFY7ibuY7UPGEHKSUPHcYPa3876NeZ36clBqSCmEFvG0mfKhNXq0gdzA2A/PFI/lFxynVFybni4Nx/+ruhETuLC0TGZ1PJrMSoL6G+m6upEb56/xTHKbkzakQ84fVyg8OI4T19ZERpxh4hkX9t1AwZqikePketoNuySrf29jLdTWtCfAjfGFy92iZj8+jm9TYZFeKHmRZLy/FYULJdGK95TGN/GE0fhP6rEabVvIpfVK1Cmo0sICvRD9kVavxZhNfishhTjnOjarMEaHGye2msWK1jh5dtDtpyAx4+e0Dduaitynb2eIOYxSmMMxH8kXD5LelAsEKquZDVPGo7JjOc2mtz35IIMUFZB7BfQIphKEclkBa5IErkvzdTfrGWsFwdmPpRAWqbrLstsnt/Je0Xg4VTvxrpc3GupYwfz3KQUcrRraH0s4WmWSDKe75tqRls50EHqeN6/S9QiKfWMPS2cQqsFaafnKyeJD9BG+P1u04WzclFvUWpvJ3voRRJr4Grk1b5hPjI5j8BXo7mY93xgBA8MwB2FUlhLheqPxN+Mb33DPV64bwzhiHrSJuRmKhkLL92LlSOA5ve52T8+85x9jwkt2+sZv9oEf1BtfmTbZMquuTG6TPg05wk6o4uDu5wKlMm81nJR8AMwVyRCoD9lbMNzgmuw89LOYt5MS8tJtrJlca6LFSBXBD8d0taahbTUvnjBcajvPzslB4A4DSHUoZVSzw7pqdKDBDr0Tl6y36PkuLGb5L11b7C9HatDsUcpB6UHqETEKUrcAh8+/YJFbCzmsgL9ZZQjGrnTTFB771vBc2CT6KggA0SgxcouOV5wXgTep/4S4x8/spilXLSho9MC6DpkdYbFcZ+4JDWb1MaGTzgrkgKMTDa+1Bpcyygx+basxnvq6oXuWglSII2n9XLcb3fg7axqjAqoJSeY4i2/qBZbn546xJ30GlIMINB0wIb+VdczGW+c3LKHDiCFmiwf00RnUriDXziu0MK7/Kv6AkfD5Vej0cv9kmLCcTCTDMOqBaCa9guuKUCqgXcngYfo06vnk77YomtvvRBAepEx7hvsk0suyWKuCNj/sewQP+MiVzpM7XraWGVJgdqrpB/HFweS04HHJ008dumqRnzVsIrMfQVxC22xrVKDduHquim0d4zNDAYnMFgiLmMJXwNIVSxPWHidwcHejt/Iv9I9Nc/R8Z/gCf995nQ1k2Uml+OgFKuNXIe0czhvZAVoWhgSAykcSWOAWb4MR78g5Pgnms+2z7XKJlX0sctXgnUfp8wt73VqiAdkY9WNoUWgJMZ/d2t7oRdt3+96UNl8NmhaMvD0Q6M7gWnO33+p16Wu8fVJepEBmkhbDevSODo9Kb7G7V92OQyFZQQwN3fPCVtkdsBhxVEAIuhA5EbPhd2Y+w3LsaDmuUgPrDezCWHRgXG00SLDjhpmTvkmOUuUp6imO9Gc5h07x+PvbYOjDBpQ2N7DhxowEbRJOqquHuS3rxdHMFmklfCGXG+/u9aN0NoZZkT8GcIaa3TlLHvUy281gevC679WLcBJLAaWTIaO1eJ1SgJfFBKGMHxCz92xCo12f5S5PERQgrcicSNdbVxY29bvrSoBvb0WWICMBtq5OsOu+rdIDNABm8oE1dI8RljHD/gf6nXAANOPidFTvmStL+EuXuqdHEuJXg1Ud9QwATsfNH03Ys7ZKZvKsSXm2XlZWjFoxsU7Rj3bPDO7MtHmN50GuibZOglj4RHfBtiVlpVm6e7OIMuLSmftoZ40BULzFsW3IJSNT1D+nDpkjnBwcZ+JxoO6sUV06xaGZq7dJM6TvyYxZsoFO3nzSfa7QDDPBKGC8SwRi041tS6Hkdjp07NsRyh80aWgMJw5VFRU0RZL1kYj6dlEts56JKCazJhDuCCUeAF/OkXwNXcoBlHfFL2B1MythIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACFyjhN60qMn0weFK1b3qbdeL1IZKaJcTcacGMSIllRkkSpEj4vJfdvy84BBJAFuG4xWAgo3nlDupXDRSulHn7QQDENyb3W2/aDeIs4ODfq2vMegX/lalrKJQkxfczZw2WL5tuC04sAZaN5cMkgqp9HQoJ1xeOyTuteFj5bmTwtI0dWKphxkrVIgQ9ecSAIhnlW6GXUa3+bDYyTT+2wtoJiS18GKk8Pa5YgJ+q7saoanj0s7xh8Z1ucGk1m79H5/kH"
1862
+ "verification_key": "AAAAAAAAABIAAAAAAAAAEAAAAAAAAEJpFRimjwYEm28JXL+uG6+ZQVKHMcdWXZgSwKCOKBCAKRkWDy0hIzxUcmDnRjub5+8/87SIgs5j9dAIgmlvUQz12AGrVCeFeqzE3vfy2M26Zttc4GZpWViRBK1cyq0Dlb1oEzyPW175lD29p6mrks1vB2HS8w/JBYKG0xTRFx3olwcLyIGOpPCNjfqkfrfXRc0Hc4H72E6a3ks3usARlG1ynxTawpFVAEbYaEWRaMRBu9JmkVnmBnz4Z5eG3rdZUiqOJXHuXnhrwGnZtW1v9ANFCD7iGai1/rNmDQM4xh7reKgKvMdl+yG72OnNpBcTY1Lh4xZ3y5a1c+bY6XYZ8Ic3lhNOOCpyL2sLKlymmbVBiZmgsBVT3HhmPy2+SwmxncrQCFr0Eyys7I6DU948pwnZ7xYoJd4t/LCBTI5AD8qSFEQd3sGHP3gYAaXJGtyyjzgvNmnSkO3SlX8am2fDMmInHx36wK06s6FWNIWB8o/ojwYZIfZXyvCcaOI+kC4sG25QCLFUon/AwusXS5V9XOK7mgwq91f09SFJVigyejeFCvQiqKqwFC76lCbUvzIesCHtEKe208Ag1iqSO1vTlhkdEx+UwAD9XMIkv9PnKVAsOKlg7QTtGCJq9+I0xQ+2jrMsCFFYbipA4EmuaGL29YSaf2bfOy4Wx90Wkg6Cp3acxZEFmMYsaRi73HrGhF6Fa2toWUMBuHqXz+u/81iZIlDKTwpnvsjAlpQvPxC7l2f/sevLdAUTljQ/y9A5vp1W634pCI5rtvU4aX5ddU6PJA/DotK+GwZfIOfxp8osRBzgLngkh6GqZFX9abCXMAKxHXxunXVJ6B7ex0GnFGhzpFHylgEwwQ1KtB0R0sdPjyJwbvzbezJkHM1acYaOfNPXIyDkLx8By8pQV6gsMctX1LQSbGP6UV+RTMDMVJE9AtswcMAsN10rGjxmuojqZG7HjStZus/OPKbpIVIauwMzmgDWxQdZg5Wk+4SUvdFTltGUF01bHUfNUTL4qNLt0Cln5n6EA9kDpPa1VtUy9UZ+1vddu40KrxWtUHMUKc6dUA+L7eAfgzJHCuZ1H66fvaGxUxX8Vj94Yb41mQJ3NQlAYrxSACL8fzKZank1dfykTlw0x0ZF6aRwqk02g4YjtQZxKPSSEISM5CEWx1wj1IqBXfpwRNHT2BPgCDH6z3JnPxGbBZokGkHugGftiO42Q9cKoHQQqahOunI7RilEmrmEobaaFQa5YKTASR4lmbrQS0bZi4vF/WTXAOxJftzhSoBhipg5AUrVFzievK0/pWWjk4TWa4G9ifHfse+iETRDOHdAogMN38JAP/26DkVslh+lZ4Kd2/iOD4RXRdjpJy4kIIv7Sy4WXEeaLz/DLmZugypDIsmidPcd6RU14tZZX4E5MpY7LH9bdvAeIn+Irnr368p/bXMz+IlyX91lJbpSGbcrpgkbJqlW1IdqvMFXH7Az4/4eTh1yDs0RMLhhYfFeE2RatCyJFbsQLSr07icBpwRK06b5q/kd4nO2mJXc7WYn7B3HFp8SGKR28HmW5R2LartSChaegEVCT0VZEM1fVtkJNogicLS+crAFuwNZzHJuNS6opReGoy1UOmftRSr4rPkN7guOi2oGYN+H51UV3bGGYnD8RL/Nn0D4RW+wHT+udzcYEuclbhZ0vJaHE/rzYOf3XkmViCbUlwNJaelusnEacooeMIyJDIxr4EVcDylqyesp0AH4pZDvkTxMJL8MS9kfLBw00vREs+6QKbLbr8Hx6IkxFeHYI685mke1a4zkXosdKVdrt+HhyBCXmWuGQ0zI8Mb0tuPnK7wpfeFRBYWqQ8MIncIYWVoEE0vTaKCYMq16Ml+Vx1jV8KcZ4ZPq+1PLWgepv9mjn1ecn/+urT2vgZ6CcN6ro47NXvs+o8OXCfrAHHbNZu1Iq1/ptcpJncnC3ss9pPIEdYgglYPCzBKfxrkorT+MiWPqoo2xOyPO9TJYsz2SOt6LXQRIQZ1INF5fgR4V2tI0tWxhp6VSUKis5p7VfFH1TihcNO1JZ6n+3/nAIaqA2gm6kDVORX09BskYYx8/ayUS6OK6wi4J3r8TDiwgveQqOWlou79Of2EQxiZ00dNialeC4xIp1w+wI6sTjS0+1EkYm5sDBl+lwbdIfr9w4yBXkmZtEHgt+CTLiYMFIrB3dAjAnSCbxcFmSsLN70JLLYunou4TQHZUN+vS/1cXpSn4AHnnpj3rkDGPgS9gUrAxVqTDZRtk++SkJAgACAGccL4WcSU71mih1GxW6xSQLZ7l4/wx2Qy8goh2E4F6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAhbykwbDi96GhukJ1TTyjhvE+RKM8+91g9p1YbnnWMe3ILCnHxW+Qg4xfDrZh2F6hSOaUov46J3cQ1qy+HTZKewAxDcm91tv2g3iLODg36trzHoF/5WpayiUJMX3M2cNli+bbgtOLAGWjeXDJIKqfR0KCdcXjsk7rXhY+W5k8LSNHViqYcZK1SIEPXnEgCIZ5Vuhl1Gt/mw2Mk0/tsLaCYktfBipPD2uWICfqu7GqGp49LO8YfGdbnBpNZu/R+f5Bw=="
1717
1863
  },
1718
1864
  {
1719
1865
  "name": "process_message",
@@ -1822,18 +1968,15 @@
1822
1968
  "error_kind": "string",
1823
1969
  "string": "0 has a square root; you cannot claim it is not square"
1824
1970
  },
1825
- "2709101749560550278": {
1826
- "error_kind": "string",
1827
- "string": "Cannot serialize point at infinity as bytes."
1828
- },
1829
- "2896122431943215824": {
1971
+ "1004672304334401604": {
1830
1972
  "error_kind": "fmtstring",
1831
- "length": 144,
1973
+ "length": 48,
1832
1974
  "item_types": [
1833
1975
  {
1834
- "kind": "integer",
1835
- "sign": "unsigned",
1836
- "width": 32
1976
+ "kind": "field"
1977
+ },
1978
+ {
1979
+ "kind": "field"
1837
1980
  }
1838
1981
  ]
1839
1982
  },
@@ -1841,22 +1984,11 @@
1841
1984
  "error_kind": "string",
1842
1985
  "string": "attempt to subtract with overflow"
1843
1986
  },
1844
- "3095323350861740601": {
1845
- "error_kind": "fmtstring",
1846
- "length": 132,
1847
- "item_types": [
1848
- {
1849
- "kind": "integer",
1850
- "sign": "unsigned",
1851
- "width": 32
1852
- }
1853
- ]
1854
- },
1855
1987
  "3305101268118424981": {
1856
1988
  "error_kind": "string",
1857
1989
  "string": "Attempted to delete past the length of a CapsuleArray"
1858
1990
  },
1859
- "3367683922240523006": {
1991
+ "3738765135689704617": {
1860
1992
  "error_kind": "fmtstring",
1861
1993
  "length": 58,
1862
1994
  "item_types": [
@@ -1873,19 +2005,15 @@
1873
2005
  "error_kind": "string",
1874
2006
  "string": "push out of bounds"
1875
2007
  },
1876
- "5870202753060865374": {
1877
- "error_kind": "fmtstring",
1878
- "length": 61,
1879
- "item_types": [
1880
- {
1881
- "kind": "field"
1882
- },
1883
- {
1884
- "kind": "field"
1885
- }
1886
- ]
2008
+ "6485997221020871071": {
2009
+ "error_kind": "string",
2010
+ "string": "call to assert_max_bit_size"
2011
+ },
2012
+ "7233212735005103307": {
2013
+ "error_kind": "string",
2014
+ "string": "attempt to multiply with overflow"
1887
2015
  },
1888
- "6336853191198150230": {
2016
+ "11732781666457836689": {
1889
2017
  "error_kind": "fmtstring",
1890
2018
  "length": 77,
1891
2019
  "item_types": [
@@ -1896,48 +2024,54 @@
1896
2024
  }
1897
2025
  ]
1898
2026
  },
1899
- "6485997221020871071": {
1900
- "error_kind": "string",
1901
- "string": "call to assert_max_bit_size"
1902
- },
1903
- "7233212735005103307": {
1904
- "error_kind": "string",
1905
- "string": "attempt to multiply with overflow"
1906
- },
1907
- "11418088424205762236": {
2027
+ "13393647220875574755": {
1908
2028
  "error_kind": "fmtstring",
1909
- "length": 98,
2029
+ "length": 40,
1910
2030
  "item_types": []
1911
2031
  },
1912
- "12099279057757775880": {
1913
- "error_kind": "string",
1914
- "string": "DST_LEN too large for offset"
1915
- },
1916
2032
  "13649294680379557736": {
1917
2033
  "error_kind": "string",
1918
2034
  "string": "extend_from_bounded_vec out of bounds"
1919
2035
  },
2036
+ "14101993474458164081": {
2037
+ "error_kind": "fmtstring",
2038
+ "length": 61,
2039
+ "item_types": [
2040
+ {
2041
+ "kind": "field"
2042
+ },
2043
+ {
2044
+ "kind": "field"
2045
+ }
2046
+ ]
2047
+ },
1920
2048
  "14225679739041873922": {
1921
2049
  "error_kind": "string",
1922
2050
  "string": "Index out of bounds"
1923
2051
  },
1924
- "14514982005979867414": {
1925
- "error_kind": "string",
1926
- "string": "attempt to bit-shift with overflow"
1927
- },
1928
2052
  "14657895983200220173": {
1929
2053
  "error_kind": "string",
1930
2054
  "string": "Attempted to read past the length of a CapsuleArray"
1931
2055
  },
1932
- "15366650908120444287": {
2056
+ "15200354114977654233": {
1933
2057
  "error_kind": "fmtstring",
1934
- "length": 48,
2058
+ "length": 144,
1935
2059
  "item_types": [
1936
2060
  {
1937
- "kind": "field"
1938
- },
2061
+ "kind": "integer",
2062
+ "sign": "unsigned",
2063
+ "width": 32
2064
+ }
2065
+ ]
2066
+ },
2067
+ "15760694058516861966": {
2068
+ "error_kind": "fmtstring",
2069
+ "length": 128,
2070
+ "item_types": [
1939
2071
  {
1940
- "kind": "field"
2072
+ "kind": "integer",
2073
+ "sign": "unsigned",
2074
+ "width": 32
1941
2075
  }
1942
2076
  ]
1943
2077
  },
@@ -1949,22 +2083,17 @@
1949
2083
  "error_kind": "string",
1950
2084
  "string": "Input length must be a multiple of 32"
1951
2085
  },
1952
- "16775516380094354375": {
1953
- "error_kind": "fmtstring",
1954
- "length": 40,
1955
- "item_types": []
1956
- },
1957
2086
  "16954218183513903507": {
1958
2087
  "error_kind": "string",
1959
2088
  "string": "Attempted to read past end of BoundedVec"
1960
2089
  },
1961
- "17843811134343075018": {
2090
+ "17149600165939355391": {
1962
2091
  "error_kind": "string",
1963
- "string": "Stack too deep"
2092
+ "string": "DstLen too large for offset"
1964
2093
  },
1965
- "17879506016437779469": {
2094
+ "17226037485472400844": {
1966
2095
  "error_kind": "fmtstring",
1967
- "length": 128,
2096
+ "length": 132,
1968
2097
  "item_types": [
1969
2098
  {
1970
2099
  "kind": "integer",
@@ -1972,11 +2101,20 @@
1972
2101
  "width": 32
1973
2102
  }
1974
2103
  ]
2104
+ },
2105
+ "17610130137239148460": {
2106
+ "error_kind": "fmtstring",
2107
+ "length": 98,
2108
+ "item_types": []
2109
+ },
2110
+ "17843811134343075018": {
2111
+ "error_kind": "string",
2112
+ "string": "Stack too deep"
1975
2113
  }
1976
2114
  }
1977
2115
  },
1978
- "bytecode": "H4sIAAAAAAAA/+29C5Cc13Ue+Pf0zADTM4NpvAESJPW0LMmWu6fnqZdHoiRKJPUA+H6jpx/gAyQoPEgRkqgmCRIECAIECIKkSEqWY8WbqmTLWXvjstdlbamczdopVeJN4tjrrY29lU2qUnYlZce72djlLC7Zp/vrb85//7+nzx30EHOrgPn7v/d+59xzzz333Md/byZ6J9xy8V+m+TzY/Luu+de93xh1Bkm70Pxb6C0UDbEKoXjMrAIeB1YBj9lVwOPgKuBxaBXwOLwKeFy3Cnhcvwp4HFkFPOZWAY+jq4DHsVXA4/gq4HHDKuBxYhXwmA/AYwg+N64SPjcZ8ol+cyh+N0f9r6NbVgGPW1cBj9tWAY/bVwGPO1YBjztXAY9XrAIer1wFPO5aBTxetQp4vHoV8HjNKuDxPauAx/euAh7ftwp4fP8q4PEDq4DHD64CHn9qFfD4oVXA40+vAh4/vAp4/Mgq4PGjq4DHn1kFPP7sKuDxY6uAx59bBTwWVgGPxVXA4+Qq4LG0CnicWgU8Tq8CHmdWAY+zq4DHuVXA4/wq4PHjq4DHT6wCHj+5Cnj81Crg8dOrgMefXwU8LqwCHj+zCnj87Crg8dpVwOPnVgGPn18FPH5hFfB43Srg8YurgMcvrQIer18FPN6wCni8cRXw+OVVwONXVgGPX10FPH5tFfC4exXwuCcAjyH4vGmV8HnzKuHzlkB8RrcS0wMX/7mPotxHR+6jHvfRjPsoxX304T6qcB8tuI8C3KZ7t6ndbRp3m7Lz0Tsf5rnNum4DrNtg6jZwug2SbgOi2+DnNtC5DWpuA5jbYOU2MLkNQm4Dznsu/nvvxX9ug4bbAOE2GLgFfLdA7hag3QKvW0B1C5RuAdAtsLkFLLdA5BZgXKncAoKboHcT4G6C2U3guglSNwHpJvjcBJqboHITQG6CxU1guAkCGYC7AaQboLkBkBtgOAfeOcjOAXUOnnOgnIPiHADXwboOzHUQzgA7A+cMiGugTvmdYt0SxQdRkJ3XvPN3pPl7AOINP04rjhBdS/y5Qn16RCmfIf+lkSbm+iD40zOCPxKG/4J8wPr9RhsfyyJ0s82/v9Joy/JXGp08SZq/gDR/QWmkPGHqe74eVl7Ftz+YQRlFUBahnQtDezJD9LBeME7o56KQuvnOx75IT/hh+YjtGJc0jTY/GYobbCwth8QNQZzUr6PzEUjHurWe4oQXF0R/x0E2Ev5hM07qdBAw7fR1cTKsvk4VLp2+ThXfjfo6SHGDjaXl6FZfUbdYX4eidhBbKnHDEPeXFLcO4v5zo017Gvj4u83nsDb5nT4Y2551H7ZZ4R9pubCu0ZaH6GAW3g2B/N6WD6anuBGIG2x00sk1fw8CHcQSPoYo/VTz90Tz7zDkkfx5hf4w0e/gW3nHchlR0o8o6Z2u/Wzz2fnZos/XNtp4lgcCCP7nwuC3/M7Ph8GfFPwvNNqybGPXp2ZL1dnyTGVxrrpYqkyV52anyrPl6fmZYrFaLlTn5y92DZVCebY+Nz03XasXF2u1YmW+XC/MTZdLgn2dil2qLc4WStPlmbnFYr08Uy8sTs3Olcr12dlquTo/VZudLlSLlZliZbJYn5srT0+XK9PzxWK9Nj9dn5sR7C+q2LW5ucr84my9UC/X5yfLhcnC5GKlWp8uzFykUa9Vpuv10tR8Ybo0Vy1XqrOV4nylNDdZr9Tm64X5Ft9fUrGrk9PleqVaXZwq1OdLs+XZuYuymZ9dvAgwVyzNFMuV+Ysyqxdr5cpsZbFcK1ykVSuWq7PF6myp5edf32jXZ4hxyg1B8Istfb8xCH5pUfC/3NBkP1csX9TBanWqOFetVEuFWql+UfvmylPVmeKcU5/S3GK1ND1bu6i0xbny7OR0bXqmXL6oR+VKsSWbr6jYtcnZqanSfHF2qjg7Uy3N1KqFuUp9rloqlovFxWK1Wq9f1P3Fi4pZn5mdn7moO7VKbbY2tzhzUUFbOvNVBbs4V5qcnC3Nzxbm56qF4lS1Mjk3OekU6CLzlcna/FRxvj41OVWqVC82tKm5ctEpbmW+PveOVAT7ayrfXVYgBcHe3QhRn237sicM/pTg3xQGv1WvNwN+xgy/1LJjtzSiXuuWQ8vW3BqPvWzVFOzbFOzJcqlycYhbKE9fbIK1uemLbetiF1FbnKvVZybLi5WpwmS1WCzWpi7+N1mrTs0vXmy+izO1i8118SK5lk7e3ghRp8WK4N9hjD9TLszXZmZmBf9OY/zFxZnZ8kV5Cv5dxvilykytXppttdm7jfHL01P1+nSpLPj3GONPFwu16cnZlm7ea4w/v3hxouuiZyH49xnjX/RzStX5cqsP3Gstn8VaoVItzsv4oNzEFxouCO1FY9rNMJ9mrI30c8RriLE20kN+UD481q40lvKaV+LQxnBcVnkndDSsOw2x7jLEutsQ6x5DrHsNse4zxJJ2HbatTbX60UoQ/NKc4FeD4Bdqgl8LgV9s+751wI/s+G/h7wsjnxb+/U38ELw/EEY2rbHYg/a8t7Afssdu+Ub77bFbY5mHG0H0peU3PhIGvzWWORAGv+VXPxoGv2XPvh4Gf17wD4bBb/nVh8Lgt/zSw2HwW371kTD4VcF/LAx+a9zxeBD89vzVN8Lgt+r3iTD4LfkcBXy7uZTJVp/1zSD8t/G/FQa/Vb/fDoPf6rueDCL/Uks+3wmD35JPIwj+VAv/qTD4rbnEp8Pgt/yHZ8Lgt/r3Y0Hwp1v682wY/JZ8nguD37Jvx4Pgz7T08/kw+C39PBEGvyX/k2HwW/7tC2HwW/p/Kgx+y799MQx+y789HQa/5d+eCYPf8g9fCoPf8g/PhsFvzWecC4Pfsj8vB8Gfbdnn82HwW/7JK2HwW/btQhj8ln17NQx+y769Fga/Zd9eD4Pfsm/fDYPfsj9vhMFvjY/eDIPfsj9vNfGjyGy/TEv231Oxe9ovM+X2Wbl9en/eXKxx3zZsaGLvqx3+7P4DlYe+cuThxdpBXOHJRJ07KPE97nCVMNb810S9+YGHa4cOlx9+lPOOxGAOxmBuamNee+CRwwfLlcOfqVYP1g4dYoScghzFoObaqLfWDh564MAjjDa6PLRr7y8/8MiXqow2lhJN9l2OU37trwva2hyubSAWykjobFDoyD7LCXhvOM9QTVMOpJ8jXo3nhVr7eSeIH5bPAMkur/CapzgXjjXa6Tguq7wb8GCdNMQ6b4j1giHWOUMsyzK+ZIh12hDrrCHWKUOso4ZYlrK3bEOv9CnWcUMsS52wlL2lfp0wxLJs25Y68bwhlqWNfs0Qq1/7RxlTjURLfQfrPQcOc1MY/JLIYqNHFkhffCX0rTIxfwWL44RWjrCMy1b0lQ3553reCPygDOKwNnaJNaLEhajTvKfcTD8uveYvS/rNHnxMPxEt1eHNJIstYWQx6au3zUBT6LtxnYySq7XFI/tuPLAvopAlOYjcdlE62Yc0EC2V96YYrIh+76J3WcDD4PgW2ddrhyv331zet69Wvcj9IUq5JOsXGvp7X1MPbPZSf9Is9FfKlPialAui8q46ZMJh/4Fy9dryo4eO7K8NkChxBMziRDguNldVBljCdzlKJ1UtQb6KykbxQUSZ1poKprR6LNPGmHxsafjdgJI+T1h5JZ/wnvXkRwzMx6rUa88n5Yiidu+glT/NTE6YZlcsLbfZhZ7JSdszhe1Zi5NpvADkV+pykxLHvegQYGH6jVBG7rWwBx6id1c1KyxPmC7IDtaMEpdV3ol83de+2zOdZcO6YT0NUw/pTxBgTzNQd+X1NLURRVivfqqQpl6RX6nLzUqcYImHhHqK6TdBGTE9Pkt+fPdR0lPUadZTzePEd6inHyQ9xbphPQ1TD8VKWj0V+rkoZLtp66mmF9ooRtMLyavV17FGO1039aVhnTfEOmeI9bwh1klDrFf6FOu0IdZZQ6xThlhHDbHOGGJZ6n2/yut1QyxLXb1giPWiIZal7C3LeNwQq1919Q1DrCcNsWSHDY9XBN+FkWipL2A9tkJ6Ug58h/RzUUjfre0raXLVxkZhZzKLLX62KPxsUeQjdblViROsbc3f6NNj+i1QRkyPz5If3x1uVlieMF1gn36rUh58hz69bOphXXRhofm3x1OUpsLW4/TsiCJny3Y0otSV5RyR4G8Pg9+S/44w+K1T53aGwW+dzHpFGPyW/lwZBn9O8HeFwZ8X/KvC4JcF/+ow+FXBvyYMfk3w3xMEf7LVft8bBr/Vft8XBr/Vft8fBr/Vfj8QBr/Vfj8YBr/Vfn8qDH6r/X4oDH6r/f50GPxFwf9wGPyK4H8kDH7L/nw0DH7L/vxMGPzWSdw/GwS/1Nox87Ew+EXB/7kw+C3/rRAGv2X/i2HwW/Z/Mgx+y/6XwuC37P9UGPyW/Z8Og9+yzzNh8Fv2eTYMfst+zoXBb9nP+TD4Lfv58TD4Lfv5iSD4Uy379skw+C379qkw+C379ukw+C379vNh8Fv2bSEMfsu+fSYMfsu+fTYMfsu/vTYMfst+fi4Mfst+fj4Mfsu//UIY/JZ9vi4Mfss+fzEMfss+fykMfss+Xx8Ef7rl394QBr9l/28Mg9+y/18Og9+y/18Jg9+y/18Ng9+y/18Lgz/j5tF/NfMOluzRxO+CcU+i+yff98oagQv7Gu006yEe0/96M8LR+/UmvTS3zowEKXcx1Um4SH+lbp0ZIX5YPrwXZ1ThNU9xLvBa46hCZ1Sho2G9aYh11BDrZUOsk4ZYZw2xThhinTbEsizjKUOsftWv44ZY5w2xLhhiWeqXpbzOGGJZ6pdlGzpniGWpE5Z2VfYljitx7EfgCR2G/XbqfSpCPxct7bdD+BFjUTq5pvw0Cd0wFifCcbFRLBiXpXf8adJ1jc7fy/k0CT8J0UTAnyZhmTbE5ENZRMq7ASX9GGGNKfmE96wnfxQFV+di2MNh2h+janWDZRL649FSmWdi/goWxwmtXKTLfMFIdr6yIf9s0vBzKZRBHNaGLrFGlLgQdTrmKTfSH/fwqpVjlGSidRnaEEnST3j4wvQTCm3JG/gj7UmfDLWPtJfzYbLIbQelEzs4EPntIGJF9HsHvctG+ofJviF/mvYsfLqQV7BkKmLNJWiFNZfg3e0SaKaWVWkkWlrWhebfQk+hWhlReGpj93Rn5KSbLbymqUiaecbZODSVuIN5gyLbIUp/H8xOvr9Jz5VHvtZcPLL/oT21wwcfqD1W0w5RSNLdLzc6f8sdmD7ddcHn/vSrGQvtXvl034UuzRirUGgzhtefumBlxkYUzDRmDKtrvUJX3g0o6X1mjCfKs578Lowr71jVA3mwqVWdRxKhRmG+ekb59KjqKE6E42Jfyh5bc97HFEyf8+5Tz0h5l+QI+3qhbAy9DR56vFaGeYco7UKzkgI3iQJ+R8VlWOuVWmGtV3p390pZJR+rUq9zVFIOF/JRfPlHoqXyWGj+7fEC9Smt2WYi+88cNgTBn5nU5i0N+a+6gcEtNBDBuSAeDIv5jNsmsRHiMf2DTRqO3h0wEJHPlx4r73+gWj5c+/wjXz9SO1KrfuXA4dqhzzxS/fxjtUcOdz0s+WKj8/eXGkvzaUHbKCLHkIfduFEoj8eUJYr0TRHrKQ5bt1wjyceyoyXVZit5EwbPlmMcHjI0SHGoQUMUhx3wMMXhh7vr4JkD1yPWi5PLX+bauJxOwmjUru9bFByR1a3wO0vpXRDrL+lva74fjtp8YhrJO0TpDwy0+f9086tNzWoKP+OUX+KjqK2rtxPvC83fhd5CamdF6OeI11DOyu3ED8unS2cF1YLFiXBcbFbZlXRW7oA4TQTsrGCZ7ojJxyrP7waU9LcT1u1KPnZWtPyIgflYlbj54UzZrQptbn4NaH6f2RlP99ZoqRy4Ca5X6ElzvYPSuiDN9U4q00Lzd6GnMD2btrkK/RzxGqq53kn8sHy6bK6oYgh/K8FJGkyL4VZgCdPn6DdX+9eUfBxElOPRUhGwOtxFeRaavws9hfRHkAj9XBRSPdvqcBfxw/IZIPncHUY+LX7uVvi5W5GP1OU9Spxg3dv8jWYJ098NZcT0+Cz58d2FplDyhOkCH0Fyj1IefCfydZ7LSwOd9KRt/TL48a/RuAHbH+pKnDm/XaGdV/JLOo1Ovkc6eYWOdpRivdEZt8kTh17snYSJx9rwmu5uiLuf4vYAJh+7epMH82YF09XdJwbbeO7fIqTTTDG7DWXgB/Pi7yFK68KDjc44SfvroFd/n/QKuyGu7zsS+PbVt6QTWaGecJ1ie+Y6RTvB8tfao8Tdq5RL4u7zYO5VMJ3cJgc706HcuW9ZhPeGrsZM2r5F6OeipfoUom/R9Bvlw31LJYx8pjOEj/xUFPlIXVaVOMGqNX9j34LpK1BGTI/Pkh/f/WPqW6qQlvuWqlIefId9y48GOsvG9kP7K7j8jts3ykbqV/O1pE05fn5voLMskg/lif3RVyEe098Ii+0/8dgwrr8ylTHJ9t6plDGtHd9NWGUPX5UErJsIC/NXCKuagLWHsDB/lbBqCVgPExbmrxFWPQHrEcLC/HXC2peAdYCwMP8+wro/AetRwsL89xPWAwlYXycszP8AYT2YgHWQsDD/g4T1UALWIcLC/A8R1v4ErMOEhfn3E9bDCVhHCAvzP0xYjyRgVQkL8z9CWAcSsB4jLMx/gLAeTcC6gbAw/6OE9fUErMcJC/NL3nEFS+y89MkH4f2lGA8L/RzxastP22c5GC2VK8qHZ+sPKbzmlTgemx1S6BxS6GhYZUOsRUOsiiFW1RCrZohVN8TaZ4h1vyHWA4ZYDxpiPWSItd8Q62FDrEcMsQ4YYnH/U1aw0N+WI2h9/rPkQxvE8508bsT0iBHnn+MyxWICz9uIZ42mYFUSsLYT1nL9dPe8g7CW66e7552EtVw/3T1fQVjL9dPd85WEtVw/3T3vIqzl+unu+SrC6sVP/0ajE6sXP/12wlqun+6er6YyLtdPd8/XEFYvfvoTjU6sXvz0bxJWL376twjL56cfTMD6NmFh/oOEdciD5Z7fE3ViYf5DhHU4Aeu9hIX5DxPWkQSs9xEW5j9CWI8lYL2fsDD/Y4T1eALWBwgL8z9OWN9IwPogYWH+bxDWEwlYP0VYmP8JwjqagPUhwsL8RwnrmwlYP01YmP+bhPWtBKwPExbm/xZhfTsB6yOEhfm/TVhPJmB9lLAw/5OE9Z0ErJ8hLMz/HcJqJGD9LGFh/gZhPZWA9THCwvxPEdbTCVg/R1iY/2nCeiYBq0BYmP8ZwjqWgFUkLMx/jLCeTcCaJCzM/yxhPZeAVSIszP8cYR1PwJoiLMx/nLCe92C5UGl0YmH+5wnrRAJf08QX5j9BWCcTsGYIC/OfJKwXPFgu3NjoxML8LxDWqQS+ZokvzH+KsF5MwJojLMz/ImGdTsCaJyzMf5qwziRgfZywMP8ZwnrJg+XCYqMTC/O/RFhnE/j6BPGF+c8S1rkErE8SFuY/R1gvJ2B9irAw/8uEdT4B69OEhfnPE9YrCVg/T1iY/xXCupCAtUBYmP8CYb2agPUZwsL8rxLWawlYnyUszP8aYb2egHUtYWH+1wnruwlYnyMszP9dwnojAevzhIX53yCsNxOwvkBYmP9NwnorAes6wsL8bxHW9xKwvkhYmP97hPX9BKwvERbm/z5h/UIC1vWEhfl/gbB+kIB1A2Fh/h8Q1i8mYN1IWJj/Fwnr7yRgfZmwML/kHVewMs2/smb0S/Debo0m/dXMQj9HvNry014z+qVoqVxRPrxm9EOF17wSx3OOP1To/FCho2FVDLGqhlg1Q6y6IdY+Q6z7DbEeMMR60BDrIUOs/YZYDxtiPWKIdcAQ61FDrIOGWIcMsQ4bYh0xxHrMEOtxQ6xvGGI9YYh11BDrm4ZY3zLE+rYh1pOGWN8xxGoYYj1liPW0IdYzhljHDLGeNcR6zhDruCHW84ZYJwyxThpivWCIdcoQ60VDrNOGWGcMsV4yxDpriHXOEOtlQ6zzhlivGGJdMMR61RDrNUOs1w2xvmuI9YYh1puGWG8ZYn3PEOv7hli/YIj1A0OsXySsioKFc45faT779slJvrjvsbKQBue5tH11cfvwssBz0n68rxLPGk3t+8YHGp1x+H0j78nHb57520f8hrlMcfh949+huPsgjr912wtxUh7t+8aNnvLgKTP8Xe9miONvuLdA3N0Utxvi7qE4/D73Xoq7CeLuo7ibIW4vlFW+zx2isn66+T7wCS/qMXm+76MzMX+jaOm8uAvcbvHEoBzRud2QDmJd1+ikc4chHcTi05juNKSDe41ZbncrdERvsN0a6k3qb2mEfi5aamNCrItoZx/crcg15VEjfLwDihPhuNgoFozL0rsQJwPhMRKaCPgzUyzTvTH5UBaR8m5ASX8PYcUdm5GNoadVJeZjVcrQ+yF4f6tCe4jS39k0ue7r3s/tbKePo4Xy4MPBhPe4w8GYB0l/L/Dw6Z065mBMue6Owfz6YJuX8qCOGSmYWrnupXIxD/cQD5K+BuW6jk5dulfJH8W8y0Sdpy5hXv6t6cytlP6+hPJwPUn6hzz1dJfCA7ZJlinzwGnujeHhgMIDmrXKgUefaJq1iMIgPLMZ0kTOJyDdpeDEBRGDK56oYpZw2UQxHfm9XuHJFVnO/6vW9tcO12IKzbY6F0NsINIDu9CSz4WwRxWl726Ffi7SdXHBhh/v0UkoH96GoB2FlFfiUDFYAX10xqL2AZmHDh84GKcLafvhjMIP548IK6O8c2FNf5avPyndNVYbFCfCcbHjqixJTWRkIWE57prPzUFMcdd8LhZW120KXXk3EMW7U5orxocw+twxxMB8WrfIXazWBeNBj5j+Rej+5CBHziPhrUY7jg9qXPnRUzH1rrJ36egpT3CSBtNiyANLmN53UKMLcrhFmuYY9kComSk+4AmDxNWANk9Y4UYznrDCjWN4dDSHrFJ2Ka9rRtfvbONyOuYVm3aN4rDZ1CkOPfR9FIeThfdT3F6Ie4DiyhD3IMXh5KtsGBuiMvxdmmwL1Oupk21CayJaKlecwIzzgrRjj/NK/ts8dPb0SGePQiewLIth22v7Ukifh4L0uV1IvPZXsDiOva/Qx2j7umwXuJ612SAf1t1dYgX2gkvscmjl1uyrxqtWDp79kPY+OfTOXzcE/i3P4ga7H5uCyKGU+vBGoZ8jXkPp4ybih+XDo8nNCq9s+1x4ptFOx3FZ5d2AB+ucIdarhlhnDbFOGGIdNcSyLKNlPVqW8XlDLMsyvmSI9bIh1hlDrJOGWBcMsU4bYlnqhGV7tGxDljphKa9ThlivGGJZyv4FQyxL2Z83xLKUl6UtPG6IZSmvfrWFlvKytDmXg89kqROW/bal7F83xLLUe0vZv2iIZSl7yzJa2glLH8BSXm8YYr1JWGnH9ZJ+t5Jem5eSuUzczCl5ZQ4F5yatV1Tj5IQbSIW+WzKR7QvV2uKRfTcewPMpW/lRDiK3aUonS4IDxAPKgrEi+j1N77KAhwEvDk2zZFYhzIXm70JPoZR6BVvor9SSWYX4YfnwnJV2YUee4lx4qtFOx3FZ5d2AB+ucIdZLhlgvG2KdMcQ6aYh1wRDrtCGWpU6cNcQ6aohlqROW8jpliGUprxcMsSzl9aohlqWunjDEuhzq8bwhlqW8LPuh44ZYlvLq137IUl6W9t5SvyxtjmV7tNQJS5/JUvavG2JZ6r2l7F80xLKUvWUZLe1Ev/pfbxhiyRyM9sEwb5PWxrAVDx3MX0mBpY2HJb124Ydvrgf3SEpemXvAfZAh5nq0+tAuDVnOXI/IrUjpeK6nCvlqMVgR/S7Su7i5Ht639MPmviWRb6D9aOq+SN6viGk2U/m0+UV8FzdXiem0C5+Fn8Dlr2aInpQjTiY5RSYh5rZuSynXwPv2KploqR3JKjSFX6lLn82TdoSfHWB6vqgd2x3agSF694+abSYfLbWHfJluWrvr5mB/ZaizbMvdZ4q4mj1P0x6WSwex9jXa6VHeQ4B1GNKUo870IqdBeI/6UW+08TD9/9yUo7PP/xD2u7s0dyn8Odn/eMjPK+ZFXvkL4yJcHPyPm5jaZz1SH1r98FdzmxS6GibbzG73625WePBhYX1tofR7o7YctPT8JbOk/2dQd9ft1DHj9Id5FnqoP4LhAuuPpP8Xy9CffzXk55X1Z0vUSVvSbwb9+UPSH5SxT3+2UBzqj8hI63P5G4Fu+1zMv8lD5w6KQ97vpLg7lHJlKA75u8PD3xaFB+nX9kKcXb82U+J+CoO2XrSH4tAXvoni0C+9meLQT2Z7jwdHc3+KB0Hz4Td4sDMffoMHNW+hODx4mT/XxJCl31gvrln8WhffLqHeVCkO2yHKF2U1GC1tty5Im2c/+v+B/f//criTns/fvAneW+pdmv4b6a+Uv3kT8RNnU7RDlSRvnuJcaDTa6Tguq7wb8GAdNcR62RDruCHWeUOsC4ZYpw2xLOV1xhDLUr/OGmKdM8Sy1ImTRljueSyywXLhFSO+XLDUiecNsSx14iVDLEu7atm2rXTVhX61q5Y6YWm/LNuQpU5YyuuUIZalvE4YYlnqqiVfa/32pZOXpb9qaaMtfYBXDbEs7Ve/6oSlnejXfshyDGNZxu8aYq3Z1XeH/bKqR/e8IbLBcsFSXv1qc/rVL3zBEMuyPVr2tZb12I/+qnueiGywLPlywdKuvmiIZWkn+nWeyZIvS9n3q52w9Mkvh3GtZb/9miGWJV+W41rLerRsj5ZjGMt5X0ssS53gNiTrnoOQRvauuCAX5gxR+n/RXIceiZb254ZrzVO+/WpC+75AtDNEL4r0dW7er4D88J5LjBvsgdf52ux0abJWLZYrc4u1xdYex/uIV37H+6f3Kul9ezTLkN9Q1pOy7yLbaOPvjdpydWEQ4u6juCGIEx7dvo6PEP97A/GfRv5IP6+k5/2daetyU9Spa9getT0juE+C21KYdlxKvWdE6OeIV1t+2ntGNFt6kyLjcY+MeZ+cC0832uk4Lqu8G/BgnTbEesUQ63lDrHOGWK8ZYp00xDrfp3ydMMQ6aoj1hiHWk4ZYbxpiWcrrrCGWZXu8YIhlqfeWttCyHl8wxLKsR0v7ZSmvlw2xjhtiWcrLsg1Z+hOW8jpjiLVmVy+dXbWU/euGWJZ6byn7Fw2xLGVvWUZLO3HKEKtf/dXvGGKJv8pzhe4Zvz8JO59WmAw7h9S+n2OvIissk9C3uHNlb/N5pe5c2auUzacHe4EflEEc1t4uscLOq7Xr9D5PuZH+uIdXrRw3G8rkHsJKO7fUbd1OREvrU/IGbmOteU7tqre9QFPoL+csC5HbJKXb3WjLgeV9XwxWRL8n6V0W8DCIjHH+8U7C0mzyFnjHVy+irt1GWHcmYO0mrNs8fN2TgHUTYWF+1uH7ErD2EJZWJz79RqyHCUvTb8EqJ2A9QliYv0xYlQSsA4SF+SuEVU3AepSwMH+VsGoJWF8nLO1sF8GqJ2AdJCztnBzB2peAdYiwtDNuBOv+BKzDhIX576d8+O0xnimgfSu7r/HOX7c08ui6Tp608xnw29W4G+D/wbo25qF1nXxjfjm7eoJ+u+fbiWeUhdgosfF4TrS1jUd6UaT7PkI/R7wa89PyfbRzvVE+0j+mvF6Uj7RAcSIcFxvFgnFZesefZm+kfMu57XcPxKXpcrSjxDkfyiJS3g0o6XcT1m4ln/Ce9eRHDO0Yci6/vI+77XczxGP6Z5vN0bkin6OjPzRaKA+RKeuJHD/CaZgHSX8CePj0Th1zMKZcW2Iwvw8m59Q6HTNSMLVy7aFyMQ+7iQdJ/xKU6zq6SRn1ldvAg41O3m5SaEUx7xAb83Kcj25SXvd8CzxznKa3t1J6XIZPo6+S/nWPrmxWeMDycr0yD5xmTwwPbyk8oGmtHHj0iaZpjSjgbiLNFHJVchVsVnDigojBFU+aA+PIb5/6oQnbotDYEsMj5nXikR0p1dr+2uFajIC4b9kUQ2wg0gNfYSn5XBiJgnbHqd0DoZ+LdL1dsOGnyHZc+GH58FaOPQqveSUOFaMbOmNR+0iAQ4cPHIzThbR+g9Zfcf6I8maUdy7gtRzacV9bCKPb474wPx8LFfpYMY3Onh7p7FHoMJY2XHBhsdGOx/S/Afb1R7t0zIEYTBnCS/oHlfJox1VJ+oeU9A8qZRRZ4tFND0XJtFGW3B/t75LXh5X0eOzTg8Qr8vdwl7zuXmFe71Z4HVdos23Hcl0K2y70c0oZQ9h2n1xd6HLoh6rO4kQ4LjaKBePYhN9E6b7Y6Py9nKHfIxCniYCHflimR2LycZPgdwNK+ocJ62Eln/Ce9eRHDMzHqqTlc+F7jaV50jSdRwh/ofm70FMoTqdtOkJ/pZpOkt6wW3RA4TWvxOFwDeOQzgGFjoZ1ryHWA4ZYNxti3WaIdach1j2GWPcZYu01xCobYlUMsaqGWDVDrLoh1j5DrPsNsR4yxLrbEGu3IdYiYWnDnjg3ajlDV57HeTiG/hYlf0R5M/QuzZAUfRkedki/MBz5hzxDnL65fI3Tm1lKw/ykuemSfaWF5u9CbyG1Cy/0V+qmy6ShF/shDym85pU47u8fSEnHQsddEN8+o/DD+SPCyijvME7TcZwGEB3nFU7MiyucE9HSvlX8Em11exPxU1H4wfR3Ufoq8KClFzy+BWGn0ua0Ve7NMfSQP9+NN5i/GoOlnbLuwuMNnfdrgHee1tFW9LWpQ0mvrdpjPy/8aLLhPrymlAfr8zCVR9J/UCmP72vNkebfQYgztCdVx8ePgQ+W61Cjs9w+GbrAMtd2N6AsRWZ5So/y512YSFPitJsXhIe9Cg+oe9zusd1JXrw5wHdLhLYThdu91q4wPbf7GvCgpce2helnlXbv01+Uiew6YcyPe9qjpht74V23usHtEdsq+8F1pTwoZ26Pkn4hZXuUur4U7RHlyu3RJ0MXWObaDiFfm8MxArc5bI91ikOd5zGe1g+nbY/YD/NNMGXCRSwXz+N87C+1/vRrEI/pv+ZpA1rb9k1xa30Y9jvCj2ZXahSHvMtYRdNlSRdWl6dnNF3uuK2pkV4WLnTbn0t956PkfgfHduy7lBU6uMOU9RX1TPI6ff09WiLEk/NkV69g4Np6pvlXxjqBbn5IPdYR+jni1Zif1lhHu90G5dPlcsUEPLM4EY6LjWLBOB7S5CjddY3O38tZrkC3VhMBL1doF/RxPpRFpLwbUNJvIqxNSj7hPevJjxiYj1UpQ+/RVG9QaA9R+kfBVH9mZzzdDdFSOfAOw7caS+mluTgmzE6NYjFtcxX6K3VxjKar2iE4y2yuAp8nOEmDaTHkgSVMn6PfXO03NJbm4yCilCq/hd4vNH8XegrTM6Jutyo8aGeqsJreDnF81xTewzQKzxyyStmlvK6ZXd/F3U/Y3G+jOGw2cfu4kW+JwxnfOykON57cRXG4Anc3xeHKlazwsKk52TQ1ogNsDheavws9Bu1+Vq7nNe/hXeM9fLnR+Xs53sMtENet93BLTD6URaS86wfvQcvnfo8pedI0nTBmvZD6OC+hv1JNJ0lveJHhVoXXvBKXg2eMQzq3KnQ0LJ60TvKUe12wYHdhUwz9ASV/RHnZJvAAd6NSFmxzvCgnvAxH/vbBVyL+smdRTsvvwlpXs7S9pO1qNBdH8mqLKdznTKSkY6HjLkgflFH44fwRYWWUdxqW4Lh3OBpjHZdyDkfdjQT/R0XHRdbrlfwO/xqasLlFScc2DPveWzzluI3KwWluoXJI+t+CcnyayoE8CT9pjny9nXhfaP4u9BZSt1Ohv1LHPtxO/LB8unQJ+bMmFCfCcbHjmkZSc/xCo/P3clxC7Ubm2xRMUX0s0x0x+Vjl+d2Akv52wrpdySe8Zz35EQPzsSpx84v79DGu+f3EM6GEdHmErjXBzQo9Ho1LvAvSXO+kMi00fxd6CtNzaZur0M8Rr6Gaq3aag7amkrK5oooh/G0EJ2kwLYbbgCVMzx4iV3vSdi1J5+KHiOd/B5fO/+vms3aIBV/K0+2BRxsU/jU6+R7p5BU60gTWQ756ozNuRCmrxI1Cvn2Ubwzi7qe43Uq5eOJIw7zJg3mzEufqbneuTSvOjKGKsznWTGDa5sKHn2B+XiK9KwHLd/gJb2O4OwGLDz/Rln0F654ELD78BPPzFu17E7D48BPMz1vt70vA4sNPMH+aA14Qiw8/6faAF8Tiw08wf5mwFhOw+PATzM9baCsJWHz4CeavEFbS0jsffoL50xwWg1hHCKvbw2IQq0pY3R4Wg1iPEVa3h8Ug1g2EpR0WI1gPJGA9TliYn7ec+r6+dM9bo04szC95xxWsTPOvuFG47dVwXS71bJ7QzxGvtvy03SjfV6ou8OzEfoXXvBLHn+JoX3lq2+I1rNsNse40xLrLEOtuQ6x7DLHuNcS6zxBrryFW2RBr0RCrYohVNcSqGWLVDbH2GWLdb4jFfZnPr3fP25rPPr9e8qE942kNbfpEGwfEjRtwauTOBJ63E8/LHT+45x2Etdzxg3veSVjLHT+45ysIa7njB/d8JWEtd/zgnncR1nLHD+75KsLqZfzwjUYnFuZnm5s0fridsDB/N+MH93x11Im13PGDe76GsHoZPzzR6MTqZfzwTcLqZfzwLcLqZfzwbcJa7vjBPb8n6sTyjR8eSsB6L2H5TmPZn4D1PsLC/PsJ6+EErPcTlnbMg2A9koD1AcLSjq8QrAMJWB8kLMx/gLAeTcD6KcLC/I8S1tcTsD5EWJj/64R1MAHrpwkL8x8krEMJWB8mLMx/iLAOJ2B9hLAw/2HCOpKA9VHCwvxHCOuxBKyfISzM/xhhPZ6A9bOEhfkfJ6xvJGB9jLAw/zcI64kErJ8jLMz/BGEdTcAqEBbmP0pY30zAKhIW5v8mYX0rAWuSsDD/twjr2wlYJcLC/N8mrCcTsKYIC/M/SVjf8WC5UGl0YmH+7xBWI4GvaeIL8zcI66kErBnCwvxPEdbTHiwXbmx0YmH+pwnrmQS+ZokvzP8MYR1LwJojLMx/jLCeTcCaJyzM/yxhPZeA9XHCwvzPEdZxD5YLciLdhJL/OGE9n8DXJ4gvzP88YZ1IwPokYWH+E4R1MgHrU4SF+U8S1gsJWJ8mLMz/AmGdSsD6ecLC/KcI68UErAXCwvwvEtbpBKzPEBbmP01YZxKwPktYmP8MYb2UgHUtYWH+lwjrbALW5wgL858lrHMJWJ8nLMx/jrBeTsD6AmFh/pcJ63wC1nWEhfnPE9YrCVhfJCzM/wphXUjA+hJhYf4LhPVqAtb1hIX5XyWs1xKwbiAszP8aYb2egHUjYWH+1wnruwlYXyYszP9dwnojAesrhIX5Je+4gpVp/pX1pzfhvd16z1Tq78KEfo54teWnvf70ZrRUrigfXn96S+E1r8TxnONbCp23FDoa1l2GWHcbYt1jiHWvIdZ9hlh7DbHKhliLhlgVQ6yqIVbNEKtuiLXPEOt+Q6wHDLEeMsTab4j1sCHWI4ZYBwyxHjXE+roh1kFDrEOGWIcNsY4YYj1miPW4IdY3DLGeMMQ6aoj1TUOsbxlifdsQ60lDrO8YYjUMsZ4yxHraEOsZQ6xjhljPGmI9Z4h13BDreUOsE4ZYJw2xXjDEOmWI9aIh1mlDrDOGWC8ZYp01xDpniPWyIdZ5Q6xXDLEuGGK9aoj1miHW64ZYPOeYtE/uq81n3z45yYfzTvypYJbyYHrEiNuHlwWek/bjfY147mU/3hbC0vbjad+NPdDojMPvxvhbATz0iL9FG4M4PowIvxvj+V88cIgPI8IDh/gwIjxwCI+8lO/GhqisNzffB/6iWz18iOWB8s/E/I2ipXPSLnCbwS/zc0TndkM6iLW/0UnnDkM6d3jKc6chHcSSz8W1dsi34Wl26C4PHcx/VwyWfGLtwr5GO80oxGP6elMwru7/MOYmN+RvBN5d7ykrHuGLdsO4jRQF/74w+CWRhbbvGMsk9H3XJ6TRL6S1UtcbaGXz3SiIaxoogzise7vEGlHiQtTpPZ5yI/1xD69aOeLaJtLRTpCR9Pd5+ML0vn3pIsO9EGcow0mfDLW97a5Pl/6lWls8su/GA7g9upUf5SByu5LSid0ZiJbq4L0xWBH9vpLeZQEPg2bbNsXwKXST7DjmZ1/kLuJL+yt0+B3T0XjWTqiRfsL5PMfoW3nthlDMy1dJSPo/zrUxjzefRZboF3Jb0Y4QwTMG+GQfyR93sk9cv3cK+j2+pXqUyozlZB4RczBaStcFOU+BeThLfmQgO6/6kXxLKvrj6ykO/ULx3cL6vtOLWnuQMK7Ia5Ti7lHKo9nxEYpD28Xjkr0QN0ZxZYjbTXGLELeH4ioQdxPF4ZozjlE4ZOk31osr+1/m2ricToJW13dQHLZbHl+NKbiiIzhms+6DuByaPyX0c8SrMT8tf2o38cPyETud8ggdbJosToTjYrOqZIAlfMdDyBHKt5wTr/AIF00EPHTAMu2Jycdmld8NKOl3E9ZuJZ/wnvXkRwzMx6qUofdxJ15xtyTpfxW6pc9Rt6TR8nWNwnvarlHS/7qna5Q0gzHlGovB/Am4A7+Z0zEjBVMr1x4qF/Owm3iQ9L8N5ZJDCaNoqb5yG3iw0cnbTQqtKOYdYmNejvPRTcrrnvlUPIzT9PZWSi/dS5xMWVck/T9J4UYhD1herlfmgdPsieHhnyo8oGmtHHj0iZizOAfhWTOFXJVcBaMKTlwQMbji/SSn48hvn/qhCRtTaIzF8Ih5XRrxBqq1/bXDcYeVct+yPobYQKQH7Zgwdg8Cdcep3QOhn4t0vV2w4afIdlz4Yfnw1tw9Cq95JY5vX01LZ7kH18b5DVp/xfkjyptR3rngGsuvZjrTadOS2mmakl6GAtgX49BhK8Rj+n8DdoVvntKmubDRppnSwWEID8e0qUVtugenD97GbrTjJF3Ym6eKk9rNU1jeoUanLPZGS2WB6Vl2ZSX9XkgjdZ+n9ChHbUqEp2xxWI/LQMdgmO7CYKOdzkqOs3OFQqudNPFx+gHDIMRj+r9o8okHvsvfwR74rM+Wi/VSuV6eLlerU5UyTye4IHXm7IvThz+nKR+2qfLMNslnp/JK/tEYrLhlkEGIx/T/1bMMotlRrBcey2jjg4lI7+uS6GjDRk0OPB3hG46PEw8Lzd+FnkL6K5KE/koNx8dTylXksyGMfAoZwkd+NijykbqcUOIES45Oxb4N02+AMmJ6fJb8+G68qcR82LkLcrRqRonLKu9Evs6WrhvtLBvWTSbmr+DyO24PKBtuD3hMME53bxrtLIs2bse8ckwjj9t/Zmcbc2sTc4Lya/WnjelxMMG+jOSPGyOxfZP0VzR50sZpg1RmLCfziJg43Y0883S3pL+myUPYdqZPdwutEeJXymRF26fXQctdrKe2v0I/F4XsD9r2V7N3KB+2vxNh5FNIY6+QX6nLvBInWNpViZh+AsqI6fFZ8uO7j5H9RUzW3bxSHnyH9venyf5i3fRqf319WAg774LYcrG1WI988VHafiqv5Jd0oXV0HDC5jK7+Pk79ldb/a34h9+//eUcb81PUX6G9lzqdiOLreCKK73+5z4givw3IK/nHY7DifPwNEI/pPw99IPv4mo3yrVcgT2wT5PegwjO23wEPVqS8k/Q4vuB5tTyl3aCkHVFoLTT/FnoKxaLQ4q1umg0dUeIs5yW062IlaJdC8eV0WyD9VxvtdBx4jI5lcrr2xzA3wumYH6yvzTGYms7yWoGUWdODPOFye0F5ia8/RGlrTWVy9uPOUR2P+zwXbmnihb20rFji+sXA9cvy4aDVr/Dt6jd3VRuX0zFNrMMtFId0xIfm8QtiONkfIJ+639rSctpLN/LU2osmT96ajvIUDE2evNVrofm70FOYLWrXVRvizw2RDDaPtct4iNqrpGEf1AUe64vODir5XeCxn6R/HPreW6/S6fvsRUR4khbrkbd4b40687ogct9G9Beavws9hVItQ/SiSB+DCf0c8WrLT3sMto34YfnwmtN2hdc8xbnwbKOdjuOyyrsBD9aLhlgnDbGOGmJZlvG0IdZZQ6wLhliWsn/DEGutHrvDetMQy1InThhinTPEsrRfrxhiWcreUlctZd+v9stSVy316yVDLMt6tNQvyzZkqV/nDbGOG2JZlrFffTnLMlr6E/1aj/3oy7lnHoO/G/0cSx9zzZ94d7QhSzthyZeVfrlnnr/rha9XG3ZYlrK39AGkrxU8kR/P52WipfOGkjbfnGvU5jjt5ramijJXhXNbmaiT9vZAtDNET2SN75C+b14tp8T1sl9zujg7OzkzVZ2uL87MTU/XutULSb9DSa/NGYqsd0YhZF2qanubd4BcXRiEuO0UNwRxwqObh/4I8b8jEP9p5I/0tXb5UKOdrlebyPsiesHauEysTVFnG0A7oe1N4fUwXMPEq97Pw6I92qg06wW43st2JMz8fCm1HRH6uUi3wwsm/LTXC7YSPywfXi/YpvCaj5ba52cb7XQcl1XeDXiwXjTEOmmIddQQ63lDrDOGWMcNsU4bYr1kiGWpEycMsZ4zxHrFCAv9Pwu+zhvx5cIFQyzLtv2GIZalLbRsj2cNsSzr8U1DLEudsJS9VduOjMtoqRPnDLH61U5Y8nU5+Exrfdqlk71le3zBEMuqjO6Z1wvebf6EdRmlrxU8nlPE8e5GipO0Z1dkTrE0dQn3Dk5liJ7IGt8hfd/YO6fE9TKnWJ2eKk7V56cXq/VSrTpb71YvJL02P6TNKwSekytoc4o8bzgIcdsobgjihEdtTjHM/HOpkEb+SF9rlzyn2Iu94DnFXrA2LhNL5hRxrs43p8h7wvNKeXBOkb+BeJVsEsrAcE5O/Z4Vv0lmfl3A71XyICfkX8PBd7jHW/vua4jSfx/2mL85pvMnZbhf4Y/37XO5fjAWny6vpHN/5Du9fbXDN91fPlir3lSrHKwdzkY6e1xELj7m4yBF4zOlRug3f7LFmDLVnfZMKfmLWFrVITZ3vT9sisyZsDua2/NHiF+htdD8W+gxaJ9pcFcb5hPxyWV/Kp0Nwo//U2mUD3ePYT73mSxsjNqmGdtGrbFUNswHn8TKbUv7K+Xld9xNsImNFLqaCWSTJWl/DCbrV8fa6dkGaHXhO/ZF8mpHrrh/C83fhZ7CnHqkSMbDj8ShudTS8yeBkv43wU7IEYqaK5WF8rswSHELJuWfLGpHT6F9RTctrk61IzTz0VK5iUw0XUTdE53S9IKXHLW2EfaYnsnUx+LxMT2B3BvvMT0oH7Z9IfuGOFvsO+Igr8QJVtIxEXGfzOKz5Md3v9/UtbyC2csxEf+UXK0Qxzdg/WpH5fDRXjmF/5yHjq/doR3f13jnryv3H43pNLXjFVz4ZqMdj+n/bzhe4f8ge4AyQh16u1yNdtwK2VD1+D6UK9tQ7bg2TP+tZvq8kv5mivPpgjYMyERL68DnJ/n8hgklX7mxfDqcX9Kl8XPDHDma/kg2ob9Sfu5oSrkGPrKu4Ot7xhX5aJ+ds50SXUCbofUbA9FSm432mH2v/0K2HvsnsWFp+i6h7YKzT39Btl47qjeNHiGuZoPTtIfl0kGsRxvv/JXjMWXMO9AU/LAwEZP/6412OsmjHX+D9pnbjPu30Pxd6C3MaX0w9lnD4510Nf3T/FjWr78PfdYIlVtrC75xj6+d+4721Oj4dBplIvWm8cVHzvCRPQvN34WeQnGO62BUKTfXgQsyFbkVdHRz8znpCMMdVP9oy32+pnYUBo5jBJd53AU8XkE8jsbweE0zXTjffe7t/5kPpIV8iKzQt8565CHpNwGWlj5u+er9TbpJ42acN3BhsGEtp7f1tGjt80nb0+w+ysQF0aN50KOPkr3RfPfl2hStPn19XVifozCf1ifj8XfoY+nTjr/j2o4L4v9q6Tcp+Fq9OVzud9B+CV28qWgTvfP5adoWcrRVnxzXMbB8Gsa3FQxfX7RcfdbK1A/tJo1ea3R84/RQ8w5Sb2GPIStMiew3A59an8zbjPCYoyxhaOk3Ev+Mv4XSS368xgfbs7QH7scaYLO/Sn2pr4wu7GnoZRSeOQ0vA8uy7nAMz3uIZ0l/M/S9fPSxNi+HR8bxcc+S/jbA5KshtE8nfHZUW97WlrAnoqVy2Ub5cBmd61zD5q0sGs5WwuFyDhANxta2crh/C83fhR6D4MlWBzx2c4fCzxClr5EeXxF1ytQnM/dvp0L3iqhTrkh3J9F1OnT3VZ2YwhuOH7Det5JsN4aR7RTLcShaqrfcjjD9frAXD1K/iv4A9r8HY3x0HM9sV2TBfCGv2CZly90QpX8U6uO+q3RekR/kVfPlpc1fCl++Y82g0SkfzT75biNOa59822d944JMtNRGpunDsB609Dh3j+mfVMZivvloh98gf8631tPShcjfD2rj73GgeWxcx427mqDa6CyvpH8L5nWO0zg8zLp0oaj5x5mokzb7LEa0U4+v0K5wnYYYX2lzDdr6m8/m5JU4XufTxlmbFDprWP2FNW6IxXPtcXOH34/pa+NszO5GOx7T3wI25hc9tjLEOFLr89jWhBnfpd9HJvRzUVDbV/TpjtbHh91OP9nyzTcr/GjjWanLLUoc+y+oo5h+M5QR0+Oz5Md3v0prQojJ7XyLUh5tG7trD//A4/cuV+e1Ni/1q40T464tQf43euhsUOikaXdh9Cp9Hy/0V6rdaXqu9fE+PdrgSZ/Wd8c5VPTPI6KLc6hb6Z3PZ0/qV36H+hVc79L6FVyzxfQfhn7ln3jmVNl+aNfaBD4iP3VfIPRz0dK2FUIntX1fmo6F9cvbey18tgf51fxgrDvUbdQrzSYOREvtEbbVIXr3B9QXWPh8Tof/OfUF2vhouX2Bb43X1x4C1Xfq9sDjsNDtQdM/X3sIdEVJIY3+aDY37poNtOvafDbiDlB6fJb8+O7fU3tATG4PPl9PaLvg2sOfUnvQfInltgfN/0nqt/6sy36L1wda34tAv/UfPf2WtFltfxH7c9o4ymfjNb8jn4IHpDPWI50xhc6lmxtavk3ql7mhNZsEeM3GYm2T/tsK2SRuD3E2Kbehsyza/j6fTWrtH93exhxvYmptvpvxXSA9XJtX8bOzquZVdlE7tZpX2bahs2yh51VC2gMXpM3zuJ3bZzf2TBsb8CfxcXbnQxt0mmntjqT/E7A7H/HYHV4r1MZ9mtyE7krNe2l0Rnuk41sXTesb+GyUb05J0yVtXxjbEMFwIewxqcW+PSZVWxvX7NVY1F7fKdcOFSfnPlerHHzi0cNxi+3sHG8lQEkf0W/O55hiI7tRoeEC3vnODRLf84Qi46fhKSltUrxmQLZ46KYZrGD+fAxW3J3D2Hli+s82W55257DWsFF5+ANzzUnzTaCxrHHiUcuHDQp/Y5mFJ63MkuZLPZR5N5U5m7LM2Ugvs7xfHy3VAcS4ZIPSYq2Q1rhdloPSYrXu69j6bVB6V6BB6S3k7IYelAZdLLlYp0nOZ5mcTzwzjp1Pts+Y/ifgfFbJ+cTJKdadCeCrV/lOQBqeUBtTysUyx/TC56CC6YJ87MgbNB5ulj3whnf1rCoehGofY7999/KGZNn46lzS/wjq/KCnzrFeuM6z0VLZJn0A4975HO20H8Cw/RIMF6T+gji2XfRFQj8XLbVzIfoibeFbs5WpHW0B/DeZTiFvIUBJH9Fvzqc52hMxNOIaNTud7IAnOdoanbi03TrayDMfDpqF/FnlHRtEVhYXwp6E0N6JNAZ8arNccV8d45c4Y570miOK+HFffw3GyE46RT656jlwshdptzrmZ8MR6CvCelrD0e8nTYyF4afG+of8aPrk+4KR7UvcSRNjUEZMj8+SH9+dJycWOzU8uJHjfJ2g64xPkxO72k+akLap6Y77t9D8XegpTNXCnlpQKwr+RBD8ciHsV0qT85pTa4e/OKfNbhrW77R2sLQh/zPaYcR2+HPFsF/4Tc9pF8wZ4lcF/4ow+tni/8og+KWS4O8Kgl9r8X9VGP1v4V8dBH+xZR+uCYI/39L/9wTBr7fsw3vD8N/Sn/eF4b9l/z8A+Ja+veD/VBD8Qknk8cGoHbJKmYS++B3vh/Td+B1IK0dYofxkrWzIP/tBHwR+UAZxWB/sEmtEiQtRpx/wlBvpj3t45XK48GTDRiYunDDC0nzUXvg637Dja4MhX99p2PE1YcSX5v/2grXJCMuFYw07vrYa8aX5w71gbe9TrB2GWDsNsa4wxLrSEGuXIdZVRlgufLdhx9fVhny93LDj6xpDvp5q2PFl1Xe45/cYYr3XEOt9hliDfYolCzcTCjavOQwqdAY9dHwL8YOAw3P2Lsgp33xqhgsLzb+FXkKxfXJl3IK4OCLCs+/LFCzTEKU/AIuj2Sam7/R17auVLMXh+CXESd2MhWsl2omjXE+Sf6H5u9BTmJoPOx9bKoedj52qaps77PCnS2Hne6dmw873TlUu2QL8xbn+DNGLoqgvFuC1nfnaArzITjuJLq/EcRvtl4uFXzPEOm6IdcYQy/Ky6ROGWJaXor5kiGV54bHl5dyWWJa6esoQy0r2Wr/dL7pq2R779YJoy/b4qiGWZRvqV9lbXv5uaScs+9p+vZTeUl79ql+WvollPVrK/nKwE5YXyfMYthesrYZY+T7EcqHRsONruRdph5S9C881+o8v97zDCMuFYw07LEud4PXfXvh6umHHl6V+WfHlgqWu9qMtdOHZhh2Wla66YFmPlnz1q7wsdZXnVvvFRlvarzcbdliW/tcLhliWcwqWPrnlWMFy7pH9e5m7xjVDXL+qN9Pzh8C/0zT22t5uu/n56da64XbgKRN10t4RiHaG6EWRvlYh9McVfoTvnBI32AOv07P1YmFmZrZUnyzP1aZnMoQvvPK7AaDv/u1U0mvrHtoecsN1oap2w8hOkKsLgxC3g+KGIE54dN+OfYT43xmI/zTyR/p5Jf2DjXa6bupSw7p+mVibok69xbZ9qdbDh+B5H5RrFOIx/e81bZN2QId2KAHuSeBDSZCnzZRP+87TBV5DdWGh+TdJk+oJQehJnaxTeNlCcpG0vw9yqV3VWRbttjKxUVkPjUh5l4niZce3CaNsJqeqM4vlwmx9tlyeqxemFierF//M1Gdn69OT5flSpTw1O1ddrJUXS5X5yUp1slqqzV1cj6+V5mdqtakqy2bAUzat3Ntiyp2NKXca2U0o2Nxmuu3PcwrP40o+7ie3E58Lzd+F3kLqNX3uC8P4DO01/e0p5RrWjyik7huEX6nLnUqcYEkfh/ujMP0OKCOmx2fJj+/+Q9NG5AnTBf42VvMd8J3I1+3F+rcTnWXT/Lk0eoS4+Si+rxI6uGdO+o63Ty2m/WaSD+WJeY802vGY/h7Yb/YXtN8MfWquP+73sD9zgftvoSe3gXEa7gsl/f8LNp9vhxylMmM5fXYKy4U881hB0v8NjRUC2SH1cBaWO55HIDcaok2/trEyvIb1R9vf/2g2B8uEPnZc/5HWvgutlbLvWtl8/aZma9PY5rRYgfuRUpp+jelj+jg/mtu5ZtfRFrKPrI1vGAtpX6/QFizsp7YR1hUKX/jON68m6cJ+Cz09GfZb6OmZsN9CT9X5HJY/aRpH1+9szXfSFHnH2dLPNd75O0Tpf21TG3NHl5ifj8Gs5duYVzafRwDXXlbTre+WB4LgzyxqPoyURWgPwXs7W1OcS2vzhX6OeA1l84eIH5YP79MdVnjNK3GsI8MKnWGFTl6J4326y8XSdKsf+HLhnCHW64ZYlmU8aoj1kiHWK4ZYpwyxLOV1wRDru4ZYLxtinTTEspT9aUOsE4ZYlmV8wxDrSUMsWbPVfAvL/nQkWtrXhBiraP01lknoj4P8IojX/goWx7EvkgkkO1/ZkEeuZ/TVuF/XsIa6xArrE7brdCCKLzfSH/fwmo/hFWWi0dF8PV+70+pjQqEteUWG64ivhebvQm9hMhN1lhV5xbYo9N1+ELmxtFpbPLLvxgP7IgpxcttO6WTcPRAtlfdQDFZEv3neNgt4GN6+aao5AE9zbmcYO1SsprUdQn+lzu3UdFVbJxXZrVN4zVOcC8ca7XQcl1XeDXiwzhtinTPEet4Q66Qh1it9inXaEOusIdYpQ6yjhlgvG2JZtiHLenzNEOu4IdYFQyzLtm2pX5Z8WdajJV+WdsJSJyzr8SVDLEt7n2ZOR/M1JL12pri2riZ+9HrIL3nDniPR9qM1OeFZLkJ/OX60yG0XpZO1s4FoqW+2PgYrot+76F2cH62NDXjfGdcp1/mEgjEYU1aNppTVhbySn8fww1Q2F8KOq+amM0RPyoHvkH5OkUkIP39dSrmK7NYrvOaVOD5XZL1CZ71CJ6/Esa3uBes1Q6zjhlhnDLFOG2KdMMQ6aoj1siHWeUMsS9n3q65eMMQ6aYhlqV+WfFnWoyVflnbVUics6/ElQyxL2b/Sp1iWduKUIZaV7N0znz/UL7rar/6EJdaaD7DmA4S0q2s+wJoPsOYDrPkASViW8upXXX3VEMtSXv1qJ140xLJsQ/3ad/Sr79uv+mXpR1vWo6XsLwc78YYh1jEjLPfM3wz1gmU1f++erzTCcoHPa+oF61kjLPfMZyz1wtdzjf7jy7IerfkaM8JywUonXLCsRz67rhesvCHWRiMsF6zk5cJTRljumb9lfLfp6lp7vHRl7Gf9WuuH1vSe454xwnLPlj6mZT1uMsJygc9Q7Yd+2wXLtm0lr35uj3xWaS9YlmPRFwyxLNetLOcnLOdNLPczyVyHnPUgZ4n8s6ZTHHhP4ey4wlMm6qQ9Goh2huiJ/PAd0h9X+BG+c0pcL2ePTpbrU5VKqVCcL07Xy6X5DOELr/xuAOij/cD02t5I7b5DQ1lPaWePjoFcXRiEuFGKG4I4eedkz2ePjgXiP438kX5eSc9nj6atSw3r+mViydmj2MdI216pPcw+LO2c0AzxOaykR7whSv8HTVvmynzdzk562jd/kfJugNK78LXGO3/HlTi2YShvO70sTKW1YWynAn17W/T1Sdq3FT6bquk9n4/YSxsKgXXp+rNC6v35Qj8XBdXNok+umn8ishtTeM1TnAtcf1pfN6bQWS1YaH98332kqXeNjvYtvM+WLZeO9u2Or50slw5i7Wt00hk1pKOdx8n+hwsLzb+FnkJpMaxvVqiJjDZES4PE4dw96ySO6VmPcG6d6x7H3Oxj4/dX2B44ZOk3ysnRu/+qNi6nkzCh0GG/p9s2PKjwL2UbgHyip06mY5t0mnheLvr3OYjH9G/C2X8TmzrLiPlHY8qIvCOvoutMb0uTRmA9Vc+eFVqBz/KpcN+EYVwpN7cR3K/NbQTbFrcRbFtYXxy0diCycJg/6KIdDCjl0NoIjxvGlXJofY2vf+DxkzbXqtnhBxrtdEjPBa298vmqvjKHHg8FPg9nUesDJWg+1yDFjStyS6uDUiZXj3+UQge1MyV5DpTPv0RbyDwiDzJu5DRsRyX99KY273yu9zrII5iHAZP1RPQY36OPxbZV0n+cbCufab7Q/F3oMWi2VWilGdME4msyQ/SiSB/TCP2VGtPkiB+Wj7R7p7vS7vYfKFevLT966Mj+2gCJEps+ixPhuNjcDDPAUuRJ96VG529pDtyEGTsLeEnDOjaxWKbRmHzcLPjdgJI+R1g5JZ/wnvXkRwxtyCIYI0q+hebfQqE6OV2uV6rVxalCfb40W56dm6suzs8uluYm54qlmWK5Ml+qztaLtXJltrJYrhXq9VKtWK7OFquzpRmWT6SUCfmJ4x+7IK6H9TG43EVqWLsJC/OzmR5PwLqJsDA/L6tuSMDaQ1iYnz+Vm0jAepiwMD9vYconYD1CWJifl0I3JmAdICzMz1uYNiVgPUpYmJ+XQjcnYH2dsDD/ZsLakoB1kLC065AEa2sC1iHCwvxprpNErMOEhfm3xeRDN8CFNEeNh7nOoVhK240K/ZU6alyTu++oce0amrwSl6Fn7TqH7QodDStriLXeECtniDVmiDVuiLXBEGvCECtviLXREGuTIdZmQ6wthlhbDbGGDbEGDLGGDLFGCGtAwdJs7ljUtguHDh84WGuOXSIKvrGGex6Nob9JyR95sDCPryw4fuCpAKE1HOm+vuDxdZdnYSqAl5CzSn4XtOle7u8D9a+ph81CPxct1eEQ/f0g8cPy4f5+SOE1r8RxH51NScdCx12Q8XRG4YfzRwlY8huPd9bGNTzFpI238J1vKrK1zSbq9Ad+AHrP17z6lidc4Ov8JP0vAeaPdiWXwXcc+QZPmZEfbYwpedeW19rPHCyW11hfBJf1RWw1203Mi8tkaY48D3NM/2TqbTd8XUI2CD/+6xJQPmxfhxVeecnGhWONdjqOS7PsgXHnDbEsr0h63hDL8toZy6uILLEsr7CxvFLqlCGW5XU4ltcaHTfEsmyPlldKWeqXpbzOGGJZ6le/Xj1nqRP9ep2XZdu2bI+Wbeg1QyzL9ng56Ndqudowrf8p6bVt4r5j8LV12cDbqid9csL5fKG/nGPwRW7vp3T7Gm05IA8oC8aK6Pf76V0W8DBMRJ315Z55jkGbV9HqV5tjiJujwS00sr7s4nn7yRCVw4WwV1vNFzNEL4r0cZ7QzxGvxrrovdpKu8qum6utMtHStZt+uZ6kX6/SOWOIZXn10AlDrLVrn94duno5XPtkaXMsr9O7HGRveVXT5XBloGXbPmWIZSV798z7N/pFV/vVB7DE6td+21L2lj6ApY229Cf6VVfX+u1L16et+eTdYa355JdOv9b8wkunX/3oF7pgKa9+1dVXDbEs5dWvV/2+aIhl2Yb69frnfh0P9at+Wfq+lvVoKfvLwU68YYh1zBCrYYTlnvkahF74erZhx5fl+pClvDYZ8vVcw46vMSO+3PMuIywXLHViqyFfVrJ34ZgRlmV7tGxD7vlKIywXrNqjC+92/XLPE0Z8ZZrvrLA2GmG5YNkenzLCsrSFljbahX7U+34towvv9r7WWvZrvsnq7ztceMYIyz1b+hOWNsfSJ3+6YceXVV/rgmV7tJJXP/cdfAVFL1iWcwovGGJZrltZzjNZzn9Z7i/kKyiyzffXNg+NCLzHt3Tpjm+fT30uT9yxyci3dvRdT1dQzJWKxblCsVYrTBXK1UKG8IVXfjcA9N0/7Zw4ba9y2Csc5gvaFRR8zcQgxK2nuCGIEx61KyjCfIcwn0r+SD+vpOcrKHq5Omb3MrHkCgrsY6Rtr9Q3CGJr5JyULzZtDZ5zsNK8yNU7X1Z4EXra9zV4PgKfz4e8S94J+q2VS6MzlLJcku7SfbdRqKS1q/363UboI4HT9NvIr9bvYN2h3cHzQLR+aiBaaiexjxiid3ub7UGzQXzVQlob5Hi/c0tn2bBuMjF/BZffcXvQzlVIOv69tqWzLJIv7nwVOd9wiNL/ZEsb8/7ms++Ya6GXdKwy23uhNxy1ZaJ9v8X8PQz2jY9V5jJjOTU7JWXQ7I8L9UYnD5L+IPmWgdqZeqyy0PLpXWC+Up8Pxb5lIHtd9Nkj7VvUlMcq8zFqKE6E42KjWDAuS+843XWNzt/LOVZZM2HDCqbvk1jOx82C3w0o6dcR1joln/Ce9eRHDMzHqqTlc+Gthp4nTlZYpywrzJ/mGGXEYtfKd4zyaAIWH32sHY0tWEnHJvHRx9ptdII1noDFRx93eyQzYvHRx90eyYxYfPRxt0cyIxYffdztkcyIxUcfY/40RzIjFh997DuSeUsCFh99jPm3xOTD7tWFNMcV47Gedt1BMfVn10J/pY4r1uTuO654q8JrXonDsmEc0tmq0NGwdhhibTbEGjbEWm+IlTPEGjXEGjPEGjfE2mCINWGIlTfE2miItckQa8AQ61IfC7wuhn5eyR95sDCPryzo/6Y5Fhh9VcHjJYofw1B27Vjg5fer79ZjgWU8mFH44fxRApb8djoqxwJLOm26Vhu7SHppezi1hBh8dK+k/33Qdz66VxuL+Y7u9V0fhPxo49xRitPGldpyj6QT2zcIcZbTz64cP97V5oPlM9RILwsXWHbamBB9D7b72q192lQl+1VJeuU7shenB2s01ardxhp4TJF6SYDHFIGOFfOOKbRbp0V2Vym85inOhWONdjqOyyrvBjxY5w2xzhliPW+IddIQ65U+xTptiHXWEOuUIdZRQ6yXDbEs25BlPb5miHXcEOuCIZZl27bUL8s2ZGlXLwfZv2SIZWmjxRZq19bh9XAYh3S2eOhg/i0psDQ/RNJfo6T3Hd16NeSXvOLzvQfirMe7cfVxDdAU+ss5ulXkdiWlk6X9AeIBZcFYEf2+kt5lAQ+DtvYTtz1D6MbVrzYuGPXQGeyRzqBC59KNE+aWvfbQb+MEra1rdoDnhrUrGbV2nVfiuD/rBes1Q6zjhlhnDLFOG2KdMMQ6aoj1siHWeUMsS9n3q65eMMQ6aYhlqV+WNuecIdblIPuXDLEsy/hKn2JZtu1ThlhWsnfPvD7cL7rarz6AJdZav73Wb6+WvmOt317rt9f67Xen7PtVV181xLKUl6XNsZT9i4ZYlm3Ist/uVxvdr/6EZRktfV/LerSU/eVgJ94wxDpmhOWe+di+XrCs5snd85VGWC7wsX29YD1rhOWe+QiaXvh6rmHH15gRX+55lxGWC5eD7CeM+MpES/d894K10QjLBSt5ufCUEZalrlq2IRf6Ue/7tYwuvNttobXs1/qO1d93uPCMEZZ7tvTlLG3OJiMsF/jIxH7oa12wbI9W8urnvoOPTOwFy3LM94IhluWajuU8gOX8hOX+HD4yUY4O+1wzUdij9OZaRybieRKZqJP2hkC0M0RP5IfvkP64wo/wnVPiejkysT43WaiU6rXCdGlxsVKoZghfeOV3A0Df/dPOw9D2+oms82FkrR6ZOAFydWEQ4jZQ3BDECY/akYkTgfhPI3+kn1fS85GJaetSw7p+mVhyZCL6LdK2V2pPLh+Z+KWmrdGOTAzNS1j7VpwXm7EzWhok7gqljBKH+7axzjlk6TeWycn1j65q43I65gdlzvOeSUe7sV4KD3i0G6bho90k/e2gE3y0G+YRzMOAyXoimPgeea43dB7uoT5wnMq+0Pxd6DFoR7sJrTTnOmnnTeE7bgejihzClrH7dsDHReI8Nx97h+NfPt4Yv5UYoDj8jiRDcfhNxw6Kew/Ebaa490Icf4PwPohDXeSgtWWpF1e+X9vZxuV0EdFEvbmC4tDmXUlxAwpu2KNWJ5d91OpAEH78R62ifFivtGNP8xTngtVVBC5YHhVvefXf84ZY5wyx+vUqzvN9ypflMf39eoXjk4ZY/Xo9xVlDLMv22K/Xl/fr9dKW14xY2hxLnbC8Qrtfrzi25OtlQyxLnbD0TSz7bct67Ff71a9X2verjbbEstSvU4ZYInvJh+M5PA8s7JVFhWLY+f1CSWSlnVWNZeL5fZRVJuavYHEcrwesCyQ7X9l8eoDzO3xGm4Y13iVW4LmyVp2u95Qb6Y97eNXKwWddpB37S/oNHr4wve8s87BrGe2zTDQZamsZyznLROT2UUonc78D0VIdHI/Biuj3R+ldFvAiJb1Wh6MKT2muNlmXgMVn+2v3GPjkj1h8tj/mT9N2EWsPYWly9+kwYvHZ/t2ex49YfLZ/t+fxIxaf7d/tefyIxWf7Y/405/EjFp/t7zuPf3MC1kHCwvx8xnrSOS98tj/m5zOdtiZgHSYszL81Jp971u4JwPnvfY13/rp29NfbOnmSvHj2LNqOMYjvoLW9jfm329rPchbuaEoaLiw2dBrZJg3tfFtJMxCDKe1e0mv7O7T1HUm/XUmPe4qEvtQV7lfaHiXTxjrj9b6dXfJ6hZJ+J6TZRrwif2m+ydCutFspXgcVXrV1MOm3RpRyWff7SE/Kge+Qfk4pYwgf1idXF6QeUl7VhKrO4kQ4LjaKBeOy9I7TfbHR+Xs5VzXhMr8mAnZRsExXxuTjJsHvBpT0VxDWFUo+4T3ryY8YmI9VScvnwvcaS/OkaTpXEv5C83ehp1CcTtt0hP5KNZ0kveGlyV0Kr3kljtvFLoXOLoWOhrXDEGurIdaAIdawIdY6Q6z1hljjhlgbDLEmDLHyhlgbDbE2GWJtNsTaYog1aoi13RBr0BBryBCLr93Rrj6Jc6Msrt2J2xq4RckfebAwj68s6MvwsEP6heHIP+QZovRfg2EaX7uzVcnvQprr7NhXWmj+LvQWUrvwQn+lrrNLGnqxH7Jd4TWvxHF/vzUlHatrd8S3zyj8cP4oAStDcZqOIx5fiYL1LHm1aZFuh+zin+EUB2JUG+14TF/2THGEHlqjT3kFxWE+0SXt8wNJF/gKn5p2hQ+Wd6jRKQvNp8f0afxWHAfxtVaab661PZ6yQBsi9eH07z9OdKbDKd9MzF/hld9xf4dYckO70NloSAex6kQHp8NxOvLx7W1c9098NGxHmPebjXY8pn8ZpiOPNp+16fCNUWd+ifs2tMP81fH5RZba9Dgfy46+Ky/HaOVE+VUbejmfAT43N/n0fRYUuF3WtXaJU/ncLjW7ium7nYYVmWltj8dH2pIMypxtushwWEmPeEOU/rTiD2mfDWwi3rNd8q59MqJtWd8A5RAm0yx9aEsyWl3llfybYrAGYviXds31no2hzelFJwYhPeoCfyIj6d+Aurr7Kh0zUnjQ6kjoDcek30Y8SPrvK/risxOo/1sIU9L/ImD+4a7uMPMxmD/0+CpaO8VlOG7Xmm+j+bOanu6kOOSd+83tQJ/TjhN97VP2SKEbefjlPjeJX+6PJO63oD/7lebzCOEZ2/KSry7fr5QnbV1u8JSfsSTfYLRUX31tCOX169t1zKEuMX9T8Qk0X+eBRpv2b8X4My5o/gzbbbQpkhf9JM23mCD+Zcz2Y6W9ar6CYAX1FYq1guYr4FY59hU02WF6tinasj/Ws/QBWn/F/j22Xz4+QrvuM21fjJ9yHtiQXF7EfbwRqeUdiikv64Wk/32PHde2O/hkrs0l4DyU8KNtj9hKcci76KSmr5LuUugryof11ScLF1h2mn+BcyOsr2g3N1Mc2gOeB0zSK5++og0qN/VVq0uuZ+QhzfXtW5Rys5yGY9ILHveh/87jV2l9HG6N4rraoaTX/Eutj+O1O+yPuN5duKHRWR5J/2cp7bnUS9ixX7GotQ+UK7cPnwxdSOMjoixFZnlKj/KXOLQt2ynO13a0PiVt25G8Tm8/RLY+nxKX2zDqDK6zsa2X9H/jsfVa2Xy2Xusb0AYIP5o930JxmM9n6y+lLveLred5Ak1fNf2T+nD6l0vha/iul0zrW2lzZpspbpPC4yXr52PqHsvLde9rBy506yNx3aNebKA4bPM8X5M0R3QDlWO5c61XNI1wWpvi06skm8JjR59N0eZ5Nb3CTwRcGIS4y0WvfDalW71KO/f4Z83K0LaD874FTY98/lmSHrF90myo1q/iOH9EwXVhofm30GPwrcmEvWa1kHpvHl+zujEMP95rVlE+AySfrWH4mXI02Qa7UGsslQ3zwe0pD7yLjPcAjuhq0trZ/I5OXG0+APMKDZ4P+PkdbcxPEqZV2/+dcZ1XxM0reVkPhmPSY9kx/bXQV/EYULOfmm5J+iQfjvsq7apw7XOBuGNTsR5RXtwvS/rrlX5Z6/+Edtj+b1Lt/1CG3P/51vpc6HZMznMkOHbkK5i1+WCfrqadw8UxILfXjVAurW2hTUAehQ8XqpAmF8N33BqzfJ7F9uBOj3+n2WNfv5zkowg/vvnBtH1Bmv1sWr/P+9nKKWzGUKSP+1imkr7qkalmV3wyTVoTZ7/Y92lSkkz5cx9tLs4nU0n/kEemmr3zyVTSP+KRqfX8HsvUN7+XJFP+NE1bN/bJVNIf8cgU1xXTyFTSf+MSyhTLvIPyoc1AG5GNltq7XEy+rAdzawymZr98n3hqdanZNK7Lpz11qZWL+Y0r1zajcm3rslyS/vlA5doYU66NXZZra0K5eH1e0p9WyqX1YTyuxbbM82gu8Ny/pD+X0re7XOZLef7CtycM64DrX9OXtOMbyet05/s0t4Hf+bAO4P4a3zzdEKX/QUodkHeXQgewP2Ad0GTt6z+0OWps9zy/hellnKzpAH+fpB37kFYHJK/TgWPjnelC7a2VsrGccByBZeJxBM53aTaI04tNwb112I5ax8tT+l8Dfb0bjs7mesc5jX+UYk4jr/DKtH8X5jR+o/nsO4ZC80G43Wrz5ShnbreS/rdTttsV2YcT0259e3Z9az8udDsXK2XPR0t1KU9x2n5ZtqNIB+uD2+24Qsfpx/B4Mv/ampXPh9DWKdiH+EkP48xvNXTM/w30/p/v6Cy/tt/Jpfvfd9jQ/lddjnF7OX4jzRhXK/dWpdzd7FlZztgiabyC+bYqZWQZDsek5zlQSf+nip6lWfdJWoPh9qXNx2o2PeloJNYFrZ3zcXcuaMf8854E7dqZS7dGODl5qX0okZ02D8r+lWY/M9HStpwlbBd83+FJXqcrf9TcgDLh4cdXNt/3Cdq+Nvax/z9oK7xvXvPbsYxxfvvfeOxi0t68bvdhcFvQ2qSvT3NhRKG10PxbKNR7CkJPbNs6hZe4tZzBpu1ycqxdpfOaWcJvb0HzjzIkpzBrspOFDNGLoqVjBaSfi3R9WDDhx78mq7W7sGuyxbrFmqw2VsPxyAbyyzQbgHmfaLTjMf2WnW3MjTGYUdS97UQ/9uOjnbjWfjuPldC2+Pb3+dZF+TwUn++ZiZbuc5T0u8A2+L6LXJH5sWJdHWPhHBj36775LheW6x9r30Vy363pH+oCr6uhb6fVEX8/Juk/BHXEfij6Zbyvd7xL3rU1QW7n3Ha4naf9xiND/KPeIoZ8u8HfHRdAJuwbaMd+ol1I4ydr37FovjD7yZjP5yevzHfG/TvXiHL06WvSt0CbmrYb4+VvL1dgTs7NzcxPLhamZquVenWqxNekoSxGA9CvLM4sTtUWKzPFqZnSVKG60vQnq9Vacao4Oz9Xm5qqzk+vNP2p6fJspTxbLM5PFWtTxUT6Ts//vMkEfq/oQgV8iC/D9WUZwpNn8b9Q1w39wdRXjQn9HPFqzE/LPx0gfjIx8h6JOm2qMT+LmWipzc4qNPlcn1Eljvsl7GdGiX8pI6bn/oi/Fb0r5pwCF+TMkIwS55u/cXp6C+kpnqHDZ4QMKTQlbtgTt84Tx2f3YdwI5NtH+XIKpuPh75GfoNUt6h+fOcq6j1ijCVh8LDrm57WKsQQsPhYd8/P3ruMJWHwsOuZPcyw6YvV6LDpi9XosOmL1eiw6YvV6LDpi9XosOmL1eiw6YvV6LDpiHSasuDG9+7ctAesIYWF+3ve5PQGrSliYn9cgEIv7Z9w/din6Z6GfI15D9c9pvwPls4oxr/bNJ9st7ftR7SxHDWvcEGuDIdaEIVbeEGujIdYmQ6zNhlhbDLG2GmKx3Urqrx9rvPPX119r62x8vTuvuWN6xIjzB9A3T/ILbiCeNZqajylns7CPKXQxjq9kxjg8T5qvpEYfk+0+ni87RnFx+4j+XszYDsvGZUUeNZ75myIcVwxRHMqIrwLH/oOvF0f5SblDjKkXqzOVwnypWC2XZwuzM3PdjKl5jIX5pD9mPV9YJp+doVLMKHxq/bHQzxGvtvy0+2NtrKCN58JeS1Yp+OzXuCKf0Fffafsa2MfQ9tlj+nGQIabHZ8mP736XbIA23uCzilzgsbo2RsJ3A5cISxtvad//OZvy2yQL1NdMzF/B5XfMI9Yn2/VRQzqIJXMNWnty/xaavws9hdKk9v0o2zrUK7u2Mz2b1tYJ/VwUtC0XfTqM8uGxh3bGirbm3Gi00yXpN9LRsC70KdZJQ6yXDLFeNsSylNdpQ6yzhlinDLGOGmJZlvFcn/L1vCGWZXu0rMcThliWbegVQyzLerTU1dcMsSz167wh1ncNsSz1vl9tjmUZ3zDEetIQ601DLEt5WfomlvrVr36hpd73qy933BDrjCHW5eDL9aveW/oma31ad1j96sv1qy08b4hlaQst69FSXv3qf33HEKtf/a8XDLEs27ZlG7KUl2U/ZNmG+lX2lvbLcl6uX+eGLPXL0vftVx+zH/sO98xrVhZ9x0QMNj771oY1OhmFZ21NGfeajERLy2u5riz4gb7TbN3j5PsGBunzGrPEa38Fi+OEVo6wjMtW9JXNtxatffflw9rYJdaIEheiTvOeciN93/duWjnGDWUyZIg1TFjDCpa2ftutnvj2Ygdur5M+26bt53Z7FmRfVrW2eGTfjQf2RRSyJAeR262UTr4DGIiW6kE+Biui37fSuyzgYZiI9DrV+BS6/M5n3+P2o0WQLuwepvR3iwv9nCKTEPZyPKVcec8I5s1HS9vbQ43OfEiHZR5mb8fkfFqZC/1cFFQHWjLX9rRqvoq2x4u/KUWb9WyjnY7j0vSFGPeiIdZpQ6xXDLGOGmI9b4h1zhDrrCHWBUOs84ZYxw2xLOvRUl6WunrCEMtSV08aYvWrnbBsj5ay71ddfdUQy1InLHXVUl4vG2JZ2mhLH+A1QyzLvsOyDfWrfl0O9itEP3Tp9tyXFjNET8qB75D+at9z/0yjnY7jLuU6juVeIcs1Dss1Ics9vpZrHP265ng57Ffp1286XjXE6tf9Y5b6ZWkL1/YUvjt04kVDLEv9stxPYFnGtT1Ma3bicrQTlmW0/M7H0p/oV9lb7g1da0PdYT1niLXWhi6d7C3H7pZjZNkj59urFXrfWoboSTnwHdJfqb1gmly1ebtu90RZ7WNygc8lxbNOV6j+Jpdbf0Nh+PHW35Ai127qz4X9DV2ukV0ZSuMKXa7PkPvGkJ7ID98h/ZwivxD16TtL3QWuz80Kr3klLk/58IzefY13/ro9TWeubOdx/+SMNO2+zQzwM0Tpx3e1Mc9d2UkbZc71jXsQDfc5rfrztrUz5NhmZiEfz+9nFTpZhY6Gdc4Q61VDrLOGWCcMsY4aYr1miHXcEOuMIdZpQ6x+rUdLXbVsj5Z8PW+IddIQ6xVDLEudeMEQy1InzhtiWcrL0n5Z8nXBEMuyHi356te+w7IeLWVv2bYty/iGIdaThlhvGmJdDv22ZdsO0ddONONwPMd3qGUhbpTi8GxuxMA45G/Qwx/mH4zJx+WQ8Wiob4sEf30Y/NY3j+sUWWGZ+IxybW6N/woWxwmtlZr70sqmzX3lKT3LIA5rXZdYI0pciDod9pQb6Y97eNXKMUgy0dpZRpGJvF/v4QvTTyi0Ja/IEM/+N5ThpE+G2BaF/nK+FxW5fZTSyX1WA9FSHVwXgxXR74/SuyzgYZggDM2OcnuOq998TH4Xxj10tPsSpHyjkW7r+c6xbm095pd0Gp1Mj3QyCh3G0uZMXVhstOMx/bbmnKl2n+mIwp+vLWrrAtimhB9NNvkU+VwYV2gJTytxTgPSE37xHdLPEa+h+iRt/l5bp+x2/p7tgnYf2WaFjoYl9TkRLa1f7hc1vRvx0NHuMQmrC8USyxKDxG1Rysh3S7N+cMjSbyyTa7Pb6O7sSMHS7rYR3vpNTiMUh3fNydkHEod3x9UbbQwOSTL8SBcyxLri+6VadyorfLkgdxsNUfobmnY3bF1MlrW6YNu5JRDttLZT6Gu6IXznlLhe7ieqzVVq84tTUzOzU9PTpcpshvCFV37H/Z92L6J2foDIelsYWc9p935vBbm6MAhxWyhuCOKEx7fbCfG/NRD/aeSP9PNKer6/Jm1dbori+8he23l5Rdp5qXrp2nmp2s/tfNLda14u10uVeqFSrtcs27n2fVzYdl4qr+52XipbtPMHG+103dRlXqGDcwNWNkPzdyeITrf+Lub3+dVDPdIZUuj0m7/IdyGirqKcOKyUX83jqYXm70JPoTjFsogUvlAW7Fej78x+Nd7t261fLeXt1q9GfdpKcSNK3rDyTT/W574q0Bxia6yvjcG1NuzrVzXbh+OaXu0o2z6s2zT3pW/y0NHO1+u3tsZnOmL/j/rBIak9beuxPfWbnPg8036zSVhXWymt8D6kpB2kOEn7GuxP/a3mszYXymuWiI13yzIfmj3geV9J/xbM+26+WscciMHEunEB/U8pR2uMBHF2ulYpOr5/vKvNB9tG9G3j7Jk2dynpNR9fs3H5aKlesy3V5vnRxskajSZP4fFSyBPnkFmeaeecffJHGyUySjOW12ijjH3yFB4vhTyRR5bn5oQypZGnb17fJ0/fuo0L11N6wR6O9PUawWOb8xtgc67b2ckf3uvLujCqYKMN9bWznFIO/h4B8+L3CNb3oFemZxYrU9PlQq3ofk4m3YMu45fhBpSr0ZlnXfP3YNTu+zA9fiuB6f8X6Iv+V9DTt9Mq9Fy6f+1Jl4n5+zaG8m6w0flupLE0fbaxNH3rHN7GUh4lbhTisJ25MNb8jfJCLOFjiNL/S+ivXVgPeSR/XqG/nuh38K28w3bOWFnlnaR39fOTJo+it1h267HI2zQJH98xb6I7o5F9u6otTs3PLs5XpgvVwnxxvpTUrpz9+fMmE5pt7laXeYyCWDI/FXhv16S2Dyiywy+m+Q4yzL6yej1NPSD9ldoLlnbvUdj9RfWaG29q+2W0PXfMxzriMReIR80Xw32ALgxCnPDh0py7upPHgUA8hm2j9Sp/T+fCvsY7fx3N/0T+jNQNju1Q77Fvx/R/BX37X9I4k22uC7gvStubJ7+lvgaUtDx3zvsRNblietHJ4ZiyDlNZJf1fg0/56Z06JsoP+RqIwfxbz54o9Cd9bV7SjyrpsY0JP76xvsY7+uf8TqufDKXlPhjXUdZR2nUxdFgeGg/rFRzuJxmTabI+uMC+fFahg20K+/wRhb5h/zCt9ZUS+K4LrBveO+vCrY12Og7aXJeUyZX3j8lfx3TMj9bWLH0jeT8E75lultIOU1pez0Iel7uHHHnU1r34TpJ1Hv4zhDOo5PN9j75cfjMKv1pf0ysdxLqt0UkH6xn7tA9c1cZlO55V8n6j0Y7H9B++qo35oeZzUp/GtgTLcHuj/S5uTzn2XdgmeT6E+y5Og/04pv9YsxzYd7F9QCz3rkDy1HwEze9jH+FrIM8SyVPzASaipbJhHR4hWugfS//CMvgE8DF3VTwtkeu4p4zu3aeu0tMhD5iOMbS+k79f0PaOTyh8cdtj2zHsoaH1ZxqNIYrrtX60flvbN5BLiMf+HOnwuwElfZL/kYvB1nC17x00O7+e4jJKHNswLC/aMPZNtDEZ2kat3cXVnc/31nhP41cNe3jX5Id2yHoupzBXKBYqs9P1erE6U16cSprLsaY/OT0/V55fLBQn65OTpbmZlaY/MzVTnJsrz1VmKvX5qcriStOvzM/U50ulxWJpvlqbL654+WtTpcV6sX5xPq9UL5TmiitN/+Ls/GRtqri4OF2slefn693MJWr2mb/TkTaE77H9ydo299ePNNtb4G84C5sUeabp47TyafblppjynQA/4OBVyfR8NlPrC/k7QG29XjBa8+cpyyDpnwB/7kc09sJ5L5xzc2Gw0Vm+heb7Qm9hSluDxPH6UKOz3L65ChfYTx5T0uNaHfs0uMbHY7khBUvrl1jPhiPd7xU81rNjUEe8Bok6nyPesezsK2QVur45DsfnL1B7DrQuMKvNKUgYj3T/BuOwnfDeMp4rxjjUA5QBB20OQ2Th+PoB+POcToJmJ9gWaPN+mp1onSUn/DWW8nUp2i362NxutTlJbf0+Hy2tN9ZXzXfU2gD7nFkPPW28hG0gbk0ObQLOKfxSijkFzMv2WtL/T9Dn/DL1OWifWF80O8O8RJFux9LMNWljV6mXwN/7T2eInpQD3yH9lboPN+25C4H9oynhRxvzavXs1uY2REvrTBtf4zzrnsY7fzV99Nk29o8026a1dbYD2pjVNzfha+u4vpTGd9TaMbdzTP8jaMd/4PEd4+b5oshfh746R/nyXIy2XuObp/HZ8/UevpLWmJgvbY0pUmgnlcGnd5p/fQn71GmtT8Wyc5/q821d4DoYV9Jr/m6e0qPMfXNPWrscpbi07RL90D+I6UuxHGhneX5Ia5/YR2O/niFekAbOnx1udKYfAlxOj3hDlP7/VHx9xhRb48KRxlJM5hnfo1x43C7p/i/g4Yew95zlwP17oL0rqb/PFPo5RR4h+ndt/Kftfw08Xqr42oHm9/H4iusO23DcPgRe58S+Ae0+z9v/p6Zu8blKLvAe37RnTTle/gOtoYRaW8V+Ae2XC+jv/xXZKO2sG8wr9oPb4n8FP+G/eNYQhcfRyG+ztL04rD9x+1nYZkn6v/XYLG2cg3wdaeiYmavbmD+K2WOE5dLqj3UZ0/vWC7V1Ou2bF2xPb2M3lmIG9hGqmo+A8mEfwScLF7r1H0U/8pQe5ai1I54D9emqC769M7gP/q8CrfHUisVifWZqcW6mMlmoVysrPcc/VZ8tz9RnC9OT1anaZLXczRy/T8YZRcYTHhmn9YcYK+PBGkrA2k1YcW2Q862QfzKVIXpSjijy+ydh9oT6/ROUD8+Nar6Cdl4Vj4G7nT/S5jwtsLhvRuy4tqGN2VFGUaT7OyjbrzU66fr2mweaA0utg/169qg2r8/jQey72FfU+jVt/mGlsLS+mHUh0Hxf6vlQ/vYgkG4Wu/U9tHUcnlNAv4Trr9szQ/odC+2Pb549Tb1rdHxjxFDjqLizdy3oIJaMydi+WNBBLJlL0eYSuY/rVg8wP5+Jgn4Yjj9vvVqnGTcO4/UmSf/k1W3MO67uTCMyugvS1Om7F+Td0KbMa2uMEckGfXBuP7jWyzqPc6CspzgHymeC43la+G0Chyz9Rjk5zP8uxXkPKGvNx+a5etEp7WxfF3guUNI/RPXJe98Xmr8LPQZtD4/Qupx0aTn68qcp9EXTkWGKG1DKoY0F2S/T/HnN5sfZacTXbKucTZihtFHU/dhT8uI8mc82IjbbxqfA7p0he6uth2l9ibxPWg/jOSptPSzs95CFRW0NSoKm79xOUN+5nWyAOG4neCYa21w8twRlwkFrQ/i9ZlqbeyamXxUaWFcu8LxV3JrWrWBn337XaKczrMPWfZ5DjTbPIpvBRpvvYeDbBTw7QNK1ztcLw2tBeJWzBnDdC89ekLIMUHp+HqJ3vwR1iWVEO4HlxjbrgnbOAZ7/IDxqZ2KMNrrDWk9Y63rAEr60sx/WLZMvDWuYsLTzMvAdrudcaNZNiLnU8mxtfmqmNFkp1efLc4W5ftkv/d+Tr/Vu2y/9u9Bf/g9XJ9Prx/3Sv6GsS63tl+6v/dK/A3V0KfdL/wm157X90u00uF+6m/HL2n5pfc6oX/dL/wn0493sl/635Gcvd7/0X0Of8++pz1nbL91ZDnyH9Nf2S/vreW2/dPj90v8N2vG2azrLv7Zfem2/dGFtv3SsHyrtxdd/LWe/tPTR/z+fAE50CUkFAA==",
1979
- "debug_symbols": "vb3bziTJcWb7LrzWRbi7Hdz4KoOBQGk4AwIEKVDSBjYEvftOtwj3lVU96RV/5t/7hr3YXWUrTvZlHDw8/usP/+vP//Kf/+ef//K3//33f//DH//Hf/3hX/7xl7/+9S//55//+vd//dN//OXvf3v82//6wzH+p5j/4Y/tnx7/7H/4o45/xh/+6I9/+uM/x/hn+cMfSxlQHzD+2a5/yvVPffxzVHCb4BP6hLigHxPKhDqhTZAJs3Kflfus3GflPivHrByzcszKMSvHrByzcszKMSvHrBxX5XocE8qEOqFNkAk6wSb4hD5hVi6zcpmVy6xcZuUyK5dZuczKZVYus3KZleusXGflOivXWbnOynVWrrNynZXrrFxn5TYrt1m5zcptVm6zcpuV26jsA3xCnxAXyDGhTKgT2gSZoBNmZZmVZVTuA+ICPSaUCXVCm/CoXMuAR+WqA2yCT+gT4gI7Jjwq1xhQJ7QJMuFRuR0DbIJPGJXHhhrtlzD674RH5TYUowFPaBNkgk6wCT6hT4gLRg+eMCv3WbnPyn1W7rNyn5X7rNxn5T4rx6wcs3LMyjErx6wcs3LMyjErx6w8erA99mkbPXhCmVAntAkyQSfYBJ/QJ8zKZVYus3KZlcusXGblMiuXWbnMymVWLrNynZXrrFxn5Tor11m5zsp1Vq6zcp2V66zcZuU2K7dZuc3KbVZus3Kbldus3GblNivLrCyzsszKMivLrCyzsszKMivLrCyzss7KOivrrKyzss7KOivrrKyz8uhBOQbEBaMHTygT6oQ2QSboBJvgE2Zlm5V9VvarsoyNObpSxsaUMmD84fFvxqY7oUyoE9oEmaATbIJP6BNmZZ2VdVbWWVlnZZ2VdVbWWVlnZZ2VdVa2WdlmZZuVbVa2WdlmZZuVbVa2WdlmZZ+VfVb2WdlnZZ+VfVb2WdlnZZ+VfVbus3Kflfus3GflPiv3WbnPyn1W7rNyn5VjVo5ZecSX2IA2QSboBJvgE8ap1DhaRnwN0BFfJ5QJj8paBrQJj8oqA3SCTfAJfUJcMOLrhDKhTmgTZuUyK5dZuczKI75UB8QFI75OKBPqhDZhVPYBOsEmPCrbWNMRXyfEBSO+TigT6oRHZRvLM+LrBJ1gE0blYR/xdUJcMBpN+4Dx123A+MP5bx5/2Md2Hm2VMNrqhDKhTmgTHnV8VB5tdYJN8Amj8nCNtkoYbeUxoEyoE9oEmaATHpV7G+AT+oS4YLRVHxthtNUJj8p9LMZoqxNkgk4YlYditNUJfUJcMNrqhDLhUTmGdLTVCTJBJzwqx1iM0VYn9Amj8jgSRludUCb4hPGHH0tooy+iDxgnZnXAkMYAmaATbIJP6BPigtEXJ5QJdcKsXGblMiuXWbnMBcsz6uNxaFqeUp9UFtVFbdE4RT1kkC6yRb6oL4pJeXJ9jO2QZ9cn1UVtUTrGguYZ9km2aDjKWJY8yT4pJuVpdm7iPM8ep+eWJ9plrG+eaZ8ki3SRLfJFw1GzckzKE+6TyqK6qC2SRbrIFvmi5dDlsOWw5bCsN9bNdJEt8kV9UUzKa9Tx2255kXpSVh57pq8l7WtJ+1rSvJ4c1wGWF5Qn+aK+KC7yvKg8qSyqi9oiWaSLbJEv6ouWoyxHWY68nKw2KP+uD8q/G4NiUh7tJ5VFdVFbJIt0kS3yRctRl6MtR1uOthxtOdpytOVoy9GWoy1HWw5ZDlkOWQ5ZDlkOWQ5ZDlkOWQ5ZDl0OXQ5dDl0OXQ5dDl0OXQ5dDl0OWw5bDlsOWw5bDlsOWw5bDlsOWw5fDl8OXw5fDl8OXw5fDl8OXw5fjr4cfTn6cvTl6MvRl6MvR1+Ovhx9OWI5YjliOWI5YjliOWI5YjliOWI6+nEsKovqorZIFukiW+SL+qLlKMtRlqMsR1mOshxlOcpylOVYfd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/31ed99Xlffd5Xn/fV5331eV993lef99XnffV5X33eV5/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1eaw+j9Xnsfo8Vp/H6vNYfR6rz2P1+ePS7QALWMEGCqiggQ52EFvBVrAVbAVbwVawFWwFW8FWsFVsFVvFVrFVbBVbxVaxVWwVW8PWsDVsDVvD1rA1bA1bw9awCTbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDdj5ULYkCKpiP/Fqigx2Mhecj1hMLWMEGCqggtsB2PnL1xJhYzseuJxawgg0ctnE7/oEKGujgsElNjIXZkBcO27j9+6AKNjBtkqiggQ6mbTxYL9l64wbxAyvYQAGzbk/MupE46o7bxw/sYCzM1rtw2DTXOFvvwgYKOGya65b9prm82W+ai5P9prk42W+Wfy377cIKNlBABQ0cNsutnv124bBZirPfLixgBRsoYD4dzu2Q/Xahgx3M58+5ONlvFxYwn0LnkmW/XShg2nJ350+z5zLkb/OFHYyF+fN8YQHTlkd1/kJfKKCCBjrYwViYP9QXFhBbx9axdWwdW0aF5zGZUXFhLMyosDyiMiourGADBVRw2Hpu34yKCzsYE88RGhcWsIINFFBBAx3sILYMhXE3vpyjNC4UUEEDHexgLMxf6QsLiK1iq9gqtoqtYqvYKraGrWFr2Bq2hq1ha9gatoatYRNsgk2wCTbBJtgEm2ATbIJNsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgcm2NzbI7NsTk2x+bYHJtj69g6to6tY+vYOraOrWPr2Dq2wBbYAltgC2yBLbAFtsAWy9aOAyxgBRsooIIGOthBbAVbwUaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEl7cwSSRRQQQMd7AvPADkSC1jBBgqooIEOdjAWCjbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDZtgMm2EzbI7NsTk2x+bYHJtjc2yOzbF1bB1bx9axdWwdW8fWsXVsHVtgC2yBLbAFtsAW2AJbYItlk+MAC1jBBgqooIEOdhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFRtZImSJkCVyZoknCqhg2nqigx2MhWeWnFjAYYu0ZZZcKGDaItFAB4dtDIsoOXbrwsySCwtYwQYKqKCBDmJTbIbNsGWWRE1soIAKGuhg2jQxFmaWXFjArGuJWSH3UObDhbEw8yFy82U+XFjBMYz2yB0w8mGiggaOgbpHSexgLBz5MDHr5rpFVsgNFQ52MJd3/LUcyTWxgBVsoIAKGpg2SexgLCwHWMAKNlBABQ3EVrAVbBVbxVax1bRpooEOdjAWtgMsYAWp2wRUEFvD1rA1bIJNsAk2wSbYBJtgE2yCTbApNsWm2BSbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDJtjc2yOzbE5Nsfm2BybY3NsHVvH1rF1bB1bx9axdWwdW8cW2AJbYAtsgS2wBbbAFthi2ew4wAJWsIECKmiggx3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrGRGjk2biI2ssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTJEidLnCxxssTPLMl3Gc8sOTEWnllyYgEr2EABFTQQW8PWsAk2wSbYBJtgE2yC7QwQS4yFZ4CcWMAKNlBABQ10EJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2jq1j69g6to6tY+vYOraOrWMLbIEtsAW2wBbYAltgC2yxbP04wAJWsIECKmiggx3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8XWsDVsDVvD1rA1bA1bw9awNWyCTbAJNsEm2ASbYBNsZEknSzpZ0smSTpb0M0t64rDlS+I54nGigQ52MBZmllxYwAo2EJthM2yGzbAZtsyS8QpEyRGQEyvYQAEVzC0ZiWk7sYOxMLPkwgJWsIECKmggto6tYwtsgS2wBbbAFtgCW2ALbLFsOTxyYgFH3fFiRMmRj/V6Qb+Do8J4r6Lk4MeJBaxgAwUcy1t7ooEOdjBtuWSZDxcWcNhaLm/mw4UCDlsOmMnBkBMd7OCwtXGU5ODHmmNccvTjRAEVzLqamHUtMet6YtbN5c0kkFyyTIIc2JLDICc2UMBhyzEuORRyooMdHLYcwpKDIGsOS8lRkI/Hr4mpyO2b7Z+jTuJ8eT5X6Hx9/kQHOxgLz9foTyzgsGkuQ7b/hboOruz5Cx3sYCzMnr+wgBVsYK5QrnH2/IUG5grldsievzAWZs9fWMAKNlBABQ3E1rFlz1sub/b8hQWsYAMFHDbLjZo9f6GDHUyb5nQYB1jAtHniTJiaIyUnKmiggx2MheUAC1hBbAVbwVawFWwFW8FWsVVsFVvFVrFVbBVbxVaxVWwNW8PWsDVsDVvD1rA1bA1bwybYBJtgE2yCTbAJNsGWqTHesa05UvLCPH+w/AMZIBdWsIHDNsZS1RwpOdFABzsYCzNALizgsHlLbGCumyTmWdD5ZzuYdfMPZGpcWMAKNlBABXMtLNHBDqYtGydT48ICpi2bLFPjQgHzDC/XrRvoYAdj4XnVcWIBK9hAAf16ulPPgZsX5lqMPZ8DNycWsIKj7niuV3Pg5kQFx1r0kuhgB9M2jp0cuDmxgPV6wlTPgZsXCqiggQ52MBbmY9ELC5hrURMVNNDBXIuWGAszCS4sYI70TcU5ZvpEARU00MEOxsJzzPSJ7XxRvuZgzdrPf6mggQ52MBZmy0fuoGz5CyvYwGGL3CLZ8hcaOGyRmyFb/sJYmC0/HjjWck6+k2txTr+Th9k5Ac+JAipooINpy6Mog+DEDIILC1jBBgqooIEOYnNsHVvH1rHlRD1HbsmcqudCBW1gbp2csOfCDsbCnLbnwgLWgWnLyXsuFFDBYSvZuzmJz4UdHLZx6VRzsGYbb47XHKw5sYINFFBBAx3sYNrG8ZBTbE1MmydWsIECDts4Gaw5hHOigx2MhTnlz4UFrOCw5TRTOYRzYtpy6+T0Pxc62MFYOJJCskBO/5OzReWwzYkCKmhgGnLj5FRAF8bCnA7owgJWcNhyBqsctjlRQQOHreXy5vRAF8bCnCKo5arlJEEXVjBtkpi23Ns5WVDLxcnpgi50sIOx0A5w1M1aIygu0kW2yBf1STm/1rgsq+cMWyfmHFsXFrCCDRRQQQMdxNaxBbbAFtgCW2ALbIEtsAW2WLZzLq4LC1jBBgqooIEOdhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3NsZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyJEdTtrx3kaMpJzZwiD1JF9kiX9QXxaQ51XC1OddwtTnZcLU523A1XQ5dDl0OXQ5djuzsMQlAzeGTEwuYK6OJDRyi8ay05vDJiQY62MFYmJ19YQEr2EBsjs2xObbsbMldkp19Ynb2hQWsYAPlnBq55ujJi2yRL+qLYtI5O/iJebsld/05H3hNdLCDMTEHQ7bxXLjmYMiJFWyggMPWk2xRujSxg7Ewu/TCAlawgQIqaCC2gq1gq9gqtootu1QjUUAFDXSwg8M23ravORRyYgErOGyWGy9/8S9UcNjyUXAOhZzYwbSN+205FHJiASuYNk/MurmHsusv7GAsPBv/SMzOL4nZ+nm4nL2fy3s2fy7Z2f0pPtv/RAc7mCmTS5YJcGEBK5i23NTZ9vnsKgc9tnwWlIMeWz7qyUGPrefiZNv3XKFs+wsLWMEGCqhg2nIZsu0vHIrIDZW9fmEBKzgU+dAmRzpOVNBAn13s59cBToyF5xcCTixgBRsoE3MYYsvHPjkMcaKBQ5wPg3IY4sRYmM2bT+tyGOLEXM1IbKCAmWm5DMVABzsYC0fzTixgBRsoILaKrWKr2Cq2hq1ha1m3JmaF3FAtK0hiLMy56y8sYC6vJTZQQAUNTFtuvpzL/sJYmPPZX1jACjZQQAUNxKbYFJthM2znJwJ6YgMFVNBAB4ctn27l0MILc977CwUcf63kbskJ7S/MhcwDMSe1v7CAYyHz+yk5RnCigGMh85lXjhGcmLbcF/mre2EuZC56TnSfgzdyjKDks6kcIzhx2GoeBDnh/YUKGuhgB2NijhGcmDZNTJslps0Ts25PzLqR2MFYWA6wgBVs4CiWj6FyYODEWJgde2EBK9gWZpPlE6kc4TexgQKObTZG+NUc4Sf59CpH+Mn1XZQOxsLzYxInFrCCDRRQQQOxCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7NsXVsHVvH1rF1bB1bx9axdWwdW2ALbIEtsAW2wBbYAltgi2lrOe5vYgEr2EABFTTQwQ5iK9gKtoKtYCvYCraCrWAr2Aq2iq1iq9gqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGjbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIbNsTk2x+bYHJtjc2yOzbE5to6tY+vYOraOrWPr2Dq2Myo8MYv1xAYKqKCBDnYwJpYzKk4sYAUbKKCCBjrYQWwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5NsfWsXVsHVvH1rF1bB1bx9axdWyBLbCRJYUsKWRJIUsKWVLIkkKWFLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJTkcUPIDcjkccGIFR7Fxj7jlcEAZ975bDgeU8cJNy4F/Ml64aTmwT8Y915YD+2TcyWw5sG+igWM19fxrHYyF2egXFrCCDRQwbbm82egXOjhs445hyyF8Yrk42dIXjrqWfzZb+kIFDXSwUyEWZktfiM2wZUtfKKCBqchNnX18YSzMPr6wgBVsoIAKGojNsTm2jq1j69g6tuxjy92SfXyhgbHw/I5dHpPnl+zyMDq/ZXeiggY62MGYmEMBZdxabTkUcGIFh23ccG05FHCigsM2bq22HAo4sYOxMHvzwgJWsIECKoitYCvYCraKrWKr2LJ5x53elkMBJyqYdcdWz5F+4rnNsnkvHMswXnloOWRPxg3iB8bCbNMLxzL03KjZpheOZei5ONmmF2aFFGe39LRlt1xYwAqOYpGLk91yoYIGOtgXZotELm+2yIUNzLq56NkiFxroYAdjYbbIhQXMP9sSY2H+UF1YwAo2MJdMExU00MEOxsQcyybjLYSWY9kmVrCBafPErNsTs24kxsI87C8sYAUbKKCOT00eiQY62AeWxFiYn328sAyUxAo2UEAFDXSwg2nLbdbSltuhFTAr5CZpDnYwFkouWa5xfv3xQgEVNNDBDsbCcXKqJTfU+CWbWMEGCjgUJTff+Pm60LJYTcy/litvAipooIMdjIV+gAWsIDbH5tgcm2NzbI6tY+vYOraOrWPrWTcP+8gKuY8jK+SmjgqOCjW35GjIiQoa6GAHY+L51dULC1jBBgqooIEOdhBbwVawFWz5Pdbxwkc7v8h6oYIGOtjBWJhtemEBs25NzAotMStIYizM1ruwgBVsoIAKGuggtoZNsAk2wSbYBFs273hg0HKQ10QHOxgLs3kvLGAFGyggNsWm2BSbYjNshi27ezzgaDlwS8cDjpYDtybm6XgeGnmWeWEBK9hAAXN5I9FABzsYC7OPLyxgBRsoILaOrWPr2Dq2wBbYsrtbrkX2ccvjN/u45Z7PPk7MwVgTC1jBBgqooIEOdhBbwVawZR+P5zgtB2NNFFBBAx1MmyXGwuzjCxuYFTzRwQ5mhTow+/jCAlawgQLm8vZEAx3sYCzMPr6wgBVsoIDYBFv28fV99g7GwuxjyeXNPr5w2CQ3avax5B7KPs6r5hzONdHAtKU4+/jCtI1jMod0aXZWDulSTds4QZ7YQAEVNNDBDsbC/O2+EJtjc2yOzbE5NseWLa25dbJ5845ADs5Sze2QzXuhg7mQeXBl856YzXthASuYdXNLZvNqbsls3jHJRMsRWhMLWMEGCqiggQ4O2/heTMsxWhdm816YtpZYwQYKmDZJNNDBtFliLMzmvbCAFWyggAoa6CC2iq1ha9iy0fMmSY7RmiigggY6mDZPjIXZ6BcWsIINFFBBAx3EJtgUm2JTbIpNsSk2xabYFJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2jq1j69g6to6tY+vYOraOrWMLbIEtsAW2wBbYAltgC2yxbP04wAJWsIECKmiggx3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8XWsDVsDduZJT1RQAVt4RkVJ+Zfi0QBx18bgzFbjhOb6OBYyLxjmOPELsxQuLCAFWyggAoa6CA2xWbYDJthM2yGzbAZNsNm2AybY3Nsjs2xOTbH5tgcm2NzbB1bx9axdWwdW8fWsXVsHVvHFtgCW2ALbIEtsAW2wBbYYtlyeNnEAlawgQIqaKCDHcRWsBVsBVvBVrAVbAVbwVawFWwVW8VWsVVsFVvFVrFVbBVbxdawNWwNW8PWsDVsDVvD1rA1bIJNsAk2wSbYBJtgE2xkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZYEWRJkSZAlQZbEyhI5VpbIsbJEjpUlcqwskWNliRwrS+RYWSLHyhI5VpbIcWAr2Aq2gq1gK9gKtoKtYCvYCraKrWKr2Cq2iq1iq9gqtoqtYmvYGraGrWFr2Bq2M0taooMdTJsOPLPkxAKmzRMbOGzjoZvkELeJBjrYwWEbj+Ikh7hNHLaey5tZ0nPJMksuTJskKmhg2iyxg7Ews2Q8zJMc4jaxgg0UUEEDHexgLHRsjs2xOTbH5tgcW6bGeLYoOWxNI7dk5kPk5st8uFBBA8fyRm7JzIcLY2Hmw4UFTFtu38yHyMXJfLhQQQMd7GBMzHFtEwtYwQYK+LDZeBVDclybjcdgkuPaJvaBlviw2XiWJDmubWIBx18bj5Ukh6JZybqjeW28FCA56GyiggY62MFY2A6wgBXE1rA1bA1bw9awNWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2AybY3Nsjs2xOTbH5mnLA9Ed7GAs7AdYwAo2UEAFsXVsHVvHFmnzxAJWsIECKuirW6KDMTFHmk0sYAUbKKCCBjrYQWwFW8FWsBVsBVvBVrAVbAVbwUZU5FC0idgqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGjbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2M4A6Ymx8AyQEwtYwQYO23jWLDl73cS0RaKDHRy28fxYcrTbxAJWsIECKmiggx3E1rF1bB1bx9axdWwdW8fWsXVsgS2wBbbAFtgCW2ALbIEtli1Hxk0sYAUbKKCCBjrYQWwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIaNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULNEzS8ZNBz2z5MQCpk0SGyiggmnTxLRZYtp6Yiw8s+TEAlawgQIqaKCD2M4sGRdXembJiQWsYAMFVNBABzuILbAFtjNLPLGBAipooIMdjIl2ZsmJBaxgA4dtjPeUHJc50UAHOxgLM0suLGAFG4gts2SMLpUclznRF2ZqXJgVWmJWkEQFDXQwl1cTY2Hmw4UFrGADBVTQQAexNWyCTbAJNsGW+TAGmkqOy5yYtp7oYAfTNo6oHJc5sYAVbKCACho4bJI7K/PhwliY+XDhsI1RoJLjMic2UEAFh03yQMx8uLCDsTDz4cICDpvmUZL5cKGACg6bpjjz4cIODpvmsZP5cOGwadoyHy5soIAKGuhgB2Nh5sOF2AJbYAtsgS2wBbbAFsuWQz8nFrCCDRRQQQMd7CC2gq1gK9gKtoKtYCvYCraCrWCr2Cq2iq1iq9gqtoqtYqvYKraGrWFr2Bq2hq1ha9gatoatYRNsgk2wCTbBJtgEW2bJGCAsOfRzYtpG++fQz4kFrOCwjTG9kkM/JypooIMdjIWZJRcO2xj/Kzn0c2LGVUlU0MBUaGIHU5FrnAFyYQFTkSufAXKhgLlCucYZIBc62MFYmAFyYQEr2EABsZ3PW3LdzuctiefzlhMLWMEGCqiggQ5ii2XrxwEWsIINFFBBAx3sILaCrWAr2Aq2gq1gK9h4HtsLtoKtYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hk2wCTbBJtgEm2ATbIJNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNsedoxphuVHBA6UUEDHezgsHkWy9S4sIDDluNhckDoRAEVNNDBDsbCTI0LC4itY+vYOraOrWPr2Dq2wBbYAltgC2yBLbAFtsAWy5YDQicWsIINFFBBAx3sILaCrWAr2Aq2gq1gK9gKtoKtYKvYKraKrWKr2Cq2iq1iq9gqtoatYWvYGraGrWFr2Bq2hq1hE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybYyNLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiTIkiBLgiwJsiRWluixskSPlSV6rCzRY2WJHitL9FhZosfKEj1WluixskSPA1vBVrAVbAVbwVawFWwFW8FWsFVsFVvFVrFVbBVbxVaxVWwVW8PWsDVsDVvD1rA1bA1bw9awCTbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbEpNsWm2BSbYTNshs2wGTbDZtgMm2EzbI7NsTk2x+bYHJtjc2yOzbF1bB1bx9axdWwdW8fWsXVsHVtgC2yBLbAFtsAW2AJbYCNLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWTJOT51vHeg5/jUC2NhZsmRfzaz5MJhG7Mp6Tk+9UIBc2i4JRqYNk3sYNoed5P0HKp6YQFz3SKxgQIqaKCDHYyFZ5acWEBsBVvBVrAVbAVbwZapMd600HP46Xi9Qs/hp+P1Cj2Hn17oYAfH8o53KvQcfnphASvYwLT1RAUNdLCDsTDzIXIZMh8urGADh228o6Dn8NMLDRy2MZ+YnsNP41TEwsyHCwtYwQYKqKCBDmJTbIbNsBk2w2bYDJthM2yGzbA5Nsfm2BybY3Nsjs2xOTbH1rF1bB1bx9axdWwdW8fWsXVsgS2wBbbAFtgCW2ALbIEtlu0cfnphASvYQAEVNNDBtEViLBz54GNSOc3hpxMr2EAZ2BIVNNDBDsbCeoAFTJskNjAVmmiggx1MxcjfHHM6sYAVbDOjzjGnFypooIMdjIUZIBcWUK53mDRHl0400MEOxsJ8T+3CAlawgdgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsPm2BybY3Nsjs2xOTbH5tgcW8fWsXVsHVvH1rF1bB1bx9axBbbAFtgCW2ALbIEtsAW2WDY5DrCAFRztNN490xxdOlHB0Vnjlrjm6NKJHYyFGRUXFjA7yxMbKGDacnEyKi50MG2aGAszKi4sYAUbKKCCBjqIrWJr2Bq2hq1ha9gatoatYWvYGjbBJtgEm2ATbIJNsAk2wSbYFJtiU2yKTbEpNsWm2BSbYjNshs2wGTbDZtgMm2EzbIbNsTk2x+bYHJtjc2yOzbE5to6tY+vYOraOrWPr2Dq2jq1jC2yBLbAFtsAW2AJbYAtssWw5unRiASvYQAEVNNDBDmIr2Aq2gq1gK9gKtoKtYCNLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCzxM0sssYAVTFtPFHDYxlvUmiNRJzo4bON9Bs2RqBdmllxYwAo2UEAF01YTHexgLMwsGa9BaI5EnVjBBgqYtlz5zJILHUybJ8bCzJILC1jBBgqooIEOYmvYBJtgE2yCTbAJNsEm2ASbYFNsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tg6to6tY+vYOraOrWPr2Dq2ji2wBbbAFtgCW2ALbIEtsMWy5VDViQWsYAMFVNBABzuIrWAr2Aq2gq1gK9gKtoKtYCvYKraKrWKr2Cq2iq1iq9jIkk6WdLKkkyWdLOlkSSdL+pklPXHYxrBszaGqEzsYCzNLLixgBRsooILYBJtgE2yZJWOmdc2hqhMr2EABFUxbJDrYwViYWXJhASvYQAEVxGbYDJthc2yOzbE5Nsfm2BybY3Nsjq1jy9QYLwJpDjR1yQ2VSXBiJsGFY8nGJPGaA00nNlBABQ10sIMxMQeaTixgBdNmiQIqaKCDHRy2MSW95kDTiQWs4LCNN5A0B5pOVHDYNJesrK2eA00nrq2eA00nFrCCDRRQQQOxVWwVW8PWsDVsDVvD1rA1bA1bw9awCTbBJtgEm2ATbIJNsAk2wabYFJtiU2yKTbGRBEESBEkQJEGQBEES5EBTH2+ZaQ40nZhHiSYqaKCDwzbe3dEcaHphJsGFBaxgAwVUMG25kJkEF+a65ULm+YPlAZ7nDxc2UMBR1/JYz/OHCx3sYFwTEuo5x+iFBaxgAwVU0MCxdcYLRpaDRycWsIINFDCXtw3Mnh9fILAcEOrjXSPLAaETG5gVLFHB3A6e6GAHc3n7wOz5CwtYwQYKqGDaItHBDsbC7PkLCzi2+oW6tkN294Vsnezu8SKF5dDPC7O7LyxgBcdajNcrLId+TlTQwGHztGV3XxgLs7s9d0B294UVTFvui+zuCxVMW+757G7P3ZLd7blRs7s9N0l294UFHHV7rlv28YUGOjjq9ly37Njz4MqOvbCBAho4GkdzyfKx6IUFHLtQc8nyseiFAipooIMdjIXnt0hOHAvZc5vlz/iFChqYK587K3/GL4yJOS5zYq6FJFawgQIqaKCDHYyF54eELLGBuRbnH1DQQAdzLTQxFmbzXljACjZwrMX4kJDlCMyJBjrYwVh4fnToxAJWsIG5Frma2bwXdjAWZvP2/GvZvBdWsIG5FiVRQQMd7GAszAESFxYw90VPVNBAB3MtIjEWZpteWMAKNlBABYdt/KBYjqqc2MFYmD/CkYueLX1hBRs4tlnNzXd+POxEAx3sYCw8Px52YgErmHVrYq7FiQ52MNciWy9P3SMPgjx1v7CCDRRQQQMdTNtYshwp6WMck9Xzc38tMf9sJHYwFuaP8IWPCn2MY7Ic/TixgQIqaKCDfS3D+WG/xPPDficWsIINZC2yjy80MIZt7PkcE9nHoFTLMZETK9jAXIus0BQ0MNdCEjsYC+UAC1jBBqZNExU0MG2W2MFYqAdYwAo2MG15PKiCBqYtjxLtYCy0AyxgBRuYtjx2TEEDh63kHhrd3Utu39HdveTWGd3dS26H0d0TK9jAYSu5FqO7e8llGN3dS9rcwQ7GwtHdvebijO7u2cc5JrKfR9T4RZ8ooIJpywO8O9jBWLg+B2r1/BzoiRVsoIAKGuhgn5ijH/u44205+nFiAwXMtdBEAx3sYCwsB1jACjYw61qigx3Murno9QALWMEGZt2emBXG3sxhjBMLWMEGyvUtasthjBMNdLCDsfD8WPWJBazg2L7tRAMd7OBYi/w9zqGJfdwTsxyaONHArNASOxgLszdb7uPszTznykGIPU9RchDitR2yNy90sINsX2f7Zhe23AHZhRcqaKBfX2O38xvXF8bC8zPwJxawgg0UUMFRN5vs/B72ifk97AvH8SAnVnCsheRGHf02UcGxFpIbdfTbxA6OrSPjWM+BhRMLWMEGpq0nKmiggx2MhdmFFxYw60bi2OqZtDkssI+bZpbDAidWcCyZnn9WwLFkYwYfy2GBEx0cSzZusFkOC7wwu/DCAlawgQKmTRINdLCDsTB/eS8sa43zN1ZzU2cXXmigg1nXEmNh/sZeWMBxTOY5QQ4AnCigggY62MFYOFok8vQ2R9FNjIWjRSYWsIINFFBBA7F1bB1bYIv8t2Mhc7TbxAJWsIECKmiggx3EVrAVbAVbwVawFWwFW8FWsBVsFVvFVrFVbBVbxVaxVWwVW8XWsDVsDVvD1rA1bA1bw9awNWyCTbAJNsEm2ASbYBNsgk2wKTbFptgUm2JTbIpNsSk2xWbY8gQu7xDliLCJDRRQQQMd7GAsHH0xEVtgC2yBLbAFtsAW2GLZckTYxLT1xAo2UEAFDXSwg7Ewf1AuxFawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bA1bw9awNWwNW8Mm2ASbYBNsgk2wCTbBJtgEm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AybYTNshs2wOTbH5tgcm2NzbI7NsTk2x9axdWwdW8fWsXVsHVvH1rF1bIEtsAW2wBbYAltgC2yBLZbNjwMsYAUbKKCCBjrYQWxkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlTpY4WeJkiZMlOSKs5+2FHBHW8zlOjgibWMAKNlBABQ10sIPLliPCJhawgg0UUEED0yaJHYyFmSUXFrCCabNEARUctryayRFhEzsYCzNLLixgBYct7+bniLCJChroYAdjYWbJhQWsILaGrWFr2Bq2hq1hE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybY3Nsjs2xOTbH5tgcm2Pr2Dq2jq1j69g6to6tY+vYOrbAFtgCW2ALbIEtsAW2wBbLlmPKJhawgg0UUEEDHUxbSYyFmSUXFrCCDRRQQQMdxFawVWwVW8VWsVVsFVvFVrFVbBVbw9awNWwNW8PWsDVsDVvD1rAJNsEm2ASbYBNsgk2wCTbBptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7NsXVsHVvH1rF1bB1bx9axdWwdW2ALbIEtsAW2wBbYAltgi2nz4zjAAlawgQIqaKCDHcRWsBVsBVvBVrAVbAVbwVawFWwVW8VWsVVsFVvFVrFVbBXbmSUy8MySEwtYwQYKqKCBDqbNEmPhmSUnFrCCDRQwbZFooIMdjIVnlpxYwArOM0fPUWl9jCHyHJV2YebDhQWsYAMFVNBAB7EZNsfm2BybY3Nsjs2xOTbH5tg6to6tY+vYOraOrWPr2Dq2ji2wBbbAFtgCW2ALbIEtsMWyleMAC1jBBgqooIEOdhBbwVawFWwFW8FWsBVsBVvBVrBVbBVbxVaxVWwVW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNs+fxijG7yHDoX42Ge59C5iQ52MBbm84sLC1jBBgqIzbAZNsNmaRv5m0PnJhawgg0UMG0l0UBfeEaFJVawgQIqaGAWO7GDsTAfSY4RS57j5SZWMBe9JwqooIEOdjAm5nyDEwtYwfxJOhIFVDBtkehgB2NhPuq8sIAVbOBYt/EFZc8RdxMNdLCDsTAfdV5YwAoO2xiN5TnibqKCBjrYwViYjzovLGAFsTVsDVvD1rA1bA2bYBNsgi0fdY53oD3H4U1U0EAHOxgL81HnhQWsIDbFptgUm2JTbIrNsBk2w2bYDJutk7JzHN6FDq6TsnMc3ol+gGnzxAo2UEAFDXSwg2PdanZLDm+4sIAVbKCAChro4LCN8X2e4/AuzCy5sIAVbKCAChq4TjhrdHCdcObchDEGFnqOzptYwQYKqKCBDua6aWIszCy5sIAVbKCAChqYtnEQ5Oi8GCPuPEfnTcy6uZqZGhcKOOqOIW6eY/YmOtjBWJipcWEBK9hAAbE1bA1bw9awCTbBJtgEm2ATbIJNsAm2TI0xvs9zmsKJBaxgAwXMH8vRODnaLfzEWJhH9YWjrucOyKP6wgYKqKCBDnYwJuZot4kFrGADR4Xx0MJzrFqM93E8Z76b/3Ysznh9xXPmuxiPBjxnvpvoYAdjYR6eFxZwLM54SuA5xG2igGnTxLRZYto8MW09Mdai5+F5ISuUR5+lOI++Cx3sYCzMo+/CAlawgQKmLdcijz7Ltcij78IOxsI8+ixXM4++CyvYQAEVNNAX5q+T5TbL3yHLbZbnqZYHQZ6neu7uPE+9sIOxMH9mLszDM7dv/qBcmBXygMmfDs9Nkj8Hnpskfw4udDBtuR3Oxkk8G+fEAuYy5LqdjXOi8AcUNNDBvrZDNk7iOYruwgLKXONzvFyu5jle7kJfmBdiuedzIFnPHZsDySZWsIECjnOC3G85ZKznfsshYxfmJdeFBaxgAwXMurlCecl1oYMdjIV5yXVhAdMWiQ0UUEEDHexgLDyfNeemPp81n9hAARU00MEOxsLzWfOJ2Bzb+aw59+b5rPlEBQ10sIPsrM7O6uyszs46B6CMbrmGrbXECjZQwFycPM7OoSYnOtjBmHgNWzuxgBVsoIAKGuhgB7Gd40tqYio0UUGbK3SNSjuxg7HwHEliiQWsYC66JwqoILaKrWKr2M6RJCcWsIINFFBBbA1Ftqnm4mSbXiiggjkkuic62MFYeA6JjsQCVrCBAipooIMdjIWGzbAZNsNm2AybYcveHC/N+zl6bLwT7+eQMctjJ1vvQgMd7GAsPFvvxGy93AFn653YQAF1LUPeA7nQwQ7GwrxdemEBWaHs48QczxXjfRHP8VwT85S1JRroYAfzlHU0WY7nmljACjZQQAUNdLCD2PJUbXy62XO4VozXV9zPK4meaKCDHYyF55XEiQWsYAMFxHZeSUSigx2MheeVxIkFrGADBVQQm2ATbOeVxGheP68kTixgBRsooIIGOthBbIYt7z+MV2g8h2tNbKAtzLsHksdkntZd2EABFTTQwQ7GwjwFvDAVefzmLQPJIypvGVyooIGpyEMuzxEvjIV5jnhhASvYQAEVNBBbYItlyxFWEwtYwbRZooCp8MQsNo7fHEA1sYBZLBIbKKCCBjrYwViYF2IXFhBFHr/jtSPPIUIx3jXyHCI0sYINFHAs2XgDyXMwUIz3hzwHA12YR+qFBaxgAwXMupJooIMdjIV5U/3CAqYtd1Ye6xcKqKCBDnYwFubtMc3dncf6hQ0UUEEDHexgLMxj/UJsgS2P9Tx/yBFAExU00MEOrp2VI4AmFrCC+dfGQZuDdiJ/0XPQzsQGCqjzOMtBOxMd7OA6JnPQzsQCVrCBAmKr2Cq2iq1iy5+kc93yJ8nOf6ugrRXKH58LOxgLzxsJJbGAFcwL85oooILYBJtgE2xn857IblF2i7JblN1yNu+J2M4+jv/+73/6w1///q9/+o+//P1v//wf//jzn//wx/9a/+Lf//DH//Fff/i3P/3jz3/7jz/88W//+de//tMf/p8//fU/8w/9+7/96W/5z//40z8e//Wx7f78t//1+Oej4P/+y1//POi//4m/fbz+q48nu+O4y7/+eLRb6irxePz7Q5Hyuki+U54leotVwMsPf7++/vt2zDV4XFywAOq3F2Bc6J8L0I9XCyCbBRh37vLv+1HeWYAocyM+DudXC2Cv/76O5zX59x/3Gt5aAJ1r8LhR9GoB+mYLtrUL9b0tMGbhuA6jUl4tQdkcij7i9twJ7i8XYXcsS6mzxOOBedfXx/LmYIzVDoU98dgpd//+4wb8PJof99eftmX5aVNsjscyhr9nicej11Xh8Wzlxwq62Z+H/F9a8jcVNodk3h0+j6h4s4LJOiSO+rrEbmNqnzXa4y7G640Zr2s8nuXWuTUfT1Ko0eTHgDp2O3UGzOMJAhXM76+JVdak+cs1qZsamp8KPGPica29atiPG3RM1fG6R2IGRXncc3xZQnaH1jwwHme3T32q9yvoimu31xU2h1Y9Yu3T0dyrT+uPJXyzEH1F9vOv3s8LscnMx6P4WeLxKP7pAM+f9jf2h7/eH7ujImcTPY+Kx4XvqxJtE96PB/prTR73cF+WqJ/u07bZFLU0X/v06Ufop33aNgdW7fNXrB0vC/xiWxa2ZX+5IT5PvV2JlufLV9zE65+Q1ncHlq/l0KdfsvGD8kON2J2X9XVeZk8VvrI9D7bnU5/a/Z+Ax4PGWeLxkM9ebgzZhe+xzlBb+SF82/0a9ZiH5+Ppf31dQz5OX9FP03db4Vanin+cvtI/TV+Jz9P39v54nb7bw6LI+l2vz6fOPx0WWj89WdP26cnatsK92Npuipza9TrF2W2KTfS5rwNj3Mh8ebK2rdHXqZb/0CQ/1+gfd6rGp526rXCrU6183KlWP+1Ua5936u398bpT94eFrUPrcSfvrUPrce937dT2tBg/17BNehZtq9Uez7teXk1sWy3WNU0Lf/2DZvHxIe7Hp4f4tsKtQ9zrx4e4t08PcZfPD/Hb++PNH6NYJ8ByHPbysHD//LDoHx8W/dPDoh8fHxa9fHpY9Pr5YXF7f7x7WKy0eBwW/a3TXzmKrRry+tDq9vH9i/750dk/Pjr7x0dnfH50xsdHZ3zD0dk/Pzq3R8U3XCPmx4POg/PxaPnlNWJsFmNMgTyvdqW9/mmPzdaIdcH8eJbSXv6y7+5h11h3PEurlbPo6F/YopUtWv29nXLrplI5diefsrZoFdnUqB/3eznapw2/L3Gr48uhH7d8OezTni+Hf9709/eK1zePjto5Ouy9GrruDVW1lz8opZTtw8f19PEo8lYNjfUAcVvj+PwebCkf35rfl7h3pJfPb86X8vHd+VI2v9Ja19NAfRzqr4/07cOjO3eU91vj3m3tUsvHS7HZGJIDdc5fyHjqlN9ujNtF+ntF9Kjz6NBju1u2RWzt28P83SLrrpk+ovvNImXdVdASmyK7J0klDp8b5cH9KZaLvhshL59elLZ7Cs9NEn991WQfP0Ip7RsuNvZF2gr2x/lc3xTZXdj7GlpS3V//wjT9/Bxm90joZrJvS9xL9t1DpbvJvnuodDPZ5fiGc5jbe2VzDrM/OtgeffO7v6vxeK607prX1yfrv6pxfFwjJ5M/a0g93qvRoq8a5XWN3cOlu+djuxp3z8f228NtrUv0j2voUd/cpuva9vEk9PW+3T1getxnntu0uGy6brsgzlmIx+soVPl85+5qfMvO5Ueq7RpXd7c+juehYsebG5VnVa1vjrLdYyJZD6albvat7W47PG4RznWRY3Nmt12Otn5vn04+frs5tr/Z6xGitOdnND//Zm+fN92872CfP6kv9vGj+n2Je7/Z9vnD+mIfP60v9g2P6+/vlc1v9v7ouHffYVvj5n2H3UOnuzG2X4579wz886PUv+Eovb0mr3Nw99Do1qXLPn5E5pqIPQ2a+k389OPT0Rxl9+Tp5tjb/aoUhk3trn62y3FzBO92QfLFwnmVXTcL8vlw5v75eOZuv+/mUMaoa5Hd5ojf80hXWT+0qrG5wt49gpI15l+fAqzET4m+fQblx/p18qezF7u/FMrDDumbpdj9rhz5Lbn55EaPl8uxLRLrV+HBVt4swql6eX6G/5Utomu/9N1+6b9ricdjCE4qj15er0r/jj3Tv2PP9G/YM9u2szX2Z3yk/r0bW+N7xvPMoXh/t8hq3scyvT7TrrvnUeum5dMQJPnKQsh60WV8De3NNWneVhEvmzWJT39g6u79pXs/MPsS3/ADM77xNTeHlc3mKLvXEjSnULjOtENfHex19yhpfMNpHh+H1c2SbH75pXIeU+P1Y/m6ewZTYsVZPdrrtyx2T6TuXWXX3bOCx2njGj74OO86jpe3+X+1c47Gznk6T/1CEo2p8ebOedyre71zts+l7t0dr/XzJ/y1fvyEf1/i3jtJ9fMn/LV+/IS/1m94wn9/r+zeSyof3x3f1rh5d/xXNY6Pa9y7O76vce/ueG33bn5qhL9V4+ZN2LvLsa2x36Zt7VvR8no5+jdsj/57r8utpwW3a2yeFvziGLv1tKBK+/xpwX5B7j0tqLs3le7u3F2Nuwf7zeV4/wC598Sh7l55uvvEYb8g9544VC0fnwttH0ndfOKwX45bTxx+eaYrT2e6r25BVNVvOF3eFZGyfh4eJ73+8ox7d57LHArF7fVB9g1vPtXPX32qn7/7VL/h5af6+dtP9Ttef6rf8P7TL66C1tVHfX4N4OcaZp9H4fZK6mbXbgfVHevCo9T21uZ4xMLaL+Xpiv3nGrvXl24GoZdvCMLtctx79PqL+1tPvy7H03i4r9wke/zFoEh9GYS7x0mNh8CtdX+nxL0s/dWd2JvbQ75je8Tndx63RW5ukf1Qx7Je3yn13ZGb5eBx0NPrDb95GXR325Ff28ctZn99T6jLx6MEav98ZF/tH4/s25e491vZPx/ZV/vHI/tqfMPIvvt7ZfNbuT86bo0S2Ne4N0qgxjdcq8c3XKvv1+XWSIO6ezvq5pG+LXHzSL+9Jq+neDk+HSS9T7A1SZg/X9n+nGBt+xbOvbP9dnw+H1Q7Pn7rZF/i3uxBx+dvnbTj47dO2vENk0Ld3yu+2Sv147P99g3vNf1iOW49e2m7i/R7p9lt9zDq3hnyfinuldhtjJvXLb+oceu6pW3f5Lm5QePz65b9ctzapPsZOXyuSi99M7vfdpaqW+/Lts/fdW318zGnrX48mm9f4l4W18/HnLb68ZjTVr9hzOn9vbLJ4s9fdW2fv+nadhPs3TyX3Na4+4tQPz5E2+eHV/v8p759y1t79+defP07LZ+ej25nHPQ18uTxtObpycLPMw7uZ8jj+WZ7Pja+UOLWrZ+2m9Pt3o2O7cawWM+L+9N9n99ujO1l/Z0BRW33FtO9AUX7Ejcno9xNArnmt3ue0+3nSSC3FWx2iT29NPybCrtO03Xnacye9VSj3a8h6wHco4a+rrGbJa9EZXqOqPHO4SXHGvIqPw7fK/drlL4O8udzwN/U2J063Ry90/Tz+Xiafjwhz77EvXMW+3xKnmYfz8nT7Bsm5bm/VzbnLPuj49bonW2Nm6N3flXj+LjGvdE7+xr3Ru+03UtQNwc0bGvcPYu7uRzbGvttemv0Trv5DtR2e3zDe1S/WJdbo3du19iM3vnFMXZr9E7bvQV1d/TOfkHujd5pu/eg7u7cXY27B/vN5Xj/ALk3eqf1/QPFW6N39gtyb/RO6/bxzZ/ttG93b/5sl+Pe/bRdFq75BK3re+emvl6l6K+nOD+2N+HXT21//npN+emMcPcW1M1rll2Jh8/W5HOPDHgebt9/KiMfX8NtS9y7hgv7nbeHr3mXSonn99N+sz12t/N93V58YH+5JN8wE78c2yC8MxX/vsStC7l9iXtXcvEdl3LxDddyspuQ7/a13PYwq8faJqWWoi8PM9nOyleci4+n98Lq8dOE+NtHT7fepdwvR13HWa1PJ8q/XY5dEZVj3dHS10V+sWHr+nl4sJXXG7Z8fE9qX+JWnkmR3zfPftoescmzbZnGK0hVdLdZd7vYuKNtT99Uelw5v1vEv6HI0+nuF4usJ+nVTF8X2Q6sPmxdqB723MM/bdjtezd9nZA8bvG0TZHdu0zrKqJLebPEmjG6Pw2w+loJWUuh/eMS1t7boFUbD06eblB9sQhnAVb0zV0bZZ0pxna/bN9lWjNUtNo3S7J75NBs3adq1uO9ItLWD5+03ZHa9jMIrGuR6P3jInoc8eaGLStH2rgEeb0k2+v3tSSPn4r+DUVis2FvJ5pvYrF9Os3EfjGcLxn2Y/M7IZtd47oy8XGx9XQi/9P22D9Y6vyIPw+4+umbG7v3omo8TcP6PJPJzzX2A4JlnS8+bjPry7XZbtZeY23W5zOsL/3o9fVw6IH2ssgvzidU1l2NR0y+Pi2R3eegggepx/Odc69fWRRjrPXjBNheL4ruPvVY1ln0427crsjuoa7F+tXx53s9vymyHejDXi7aN0V2P6HrdC/K5kDZfhqK+1bPA8l+W2P3Cl1ddyW1Ps838/Oq7Gbo9zVzsPnzVC9f2ByPnbvOop9nH/7tymwf/HOrJWKTarsXnO6mmh2fp9r2LambqWb1O1Jtu2/aOi153F+s7x2sPxaJTZFd59V1lDwuu/qb7Vv5CX48QXu3CE/hHteybxZpxuC0Q94sIuv+UZXYFPHtPShuID3N2h0/7Zvd+1J9DSftT6euXyoRnc90lF2N7WDQlYqPk5f+XhEt6xmalqd5ln5bZPeGs60bAw8s7xXxtsareHv66fxika6rSPQ3iwhf75OnWwtfK9LXcDl/vnT82t6RdT6hz098v1bE1zbRfpR3i6xbC/p4APS6SN8m48Hn0R93KDZbZfsYq/Is7MG2WaXtSzqqPKdUO463l4b5wR5Ls+nm/WeMuq5MePzJ/u4m5irywfr2MfM8hb6/WYRx9xpPdwq+VOTx2GE9YSvlzSWxsm7jWHm3GY0RT1Z3G3b7NtXNM8jtK52mK7Qf/DSv1ZcWpRjnfw/ub5cxHmKYH/5uGa+slIu9XWaNWXzw7idgX6avx/4PLuXtpXnaxL283sS6fYHlduDp9p2eR+A9DZWLeL/Mvdz81UrdzE3dvXT1yMr18bYHbzexfUv8/mKH69PhZ+8ffjw6tq5v91Rw3FiYvF3GWJrweLOMF8p4idcxrLt3oG5ex2v5vVPYc+rBa3Vq0Xe3StVGmf7mD/bjF2n9wtXum03bf+ci5XG2u1bowfJuGecxfXct75bp3JLrfXMO/Ysy8bQ0sbvG2d6Uc2W8s757Z4+RcQ+sbxbpvAbYD3+3iHIT2OTd58FB1rXjeD1+QXcva90bnrIvcWt4yr7EzeEp22mpGj+v7XHz7fX2aNsbYp1ceTTQq2mLdfua063xHL9ajqepQ+IoL4tsLtWiOPeQXw6A2Jeoa1Wi1v7WAIim3Lpt6v3NA75ZcInmpW92cHw6rmRf4ta4Et09GfuOcSU/bo/6wWYlR7y9G0ePvxqU0dc3PHU3Yd/NvSP6+d7x33nv/LA93h7181gZbv24H2+WkYOb6/L8lPw3e0fLxz8W2xL3fiy2Jb7hx0Ja47Jld2ddd8/G7o0x3ZZ4JHRbZ0hu8mYRfzoZfm6+rxVZj/wf3O2tw/7xsHgdr4/HPfXd49XWKfWD4/UzGN09IfumMo9HOevMsR3Pg6rszSKlvlmkMSqjhW6K6MdnJ9vlkLIes8nzw9gvrYyuEVGPB27lvSKNN7nb8cNgph+L7N4fLGu2+0fYPx8jPy2Hf/4BgG2NR9av0V3enn8x/H4ROcoamFWer9G/VKSsn4vHb6Fsinz8RsK+xL3fcv/4jYT91qiN925+uHL8eWtsP8G87rdJ/DDE5eciu9f/+GDG0yX5z1m2XwxjMby9uy58P+io/e0ifAla396q63Wmx33K482jva33mKXtiuwei31LkbtvnGj3j8/StiXunaVtS9w6S9tvjZtvnPxik95740S35yM33zjZ/spw++n5BY2ff2V2Jbjgq/7Dx7V/CrPYnuatGk/DOn/zOxUfz5Ch8fEMGcf2luA69Y7N5tTYTTN0cP5e2vNF0Y/Hhu1ereq6+q1rbZsi5dPfyn2JW7+VtntEde+38hdbw57eP/DN1vj4LsDu6Ii+RmL/+AP186r4p51iR/+0U2z3favPO8V4qcu6vxU8wRxp4fZOiXYw6UD94bLwfom6ngK0Vl+XsCIf75Hdh63u7ZF9iXtXC/sD42aN7TcUaPhSf/hFkZ+K7BZkPSmKp2mhXb6wGNW4V/ZDDn+lCJ8KrMfzpw9/LlK/4Yd+X8Qqp3FWn2blakf5Shm+9PXgpxj7cplKGalvl1mTDj34eQTnb8rsZm9b0+f2p0vt9tMlzLYEn6V9/l7Hb0vsV4ZpEOyHeRC+tk1EGHwjzwNMvlZGn3a0Pk2V85sy7fcvUw+mtTvaZh+1/RsQ6xfjcR/wzSJ1nUvUx/ne6yJl+xGPg1tVJV7HQtu+ccNIe7bIT+9TbSvcvbLbF7l5QfSLJbl3QWS751e3c7LsP+i+DhKN/nrXyHas73pnVn/4Emn7uch2NMmtCblNPv+kgMnHnxTYl7g1oZrJ558UMPn4kwKm3/BJgft7xTd7ZXd03JuQ2/Tzya5+sRy3JuS27beqbk0hZLu3ue5/DHW/JLcmEdpukJuTcv+ixq1Juc0+/piQ2Td8TGi/HPc26S9OaZ4GAsvTQMHfnETYx/f+9yXu3c8w+11L3Lwl8otNykuyj82rLzfp/pbZ3WvG3XTDuo4yt2Lv3fByW0fI41lzf/OuGa8W9FblzftE9/avfzzBy35VbE1C301ff5DZdo+pvqXI7ZNM/3hE4L7ErccH+xK3Hh/st8bds+X9Jr15tty/YfLh/c1qXQ8Q6/Pbgr85QrZPQ26e6Hb7/ES3f/xFoX2Jeye6PT4/0d19+OrmiW6UbzjRvb1XNie626Pj5onuN3yz6hfLce9ENz6eK9N2v7hfONGNj2fL3G6Quye6+xq3TnT9+PjzwX58w+eD98txb5Nuf2BuzUD6ixIfTkFaK1Nc1c3II//8MZV//pjKP39M5d/wQGO7PfvKc/vhpPKn7Vn2B+jT0NDn09ufjvLdra3xjGs97tL2ZpFW2//t9PZrRXydjLX44S2RLxSRYxWR44ex3T8X8U+vCX+xHOswk7JdjvjwZu62wt3z7H2Rm6env1iSe6enXr/h9HTfNqKMYy6bg7Xq71yktvWCYdUfHmp+pQjDsqvZu0V0Dcuuj6vQTZH4OJzb8XE4t8/Ht/5imz69gXdstmnbvkbNN4QfrK+GqXvb3fTztXfb8cNQgp+XZHcDs65vU0h9mvXo5ycP3uzjU13fPdG5eVa2/cbO7VPdX+2co7FznqLRvraH5WkPvxqh7tsHVHcPk8/f0trv33sX3C6ff17Q5ePPC+5L3Lrgdvn884IuH39e0OUbPi94f6/4pnPt4wtu303vdfOCe58gt66ntqty8xL1FzXuXaLqx9f9rt/wjYz9ctz7QOp2CPWtS9RflLhzifqL13TW/D0PfJ6k9yvv+jxNq2nR3izS1zws9flS5osvDNWnoaG71dm9AXzzraNtkcdOXbfJnwdDfaVErKazqP5eCW7Wh74usZ1ZYf1eV3/7bbAfisi7RSpF2uv94v7xlwf2JW49mPLPX33yz59t/WKD2v/1Ddcv7pWn8/54N0Gel+TtIpzDjEk43i0i9VaR7UvM97J9X+JWtu9nd1j3IKLWNyeIWPcwH/jyzeP68a3YX5S4sy1+MSsLN2N/OEf+2tQuhWnTa3+3yDrFrc9TpX6xCP3SYzMbyi+mARLm7+m6m3vqfpnNzHu/LCOU8ddTR/n2CdW9mbB89xbVzZmwfjU5UuWTIbGZu/VXW4ULkceefn+qpuelae+X4eK9h7w7d9rjhiWTEVRpb5exp1nC3p+CjZc7H1zr22XkqYy+PfVZa89l7O0yT9+bbP39beNPZeJ4t4w8TQsn9e0dLsdzmfcPP+ZLcWmv91Qvu08MytMbHLI7bn5VhjlCHgtTNmW2d+jvztX4q6VZ1y0P3kwL+5WV+qCMM+HI8+Tzvy1j/39sm6dbB8/zynywUh+UkcL0J7spuXs9/n/YNtKeVkr0W1ZK3g7R4+BR03G8PW9uxPFUZvPLsJ86fX2X4oHxZhErDO6s/mYRXY8CXePd1fF1f9X72xPbP6/O+0X4EpL5uxPb+xp5517k3SVZc2Y8iui7S6J82EnlG/ZO2YRC0+8IhV9M91/s1pGy/0pG41MbuvnAxf4DmutzSPV5xMbP377sn08u2D+fXLBL+V1L3Lt1tN+gjemdmr/+mGjfPWS5NeHNfjGEm0/PX4j/7WLYx5eMXfzjS8ZffKB1jQh6oL5cmV8U4UVptddbRMp+8q5bn4rdFrl3B3xf4tYd8F+UuHMHfP955Vt3sH5R4sPBhLz8qz881ninwA838W8XuPfmwMcfuv74M9cf78jfczfWVvkxe77w1Ha3RJH1RPjxkPrpRPCnqNmV0PI0rkzeKuFPNzvkvaXo9nRny94qEYUvvj19EOwrJYwzHfP3VoSZ/crzyKevlHiawfXo7y1F5dW++jwQ7Aslmj3NI3u8txTCnCP23oo0Rhm1Yp9ui3dLuD7Nl/o8svbHZu/+8afftwf4GvBQ4ofRjvX+iqxh0yWeP0b484r03dfdbg1T7H1zHn9vmOK+xOdjyEvn438/TCz288bYXR2Zs1fMX55A/6pIe/4oSntZZHuyx7Ac/eHa6OfV2X+bYj1W/3Gzlp+K7Max8sm8XtQ3RbYTccjTwM32enXi44ub7XI8Lu7WJ+PrsTlKYjf/hfGZWJPXk8fsi/BxokeW6KaI/s77ptU1eqv9MB72N9tkt4OL0H6lb1anf746u1fpfZ3Myo9z8d6OVbE1vYk8nwD9XCKOj2M1jo9jdV/iXqz+Ks6evqr0epLyOL4hE7dF7vb/9kPClV9dfTsR6xpRWyzeLbIuWXotr5ckdjfVPdbzzcdj77YpsrvtpPMsQp5OqB4/oveTuRzc9H3w0+eIo/+0IJtIXGPznk7Wpb35IyOvf2RiN8Vf6U/PwZ9u90j9SizfPED2Re4eIP07DpD4/ADxT+/V/OLH4e5G7d+wUXfvXd3eqFU+3qjbH25GN7T2w9wTXyjyeEq53oY57PWvf9Tfu8i9u4r7ErfuKv6ixJ0jdXc7jgER+sN4CPfbJXRl0OPc/80S6/7Jo1p5p8SYWnme0j1/WffnY3RfYl2AlKe3aL5UghHo9WmeuJ9LxO49CV0n7NqON0sEn9TVt1bk+aXxp9k8v1LCOlMCP4/G/0IJXw/uqu+2hdTfuUgx45Ozz0OUv1TEnRt0Ud8swky4j/PD9/ZMXStTq7/XK9wcexwp5b2l4JqyHW+tSDnWbezHidxbB3opjS/gSX+vxHogMD7s91aJ9vR5tHhvKZ6+f6dPF4JfKsGd8B9ewvnKinB0Pk8m/KUSjL9t+taK+Bo7//wFgy8UiHVuHvrWSnC/9HnI7VcKrGMqXD9chfcKPM5gg1vozw/7vnL/23kWUD8vYW+VaOvu9wP7eyXs+fOFb5V4ftgl722Lxhhs+eHVtDdLvLdTpT4NqSzvleDXVMzeLMGK/DDw4wsl1lXNI/nf26k5bu/aqcfx5nFB6Na3dqqscZzS39qYHJrP3xb5uUDsHjE9HrgJafF0UXV/IYQrEX9rLdZ8KSZv7Qpdj9r0+fT/CwXWIy6N9l6BNQIo5LMCdry3BE/veb8Vlba+A2AtPlyC93bj4zqOD+7oy8l3on86fc9uGe7NQRC7+5T35iCI/SeleIf4wU+flcsZN/7n4//+6V//8o9//uvf//VP//GXv//t3x9/979HuX/85U//8tc/X//3f//n3/716b/+x//7b/O//Ms//vLXv/7l//zzv/3j7//65//1n//486g0/tsfjut//sfjVnr9J2+9/c9/+kMZ/78/Hlh4F3n8//b4/49TNa3jv40/XP1xHlz7kf8i/7Q9fq/G0Nj/+d9jcf8/",
2116
+ "bytecode": "H4sIAAAAAAAA/+29CZSkWVYe9kduVZlVWRlV1bV1V3VndfW+zETknoBFwswwzMIw9OwDw5AZEdnTM11d1bV0d1UvEz0zGJtjRsa2JJBGgISMOSyWWQQcC4wEyFqw5cNhDANICNnYmCNxZIuDEDIY16uOm/HFF9//4o+M+zIju/Od010Z/7vvu/fdd999+3ul7LXwgVv/lVp/j7X+PdD6N3w/mnUGo11r/VsZLFQdsSqpZCztARlH9oCMo3tAxrE9IOP4HpBxYg/IeGAPyHhwD8g4uQdknNoDMh7aAzIe3gMyTu8BGY/sARln9oCM5QQyppDz6B6R85ijnNhvTiXv8Wz4bfSOPSDjiT0g48k9IOOpPSDj6T0g45k9IOOde0DGu/aAjGf3gIzn9oCMd+8BGe/ZAzLO7gEZz+8BGe/dAzJe2AMy3rcHZLx/D8j4wB6Q8cE9IONDe0DGh/eAjI/sARkf3QMyPrYHZHx8D8j4pj0g45v3gIyVPSBjdQ/IOLcHZJzfAzIu7AEZF/eAjEt7QMblPSDjyh6QcXUPyPhle0DGL98DMn7FHpDxP9oDMv6FPSDjV+4BGdf2gIxftQdk/Oo9IONb9oCMb90DMr5tD8j4NXtAxrfvARm/dg/I+I49IOM794CM79oDMr57D8j4dXtAxvfsARm/fg/I+N49IOM37AEZn0ggYwo537dH5Hz/HpHzA4nkzD5IQo/c+i8cigqHjsKhnnBoJhxKCYc+wqGKcGghHAoIm+7DpvawaTxsyi5nrx3MC5t1wwbYsME0bOAMGyTDBsSwwS9soAsb1MIGsLDBKmxgChuEwgac2Vv/nb/1X9igETZAhA0GYQE/LJCHBeiwwBsWUMMCZVgADAtsYQErLBCFBZiQq7CAECbowwR4mGAOE7hhgjRMQIYJvjCBFiaowgRQmGAJExhhgsAG4GEAGQZoYQAUBhihAx86yKEDGjp4oQMVOiihAxAa2NCAhQYiOODg4IIDCRU0GH8wrA9k+cEM5Ojdr/072fo9AvGOh9Oqk8TXE3+lUt+YFPlzlH9+soV5MAn+4pLhT6aRv2IHWL+12cbHvBjf0da/f7nZ1uVfbnbKZDRfApovEY3lJ015ryym1Vf19oEZ1FEGeTHeU2l4z5WIH5YLxhn/qSylbb522Bf5mTysH/Md00bTbMtTorixZnc+LG4c4qx8A59HgI5t6yDFmSwhmP1Og24s/JVWnJXpGGD62evqSlp7Xajsnr0uVF+P9jpGcWPN7nz0a69oW2yv41k7mC+1uAmI+w2KOwBxv9ls814EOV5o/Z3WJ7/WBmPd827Djgv5kVcIB5ptfZgNjsK3cdDfbf0gPcVNQtxYs5PPVOv3GPBBLJNjnOgXWr9nWv9OQBpLXxb8J4h/h9ziG+tlUtBPCvpga4+3/g79bLPntzTbeJ4XAhj+W9Pgb/U735YGf87wv6bZ1mUbe3Nheb6+vL5U21ipb8zXFtZXlhfWl9cXV5eq1fp6pb66WtmYq1XWlzdXFlcWG5vVjUajWltd37zVw1mfN+y3S+z5xsZyZX5xfWllo7q5vrRZ2VhYXplf31xerq/XVxcay4uVerW2VK3NVTdXVtYXF9dri6vV6mZjdXFzZcmwv1ZiN1ZWaqsby5uVzfXN1bn1ylxlbqNW31ysLN3isdmoLW5uzi+sVhbnV+rrtfpyrbpam1+Z26w1Vjcrq1tyv0Ni1+cW1zdr9frGQmVzdX55fXnllm5WlzduAaxU55eq67XVWzrbrDbWa8u1jfVG5RavRnW9vlytL88vGvY7m+3yTDFOeVcS/OqWvb9b6malun7LRur1hepKvVafrzTmN29Zx8r6Qn2puhKKd35loz6/uNy4ZVTVlfXlucXG4tL6+q1yXq9Vt2T/OondmFteWJhfrS4vVJeX6vNLjXplpba5Up+vrlerG9V6fXPzlm1u3DKczaXl1aVbZduoNZYbKxtLtwxoq0zfI7CrK/Nzc8vzq8u3+jn1SnWhXptbmZsLBXxL+NpcY3Whurq5MLcwX6vfqggLK+vVYFi11c2V17Ri2F8v5e5TwRQM+73NJPayVf+/IQ3+guE/kQZ/q1zf1xxY9xy26ur787G3bTqG/QGBPbc+X6vc8kTri7eqSGNl8Zbt33KxjY2VxubS3PpGbaEyV69Wq42FW/+ba9QXVjduVa+Npcat6rRxi92WzXwwic6rNcP/EOA76n1L/g8nkb+N/5Fmt+4rAwbD/mga3Wz5yG/0l30L+5v8sbf8zMeaScp0a/7sm9Pgb9n8x9Pg1w3/W5Lgt9vW9TT4W+W7kQZ/qx2pAX7JDX9uq97Wk+DPb+E30uBvle9mEv0vbMn/ZBL5F7bk/0Qa/K1+wlNp8Lfs85Np8LfGO59Kgr+4Vb5Pp8Hf0s/FJPhLW/bzTBr8Lfu5lAZ/Sz+X0+Bv9WWfTYO/ZZ9X0uAvG/7VNPgrhn8tDf6q4V9Pg7/VP3kuDf5W/+T5NPgNw38hDf7WeOtGEvzlLf95Mw3+Vv/qxTT4W/7tpTT4W/7t5TT4W/7tlTT4W/7t02nwt/xbMw3+lv95NQ3+1vjrM2nwt/zPZ1v4WeY2l7yl+89J7IHmkhfCGkRYw3qitegW9v2caGFfv/bU009du/H2xrWvfvpS7VPvuX5xo3Gl1Jaha5ERv+MisIUAfrwL/P1PXWxcvbZ+8TJDTOZAj+VAn+mCfsulZ65dWa9d+6p6/Urj6lUGmhIMshzwo13gH2xcufrUpWcY9NBAoG/5xPpTz7yjzqCHC4LasuU0pVf/hjAqvtlSVZmwUGPG54jgY8uUM/DdcahdL5IP5D9FsnovaZSIn8nD+hkh3ZWFrGWKC4GHVGXBpyz4KKzLjlg3HbGedcR6wRHLM4/POWJdc8R63hHriiNWzRHLU/eedejFIcW66IjlaROeuve0r0uOWJ5129MmnnHE8vTRrzhiDWv7aMOuyay77+C99Bgwj6XBnzddHI3oAvlbXwn7VqWcfw2L44zXFGE5560ayxvKz+V8FORBHeRhHe0Ta1LEpSjTciTfzD+PXvWXjf54BB/pZ7JuGz5OurgjjS7mYuV2HHga/8OQh9Yg8K2NjetPvvvSkxmFUVKHqe8s0dmuhJGsW+3HcrAy+n2Wvo0CHoYg/slO8b+mca32ifevP/lko34rE1cpQReC7evj77GKn9gJFj4fYPx3yrHEKlgIVgFCqVhJt0rl3ZfW629Zv3z1+tONEdIoDotZq4jKuecSK4Fk+G2K6KzELdhOQzVhhDijWdwtzghMcwWYp6M56dj98LcRQV8mrLJIZ7KPRtIjBqZjixq0ObR8ZFm7yVD5LzK9k6b2VRe2W/tST+8Uba7SNrfV+SJdA5TXyvKYiOOmdRywkP4o5JGbMmyWx+nbv2n9WybMEGx3W0nEjYpvpt+wg/73KW9YNmynKcsB+Znc+A35T2VJW61o91MNM9J29atzRcoV5bWyPC7iDMu6TWinSH8M8oj0+Lelx29/1vq3nHXbNNup6obiN7TTP6a8YdmwnaYph+Knx4z/VJay3rTtVNmFGtpMZt3l7LlzrEi5orxWlneIOMOyFTS0U6Q/DnlEevzb0uO3Q60CK2fdNs12eofID35DOx0vdeYNy4btNE05VGtF7dT4T2Up603bTpVdqHZJ2YWlVeXFyzpFy0th3XTEesER6xlHrMuOWC8OKdY1R6znHbGuOGLVHLGuO2J52v2w6uvTjlietvqSI9ZVRyxP3Xvm8aIj1rDa6quOWHVHLNtBxuMVww8h7TRz8RtMjP9UlrLv1u4rKb2qsZHp50Qa/WzJc0LIc0Lox8rypIgzrFOt39inR/oTkEekx78tPX57f6vAyoQZAvfpT4r84Dfs07+nhTsj8sPzP/3WB0zPOsR0XB/SlPfCYtH6YPynspT1sxK1P6VX08/JNPpZKGI/KK+V5SkRZ1inW7+xPiD9Scgj0uPflh6/Nag+YN3h+nBK5Ae/YX34eKkzb1g2bKeJyqGw3zb+U1nKetO2U2UXJ4QeJ7Pucvaeq+pVriivleVpEWdYtisY7RTpT0EekR7/tvT47SrZKdo02+lpkR/8hnZ6kfw25ofnQ4u2B2p7gNFNinRrrX8HvGFlIa29LC5PZt3l6TnHb/hnpG4GClu6uTOJ7Atb+Helwa8GW32ZbBUPA+C6Yilr7+a3ehgC3qBwEOKR/rOtiMDvVfLhsdvYEt1cuFrUhxv/nbqNbZLkYf3wPOUhIWuZ4kLgcdghweeQ4KOwPuOIVXPEuuGIddkR63lHrEuOWNccsTzzeMURa1jt66Ij1k1HrJccsTzty1Nf1x2xPO3Lsw694IjlaROeftXWbKZFHPcj8OidY7tdeCxo/Key7nY7RT/icFZMr/3tMsTeGGsVUTn3qB2MG6VvvMvw7c3O39vZZYi7u5QmeJch5ulITjrURSa+jQj6w4R1WKQz2Ucj6bMsuVVX0x7+bG82V2WDeTL+01m3zks5/xoWxxmvqUzrfM1Jd7G8ofzs2XDnI+ogD+tIn1iTIi5FmR6O5Bv5T0dkVfk4RDpRLYcaKRn9TEQupJ8RvC3tTuxZz9Oh2nE8wMEDU99pojN3OJLF3SFiZfT7NH0bzfTBg9gEQJFqbXKGUBZYNjGx30HYCvsdhDdEB0E5Xraoyaw7r2utfysDhfrCpJCpjT3QBc5zt7eOtwxEOWucokPHiUsHR4Rux4n+UZiy/IMWv5AfmwZv1Yavvv70p55oXLvyVOO5hjor1cuE8Y7rEOxe6pgJhxDrEw2rU0vd54pVgRC259TYoFI7NbMAC15ObVJgFnFqWGoHBV/7NiLoY06N59JHI+lDmBbf2OIT9W4LWzyPMlKN0GLljPrxsXjUKqJy7nezGVf9+8MCM9a/j1lpJr716iTHmqbRHH5HIvx4VQ3TjhPtVKuQEteMCu7c5zzst1FbYb+NekO0UaMiHVvUoLNZlo8Qyll+/iezbn2stf4d8KWThbS1t/3SYxqvtbgYOvV3t5Ro9oUzLDyQtRmXvH0POMhA+vkWj8Dv3tbfQWf3t+JbNfuD608/VV+/1njbM89eb1xv1N9z6Vrj6lc9U3/bc41nrvU9pMDnikKwJ4Z6DSnUBpCtZ76ylO6xum6V4k4hl8XhJhh+Gu4sxJ2huHMQV6K4uyGON1fcQ3nFuFmIG6O48xA3TnH3QtwExV2AuAPwNwcuRyyXoJcPT7Vxmc5CGPVbeZ8WOKYr3tiE9CHgE1NYDhNZW06kwQ2nSL8y0pZ/ulWAyrmZPFzuFp9lbVs9R7KvtX5XBguFuxbGfyrrttEUXYtzJA/rZ3tdC7QO1iqicu7Zcneya3E3xClNcNcC83R3Tjq2fP42IujPEdY5kY67Fio9YmA6tiiuhTjndafgzbXwHVALy2fy+bKXVjXxoODHXtfiQ7Bay153rfW7MlBYXC5aa43/VNbdQqSotfeQPKyf7dVabvOMywcJ1WiQFsMHQTKkn6LfXPqHRToOplFuby0uBLOKWUqz1vpdGSgUP4Rl/KeylFbatopZkof1w5v5z6fRz5Y854U854V+VD9nFv7Gfg56J6Q/D3lEevzb0uO3j7eUUibMEHgz/70iP/jN9Bv6MR+hgcIsyMOb+WcF7qzAVZv5jU7xuWdAPvcU5JMiP1ZO5pNuwKDok6Tbc5E8q9bwXME8n8vy+RwdkM9RwUdd8mVPGaoLjzgOp9XuIUw8jMlr3OoyET4shTLzoUmFqQ5vhbK7MNrGC/89CHSqJeNe1wMgD6bF3+NEG4I9SzhOtP8x2NUrI515wPJjXc8CX9b1eUjHelH+RY3lWNf3RTDvF5ghP3eOdtKxvkKwtuAh+O45KVO0rTT+UySrrzzttvIhkof1w23lw2n0s1gifJTnYaEfK8tHRJxhPdr6jW0l0j8MeUR6/NvS47f/itrKR4CW28pHRH7wG7aVn6d6h2VTyvnXcPkb+1nUjZWv8UH/YHUqyPPdI515Qb8ymnX7oSMQj/SnYTfAF6jNwvRctqqebjf/D4o8xvSc1t6LX55n/KeylP6p7Q9U/XtI6NX080ga/cwVqT8or5XloyLOsB5r/Ub7RfpHII9Ij39bevz235I/QN/B/uBRkR/8hv7gB8kfYNkMWh9iPhX7HegPfoL8gaVDfWJae8p2nOhL4A9+ivwB2jeXbar8c7/lHkc+iIWLHnm2gHXN9Ge6Qbt/lNKhrXKdVLb+mOCt8A2jl2380ojOm7IN5MVt6/95oI35DwvYxkyWX54z9BvbgZh/wTLD55hRzglBH8vXP4XZweNnOjHvgTSqLLhdNfpfAcyTZ7ScmC9s53mLt7IH5RuVTh/LevNGPfO6h6WfyOK2yH73S0Kn3N5j+mkhC7f3bPdrrd+VgULxiy+M/1SWsn1tt/e9yorb+8fS6Kcas8PHhH6sLB8XcYb1ptZvrFdI/xjkEenxb0uP336P2vvHgZbb+8dFfvAbtvf/ktp7LJtB2yFVl3v59H9NPh19m/Lpd0E80v8v4NP/Dfl0Vc9T55/nFB5z5INY3N6/ibA4/6Y/0w3a6pso3ZshDumwvUd7frPgrfCLtvd/NqLzlmcbj0M80v8k2IYpeEakt/JTdvMYxWFZc3vfq527i+hN7oks3o8aJ/oDrbyo9l71jdDHcXu/1SYAJrf3ys/E2ntli8o3Kp2+ibAeEFioZ27vlU4x/w9Q/o3+qNCpau8tvZq//GizM24W0vE46DzE8VjkXojj8cMFiLub4u6DOPbD90Mc9jN5/nImkh88Xsfz6TgvPktxeDHieYrDS+LupTicF79AcXhx030Uhxci3Q95tXlxPlHyQOt74v0pcktubF2ilPNvlhVrL3DjHL8te86RD2K9vdnJ525HPuizeS9ZinG10tt5wcfsBuvtbuxrMv5TWbePSdG/V2u154Ve+9shMQt/s1YRlXOP2sG42A6JEDz2NV2AOKUJXmHDPF3ISYe6yMS3EUF/L2HlrfaP5vBTJYrp2KJK9D1vX9MsxCP9V0Ore4Z6HYrXLMjHLb/JnrfDcZZkMPqvARmmz2jMsZx8nc/B/MhoW5Z3jGrMTGCqfF2gfLEM95IMRv91okczSjQsj/pWyjr3jGFa/q1s5k6iv69HfmYpP0b/vkg5zQoZsE6yTlkGprmQI8OHhAzCu73l0uUbLe+WURiDv9kbKc3z/q1ZgZMXTBu398q0JB8lXPZUzMd+HxQyhZxb/23rmoOnG9caOXlnzz2Vw3Mk04H71ZYuhLT7rYq3wcZ/KtOWueYjT3T/1yx8473zaj9XWcShfbAdxvgEm7D+fssm3nft0pU8kyjaOJeEWJw+I6yS+BbCvhlt34z668qxEaFWEZVzn1dyvazFBh8WttOVi3WBENO6cpine3PScQXibyNZfldLddN4e3msq4YYmG6WMLgpzevK4RZ2pL8OTWP5jM6nhc8223G8BR3l5lqZZoBVLfyK2+t7gFUmVKNBWgz4PivSx7agh/CuZnc6DqbRtFvn5lbV8r8FtQ1sluJw6vI8xeG04yH4m8OoyLvlN9Sms2fauEzHsmIN5ylArD28HIKd+McoDqcVH6c4nFZ8E8Xh9qs3UxxOqVZaf/Ohl8/TtNwspEk9LWe8ZrJuvfJ7hKprpI53lUX6sxE+Jwbkc0LwSazLatr62r7N7rzQBeaJp9vVccSiXt947dRxQZW3WDljKzQLf+dhne8TK3GfeJ57Hirfyr8qWVU+eILE2q07W2PoMDz+W5FlkBLpIc0tg/OFt3Hz29yJbgONvs2N+uEhpnoLm31fCJ9stuk4blR8G4lgveCI9bIj1vOOWJccsWqOWJ559CxHzzw+44jlmcfnHLFuOGJdd8S67Ij1kiPWNUcsT5vwrI+edcjTJjz1dcUR60VHLE/dP+uI5an7m45Ynvry9IUXHbE89TWsvtBTX54+543QZ/K0Cc9221P3n3bE8rR7T91fdcTy1L1nHj39hGcfwFNfrzpi8ftwRcf1Rq/eMVbzUjaXids+LW3at4rbLzUoPeFWU+M/wEsNpr5FouOXGo5BuuM5WBn9XqRvo4CHAa9LLLKAlmZadr7wsjbfQHA+iTzxGwhQPzx1pU6u8qnOED7RbNNx3Kj4NhLBesERi6cDBsG64Yh13RHrsiPWS45Y1xyxPG3ieUesmiOWp0146uuKI5anvp51xPLU18uOWJ62eskR641QjjcdsTz15dkOXXTE8tTXsLZDnvry9Pee9uXpczzro6dNePaZPHX/aUcsT7v31P1VRyxP3Xvm0dNPDGv/61VHLJuKUbfP8KZpNYZ9KMIH0z9UAOu8wDJ6dYNHbMpH3bgw2fqd5naP9pSPKg91mn6AKR9TX5XoeMrnYUj3SA5WRr+r9C1vyod3MX1HaxeTqTnR7jS5S5J3L+LOqGOUPzXbiN/yZi6RblqkM3kS579eIn6WjzydTAmdpJjiOltQr6af82nkqZWybncyKniavHxBonJ9Vo/wLALSn4c8cr1DdzBO376nVWfKWbdb5Et2irrfMBX7XWOdedvurlPEVW69SH3YLh/E4ktmTN/42s43Aw3u+EY9jcF3tA+78Jcv8fvBVoKw+/1nYfd7oJkV8gXd/9BYXFZMi7LykeTvhktjfrSFqc76WHmo8jlPcWXBV2Gyz4zVpRBiPvN8ASwsr+NEjxdnKHrUL9L/NJQdX05zP6RR9sMyGz+0H7yIme3H6P/uNuzn58bisrL9HM86eRv9i2A/f4/sB3Ucs5/jFIf2YzpSbS6fGOi3zcX05QifuykOZecLEu8W+SpRHMp3d0S+40IGa9fwJIpfuza3wu0UBrVsdILisEt8kuKwe3qK4rC7zP4eL1Pi9hQvULpAcXixF1+aU4G44xRXhbjz8DeHUfqN5RLq4s/3cZIJ7eZhipuFONQv6gqvbJgFfKvz3I/+a61Xv8I/v03t+Ekhq9kdXjbkuKRa+BJn4z9FsvrK0+5vniJ5WD+8pHpWyMo+L4Snmm06josNPRXWNUesFx2xnnHEesER6xVHrMuOWDeHVK5Ljlg1R6xXHbHqjlifccTy1Nfzjlie9fElRyxPu/f0hZ7l+Kwjlmc5evovT33dcMS66IjlqS/POuTZn/DU13VHrH2/unt+1VP3n3bE8rR7T91fdcTy1L1nHj39xBVHrGHtrzYcsay/aulwjD8LdDYHgDekeC5tGv4DafC3bl64X+gK88SXXqOuSjn/GhbHGa+duk1D5S1mBziPiDrIw7q/T6y085XtMr0vkm/kPx2RVeXjlKNO7iWsonNL/ZbtTNZdnpY2cR3b2p5wb5avJ+Q/wPYEU98c0b232VYHq/2+HKyMfs/Rt7ztCaZqnIbkO+xPEVYIiZfvG0Xdk/GfyrrNPYV7Us0U6oeX7xO9b10vET7Kc4/Qj7pUDMsObSvvPel7II9cPdF98S28F8df+7ecdVetQd6TfnK8kw7zcx7SqGX3DzfbOJfHO2VQb3Dhctps1plPo//h8Tbm1dbfajnO3MUM/Q5/8/sC+EYx1z08IOftApFflum6Z/ynSNZUdU8daET9mG30d70iL+KjVhGVc8+etASS4Tfe7DFD6bZz6ekJiFOa4EtP1VFKToe6yMS3EUF/B2HdIdKZ7KOR9Iihzl9y/nEx377fKXiPE/23tmqlur9e8UJ98J3kJnveneQsg9H/pyAD34tuNHn317M3OEG/0bb4dW/D/h7wUt8xrvlngj/nD3sNeXfDG9440X8n6IDvuj8p0mc531AHmDbvN9Kezjrzwj0HtkW+F/90j7xz+Rv9d0XK/5iQAXsXrH+WgWlO5cjwBSHDYPfis5fjUuKSOCZw8oJpI+Tye6jNV94iy/nGFmBpB70Xv5zDcyTTYb9t337brt6asrRqWxS37scK8hnwXvy8Rl9VdE6fUdqS+BYCXiagdify7q3zWae8/C22e8vodmoXpOJzYkA+JwQfxlJd/hA2m+14pP9pcKQncx7EGcnBfKLZSa9mgNTuOqPvNQvIusSh3P1Zb96oS254HuhTVrUrG2dw7iNZUb6H+pT1vTss63kh67TgzS4+0Z3L277cI9GMWrWIXkPY3vCN53xRq4jKuUftYBx78pNE97XNzt/bGb6po08PCMzYY+cxy8zEtxFB/xBhPSTSmeyjkfSIodYhDEOlC+Fzze40sRpUxMJD4E7Dw45YO/9weHWxaM0e1ofD1V5pS1sWcTgUxDjk85jgo7AuOGLd64QVAk+A7mPtY+1j7WPtNSyLwzb/EUqH7a+NftTohEeuRReF1MjV6BSfUwPyOSX4TIt02+1rlCMyqyP8rLdHRH4eifDB9PwaES404uLZsQnNE0fSmNbOD44T/X8G53lOTOTnEfV8O1/NbpknW/+OQZzn4nQY7f/CXZ36wT7QeLNTJ6p+If3HW/Sqr2GLmsoW+FWovDK6h8rIMPLKyOThZ3KvQxndS2WEi854vi6vXil+bEMTgp7lR/oHWzLhsoKSj889K5tFmTeamt+jwO8knZVDuzTeae2yuqjsEus722XRfnsRO0adKTvmGSe1cQF1zjNO6nyz2pzA53uXhE0UrQdc7ka/WrDcd8Yf6XJHXXK5q5lD1c7F7ATL03RWzrpt4jxhnRdYqPMi5X6PwOdyf2uk3NUGD5SLy93o316w3E2Xu1HuqMsi5Y70XO6q/4DlbjorZ93t9B2EpdoA1HmRckdb4jbA6J+IlDvaShE/b/Qf2AN+HnVZpNyRvt9yZz+P5f4gxak7KHa6DVgXNsFjEvYrefIpvR3OBlos5LXxh3LEuEOkzyhtib7dkYNlOOEbThuzyi27E5me4mWVG/0nhMpVNUZ5lAuz/NjUKhb3biyaGP+prNtkUkyt9uo689TqfULWsojjqni+IB9HUw/BVlNKQixOnxFWSXzDOGXquP5qps7bQzEtbg9VMwg80lGeU41cjP4x4KPocWSC9DcjrVyv0SZ7+8cFPfbc+YYYzMPjFIfpHsjhg60v6otbX6N/tWDra7x3o/VFHXLr+yaIGxX0XB5vFvR4SwzPquEtMVzlsQweJz69XAvXD2XHanZBjRbUFpsi9qrsD3sbj1GcGo0qW8HLLkMYg7jUM0WYX7aVWF0MgXUXsy3UXTnrbUdYrx8jPjG/FkLMVnA2x2YLJwEb+ay1flcGCnPLhj+SBH9p66TfaBr566ZH3maJuhuH7342u1T4JiPjP0WyOtehra7QOMnD+uGu0ISQtUxxITzZbNNx3Kj4NhLBqjli3XDEuuiIddMR6yVHrGuOWJ76uu6I5WlfzztiveCI5WkTl52wLL2XXC86yRWCp00844jlaRPPOWJ5+lXPuu1lqyEMq1/1tAlP/+VZhzxtwlNfVxyxPPV1yRHL01Y95dpvt3dPX579VU8f7dkHeNkRy9N/DatNePqJYW2HPMcwnnlsOmLt+9XXh//yKsdS1j3nNyz6GlafM6z9wmcdsTzro2db61mOw9hfLWXdc+TDYl+efvWqI5annxjWeSZPuTx1P6x+wrNP/kYY13q2268MqVye41rPcvSsj55jGM95X08sT5vgOlRqfcd1UnuFK4SPtv4eJ3p7FUutozuuNS9MA2YGPJB3onXuhRLxy7LOvkpG/Kdz5AlhSsSNDSDr5sLSfK1Saaw3VtYXl9e3XmtUa+D4rcjYR62Zm64PZEl0Paf24EyAXkMYg7hxihuHOJMx7K15hOSfSCR/Ef0j/7Kg51OXRcvyWNZpa1gf1X0pZynuAYjDPY7hv153ncwSve13nMihN7xxon+1VWjqZBbuoTyWww/liz3ajOkfzsFSLwSG8C1NLfu3gex8x4/aF3VMyGf0sRNXKI/SzaOZ5o35wfLMO2n5HSI/qn7ijcshjEGc4/6e+m6fWjOdqVNrD1McXjHL++ewbj1AMqgTGLPwjffPzUJ6PPXwcwVeOFW3xnC9V/UK6WeJXp3IVLfSsK19r6j3MfudBbk+1tSYfzNSH2Mn1ULo1zZmW3/H9p4yb8wP6pnro9H/YMH6aGW9G/VxkNPNrPNe+825zuF+Vq5zWB/5Jhm0eT5Sc17IMAvfYvXR0oa6wK8Y2/5atAF8GfMuiEf6n47YtNoPHvN3FUGPe8T5NVjcE1yhOEz3KMVVII7rQlXoAeXabLbjkf7nQQ9fAhu8nZdmm4fJlbYuLFRVXTBZb8vf7Mw3Xrs/Kui5rOYF/RzQmM7KRM/lhr8RC3XOR7tMhxOCnm0Z6f+J8OkmH/rOKsn+WJ+y3y1kV6/Nvgny8WctBSt//SDxfCzCk9OiH5rIoTc8Pr/yxT7bQNTTEcI0+l+P+AvlXx+Ab2yDvc4Q8BkL1MubKE7d7LV7Z3UW5nb7rI7ZRznr9qfclmHd4bM6apxRtH5g3+1fj3Tiqj4L4q432/FI//sR+1P1Cscl/fYHuL1SelL29zDFqXMxsXYb5eKxodH/PwXbqx06mybtHW2a7T1mvyH027cwnZWz7vaEx6+qr4465/ZKnZV8XODzWck/jbRXOL5+E8l+T5+yF62Pj0I+fonaK+yncnsV8wGclvnE2jeu2xMHX/tXtVc4v6PmL7i9MvpJwCwyZou1V73GbCaP0mmsLcNX629jN7sxE9ff+d0ee3F7hfWL50lic1NqXrFo/bC0wW5/gtqrBwkXsdBuSiQj2ivWq8MQj/RnI/baqy3ud87P5InN+c0I2fGu6dvYzW7MtPa6uLTbc3dW3kXm7tAPcN/+QcEHfRDbK9qZpQ32+t3kz48AXcuk5HNUpda/to7BD4GstX5XBguFr7kw/lMkq7M8W2c71bMMqB+zi/7uBu/16gLTI20m4niVcoro3t7s/L2du8HxpLzSBN8Nrh5A4XSoi0x8GxH0xwjrmEhnso9G0iMGpmOLKtF39NhHBO9xov8K8NjlM/l8j2TdeijTt882u/lNi3xxrU3zSEq1WrTWGv+pLKkXqcZsVa1+DVZrjUuZUI0GaTGUQTKkn6LfXPrvanan42AatZK/k76vtX5XBgrVmnrB14LFnQPebK3YrzpGcTi+OQR/cxgVebf8htp2ltYsMoGl7tjJe+oQ5bY4vMaKnyfFd11mKQ5vkD9PcbHbe/FxsAutv9njfLDlccwG2CuutX5XBgzcaqly3u9LvN76Eu9udv7eTl8Cn+7rty9xZ0461EUmvg1DX0KlC78PizRFalAa714pfNOK8d+pGtTLbkZId2eFrGqFdgr+xjjkE3vrHbH4rvNe/Was9QNcYMedh2M5YoyI9BmlZdfAg9+yyBJWPZ4gNVkmsng1GSf6q2LCL5Y+hP2Gp7vaFG14VIfH0pZFHDc9MwX5OJp6CNYilYRYnD4jrJL4prAMJ3zDkRqbumV3IutvlPiqMHVT+UGRPuD/fktYayVnBZ3JdR5+x/aVGP29lA+mmaV8GP1/AvmYpnygTCZP7FUKq64XSPa11u/KYKFwdTX+UyRrqup6geRh/WyvnzgLf7NWEZVzn1dDetXKr2l2/t5OP1G9qHivwLQagHm6LycdWz5/GxH0Fwjrgkhnso9G0iMGpmOL4lqo7oOP1cLvjsw5Id/zWdalB66JJwU/vtTX4kOwWns/5Wmt9bsyUFhcKVprjf8UyZqq1sZePQ1he7UWLQ25fIhQjQZpMXwIJEN67jZy6Z8S6TiYRsdJ5h9vWWFoQ76/9be6q5f3AKMMMf+n9lManeJzdEA+RwUfqwkHIZ2dY7K4SZFXizsE6T5M6Q5D3Eco7qzIF8+7Kcy7I5j3iLhQdsuTnXTozUo5/4YwKr6xTi8IWdXZEexD5dW2+yN8ML3RTYt0g+ZHyaz6OPgK0s8dbKcJ/9kannoNIvx9GuKR/sun2ph/j+obrguajErPXBf71XNZ8EmtZ65TDzryQSwrM9NN7LVcLKcir+Xiui+/vzxKaZAeMRS+YfSywV85qPOWZ4N556lmwQa/uE0b5H0HuLeA20O1nwPpT2c6XxM59Hn5+q3I+OyCSK9k5ycvHozIHgLbIqY3upQ2jzx72c/vkv2o/VhoP3dCPNJPgv38HtkP9uBS5D9Wr9VTJLF6rfwHp8M6eqKADLHzhSeEDJ6vS5cjMveyjT8i24i9ahf+5rMoRv9vJ9uY/55sQ+2XU3rmPmC/ej4q+KTWM/fvHnXkg1jcvj1OWKxnKye1x/lxSod7z5EO2zfc06f2uyv8ou3b5KTOW54N5p2Z+HWwwcOTnfnH9DEb5L1zsbMgvfbo3UX0ai/yI4I370U+3spL0bMguNeNfbnRnwTMInvx1Wg5ZovqTIfSKZ9Z6LU3ledC1fkazH+erZyL6FSdb8D8sE6NfjaiU6WjmE77PV+DeeZzUmqmDvVcRKeY//so/0b/oNCp6rfcR7Jj34H7kKofhvR3Er2qY6pvwnXs8YjsF0R6Nbdg96KouYUHKB3uneGxGK44P0RxOLfA8xy4p4fbP7WHX+3pwf3/NrcwTnn9stb3xGsAcg/LBZId9V/K+TfLirW3uJYzRXxSzKuEv88Qn/sc+dwXyU+K8X4ItrKgxpW87P0A8eFvzAfTG53iMzkgH1VvGcvahhCwb3YI4pH+68G//NZdnZjKx03CNx6bqH3kVhd5fmKt9bsyWKga/iNp8OdNF73umGDftd2xJfKayrrbqBSrECpvsTkF7JfyOa1+x0YKa1LEpSjTXvNAeWM1TKvykVc3kU/sXp1HInIhvRon8B1S2P/yXgfP06EaOxzO2mv5rRWstzY2rj/57ktPZhRGSR2mvruIztzPSNZtig/nYGX0+y76Ngp4GHbKnSs+xwfkc1zwmRbpBm1ulcy9htiXaYiN3WC1vMZHl43+H8AQ+yoNsWPNplpEx+U1HoJY+rwtLnnN7AvQzE7TEOwQ5RnzyTIiJj5RhzLbUiLL8DJ1jxM1K7J7zNPzOMw4SHHY3bUuadou/dySqg8WpoW+DlHcQyI/qtmYpDh0lTxsQtd9mOJw2HuW4nA4zscS1HUOFvdmiMOhFwde1sdyCXn/8FQbl+ksqLLm4TfW27yhKOKajeBQ1LvJ43yo7pvxnyJZneXZ6r6pjceon+1tIsEaylpFVM49W0wJJMNvPECepHTb2fqFmxiUJnjAgnk6l5OOvSt/GxH0ZwnrrEhnso9G0iMGpmOLKtH3vK1f3DoZ/fdC63SGWifFK9ZCmuxFW0ij//5IC2k0Yzn5Ym9wjn6jbX1jU/P/GehB/DeTmn8m+HP+0LNO5MhreONE/8Nism+UaFge9Q11gGnzfiPtbNaZF2wJlC2eJ/rZHnnn8jf6Hy/QQ0IZ1IPNeTIwzT05MvyUkEF4zbdcunwjZ9s5P3HMXo5LiUvikMDJC6aNkEuz3pi3yHK+sQVY2kBjS/lbQ7anG9fyttxzi3Awh+dIpsN+2779tl1NtVvacpZfxlzDevEZ8BRGXqOvKjqnzyhtSXwLIVSHl0uddGomU+0JN3q1EwUx+CYxo//HkZU2NTOGDVORWSAcSvCQSs1GqhkinAK4jd1sxxndbtzstZM3rVjZq5tWeGYPpwx4lheH5nhzyuU+dw7w7hWj/82IPamV2JhOet3ux7ugcRj5ZorDdLxrQd2yajJUsm49oFybzXY80v9voIfYzXQm127cpIq3ybH94q2po4Keyyp28yrqrEz0XG74G7FQ5+z78AZSpmdbRvo/iKxUo//hW2Af7VN25bdVfcTdApM0Jdjv7hnE5duW1Mo+0uftnvnjBLtn/sOQ7Z5Ru0BwVeU2drMbM3H9le0P6ofrb0wXIfS7S4bbH/SnfJMq1h2+mVr1EYrWD7xJ9Y9oZyT2JS4Qz4cjPDkt81H0uGsc6Y+0phGL3tyIejpFmEZ/FDCL3IQXqx+9dtlxu4h64bqj+nW71z9bWNxL/TP03+yb1epk0fqBNzf+bp8nHfi0jdFf6NP+YjeH9rI/7s8V3U3KpyywXPJuHVftVAg8TjL6R0EPsf7cbt5UupPtAb/2oPrXMf8b24mq/K9qj9n/Lgn/q05SPUayP9in7EXrI57C+ZXIKSFur2Jjf07L9V7R805No1+LtFfqdB7qidsro39LxF8o3xZrr3rtYOL5BNQLt2UoOy7N3cZudmMmrr8Lqv6ifrj+xnQRQr9zMdxeoT/lW12x7nBfSW3tKFo/cGvCz8FtbiGMNdt0XnpfXqlUSiZrCx+3MGAYg3ik/1DLvqcgH/bvQC8OLq9XN+fXN9cX1+v1hdo6b0kIwco4zDkGdT3REkJtUeBtRGq69JDALov0eVOveTs3xyAe6T8OvoF3bh4W8mG58EKoWi6Yod9KD4qPmjZWeuAtDbFp/2mSYa31uzJQKH4XqfHfqWn/6YJ6Nf0cSaOfSonwUZ4jQj9WljMizrDUnbjqTtsRose/LT1+u9KqD3xzUAj8WqW6oQm/mX6DL316qjNvWDalnH8Nl79xfUDdcH3AWzZwy9zzU515UYv+mNZugOVF///3dBvzJvk+9MdcfmpDAC5Xcv/T0uctxrJ/M/pPg3/jBeExyjPmk2VETNwyp14RZhk+15IhbT3TW+aM1yTJa3ny4h2z66T5rm4W9r/GfypL2R60/a/yd6gf9r9JbsutblaK+CuUly8y5LIL/9nJYPQX6j7UEaLHvy09fvsvyf8iJtuuugxSXfoXfMZ3kP/FshnU/8basBR+PgS+sQbLke8ULdpOlUV6o0tro5WK4ae5kLK6afhHk8i/ueX/RkUZBfv7G9Temq/G+qP6tXwx6S9Ce/u3qL3F9spsUr26MU1xqv/AbV6WxX1YWaSfzsHKG6PwS0lG/yORMYrysbHNmigT+zT7PSZkRv8zEsHKxDejx/HRIaItE+0RQTspeK21/q0MFKpV48WnGFUbkLiuzltdwvuLLVgc3kjDt/ifAPr3NNt0HHiOAfMUbO23aU4Z6VgeLK87cjCVzdpGUovHy5IZly8W5vqC+vpIU8tguHhy7H3NThzD/Z/gRpxfoD5sonc9Frh8MXD5sm45qPI1uW+PB862cZmOeWI58O0zyIdv4MO21DCCPn9tSPWp5rgs7IY++daBXvq0OMvviEhnf09m3fkP/621flcGCotbfY6TSfCXt04tn0qDvzJO5XHzUFvf/4z0bTTcXwmB501sXXNMpA+Bx9FG/zvQD/go2BqnN3ubpPS+dWu+USJ+WabHncZ/imT1lac97jxN8rB+eLvvGSFrmeJCeLrZpuO4UfFtJIJ11RHrsiNWzRHLM4/XHLGed8R6yRHLU/evOmLtl2N/WJ9xxPK0iUuOWC84Ynn6rxcdsTx172mrnrofVv/laaue9vWcI5ZnOXral2cd8rSvm45YFx2xPPM4rH05zzx69ieGtRyHsS8X/uax8uuxn+PZx9zvT7w+6pCnn/CUy8u+wt88zzaIXC83/bA8de/ZB7C21vBMfzbvhmssZYoz2udbc4JqLtJvbmuhanNVOLdVyjp5n0nEu0T8TNf4DfnH5tWmRNwge1Rr8xsLiyuLq8uLmwurG8vVfu3C6NX7pmrO0HSNt387zqnW1f7vO0GvIYxB3BmKG4c4kzHMFz9C8qd5v3a+XkT/yF/Vy29qtukG9Ym8F2QQrGPbxDqWddYB9BNqPw6voal1zbAG8R8OddLF1gDSrFXPF/YNxn+n1gDU3qjYGsBpIWs56/a5vAag1hpOCz4K66oj1mVHrJoj1jOOWNcdsS46Yl1zxHrOEcvTJi45YYW/eb15ELledJTrpKNcN53kCuElRyzPuv2qI5anL/Ssj887YnmW42ccsTxtwlP3XnU7c86jp0284Ig1rH7CU643Qp9pv03bPd171sdnHbG88hj+5jWA11t/wjuP1tYaHs8Fqr3YfK7yj2meEOul43h8a7/rqaxTZuR9OhHvEvEzXeM35K/G3ib3lIgbZJ6wUt+sLlbm5heWV5aWKwsL/dqF0as5n9g8YaJ5toqaJ+S5wDGIO01x4xBnMqp5wjRzyvOVIvpH/qpeflOzTTeov+B5wkGwjm0Ty+YJ0XeZn1DzhLw3/LjID84T8vmGPyOfhDpwnJOT53LxbDXLGwKeW4mdCWEc/Ib7q9X5r3GiHz/clmHksJbP8vARIR/Pw3K+DhzOpzsu6MI/Vv6ta4Lf3rj2vk+sX2nU39eoXWlc4xlfPm3JpzytNcJ0HCyHfAn3JP3mE1yMabPYRS/hDqHITDbfKLLW+l0ZKMwVnsk2/js1k61uSYm1OMfS6GfLYx8T8hwT+lFeiW9tsZ4TngJF+mOQR6THvy09fjvZqkFlgcmnqI+L/OA302+omeUW7k7dbjOd6boWQtryfu19N+SXZbo+GP+pLGX9bNeHYwX1quzvGOmcT53Z3/3YRQwr5s+K6Ffx2beT3bUTPtU9iJ3wKXXEZl/Z70n0Q0LmXbulpI/2ddhvKdnt9pVvKVH2lLp9/cpE7etqC3cyJz9rrd+VwcKKKssRN/z5JXWq2RF/eVKUl6ct9ro9622HO8sFZ8RGRdr3NtvxSD93uo35tQX6VkXGB8N2y13q8YFqF2LjgyQ32MAtd71uWeK2qCzi2BcWvWUJ6zP6UT6V/SHyX4g5yC1L30A2zLaIuP2255i+n/Y8TXlXFovWB+O/U+35TEG9KvuztMouuPyK2sVexEo9btl9+y3uz4fVfhPfQlQpYk8or5XlMRHHfUH050hfhjwiPf5t6fHbC+TPEZP9eax/bbxDCP78Cvnz2I2s/d4yh+lZh3n9rpcPa55F+11G/3+damM2+5jTUm2WesZ0Jsuv8zF9HRKyq7bU0qpyGS3AJ1YuowX5pCj/ncpPrG5jGTzRzJerTFi95lu+gbAwvaVVNsgy9zuviukPRfiUB+RTLshnp/JzeEA+6unm3ZtnLN5eD+s8Y+KbzircxqI8as7HyvKkiDMsfFFjVNDzyiyuXOMOlHH69iPUXiMmt9cnRX7wG7bXP0ArrFg2pZx/DZe/cX2IrXHltdc/Ru01v1LAafmWcaP/NWivfzLSXnPZqvwntsPC9dT4T2Up/Ua7nqp6ofp9aXdotetpzK5RXt7RxWUX/rPdJGhXahfJCNHj35Yev/0i1VPE5Hp6SuQHv2E9/Tmqp1g2g9bTmK9L4Q9CsDrfyx/8MvkDPHFcxB8Y/f8A/uCfRvzBcZJZrcWr/OArAP20cbG6Vo7Qq7qg+rS7t7uxuF8z/lNZd51J4dfUjkRV78RD9F/VuFqdW3lro3blxuVreTsdy6Tr04Rr9Bn95nRBtryxONKGwPZ3nOjYbuw74xeRqRdtr3hV73j3cb99b0zf70tH2BYg/e+0/IS6RVyNKdGGYi8dzVC6mRzZR0UepnLS5d1Mjnl+ZyTPRv97A+SZ5x+OFMwzr59zHg5m3TaAGEXGWGleIWhUivo4nhNNPcbqNVe0I3Oi1fqm8iPDOif6J4nmRP+Q+m5YNqWcfw2XvxWZ20i67/NWmfbqs/15H2vd7J+R/oehzzbSmvxTL1ew7aTSL88PqRewUOfsk1Wbiy9P8C3WRn+olfekL5JU9K5z49XrNvXp6d66iZW50f91KPNygTKP+Tv1cl3MH01H6I8KerVnYNfmEfpoi3Z6HkGNVZSv7Le/bbj/otSp6+OEa/QZ/eZ0qr89k8Mjr25zH/gofe/V31Yy5dH2299GW+B5S7TlmH2rttHozL7TvFLZ3u83DXKq+Vr20/iqDtd1RT9K8jM+l72lH8vRnbWN7OvuawkR+rcf6+N1gkSvgG4W9R/Gf6f2a/V6VZb7son2GzTY/lAeZU/q5RK2NbUerU5ejWTd7R62ebxePddKWCbMEPh1jdgrq8Y7hNAmPzbdmTf1em4RO0JctX62E/tqQrC6qWwn/LfW+l0ZKCw00u7PbVTVONcPf12+tueHP7eq+rZ++BsraV/WWVhM+7LOxpKaq/XDX6mq08t++Isr6nS3I35d3TLpaJ9b8p9Ngj8/b/jnkuA3tuS/Own+whb+PUnwN7b8w2wS/NUt+z+fBH9zyz/cm0b+Lfu5kEb+Lf9/XxL8ypb+HwB8z7GD4T+UBP+1M33hvwezdhgVeTL+1q+5H+j76dcgrynCStUPV3lD+bmf9SDIgzrIw3qwT6xJEZeiTB+I5Bv5T0dk5XyEUG/66CSES05Yqg88iFw3HeU64ihXo+kn14yTXKp/PQjWUSesED7V9JPrpJNc4e9TjlinhxTrjCPWnY5YdzlinXXEOueIdbcTVgjNpp9c9zjKdaPpJ9eso1yfaPrJ5dV2hL/PO2Ld64h1wRFrbEixbPwxI7B5TWNM8BmL8Imt948BjloTsHUrnucLYa31b2WQUK1UEp9PbfRa1/8+WuPtta4/BvFI/3Wwxvv9tMaL6W0+OHbOSq1t8c10/a5tTQk+jIVrPbivhueTeb5/rfW7MlBYWE07nzy/nna+d6Gedr53cV6drXGUf1mt5Tvi16wu4p0ipazTthK9nFT4lXK+eTTN3Rrt+Qe1Xx71w3sw1C2pZRHHdXRYbjp/xRHL8/UOz1dFrjlieb24EYLnLc3D+kKJ52sBnlietnrFEctL96rdHhZb9ayPw3pjvWd9fNkRy7MODavuPV+j8PQTnm3tsL6S4amvYbUvz76JZzl66v6N4Cc8X7bgMewgWF6vw4S/jw4hVghPNv3k2u7N/ql17/WinrdcZ5ywQuA1u2GxCV5fHkSup5p+cnm+/OQpl6etDqMvDMHzlVgvWw3Bqxy95RpGfXnb6nFHLE8f7em/hvVVSs+X2DznFDz75J5jBc+5R+7f29w1rkni+hWfGzX6emuSKe09H4tbd1/jvRqlrJP3nYl4l4hflum1CuM/LeQxuadE3CAvqK3P1efnl2rzC5WlzcXa6tY6xp0kK38bAf7hv7sEvVr3UHvUHdeF6uoFtbtAryGMQdydFDcOcSajekHtrkTyF9E/8i8L+m9stun6KUuF9c5tYtmrZzhWsLq9W+vheXer8Dlvo/lkyzepe0buEPLhnoTYnal3UDpek7TAa6ghrLX+7WVJmz2C8bMyOSBkOUV6MdpnQS/fcrYzL6dEXsxHjUZ4ZOJbKcvX3WTWra+11r9zC/WljfXK8uby+vrKZmVhY65+65+lzeXlzcW59dX52vrC8kp9o7G+MV9bnavVb7nAxsqt9fjG/OpSo7FQZ92MRPKm8n06J9+jOfkuorsZgT3o64ZTQuZpkY7byTSvR1YKr+lzW5imzxC/i0vpNW0/olK4bcAXQ7mt4rkba+NwfxTS3wl5RHr829Ljt29v+YgyYYbAZ3tV3wG/mX7DXqzPHenMm+rPFbEjxC1n+W2V8cE9ebjf7C8e6cyLpUN9YtqPN9vxSP/lsN/sv2hhqv2DXH7c7mF7FgK337YvbyJr6wRpuC00+r8CPn/6TCemurvs44DJfsowMV8oM48VjP4LOzJW0HfMnM50nsda/7FPf0tzZ2RN7HPmi/hA5D/o/UbKvyfaSxr177G715WfiGGd6RMrcTs7H+svoK7z5vnz+tFcz1U7hb6Q+8jI784crLy7Ao23YWEbxmefirY3ZZHe6NKe5V6cS3uWe3Ep7VnuhU2+p/KtrY57aHf+DrWZpu88X/rW5mv/jhP9Lx5tY/5Mn5hvy8Ecn2lj/l1qb0pJdLW4de56JAn+0obqw1hejPc4fPfzNdWVoj7f+E+RrKl8/jjJw/rhfboTQtayiGMbmRB8JgSfsojjfbrbxVK2NQxyhfCCI9anHbE881hzxHrOEetFR6wrjlie+nrJEavpiHXDEeuyI5an7q85Yl1yxPLM46uOWHVHLFuzVX0Lz/Z0Mutua1KMVVR7jXky/tOgvwzi1b+GxXHcFykl0l0sbygjlzP21bhdV1jjfWKl7RO2y3Qky8838p+OyFrOkRV1oviovl6s3qnymBG8La3p8ADJtdb6XRkszJWyzryirFgXjf/hrD2Obd1b+9bGxvUn333pyYxCnvp4qcaG3yNZt9rHc7Ay+s1PfowCHoaQpY+09scUuX40jTuq1ou6EOO/U9ePKpNVy6WmuwNC1jLFhcDbMw8IPgcEH4V10xHrBUesZxyxLjtivTikWNccsZ53xLriiFVzxLrhiOVZhzzL8RVHrIuOWC85YnnWbU/78pTLsxw95fL0E5424VmOzzliefr7IlM7qq9h9OqZLLW8Zt3pg5Cen4tJ9OzaXExP6gmwAbrTpr6zRGcraSNZdxftYA5WRr/P0re87rQaKfAuNC5aLvoZgTGWk1fF0/IaQlmk5xH9BOUthLSjrJXFEvGzfOA35D8ldJKiu3+goF5NdweFrGURx7eMHBR8Dgo+ZRHHLnsQrFccsS46Yl13xLrmiHXJEavmiHXDEeumI5an7ofVVl9yxLrsiOVpX55yeZajp1yeftXTJjzL8TlHLE/dvzikWJ5+4oojlpfuw998G9Gw2Oqw9ic8sfb7APt9gJR+db8PsN8H2O8D7PcBemF56mtYbfVlRyxPfQ2rn7jqiOVZh4a17RjWvu+w2pdnP9qzHD11/0bwE686Yn3KCSv8zSeIBsHymr8Pf591wgrhyaYf1tNOWOFvvnFpEKwTjliecnmVo7dc005YIXjahGc5lh2xjjpiHXPE8tJXCPya0iBynXOSa5htdb8+7k4eh9W+9tuhfbtXcn2y6SeXZx/TsxyPO2GFwDeqDku77Vm3vfQ1zPWRby4dBMtzLPqsI5bnupXn/ITnvInnfiab67CbH+xmkUutznriPYXL00KmUtbJ+1Ai3iXiZ/rDb8h/Wshjck+JuEFuIm1sVjbn6vX5xdW5xYXFWq1E+CYrfxsB/tg+Ib3aG2m6nk6j6wV1E+lh0GsIYxB3iOLGIc6+Bd3zTaSHE8lfRP/Ivyzo+SbSomWpsN65TSy7iRTbGKvbO7WHOYalbg0tkZwTgh7xxon+uZYvC3k+fqaTnzr6l4lvI0Qfwtc3X/t3WsSxD0N9+9llZaGoD2M/legkbjXWJqkjFjGfquyeb0scpA6lwNq99qxSeH++8Z/KktpmNaZX1T8x3R0WspYpLgQuP9XWHRZ89goW+p/YuY8i5a74qJPxMV+2XT7q7E6snmyXD2LZ+SH2Lx581O2c3P8IYa31b2WgML+Rtm/WfkUcX0C3wDdYKpssQxzbEY73uexx3p372Dgex/rAYZR+o54Cv9rZNi7TWZgRfLjf028dHhPyW95GIB3envsjZc0Tb8/F/v0UxCP9D8NNgH+7nJ/HQ5THrX64kD0EvonW6H+Sxoq4N9nRTuVNtMYrbf+/Up+mPGOYFvnmOoL1h+sI1h+uI1h/sLw4qHpgugiYX9hmPZiguGmRD4s7IvKh2hoeI2H7ME1x2Dc5QnHohz/abNNx+zWadZcd37Y6EckXysd+od+jxGOCT+IxwoZqAy2oPtcYxSm9FbVBy1P494sFbFBdycJz7HwbJvpClhFlsHEj07AfNfr/FcaNfMv3QUhjmN8MmGwnxgO/Y3+FfavR/yb51kRjB+lbuU1GHRtdYrnmSsQvy4qNaabSyBMd06B+rN4H2zXdto7Gv/vSev0t65evXn+6MUIaRQ+gPD7TI20m4kbpG9O9o9n522oF12TGHs3iPaPY2y9qtkzN5hwUfO3biKA/RFhqRsFkH42kRwxMxxY1KdKttf691WGYW1zfrNXrGwuVzdX55fXllZX6xuryxvzK3Ep1fqm6Xludry9vVhvrteXaxnqjsrk536iu15er9eX5JdZPJvJk8sRqZ5HaE0LebIwH1rTASttTrM4X9RrGf4pkTeU1jpA8rB/W3YyQtSzi2BfMCD6xO/z5TQEPrBB4JmQfax9rH2sfayewLA7bbR5dYjv33lY69UYdjkYwDuUbjcjHqy1ZVuzizlQzfkXbR+O/Uxd3ThfUa+KZpnqsvT4i9KPaa965Y7M8OJun2vcRose/LT1+e7g1ReRZr8JI+cLRzrypflwRO0LccqbtOst2vt7lzcJWj2qeahY2BBv183uZX4BZ2IWjWubwN969rN44Qxu7jdHsTjvZ+nes2Znftdb3ymChEcZBv3BXWw7U7e28A9+8eoP09h5aOdP1GOPUjGOvMvzKPsuQ36Ez+m+FMvzq1t8zlB7bkZidKn5Gb+U4kemZfpQf6d/ekgl3Nij5+C2qMcBT9Wi9qfm9C/idbPFTdol+OoSxZmde1lrfKwOF6ryyS6xPbJdqtjZ297lqj5RPUbbKu11GBBbqnGctLf1Epv2G4Y0T/QeFTRStB1zuRv+RguW+M/5Ilzvqksu930s6YzcKos5UOzNOWGMCC3XO5W7p83wB1l2kr0fKHW1F2T2Xu9E/WbDcTZe7Ue6oSy732DsZWdZd7spOsDxNZ2pVa5Li0OcyH9U+qLcAYzbBqyBZ1m0TV4VN8NiH/UqR9gtnt22lvjW7/b5rl640WtPbGYXYdHQp617oMfpjIn0WwcI0MfeLU8yscuM1kenpYHa/Rn9TqDzmvkNQpmz5saFOoifgCi+wGP+pTHdP1nzkqRZ1mzxVGqumsedQdsHUQ7CVl5IQi9NnPbDsNz4LokZT3EuNqVipahr4FGmZjP7bIy1TrIeVZd2eMzaDjvKo/B+hOEw3lcOnaItp9N9ZsMW0b7vRYqIOucVUMwRIz+VRFvQ4q8FVEWc1uPeMZcD3G/aqpua+2ZWyK+eRYa+RKuc3pp9e9jdDcXkzSbexm+043OMUwlizM29rre+VwYIc5WN+2VZiZZ9l3bo7KujRHrhXjXufYiMtXgnzspUqjfiRJ+/vUH5MreypfUBbZ1yyzm7Qfwe+5Lfu6uQX2xsYAs9oGP1PCP8Uy0NsdNyvL8buHe/b29/b2h24D4B6Krq3le3FcPupE5YW96gWWb1I82LeXOEzL/xyYerVCzXaVLMMvJcf0/LIMgS+X2mQlzBvOmJ5vlb8jCOW5wuwnq8Ce2Jdc8TyfN15WF8+9nxh+KIjlmd99Hzd2dO+PPV13RHL076G9RV4T5sY1pe1Peu2Z330rEOvOGJ51sc3gn0954jl2QfgtrZo/9Po1Rnt2FN06hznTuz/z9MTTscb/wGeojP1XSA6fooOu+0HcrAy+n2Bvo0CHgY1bcRTDWp6QxWzmmrIm/3GYyy2ES7E8ybzccpHCGlfmV6tlohflunhnvGfIlmdTTL6yrR6XF4dabK0agGZV8GG5aXQYX3V9roj1jVHrEuOWJ4vq+6/wLx7tvpGeIHZ0+d4vmz/RtC956vJnnn0fIHZE8uzbl9xxPLSffibl1KHxVaHtQ/giTWs7ban7j37AJ4+2rM/May2ut9u716btt8n7w9rv0++e/a13y/cPfsaxn5hCJ76GlZbfdkRy1Nfnj7HU/dXHbE865Bn2zGsPnpY2zTPPHr2fT3L0VP3bwQ/8aoj1qccsZ50wgp/81OEg8j1tKNcnutDnvo67iRX+PuEI9a0I9Y5J6wQPG3ipJNcnroPwatue9ZHzzoU/j7rhBWCV30M4fVuX6XWNy+so45YxxyxPOsjPyk5DL7Q00eHMKx2P6x5fL23td5y7fdN9n7bEQI/Azks/QlPfXn1yUPgZyCHpa31rI+eY5hhbTs+0/TDqjliPeuI5blu5TnP5Dn/5bm/kJ+BHG19f6JVIRLv8Z1Xl8qVsk7eBxPxLhG/DPKPcXlPF6Hc6kmtQZ6BrM9tzq1UV1YWN5bmG4v11RLhm6z8bQT4h//U5eZqr3LaZ1RWK+p6A37qcQziDlLcOMTh8yb8DGSa4wirlSL6R/5lQc/PQA7yfOt7t4llz0BiG2N1e6fOIJivOd36/aGWr8HrDnZaFnv+9puELMZPHbPBaxJiFwlb2hn6rfKl+IwXzJfR7d65jUqtqF8d1nMbaZ8+rmwUabdRXtXuYNmh38FrQVQ7NZJ1+0lsI8bp26VWfVA+iC8ZLuqDguxPHe/MG5ZNKedfw+VvXB/U9Qq9Lo69drwzL5Yu75qVjzXb8UhfvaON+XwLU13uy+XHth/+xYc92N9b+omsrRN1fosvCX0J/Bs/bTRBecZ8soxoUypfIfDTRkb/KvUtEz1/JZ824r7czvc7i9+8N6xP9/b3tBFbOmoVUTn3qB2MG6VvTPf2Zufv7TxthDVPaYKfNlLPBcU8eia+jQj6g4SV1wKM5vBTJapOsRqGShfCZ5vdaWI1qF/PvVNPGaUd5VQLn1g1/lMka6qarS6BOhTR3bSQtSziMG8Yh3xil6Eh1hlHrDucsELgXs4+1j7WPtbuY6nZcp59wfbkiVa6nZpZKHJRXiK/Xy/aDvHjmaNp5Ik+nqn0mvhR51qsXVQPZat2kS9VVhcHq3Z0hOjxb0uP336ZRuAe9Sr0Af8BjcA9nn4sZ9quQ9jpepc30v/V45pn0ZG+0d8LI/1fO65lLmWdM0xqJoBnwXGGfIee+amrC4BR7nHgm1dvkN6eRipnuh5j3CGhq15l+C/7LMO8p5oOQRn+Ls3W4EoKXxKu7FTxM/rtPvPz+zBbE3vm50Cm+eU98/Oupub3B8BvCJ75qfb7zE+vGfp+Vsd62So/+4FlwH5tRPDB8ijy7Af6FMPj2cc/EfbCfSG2nTz5lN6cn/04mCNGWaTPIliYJpYlnH4p8uwHTpWwyrdka7mQ/Wc/tlfH2WWh/lA/PEWxx579sFnJkhCL02c9sOx3MM/Ysx95j78Zv7xWiL1jXqvFz35sjb5ElSjicbOs2zPFZq5QHpX/wxSH6Q7k8Ml79oNbTKM/BXmNtZjGezdaTNQht5hqxID0XB69rv7nqhh74DG2j7JXNS36lAP3FJU99fsQIMoas79pissbWd7GbrbjjG43ev2YX7aVoo/YG33RJ1PKRK9sBesu74n0spVfzVkDzsPlNVmzZ/QhiMFPcxj9ovAhhqlWcPrt0WI3i/ehqNkztUcF9yLcxm52Yya215qyV9QP22tMFyFst61Ro9oDFIddR+7m9rKrmL3iyOBagRkc606egu+O7U3hvT7Gf6dWvE5l3TqOrXjdLWQtU1wIfK7xbsHnbsFHYd10xHrBEesZR6zLjlgvDinWNUes5x2xrjhi1RyxbjhiedYhz3J8xRHroiPWS45YnnXb074865CnX30j6P45RyxPH22+0Pq22B/iZwRV3+FUhA+mP1UAS/VDjH5W0MeeZrgH0lta6/OdhzjvKcS88pgFnsZ/gKcZTH13ER0/zYDdt3tysDL6fRd9GwU8DGr6KG/7tfHNK2Y1PDgU4TM2IJ+8hUZOZ3k20+Gh+Frrd2WgsFJ4g5zx36nhwkxBvZrulPsoizie1urXtWAcN2uDYL3iiHXREeu6I9Y1R6xLjlg1R6wbjlg3HbE8dT+stvqSI9ZlRyxP+/L0OS84Yr0RdP+cI5ZnHl8cUizPun3FEctL9+FvftJhWGx1WPsAnlj77fZ+u71X2o79dnu/3d5vt1+fuh9WW33ZEctTX54+x1P3Vx2xPOuQZ7s9rD56WPsTnnn07Pt6lqOn7t8IfuJVR6xPOWGFv/la7kGwvObJw99nnbBCeLLph/W0E1b4m6+YHATrhCPWtCPWOSesEN4Iui87Yh11xDrmiOWlrxD4SvRhsFXPOhTCsNr9sObx9e4LveXabzv2ftsRAl+JPix9OU99HXfCCoGvRB+WttazPnrpa5jbDr4SfRAszzHfs45Ynms6nvMAnvMTnvtz+Ep0uxr4B1uVK+3lNCvz6iheKevkfSQR7xLxM/3hN+Q/LeQxuadE3EBXoq9vrM5vbDSq8yvV+kKlUSJ8k5W/jQD/8F/RvX6m63IaXcsr0WdAryGMQdwRihuHOJNRXYmeaC9npYj+kX9Z0POV6EXLUmG9c5tYdiW6uqxpp/bk8pXoP9ryNepK9NSyJL4kc918xp1Zd7C4u0QeLe4s0GOZcxil35inoNcvnm3jMh3LgzrneU++qSP8O5UjI8qAVzcjDV/dbPQ/CzbBVzdjGsPES4jYTgwTv6PMfHWz0f99agP5MtC11u/KgEFd3czH6fF6C76MTV3gi9+4HhwSekibx/7rAV8Hj/PcfCkvjn/5yms8KzFCcXicpERxsxB3huLOQ9wdFHcvxPEZhAsQh7bIQdVlK5eQv5+nqzcygcWXDKN++aoM1G+R23rSPKUwt+2nFEaSyBN/SgH1w3alLsEuU1wIPK4elqegPJ/2fsYR6wVHrFccsTyfzro5pHJ5PsPl+Zya5xPtdUesYX1+7nlHLM/6+JIjlqfde/pCz3L0fEbQ0+d42sRzjlieur84pHLdcMTytAnPvolnu+1ZjsPqvzzty7M+DquP9sTytK8rjlime0uH4zm8Fizx01DVtPP7lXnTlbrWEPPE8/uoq1LOv4bFcbwecCCR7mJ5i9kBzu/wVW3bfagCsRLPlW2Vaez5LuQ/HZFV5YPvuig69jf6IxG5kH5G8La0adcy2leaKB2qtYwBrjQx9T1KdDYFPJJ1m+J0DlZGvx+lb6OAh2H3prReW7bLst5uY1intBK/Dlov0pyhvHwTpqqyW0uGmXb3ByCPXAU7boSlb0+09nWUs+7qM8jroO8+2UmH+cHbT9UbO/hOxAdOdsoQexcBm3p+F+GjJ9uYH4a/7fbtQ1l3NyTv7YXNZicPo/9YC0vdAovlozDtbaNYs6WWP2IuGm3A+Kv3DvlIeq/ml5fDZvqUtSzosVngZSKUr9ynrO/dYVkPCFmnBW/21Wm2KBR/LMD4T2VJm+lqEb2GYOXQ30ulvLEMtYqonHvUDsaN0jem+9pm5+/tvFR6FOKUJvilUszT0Zx0XDP424igLxNWWaQz2Ucj6RED06m7wTldCJ9rdqeJ1aAiFh4CL2gddcQ6JrCsZuMmTMfF58WiNdv4T5GsqWr2cZKH9cO6u0PIWhZxXF/vEHzuEHwU1hlHrINOWCFwj2sfax9rH2sfa69hWRy2+ccoHba//LIr+lTukRcdhZZFet5Ihem22wcoR2RWL97h6PbHaXRrOsp7w4hfQTT6x061Mf8OvSeF7T3m/3a+mu04o0v8BkhDvQGCfYbxZqdOlD0ivb3Jotpm3qiEZXQ865Qhr4x+nsrIMPLKiN+IMfoTUEa/QGWEG+f4MFGv92OMH9vQhKBn+ZH+H8LsBb9Uien5rm1lsyjzRlPz+2UxW7J7L6hWF5VdYr+V7bJoP7eIHaPOlB3zDI16Bw51nreRfiLTs4f8DpzR/5qwiaL1gMvd6H+jYLnvjD/S5R57k0jNtMXeJFJ2wgdqQihn3TZxgLDUjDLqvEi5jwl8LvffjZS7moFFubjcjf73CpY7LrqFMAZxqcs99jKtKvfYO17HBD2Wu+msnHW30+OEFVsYDKFIuaMtcRtg9P82Uu5qVjzm543+j/aAn0ddFil3tfhZtNzZz2O584vE2NayL9ipNqDU6reoF4mPivQx+ZTenF8kLueIcYdIn0WwME0sSzjNyiq37E5kekqUVW70B4XKVTVWC2ljlKcQEu95KbzIYPynsm6TSTEVWfTpxX73U/TbLCcw9RBs9aEkxOL0WQ+sEsUpU0c8fuEQi9vS4vqtGtnzSEd5TjVyMfo7gI+ix5EJ0t8pqhdjogzYg2Nvf0LQo9sweVT+T1AcppvJ4YOtL+qLW1+jPw95jbW+xns3Wl/UIbe+JyFuVNBzeahrA/DqCp6FwmspuMpjGfC1HL1cC9cPZcdqdkGNFmKvTfUaVbL9YW/jDopTo1FlK0a3GzNFmF+2lVhdDIF1F7Mt1F05621HWK+52xDzayHEbAVnc3i28HRBXKO3Y6roQ04DrxmIR/qvFD7EMO8SMsT2U5wV9HhE1uSZIRkw7YxIh8dZb2M323FGtxv2ivllez0ndIH0rDv1WhseE2Z7xWPCd1IcroDyMVm0PyuPYH9/8UgnnccKuloNsFUEfqrLgw9ifYj44E6Ejj1op9q4qBOsRzjsuAPikf5ZmAH+cOtvtavjFKW3uG+EenjoXH560+UM/Q5/87UY2P6h/vLyifQzOflcBzm/BPUhBKyXJlfiermp6iX6Tq6XeJx/VNBzvVQ+EP2W6aycdfstHq6qXTRos+zTTYcTmS4jwxsn+qcjo3o8Qn+aZB/tU3Z1jYY6xl+GfHxfy1hmsu42iq8iVW2gKis123I6B2tEyI/1mst9NNPtKdObTYxluu3ja0OM/gaU1ZFzGjPLkaGcI/NEDv2dJIPRvxwZMyk/gfZ/nDCNvgmYdkVOUcy8a3c+22dfJbZi06uvYvIoO+W+CsrO7eZdwJ9pjxB/jEM7Z75ZRF41exeTl9sji/ur0J59vvX3JOE5+/L5WFneL/JTtCzLkfwzlqUby7rtNVaHUF9/6ZTGHO8T87tEn0D1dT7abPP+qzn9mRC4PxMC+230Kdg//ECkT8N9BWtjvq/g/IRhJe0rVBsV1VfA44PcV1C7d5G+yOoA1kNrA1R7xf17nJ/gK1sPCz5F22K83mp6uhO3Vxv/Lc1M5jevr3wU4pH+b0f8uJojielcjfNxroPrPur8JMUpmx42e43tponpIoR+59PYXrHvyXMkaK98Na1X3/HPW4YwI2Q1njMRWWM+8ZTIt9GfARkUPfZnkP6XIv0q1beLzQX2GodMUf5xDoCvxIvNFYXwrmZnfoz+nxT051Yuieebq6p+oF65fsR0GMJ257PKRI/6Vzs/uK+G9nmKZFB1umjdsbTBbn/5cCfuoYK47JfRZvBaPvb1Rv+bEV+v8hbz9b38lcmj5rxPUZya7x02W8b8si3HfFgIrLszgh77oOzr0X/wyQ1lr8r+rDyC/f0Y2Z/qK8X8X2xHnvJ/ZSG/6gPwqbJjET4ol1o6RjvidKWcf40Pf4vNbfC5xOOR/Ci9HS+YH95Fe9wxP0pmdRIM52r/hMY2VjfRJ2FabseM/vjpNuaf0rhG7Wrv16Z4rvU46ED5WjvHuos7t+XaLfpn9j8xX2x5RfpefS72MWrtqpR1l7GyaWwTb9M02+l3xp9Xku84PhXRAepI9d3LFIf2yn3lXmeqY/0PSxvq2cuHe8tfjuS3l/0YL9W+87qjGhsoWzG63Wj7Y2sYsbY8BNadGmtg+862guOKkxQXm2NX/Tnlj9kG0H9jufFam9FfaDFWfcpe81399ot4jgBt5wzFqfHosPUph8WueN0MfVe/dsU+CNsLHANZ/6HXmB/b6ZNCZisnhXOScDgPU/Ad0/EpEO7LM3benMZEDj3P8xv9l0FdOh6pSwqT53nO9JAhb57kLwgZVJ3ia+SVXag+SFmkP5mTjnUf26cwmXXb/G5svTX+U5m20zUfeaoxP6HGnjwng2ljbU1avfZ/tT+PcXGeB22Kwyj9xjwFWz96ro3LdCwP2ifueRomPZ2kOJw/s1PAFof7o2yvznZ0eH8fOsR6YXLvpp85LWQ8LfIwrH7mdBp5qv32R14vfuY0xe37mb3pZ7BexHQYwlrr38qAQc3ZsP/AOuBXfnPVov7D+E9l3baWwn+o8Yny25NZt4056qcS1kbUPMyM0A3LcYZkTG0/sX7usNlP6n6ush/Vz91J+8mbF+1lP2ofG68V9LvfEtNz26X6MUXKWfFRMvfa1/350+00qAe1VyUEXisw+u+BtYLvbP2t1gN4jpF9m8l8O8/NdtwOzUfPD/P6Ymw+mtfDvfaSvO2wlr8EuHeItOwbkP6MkMPoeW8u06B9Iv33w9wIPyuobBrl4vlTo/+ByPyp2iMRW9fpdx+tOpuizvygP7mN3WzH7cyZn7nqbp/54XqBZ374lkOufyHgfDvbr5L11ACycjljWd5NWGr/EeaH7dbof0bYrbIP0/lu2Eds/5HSeWz/US+d8xgX9XwXxan9xjHfXXSPMM75fp7aR/SfvKeu35vo1FkN3lf6j8A++MyB2quKYz5u/7dusor4SpWH2PnIXufJTR61p+BEJB2uE08KXmutfyuVzYGC8bP24ICQBc+yI+2vgh6/5ayWtdQl72BBnSsukZ7SjEHnKiXil2V6TIPrQsoe1lzkaY9p1FymqnemnzRjrOomjmnQztXaHcth9qL2JeEY4J/TGED5ALVXnH3A/w5jgN/Jwcwy7Vdid2ng+e+/MdWJ633ePbZfide4Md0RisMy4fFjr/V83iNq9P8KfEPsTKnJlXbf/eau78XkPRfYN+J1X2V/aAs8DjEdTmS6jPheFaP/d2KN1uTDtWte15/uU/a8fVxcV7HucD0vej6mRPKj3SKGnXvh27P+PNI3UPum0C+wTahxrToDFHs3Q+1hxPmS29jNdpzR7cY+FMwv1yd17iq2h2eQc1dHKA7t1Xj2Okf1fCsC4+3fcK5rrfW70meYW1lZWp3bqCws12ub9YX5Y4SPujiUgH9tY2ljobFRW6ouLM0vVOo7zX9hcX25tr5cra4uVBsL1cUdz//i0kbtlhCVRjX8nNtp/nP1eqO6UF1eXWksLNRXe+Y/1LMnWkKYzeKeektnfTs8V+jY16yVhJyq72v8p0hWZ3mqsXZBnTlI/CTgRonwUZ5poR8ryyMijtsbbMOQfhryyG0EtlXj9O3RnLY+BL5dXt2mid9Mv8Fn3n+mk5/ZxcqZNs3jtBcMbYf3aJQEb1VPyjnpQ1DXLPI9MuMQx3fZTETiDkTiDop8WdwkpPswpZsSmEGGz5zppMN+Rynn3yyLr8XEbHYEvvGLRminPF440gPrvYSF6Xm/5EwPLH6FQD0byesPmE6dTWF/ivNijv6iXtSfGv9he+fL9HM0jTy1WL/xqNAPn8fgsgv/qfOOSH8U8oj0+Lelx29fT/4U+67sT4ueRQt1/h1U57Fstlvny1m3bvjVLkyHcy/vzxkPoT4xLb9+YfT/NbQHH6L2QL1Qljr/7J8POfJBLNNlzBawrpn+1L1gxygd2irXSWXr6mySwjeMXrbROKPzpmwDefG83LeDbXwi0leIjY/5zDD3QVFO5e+wzKwM2B9NCHrE4/u7LrXyovbk491IRfYxGP0VwOS5CuU3se3sd7zN+sY88xzQiMBSa08xnWL9NDzW6Q2hU7XfgPeUYl/Q7tnhvmD4m/vq+CYu71nBu5z5KXe+BxnjJiGO/XDeuWvuC2K9GMvJK8qoZJ6iOLSPcYpDHfELTah3fi8Z9Wf5xnd8Yz4jhLzXlL4jUg+Un1P9GaPvdT+vydPv/bxcf3BNiMct6u5olOtjzXY80v8l0ENszn2H7gOu7fbd0aaz2F03Mf+HOs+7O2Mii6/fcl/x+yI+C33eCZL9UJ+yl4Tsyl/gnHsj0hfjdvNohCenZT799Ad+KNJuqv4nysXtptH/aMRfKF3G2s1ed1jw3a7qTiXVv8O+723sZjdm4vpb3+0Xtsw+yll3/eLxPdadIufdi9YPPO9u4x/vOeGN+lKtsjpfra+vL1eWl1b2xpxwrfAe7zfmnHCtUiJ8lEfNCZs8R5LIU5lXe714zhn9sOqL85wz+iz0vdxX/yL1WdU4n++dC4HnT1RdVv25ncZS40jUG77m9I9JF2ivpZx/DZe/sYxYnjs9r6HqU/hvrfW7MlCYn+M1E5TReKeZH11cLurrjP9UlrQuV2M2rNZnVN3Pa0NDeLLZputl38hHYb00pFiXHbGec8S64Yjlqa9rjljPO2JdccSqOWJ55vEFRyxPuZ5xxPKsj57leMkRy7MOveiI5VmOnrb6iiOWp33ddMRqOmJ52v2w+hzPPL7qiFV3xPqMI5anvjz7Jp72Naz9Qk+7H9a+3EVHrOuOWG+Evtyw2r1n32S/TesPa1j7csPqCz37cp6+0LMcPfU1rP2vhiPWsPa/nnXE8qzbnnXIU1+e7ZBnHRpW3Xv6L895uWGdG/K0L8++77D2MYex7Qh/85qVR9sxk4ONf8fWhhWfkpBZrSnjnpXEZxnmDf9YInzLd+wMKfKPnevgfw2L44zXTp27UHmLrUWrvUIxrKN9YiU+3zEfq2eoa+M/HZFV5WPaUSfjjlgThDUusNT6bRF9Ib3yPTtUtnMlyivKirZq/A9DHq5fe+rpp67deGtj4/qT7770ZEZhlNRh6vsg0dkRr5GsW+3TOVgZ/f4gfRsFPAwzmTYTJafx5W8xN5+3/ToDukmRT+8iRX6Wj4xkNf5TQicp3OZEQb2a7qaFrGWKC+Gbmp3pkA/rPM32sbnVojo3/lNZUhuoxrosqB/WuTqyXM66Xd3TzTYdx8Vco8K66oh1zRHrRUesmiPWM45YLzhiPe+I9ZIj1k1HrIuOWJ7l6KkvT1u95IjlaauXHbGG1U941kdP3Q+rrb7siOVpE5626qmvG45Ynj7asw/wiiOWZ9vhWYeG1b7eCP4rRTukrqfB4/+TdDWvHTvGYyT8HJ/FI/233dXGPExHz0rA2/6eJLxS5joGK3ztlfGfIll95WmPwUZIHtYPj8FGhaxligvhk802HceNim8xrBccsV52xHreEeuSI1bNEesVR6yLjljXHbGuOWINazl62qpnffSU6xlHrMuOWC86YnnaxLOOWJ42cdMRy1Nfnv7LU66XHLE8y9FTrmFtOzzL0VP3nnXbM4+vOmLVHbE+44j1Rmi3Pet2irbW1lJxPMfXpI9CHF/1htddIQbGoXxjEfkw/VhOOs5H4nXYquEfTIO/tS3jgNAV5omv/VJr0vyvYXGc8dqpNWOVt9haPF6Txts3FNaBPrEmRVyKMo2tlSP/6YisKh9jpBNVz0pCJ/b9YEQupJ8RvC2t6RCv03PUYXRLC9ZF4z/AlhZT36NEZ7cUqS0tB3KwMvr9KH0bzeJbWrCacrFxtc4r5nJO+hCmI3zUTYSWv0OZbir4pkU1TTYSkfGgkGMmIv92+RTRq5o6DWGz2Y5H+v+8NV2Kt5qNCn6IxTrOgNaqFDd1a63flcHCfIn4mbwZyWv8pzJtD2s+8lRj7kuVpXKTlla5Sa6bgzQdph9VT3kbWr/1VG1jmxR5cNT9srpR34K6RZW3xKHbR/vgMEq/MU8B/2gfL8KjzrkZGhY9sZ/Flwf4Fnz0C/ZCwnZ0eH8fOoz5bqNXLzeEYDf3sh+0GwvTlsXcurpNmOvLeCLeRX1n7OZe9qsct7ZNWTdW65u1jbnNhc25zY16Y6v7WXQLbMw/qm2GaYdEcyvqBk7sKocwBnHjFDcOcSZj+PcRkj9N939upYj+kX9Z0PNtd0XL8lim+xAhbN2s2QQs4BPCgdbvMUiH9LiMjPT/Iywj/yO6CXlc8At0vx6hK+X8extDfBtrdn6bbHbTjza76be28ja7ZbS4QxCHthXC4dZv1BdimRzjRP/FVt6tTA5CGktfFvwPEv8OucU3bpsPCfpDgj6Uz//cktHaKcy7dz/wNk/Cx28sm9lOkhfTNpfXlzaXK4tz9YXGXH19p18sa2wsrC5vrNYWK/XKanV1fju306o2smhd4v4pYn1j87V/Ux9/UD4688OvFjnakaZ929ws2pcw/js1TVd0Wijt1M9mA181Rv+lpkNZjgMk41QiGVUfBadoQxiDOJMj0Hz7uU4Z04yvNxtp6+hmnbc6hYBb1P6QtqhZ2ajX41EP40T/76Fv8e+g3TRcS29+Cueq1FyB/bbyGhG0PPbnvqLSK9KbTU7k5HWC8mr0/x/MKU2f0ZioP5RrJAezdLaNybfv4xi0yBjhkKDHOmbyzGTddfMQpUPZcZzM31T5lIiW22BrpzBd3u9JgZMnw0GBw+0kYzJPtocQbK5ZbR+0tFinsM1PPG+4qNpKC+qlmRLFYd7f32zTcVDzHJankN/fpvEC0rE8qq559o3s+zh8Z76jRDtBtGreb9DlPZRRzS/yscoDEflLhBN72Yjro/q3qLwlIa9qawblg1gfaL72b9o2s7qh5v+xzXzobJtvXpup+kTcZj5+to35aOvvXm2mxXG/N4QPNtvfuE3gfiBihPDOZie9+dgJwEeag5Qno5+DdmyabvQ/IPgF/AXSJ2LH2qFxon8/6HOZ9In6Mn2q9i+vzeL2OgRrv1gHXwlyfMXZfF6m1+lIHgPGV53VdCgD0jHGdttF1T/jul2kf8Z1GdMpHuMUN2j5jGTxPoTZ2KEe8dh/KdIXmhL5zft9KAdb4aqlftWOTFJcScSxD8P8ov/jvg/6F+z7PBSpd3llp+zzYET2KcJUY+IDEdmV/tAPec8VVVYq1UpteXFzs1pfWt9Y2PG5qoX5jc3q5q35qvnNyvxKdaf5L65X5hoL1Y2NxWpjfXV1s5+5MrOjCZLF/sbyxO/Yh7L1MW5/n2qVd+LtY5VjQp/s/2LjVMyfWvN5Iid/n4N26OLZ3vyULy5RXGwvCPoULiP000XyYPTXxLg4tvaU+PW3BfX6G7YV483OfMfG4iFwPy32ShfqrEz07PvxN2KhzrnPh35czZ8YHtvZp6GM+PVG5bfVvCH7+1HBN9ZXCXL+NarPiea93fYboA7YllAH/FIV64CDGqObLoJcX4D+JNNZUH6CfYGa14r1t1W9xe2eIYxBXOp6i/0srreq/4f0VnfKWXe5sb2qfpeqA3n9ZcUPyx/7MFYH8tac0CfgmPZ7aQyGY1Y158j+2uh/Ctqcv0ltDvonthflZ1iWLIvveYjNpRS5sirRVuPFEvGzfOA35L9TV1YV3fKduH+0YPJMCnlUOYe1pyNZd5mp9SacR/yG5mv/xq6mi415Y75N1XX2A2pOSLV3sbG58cb1kyJ9R1WPuZ4j/X8P9fhXIn3HItvWVRnGylztaVTlwvMUqs2N+fODEbl6raHE5ij4RUler4jlIWZ3qn+9i23qompTMe/cphZ9gdbo1ZV6qr/LVxWizlW95L4m8j1EcUXrJfZDfyWnLcV8oJ/l+QlVP7GNxna9RLIgD5y/+eZmJ/044Ko5a7yqBOl/Q/T1GdN8TQgfb3Zjssz4HfXC43aj++cgw1+HfbWsB27fE+3NqJeIX5Zl0X2nU0IfKdp3Nf5TR/sSj5dqsXqg+n1qno7b6l5rBLyOp+YWLT1++1ct2+LzBSHwfs+iZxWCLP8HzeGnWjvEdgH9VwjY3/+/yUepq4kwrfkProt/BP2EP4ysYZmMh7K4z1J7Tdh+8vZrsM8y+j+J+Cw1zkG5Pt7UmH8a2a+h7EKVH9sy0qs9Mar/xfOIypeqPoLRJe4j1FUfAfXDfYRec/n99h/NPspEj3pU9YjnQGO2GkJsb4ilxXrnPsdfrVY3lxY2VpZqc5XNem2n5/iXFpaqKyvrK7Wl2ubqQm2jnzn+mI5LQsczER0X7Q8xVimCNd4D672ElVcHOd0O9U8WSsTP8pFl8f5Jmj2P8f5J7Eyh6iuURRyPgfudP1Jznh5Y3DYjdl7dUGN21FGW6f4O6vbrm518Y/upE82BFbbBYb32QM3r83gQ2y7uK6p2Tc0/7BSWaovZFhLN9xWeD+W99Ylss9pv30Ot4/CcAvZLuPxUn2VS8NkrWOh/YvPsRcpd8YmNEVONo/Ku/fDgg1g2JmP/4sEHsT5EfMaEDEHP7znXxsUyzhsf8TqQ0T93ro35Dec6aUz29wHNN9N5C8yzY11fVWt/FtQaLNs1rsGyLeLcJNsPzk3yNUF4tTDuiecwSr9RTwHz+wqcMUddq75v3l0h3Ce2wHN0Rl+j8uQ912ut35UBg9pbY7zeSLa0HXv5jQL2omxkguJGRD7UGI37S6qfrXxxnv9EfOXz7C6EEtFmWf9jQkuL81cx34jY7BtvgN/7NvK3ap1K+Xj73mudKrbX2dKmPYdX2VBrQxaUvXM9QXvnenIE4rie4It57HPLEIc64aDqEJ4TLOpzvy2nXTUeWFYh8HxS3lrTe8DP3v7WbNM5luHWU2fjzbbMppuxZlvuCZA7BDwzb3Qm62QaWSsmq52xx/UovHPA8jJC9Pz3OH37ApQl5hH9BOYb62wI6nw/3ntgMqq7IA41+8M6SFgHBsAyudSdBwe2KZfCmiAsdU8EfsN1ls+3yibJPur65uZqY7leWa9trDY2h2Yf8w9QX+v1to/570N7+UPnevMbxn3MP9aSe38fc6fOhmkf889CGe3mPuYvUX3e38fcpsF9zP2MX/b3Mes5vWHdx/wlaMf72cf8z6ifvd19zH8Ibc6/oDZnfx9zZz7wG/Lf38ccL+f9fczp9zH/MdTjI3d35n9/H/P+PubK/j7m3H6o1ZdY+7WdfczWRv//PlRXOowHBQA=",
2117
+ "debug_symbols": "tb3fjuy4lWf9LnXdFyK5/9GvMhg03D2egQHDbri7P+BDo999glsiV+SpSaYyIn3jWq46Zy+FRP4kURT1X7/9rz/9y3/+n3/+81//99/+/bc//I//+u1f/v7nv/zlz//nn//yt3/943/8+W9/ffzb//rtGP9TavntD+2fHv+sv/1Bxz/bb3/w8U/57Q99/FN/+0MpA+wB459+/TOuf/bHP0eFdkwoE+qENkEm6ASb4BNiwqwss7LMyjIry6wss7LMyjIry6wss7LMyjor66yss7LOyjor66yss7LOyjor66xss7LNyjYr26xss7LNyjYr26xss7LNyj4r+6zss7LPyj4r+6zss7LPyj4r+6wcs3LMyjErx6wcs3LMyjErx6wcs3LMyn1UHs2qlwl1QpsgE3SCTfAJMaGfUI9jQpkwKseANkEm6ASb4BMelWsZ8KhcHz2hlmNCmVAntAky4VG59gE2wSfEhEfldjygHhPKhFG5DWgTZMKjcrMBNsEnxIR+weiDJ5QJdUKbIBNm5TYrt1m5zcqjD7axf0YfPKFMqBPaBJmgE2yCT4gJs7LOyjor66yss7LOyjor66yss7LOyjor26xss7LNyjYr26xss7LNyqMPyjg6ow+e0C8YffCEMqFOaBNkgk6wCbOyz8o+K8esHLNyzMoxK8esHLNyzMoxK8esHLNyn5X7rNxn5T4r91m5z8p9Vu6zcp+V+1W5HceEMqFOaBNkgk6wCT4hJszKZVYus3KZlcusXGblMiuXWbnMymVWLrNynZXrrFxn5Tor11m5zsqjD0ob4BNiQr9g9METyoQ6oU2QCTphVm6zcpuV26w8+qDYgDKhTrh6dxOZoBNsgk+ICVduND0mlAl1wqyss7LOyjorjz4oPiAm9AtGHzyhTKgT2gSZoBNswqxss7LNyj4rjz6o4+iMPnhCu2B0opGibXQiLQMeCs1/YxN8QkzoF4wuc0KZUCe0CTJhVu6zcp+V+6zcr8pyHBPKhDqhTZAJOsEm+ISYMCuXWbnMymVWLrNymZXLrFxm5TIrl1m5zMp1Vq6zcp2V66xcZ+U6K9dZuc7KdVaus3Kbldus3GblNiu3WbnNym1WbrPy6DJqA/oFo8ucUCbUCW3Co7IdA3SCTfAJj8pWBvQLRpcxGVAm1AltgkzQCTbBJ8SEfoHNyjYr26xss/LoMqYDdIJN8AkxoV8wuoz5gDKhThjX/eOXjtPWCTrBJviEmPCo7GN7xmnrhDKhThiVh32ctk7QCWPDHqdaGR3Nx7EY3crz3zz+cIz9PLrVCTbBJ8SEfoKObhU6oEyoE9qEUdkG6IRRuQ/wCTGhXzC61QllwqNybwPaBJmgEx6VuwzwCY/KfWzG6FYJo1udUCaMykMxutUJMkEn2ASfMK6Nj2HNW7KkvCc7qSwa18fH2Ja8LTtJFg2BD7AJfsHoOSfk3xtbmvdYRwwaF9J1QG7G2KC8y0rK26yTyqK6qC2SRbrIFvmi5dDlsOWw5bC1oXmrVY5BusgW+aJYNCqXsUvyhuuksqguaotkUTrGbsnbrpN8USxKx9jSvPU6qSwajjq2Je++TpJFw1HHHs8bsHGW07wDG/cjmrdgJ/VJeRN2UllUF+Ud3qicN2In6SJb5ItiUb/I8nbspLKoLmqLZJEuskW+KBYtR0mHDCqL6qK2SBbpoqxng/qkeiwqi+qiNukcxfBBsigrP46lncMNfZAvikV90jnkkFQW1UVtkSzSRcuhy6HLocthy2HLYcuRPWBczlq2dimDxt+VR2uybO0nlUXj745LUMvWfpIs0kW2yBfFoj4pW/tJZdFyxHLEcsRyxHLEcsRyZMuWcaSzFYsOyv2X/9UW+aJY1C/ysxUnZT0bVBfl9vkgWaSLclseLcKzdUofVBfl8a2Dxt8dF6merfMkW+SLRr1x6erZYpOyxZ40HDrqZYs9qS1ajrocdTnqcuSp46R5jLwdi8qiuqgtkkW6yBb5oli0HLIcshyyHLIcshyyHNm3xpH27EfjSPvZj8Z/PftRkizSRbbIF8U8vtmPkrIf5VHNfnRSXaTzSJ/9aBzfsx8NOofpxlHIfpR7N/vRSW3ROkbZj/KoZj86yRfFPKrZj5KyH520HLEcsRyxHDHbQWQrVhkki3RRboEN8kWxqE/KLD6pLKqL2iJZpIuWoyxHtvZxxR3Z2pOytZ9UFtVFbdFwjKvjyNZ+ki3yRenQQX1StvaT0jG2JVv7SW1ROnyQLrJFvigdj7YR2bKtD6qL2iJZlKOeZVAOe9ZBOe7ZBsWiPinPJCfl2Of4bdkDTmqLZFE6xu/Idj8utCPbvY8tyHY/LqMj232Mv5Ht/qS6qC2SRbrIFuXY6tin2T9OSsewZf84qSyqi9oiWTQc47I6sn+c5Iti0XCMi+3I/nFSWTQc4zI7sn+cJIvSMY5gnmfGhXXkeeakWNQn5VXVSWXRGM49RpscV1UXySJdZIt8USzqF/VxPrqoLKqL2iJZpItsUTrqoFjUJ2VPHrdDPXvySXVRWySLdFE6dJAvikV9Uj0WlUV1UVski3TRctTlqMtRl6NlvbFVrS2SRbrIFvmiWNQnybGoLFoOWQ5ZDlkOWQ5ZDlkOWQ5dDl0OXQ5dDl0OXQ5dDl0OXQ5dDlsOWw5bDlsOWw5bDlsOWw5bDlsOXw5fDl8OXw5fDl8OXw5fDl8OX45YjliOWI5YjliOWI5YjliOWI5Yjr4cfTn6cvTl6MvRl6MvR1+Ovhx9OspxHGABK9hAARU00MEAsRVsBVvBVrAVbAVbwVawFWwFW8VWsVVsFVvFVrFVbBVbxVaxNWwNW8PWsDVsDVvD1rA1bA2bYBNsgu3MBE8UUEEDHYyFZx60xAJWsIECKmiggwH2hYbNsBk2w2bYDJthM2yGzbA5Nsfm2BybY3Nsjs2xOTbHFtgCW2ALbIEtsAW2wBbYAlvH1rF1bB1bx9axdWwdW8fWl60cB1jACjZQQAUNdDBAbAVbwVawFWwFW8FWsBVsBVvBVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bA1bw9awNWwNW8Mm2ASbYBNsgk2wCTbBJtgEG1lSyJJCluRElzqGPEtOdZmo4LDlHKCc8DIxwL4ws+TCAg5bTgTJyS8TBUxbTTTQwbRZYl+YWXJhASvYQAEVNNBBbI4tsAW2zJKiiQ0UUEEDHUxbJPaFmSUXFjDr9sRRoeYRyny4sE/MqTF1jBCXnBwzsYJje8fAcckpMhMVNDBtkhhgX5j5cGHWzdlk2eerJToYYP7i/GvZ5y8sYAUbKKCCBqYtZ7Jln7+wL8w+f2EBK9hAARU0EFvD1rAJNsEm2LLP10jMujn5Lnv3hQH2hdm7LyxgBRsooILYFJtiU2yGzbAZNsNm2AybYTNshs2wOTbH5tgcm2NzbI7NsTk2xxbYAltgC2yBLbAFtsAW2AJbx9axdWwdW8fWsXVsHVvH1petHQdYwAo2UEAFDXQwQGwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsJEljSxpZEkjSxpZktOA6njYVnIiUB0j5CWnAk0UUEEDHQywL8wsubCA2AybYTNshs2wZZaMZ30lpwpdmFlyYQEr2MC0lcRhG4/AHmiggwH2hZklFxawgg0UEFtgC2yBLbNE8hdnakhueuZD00QDs0IkBtgn5mykiQWsYE54rYkCKmjgsI3pOCVnJ03sC8+JtZJYwAqmTRMFVNDAtFli2nJ7Mwm0J1awgQKOuuMBQsm5SnXM7ik5W+lxOkscdS23LJPgxEyCCws4bJZblklwoYAKps0TU5Gbk93fc3Oy+3vu1Oz+nn8tu/+FDRRQQQMdHDbPfZbd/8Ts89mMcibTxAYKqKCBDgbYF2af9zxC2ecvrGD+oNwP2ecvVNBABwPsC7PPX1jACmJzbNnnI/d69vkLHQywL8w+f+GwRe7U7PMXNlDAtGUjyD5/oYNpyy3LPt+zaeT1w4XD1rPRZhJcOGw9NyevHy5U0EAHA+wTc1rVxAJWsIECKmiggwFiK9gKtoKtYCvYCraCrWAr2Aq2iq1iq9gqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYMkDGg7DH7fwBFrCC6zykIqCCBjoY4Drr5SyviQXMXyGJWSHFmQ/jiVvJKVwXZj5cWMAKNlDA3A+jO+VcrWs/OL/Y+cXZ5y8UMPevJxroYIAczcAWHM3gaAZHMziawdHMPn9uQ/b5CwPkaJ59Prfh7PMnVhAbfV7p80qfV/q80ueVPm/Hajt2FLCCDZS5DXYoaKBTN0Bs9Hmjzxt93ujzVtZxs7PPn2igg+u42dnnE+sBYqPPG33e6PNGnzf6vNHnjT5vdR03a+zJxp5s7MnGnjz7fCQqmLae6GCAfWG+qHPkNuSrOhdWsIECKmigg+OlgRwxzMlsF2afH7PjSk5dO3thzl1rYzppyclrEw10kCOkHCHjCFkBK9hAWp9xhIwjZBwh4wgZrY/UMKc9OO3BaQ+ev0ITHQww907uh8hjkVsWBaxgAwVU0EAHY+E5epCt5Bw9OLGBAipooIMB9ol+jh6cWMAKNlBABQ10MEBsBVvBVrAVbAVbwVawFWwFW8FWsVVsFVvFVrFVbBVbxVaxVWwNW8PWsDVsDVvD1rA1bA1bwybYBJtgY8zRBZtgE2yCTbAJNsWm2BSbYlNsik2xKTbFptgMm2EzbIbNsBk2w2bYDJthc2yOzbE5Nsfm2BybY3Nsji2wBbbAFtgCW2ALbIEtsAW2jo0scbLEyRInS5wscbLEyRInS5wsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS4IsCbIkyJIgS3JCZDtONNDBAPvEnBU5sYAVbKCAChroYIDYCraCrWAr2Aq2M0s00cC09cQA+8JziYATC1jBBg5bPmjP6ZITDRy2fI6eMyYn9oW5bEA+7O+5cMCFFczjZokCKmiggwH2hWeWnFjACuYT3fxtmRoX5q9oiQH2hfkS84X5K3JX54vMFzYw91na8g7lQgPTJokB9oVnauTeOVPjxAo2UEAFDXQwwPUsP2dRtmstjAYKmL8im1zeoVzoYP6K3JN5h3Ji3qGcirxDubCCw1azGeUdyoUKGuhggH1hT1s2uV7ACjZQQAXzzZLc9HxdZ4wr15xKmW9J1JxKObGCDRRQQQP9eqmiHucbDyf2heUA56sn9Tjf8TmxgQIqaKCDAfaFdR75mpMmJwo4j3w9qoEOziNfj9oXtnnka06anFjBeeRrTpqcqKCBDgbYF8o88jUnTU6sYAMFVHAe+Qdy5JUjrxx55cgrR1458sqRV468cuSVI68ceePIG0feOPLGkTeOvHHkjSNvHHnjyBtHPvt8rgGTcyInCqhgHovcJdnnLwywLzzfvstffL5+d2IFGyigggY6GAtH7x5Plepxdu5sh2fnPlFABQ10cPyIljs9T/6JOflxYgGHbTwHrjn5caKAwzYe89ac/DjRwbRZYtpGH8vJj228PFlz8uPECjZQQAWHLZdNycmPEwPsC/Pkf2EBK9hAARXEVrFVbBVbw5ZBILknMwgubGDacu9kEFxooIMB9oUZBJq2DIILK9jAYcuumZMfJxo4bJoHNi8J9FT0hXlJcGEBK9hAARU0MG3ZHvKS4MK0jZaakx8nFrCCw2a56bnu0IUKGuhggH3huJGYOGyWRyhD48K05d7J0LhQQQMd7OdSKTUnPDbLbpEXBxdWsIECpiF3Tl4cXOhggH1hXhxcOGye25D5cWEDBRw2zx+c+XGhg8Pm+dMyPxJzcuTEtGli2iwxbZ4ooIIGOhgLMykiqS5qi2SRLrJJ2YH9RAcDzB03aK35xaJfrPrFsl+s+3Uu8zUedtdrWa8jsZxrCdU6VxWqOSvxosffztNSLu51kS3yRbGoTzpX+CqJBcydUhMbKODYzMhDdK7kJYkFHNt5UhZI2bmg14kKGuhgzF1ia3f62p2+dqev3elrd2bnOXdinlvPnZhdJvIPZJe5MH9qNorsMhfmlubRzIW8zn9pi3xRLOqTcjWvk7Jibkh2gJ4bkmsPnRSL+kXnil09qSyqi9oiWaSLUlISHRy7cjwhqTkV8MI8b144NnM85Ko5va+NR8I1p/dNHL8ykvrcMTm7b2IBK5hlNVFABW3u8JzdNzFAbA1bw9awNWwNW8PWsDVsDVvDJtgEm2A7F9Y7Ua6mfq7rlc33XNnrQgcD7AvzNNVzE7IzXVjAei3rdq7LdZIs0kW2yBfFoj5pLZHX1hp5bS2S19YqeW0tk9fWOnltLZTX1kp5bS2V19ZaeTnPrvVsldnbLqxgarKBnovmnZii3JvnwnknOhhgX3guoHdiASvYQAGxdWwdW8d2Lqk3Dpici+qdWMAKNlDAtFmigQ7GuZpczSl5J+UyeyeVRXVRW5QVPTG3dLRNOZfS64kFrGADx5aOUama8+4mGuhggMOWlKvrnTRcY/yq5qy7iQ0UUEEDHQywL8wF9y7EJtgEm2ATbIItz5Elj0GeJC/sC/UAC1jBYcub85yLN1FBA4ct771zLt7EvjAX5stb65yLN7GCacvjnjlwoYIGpk0S05bbmx2/ZnPJnn9hAwXMutmesvfniqk5605abm/2/7zLy1l3F+ZymRcWMNtublkmwIUCKjhsLftOdvu84cupdnKtUzoUmTc51U7OrpDd/sIGCqiggQ4OW2Z6TrU7MefXSV425fy6iQ0UMBWWaKCDAa7+queimicWsIINFFBBA3PTxz7LmXQTC5i/Iv9s5sCFAuav6IkG5hXlkRhgX5hBkPcpOZNuYgUbKKCCBqatJgbYF2YSXFjACrZ5IaPnaTl/RZ6W88og58xN7Avz0vjCAlawgTKvIvRcBvdEAx2MeSWo55k/8Tzzn1jACjZQQAUN7PMCOGfdSd6H56y7iRVsoIAKGpjHIvdk9vkL+8Ls8xeWeeWt5zX2iQ0UUEEDHQxwXdHn/DrRPADZ0S8UMH9FdrLs6Bc6mL8iD0t29MScXyc5LJDz6yZWMG09UUAFDXQwwL4w+/yY5F5zft3ECjZQQAVt3nflTLrzyOdMuvO45Uy6iRVsoIAKGriOvNUA15G3doDryFurYAMFVNBABwNcRz6nuUkOpeQ0t4kFzN2Xm5On5gsFzN1niQaOn2l5jPPUfGFfeK6Zm9twrpp7YgUbKKCCBjoYYF/o2BybY3Nsjs2xObbspjkwk9PcJIdgcpqb5GBLTnObqKCBub2aGGBfeN75nljAtOXuy256oYAKGuhggH1iTn6bWMAKNlBABQ1MmycG2BdmN72wgBVMW08UUBdmL7xw/IFsyjlfbWJujiU6GODYnByByflqEws4NieTIOerTUybJio4bHlKyvlqknezOV9N8gyZ89UuzHNsjhDkfLWJFWyggAoa6OCw5ak556tJnk1zvpr0/MXZpXtuWXbevHfMmWkTDXQwwL4wO++FMsZbcq+PvjnRQAcD7AtH35yYxUbPyglieuSxGCfAiRVsYP613A+59PWFBjoYYF+Yi2BfWMAKNhBbx9axdWwdW1+2nCA2sYAVbKCAChroYIDYCraCrWAr2Aq2gq1gK9gKtoKtYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hk2wCTbBJtgEm2ATbIJNsAk2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2FzbI7NsTk2x+bYHJtjc2yOLbAFtsAW2MiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmyJMiSIEuCLAmypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJP6NCE/vCMypOLGAFGyigggY6iE2wKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2AybY3Nsjs2xOTbH5tgcm2NzbIEtsAW2wBbYAltgC2yBLbB1bB1bx9axdWwdW8fWsXVsfdracRxgASvYQAEVNNDBALEVbAVbwVawFWwFW8FWsBVsBVvFVrFVbBVbxVaxVWwVW8VWsTVsDVvD1rA1bA1bw9awNWwNm2ATbIJNsAk2wSbYBJtgE2yKTbEpNsWm2BSbYlNsik2xGTbDZtjOqPBEBwPMqRx14BkVkTiKjXmyLSeT6ZjP2o5z2ocNzI4+Zgm2nCA2sYINFFBBAx0MsC/s2Dq2jq1j69g6to6tY+vY+rLlvLGJBaxgAwVU0EAHAxy28RSm5byxiQWsYAMFVNBAB4dtPMdpOW/swuzoF6atJlawgQIqaKCDAfaF2dEvxNawNWwNW3bT/CZTzu/S8dSo5fwuHU+NWs7vmuhggH1hdsgLC1jBBgqITbEpNsWm2AybYTNshs2wGTbDZtgMm2FzbI7NsTk2x+bYHJtjy5P7eOjWzqleJ2afv7CAFWyggAoa6CC2wNaxdWzZ58czwJZzvSYKmHVHJ6vnB7SOxFFhPCRs9fyI1okNFFBBAx0MsC88P6p1IraCrWA7P65VExU00MEA+8LzQ1snFrCCDcRWsVVsFVvFVrGdH9+SxAJWsIECKmiggwH2hYJNsAk2wSbYBJtgyyQYz25bzibT/BhdzibTlq0k+/yFChroYIB9Yfb5CwtYQWyGzbAZtuzz46lyy6lnE/vC7PMXFrCCo65kO8t+LHkIsx+fmP34wlHh+khhBRsooIIGOhhgX5j9+EJsHVv2Y8kjlP34QgXT5okOpi1/cZ67xzPhlrPWNL/il9PWJlZw2PJDezlzbeKwjadGLeeu6Xhs13Lumo5HcS3nrk3sC7PPX1jACjZQQAUNxFawFWwVW8VWsVVs2aXHQ8KWM9ZUc+9k57XcD9l5L2zg2Mjx5KrljLWJBjoYC88v5+WezA5puSezQ1ruyeyQFzoYYF+YJ+wLC1jBBqYtf3F23gsNTFvuh+y8F/aF2XkvTFvuqOy8FzZw2Dx3VHbeCw10MMC+MDvvhQWsYAOxOTbH5tiyo4/Hay2nvl2YHf3CAlawgWnLo5kd/UIDHQywL8yOfmEBK9hAbB1bx9axdWx92c6vY15YwAo2UEAFDXQwQGwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wGTbDZtgMm2EzbIbNsDk2x+bYHJtjc2yOzbE5Nsd2ZklLLGAFGxgLzySQxArmn7VEARXMLfNEBwPsE/VMghMLWMEGCqiggQ4GiK1gK9gKtoKtYCvYCraCrWAr2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYBJtgE2yCTbAJNsEm2ASbYFNsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tgCW2ALbIEtsAW2wBbYAltg69g6to6tY+vYOjayRMkSJUuULDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLLEzSyJRQQOHbcxgazktcGJfmFkyJqi1nBY4cdjGVLSW0wInCqiggWmzxADTNrY3pwXqmMzWclrgxLT1xAYKOGzjhbmW0wInOjhsY9pay2mBF2aWXFjACjZQQAUNdBBbwVaxVWwVW8VWsWVqjGl2LecN6phm13LeoI5pdi3nDU5soIC5vbknMx8udDDAvjDzoef+HflgR27OyIeJDRRQQQMdDLAvHPkwEZti07RlK9G05ZapgsNW8nCPfLCSO2rkw8S+cHR0y6dyOUPQStYdnddK/vjReSc2UEAFDXQwwL5wdN6J2AJbYAtsgS2wBbbAFtg6to6tY+vYOraOrWPr2Dq2vmw5x3BiASvYQAEVNNDBALEVbAVbwVawFWwFW8FWsBVsBVvFVrFVbBXb6LyWzwtzjuFEAx0MsC8cHX1iASvYQGwNW8PWsLW01cS+UA6wgBVsoM7ekhMLJzoYYF+YvfvCAlawgQJiU2yKTbEpNsNm2AybYTNshs2wGTaiIicWXujYHJtjc2yOzbE5Nsfm2BxbYAtsgS2wBbbAFtgCW2ALbB1bx9axdWwdW8fWsXVsHVtftn4cYAEr2EABFcxm3xIdDLAvzAC5sIDZ7DWxgdnJJFFBA9NmiQH2hRkgFxawgg0UUEEDsVVsFVvD1rA1bA1bw9awNWwNW8PWsAk2wSbYBJtgE2yCTbAJNsGm2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtgCW2ALbIEtsAW2wNaxdWwdW8fWsXVsHVvH1rH1aZOceTixgBVsoIAKGuhggNgKtoKtYCvYCraCrWAr2Aq2gq1iq9gqtoqtYqvYKraKrWKr2Bq2hq1ha9gatoatYWvYGraGTbAJNsEm2ASbYBNsgk2wCTbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYXNsjs2xOTbH5tgcm2NzbI4tsAW2wBbYAltgC2yBLbAFto6tY+vYOraOrWPr2Dq2jo0sKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkqWVLKkkiWVLKlkSSVLKllSzyyJxAD7wjNLemIBK9jAYRtTPyUnWNqYdik5wdLGki6SEywnBtgXZpZcWMAKNlBABbFlloz5iJITLCf2hZklFxawgg0UUEEDsTVsDVtmyZjZKTnBcmIFGyigggY6GGBfqNgUW2bJmJcpORlzooAKGuhggH1hZsmFBcSWWdKyyWWWXKhgLMx8aNn6Mh9aNq7MhwsFVHBsr2Try3y4MMC+MPPhwgJWsIECKogtsAW2wNaxdWyZD5JdJPPhwrRl+818uNDAtGWLyny4sE/MyZgTC1jBBgqYNk000MEA0+YDMx8uLGAFGzhsY1UeycmYEw10MMC+MPNhLN4iORlzYgUbmLYUZz5caGDaemKAw2Zpy3y4cNjGXEvJOZwTh81y92U+XKiggQ4G2BdmPlxYwApiE2yCTbAJNsEm2BSbYlNsik2xKTbFptgUm2IzbIbNsBk2w2bYDJthM2yGzbE5Nsfm2BxbZollA88sudDBANOWzSiz5MICVrCBAipooIMBYuvYOraOrWPr2Dq2jq1j68uWMzttTM6VnMNpYxqu5BzOiaPCmMAqOYdzYoB9YebDhQWs4Kg75tNKzss8j0XOyzx3dc7LnFjACo5fPObLSc7LnKiggavt5LzMiavtSDvAAlawgbK2oSlooIOxtiH7/InZ5y/ERp8X+rzQ54U+L/R5oc+LrJYqwp5U9qSyJ7PPn9ug7EllT9LnhT4v9Hmhzwt9XujzQp8X+rycfT63wdiTxp409qSxJ7PPj3mOkvMyL8w+71k3+/yFFWxg/rZs69nnLzTQwQD7wuzzFxYwbdlxss9fSAPPju7Zh7KjXxhgX9hpGtnRL+RgdQ5W52B1mn2n2XcOVudg9XWwcjrnxAJWsIECKjjqjhkfkhM3L8zuf+GoO1aYlpy4aWMeiOTEzYkCKmiggwH2hRkVF64LTq0CKph1c9MzFC7Muucf6AszFC7MX+GJFWxg/opIVNBABwPsCzMULixgBRuI7XyEmht5PkI9sS88H6GeWMAKNlBABQ3EptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtgCW2ALbIEtsAW2wNaxdWwdW8fWsXVsHVvH1rH1ZbPjAAtYwQYKqKCBDgaIrWAr2Aq2gq1gK9gKtoKtYCvYKraKLS8lxjQwycmYEwVU0EAHh20svik5GfPCTI0Lh21MJJOcjDmxgQIqaKCDAfaFmRoXYhNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGTbH5tgcm2NzbI7NsTk2x+bYAltgC2yBLbAFtsAW2AJbYOvYOraOrWPr2Dq2jq1j69j6suVkzIkFrGADBVTQQAcDxFawFWwFW8FWsBVsBVvBVrAVbBVbxVaxVWwVW8VWsVVsFVvF1rCRJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJU6WOFniZImTJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJUGWBFkSZEmQJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpac00THd6/knCZ6YYD5QskYyTmniV6YL5RYYgUbmPemqTjHS05MmyQ6mLbzr/WFZ5acmL8tEivYQAEVNNDBAPvCM0tOxObYHJtjc2yOzbGdqdETHxV8LJEtOfXTj9wlIx8mGuhgDGyJfeHIh4kFrGDa8mB1ARU00MEAh20cN82pnxMLWMFhG+v3aU79nKjgsI31+zSnfvqYXK459XNi2mJgOcC09cQKNlBABQ10MMC+sB4gtoqtYqvYKraKrWKr2Cq2hq1ha9gatoatYWvYGraGrWETbIJNsAk2wSbYBJtgE2wjH3ys9ac59XNiASs4bDXbw8iHiQoa6GCAfaEdYAEriM2wGTbDZtgMm2FzbI7NsXnWbYlZIdu694WRFTSxgBVsoIAKGph1bWDnaGafP3d19vkLFTQwf3F2vezzF/aJOUVz4mo75ahgAwVU0EAHA1xtJ6doTixgBRuYvy0SFczflnWzz18YYF+YfX7MANKcojmxgg0UUEEDHRy2MdlKc4rmhdnR82DlvEwf058052VOFFBBWwegORggB0s4WNnRL6wgB4uOXujohY5e6OiFjp7zMi/UA6RpZJces5s0Z2BONDB3VO6H7NIttyy79InZpS8sYAUbKKCCBmbdbBrZeS8sYAWzbv4KF1BBA/NkmQ0xO/qFfWF29AsLWMEGCqhgXO8J67kU5Yn53viFBaxgAwVU0EAHsfVlO5etvLCAFWyggAoa6GCA2Aq2gq1gK9gKtoKtYCvYCraCrWKr2Cq2iq1iq9gqtoqtYqvYGraGrWFr2Bq2hq1ha9gatoZNsAk2wSbYBJtgE2yZBGOaneasyol9YSbBmC+nOatyYgUbKKCCo2eNCYCasyonBpi20aVzVuXEAqYtEhsooIIGOhhgX5ipcWEBsTk2x+bYHJtjc2yOLbAFtsAW2AJbYAtsgS2wBbaOrWPr2Dq2jq1j69g6to6tL1vOwJxYwAo2UEAFDXQwQGwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYBJtiU2yKTbEpNsWm2BSbYlNshs2wkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0sgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSIUuELBGyRMgSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSPbOkJypo4LCNVdk1p4lOHLaxKrvmNNGJBRy2sVa75jTRiQIqaKCDAfaFmSVj4XfNaaITK9jAtHmiggY6GGDa8sdnllxYwGEbH1PWnCY6UUAFDXQwwL4ws+TCAmILbIEtsAW2wBbYAlvH1rF1bB1bx9axdWwdW8fWly2niU4sYAUbKKCCBjoYILaCrWAr2Aq2gq1gK9gKtoKtYKvYKraKrWKr2Cq2iq1iq9gqtoatYWvYGraGrWFr2Bq2hq1hE2yCTbAJNsEm2ASbYBNsgk2xKTbFptgUm2JTbIpNsSk2w2bYDJthM2yGzbAZNsNm2BybYyNLjCwxssTIEiNLjCwxssTOLBkBbWeWSGIBK9hAARU00MEA+8KOrWPr2Dq2M0s0UUEDHQywT8xpoj5e49GcJjqxgg0UUEEDHQywLyzYCraCrWDLLBkvDWlOCHXP7c0kGK/8aE7ynChgblkkGuhggH1hJsGFBaxgAwXE1rBlEozXbTQneU7sCzMJLixgBYct8hdnElyooIFps8QA+8JMgsgtyyQYE+c1J3lOHLYxW15zkufEYeu5OZkEFzoYYF+YSXBhASvYQAGxGTbDZtgMm2NzbI7NsTk2x+bYHJtjc2yBLbAFtsAW2AJbYAtsgS2wdWwdW8fWsXVsHVvH1rF1bH3ZcpLnxLTVxNU3gyQIkiBIgiAJgiTI6ZzeT2yzS+fETe8nKmiggwH2hXmlcGHuB01cvzgnY16/Ivv8hX1h9vkL8xdbYgUbKODavzkZc6KDAbJ/hf0rBaxrG7LPXyiggra2Ifv8hQFiU2yKTSvYQAH5bWefT7GyJ5U9qezJs8/nNhh70tiT9Pmgzwd9PujzQZ8P+nzQ58M5bk5Ldfaksyed43b2+RPZk/T5oM8HfT7o80GfD/p80OeDPh/BcQv2ZLAngz0Z7Mmzz3tiAdMWiQ0UUMGHLY7chtHnJwbYJ+ZkzIkFrGADZWBNVDCvNTyxz16Y0y5jTA7TnHY5sYINXEeoFwUNdDDAvrAe4DpCOe1yYgMFVNBABwNc7SEnWD4CMLGBAubeyf3Q8ljkljUHA+wL5QALWMEGCph18wBIgH2hHmDWjcQKNlBAvZYr1/Nb3xc6GGBfmGv3X1jACube6YkGOhhgX+gHOLa3HImjQk4LzImQkRMAc73MiX3h6MdRssmNfjxx7IecLJiTJicKOLa35KaHgQ4G2Bf2Ayxg2vK49QYKqKCBDo69Pk6hltMjcz9YTo+c2MCs64kKGuhggPkrYmD24wsLWMFhq2kb/XiigsM2pq1ZTo+cGOCwjclsltMjJxYwbT0xbfnja9o0MW2WaKAvbFk3f1srYAUbmHXzt2WPHY3LcsrjxL4we+yFFRwdx3LTz48AnujgOISWv+L8CGDi+RHAEwtYwQYKqKCBuVNzn9kBFrCC48e3PFjj1DxRQQPHr9DzrwXYF+bHNC4sYAUbKKCCo67knjy/4JmYnbedWMAKNjB/RTau7LwXGuhggH3h+QXPEwtYwQYKqKCBDgbYJ+Y8xxjT9yznOU4UUMH8FZLoYIB94fl9XkssYAUbKKCCBvrC7KZjmp3ljMaJFRx1sztdX9Q+UUEDHQxw7J3shdcXtU8sYAUbKGDundze7KYt6+aJ9cIK5n44EgVU0EAHA+wLsx9fWMAKYlNsik2xKTbFptgM29mP88ef/fhEBQ3MvdMTA+wL83R7YQEr2EABh01yc/LUfKGDAQ5b9u6cxjixgBVs62CdvftEBQ10MMC+sNMeOu0hT8Jnh8yT8IUG5q/IXpgX05KdLC+mE3Ma48QCZks9EhsooIIGOhhg2karzmmMMZaEs5zGOLGCDRRQQQPzt3ligH1h9vkLC1jBBgo4bJqbnqfmCx0MsC/ME/aFBaxgA3NPlkQFDUxbS0xbTewLMx8uLGAFGyhg/rY8xmKggwH2hXk5fmEBK5i23H15OX6hggY6GGBfmGf/Cws4bJa7L1PjQgEVNNDBAPvCTI28yMlpjBMr2EABFTTQwewBudfzmuDE/JTWhQWsYAOzbu7fTALLZp9JcGFWyD+Q5/kLGyigggY6GGCfmJMQH+McibkfPFFABQ10MMC+MJNgrBlnOQlxYgUbmLaeqKCBDgbYF2YSXDhsYyU5y0mIMRbaspyEOFFABQ10MOaxyEmIF7YDLGAFGyigggY+6ornpo8+P7GA+StaYgPzV2SF7PMXGpi/Ig9s9vkL+8Ls854HIPv8hRVsoIDDFrl3ss9f6GCAfWH2+QsLWMGsWxMfFSTyEGaPjfzF2WMvbODYssimnD32wtyy3A/ZYy8MMLcs90Oe5y8sYAUbKKCCactmn+f5CwPsC7N3X1jAun5xnucjd3We5y90MMCsO1pJTgucWMAKttGiaqKAChroYIB9YTkWjn5RjjEaZzmjbnF54vrE7YnlifWJ7Yn9ieOJn7zy5JUnrzx55azfku2JHdbz30uyP/Hp1eQO2/HE5YnrE7cnPn+vJZ/b48n2xP7E8cQd9uOJyxPXJ25PLE/85PUnrz95/cnrT9548saTN876kXzWyTYXZ50jucP9eOLyxPWJ2xNn/XKyPnFuf45w5GS3xbE4J7Y9uCafdVqyPvGjTh9vfFjOYrsOUU5jW9zhcjzxWV6S6xO3J5bVBHI222J74idvefKWJ2998tYCn92iZJ2zW5x8douLz+3MP392i4vbE5+7x5P1ic/dHMn+xPHEpzf3oR5PXJ64PnF7YnlifeL05k2Gnt3x4njiDp/d8eLyxJVDfXW73Oaz253H6Ox2F8cTd/jsdhc/HXd/Ou5Od1d/Ou7+dNz96bg73UWvbndyh69ud3J54vrE7YnliRUe3aufPWH0rokCKmiggwH2iTn1a2IBK9hAARU00MEAsRVsBVtJW0lsoIAKGuhggH1hPcACYqvYKraKrWKr2Cq2iq1ha9gatoatYWvYGraGrWFr2ASbYBNsgk2wCTbBJtgEm2BTbIpNsSk2xabYFJtiU2yKzbAZNsNm2AybYTNshs2wGTbH5tgcm2NzbI7NsTk2x+bYAltgC2yBLbAFtsAW2AJbYOvYOraOrWPr2Dq2jq1j69j6svlxgAWsYAMFVNBABwPEVrAVbGSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOlviZJeNaL84sscQCVrCBAipooIMB9oUFW8FWsBVsBVvBVrAVbGeWeGJfeGbJiQWsYAPT1hMVNHDY8sF2Tkqb2BdmllxYwAo2cNjyIXhOSptooIMB9oWZJRcWsIINxCbYBJtgE2yCTbEpNsWm2BSbYlNsik2xKTbDZtgMm2EzbIbNsBk2w2bYHJtjc2yOzbE5Nsfm2BybYwtsgS2wBbbAFtgCW2ALbIGtY+vYOraOrWPr2Dq2jq1j68uWk9ImFrCCDRRQQQMdDBBbwVawFWwFW8FWsBVsBVvBdqZGT8x8iEQFDXQwwL7wvNY4sYAVbCC2hq1ha9gatoZNsAk2wSbYBJtgE2yCTbAJNsWm2BSbYlNsik2xKTbFptgMm2EzbIbNsBk2w2bYDJthc2yOzbE5Nsfm2BybY3Nsji2wBbbAFtgCW2ALbIEtsAW2jq1j69g6to6tY+vYOraOrU+bH8cBFrCCDRRQQQMdDBBbwVawFWwFW8FWsBVsBVvBVrDltcaYteY5Ba6PKVqeU+AmNlBABQ10MMC+8LzWOBFbw9awNWyZJWPSiecKgRMdDLAvzCy5MG2eWMEG5o5K2xkVJ/aFZ1ScWMAKjmJjOpfndLmJCuamt0QHA+wLMyouLGAFGyiggnlYTnQwwLTJwIyKCwtYwQYKqKCB+dtyp2ZUXNgXZlRcWMAKNlBABdOWez2j4sIA+8KMigsLWMEGCqggto6tY+vLlgsLTixgBRso4LLlInl9PMj0XCRvooNDPB4tei6Sd2G29QsLWMEGCqiggQ5iE2yKLRv4eGTpOWOsR/6KbL/nv832O17w8lztro9J7Z6TxyYKqKCBDgY4Nme8w+A5eWxiAdPWEtMmiWnLPZntd0zj95w8dm16tt8L+UHZPD3F2TwvFFBBAx0MsC/M5nlhAdOWvyKbp+evyOZ5oYIGpi1/ZjbPC/vEnDE2sYAVbKCAWWzss5z61cckA8/5Xn28A+k536uPOQSe870mGugL84xzYVboiQJmizoS8wCMXZIzsPqYQ+A5A2uignkIW6KDAfaFZ2/J33b2lhMrf6CBAipoaz9kb7kwwL4wTxLnL1Z+sfKLsw+dmPOceu7UnOfU86/lPKcLC1jBBo55DD2LZVM+ck9mU76wL8wovrCAFWzg2N4jj0W29QsNdDDAvjDb+oVpy+OWbf3CBgqooIEOxsRcja2PB/6eq7FNrGADBVTQQAcD7AsLtoItL9XG5ALPiVATBVTQQAfXwcqJUBfWAyxg/rXRN3PuUh+PjT3nLk2sYANzczxRQQMdDLAvzD50YQEr2EBsgk2wCTbBlqeZ87flNdd4tOs5YWmirh+UV1cXOhhgbvroFzlhaWIB81oud+p5I3aigNgMm2EzbHl2OtE5LM5hcQ6Lc1jy7HQhNkeR05jybHpOY7qwgQKO6UZ5sjynMV3oYIAZNtmHchrThQWsYAMFVNBABwNctnNy04UFrGADBVQw646ul+uYRZ7nc/GyyPN8Ll42UUEDHQywL8w5iHmlkIuXTaxgA2VtQ85BvNBABwPsC3MO4oX8oJyDeGJ2sjGp3XNlsYmj7Yzp654ToiYa6OBoqZK7L09UJ2Z/u7CAFWyggAoa6CC27GSSBys7meQPyk4mufuyk11ooIMB9oXZyS4sYAUbiC072Zg67jlhaqKDAfaFed68sIAVbKCA2AJbYMvzpmSTy/PmiXnevLCAFWyggAoa6CC2vmy5RFgf60t5TpjqYyUpz/lSE/vCPAFeWMAKNlBABQ0cirFClefMqD5mvXtOjJpYwAoOxZhu77nW10QFDXQwwL4wT6EXFrCC2Bq2hq1ha9gatjyFjpn3npO4JqYiD0B23vFZe8/ZWRMdzGKe2Bdm572wgBVsoIAKGuggimy/mk0j26/mccv2e2GAfWG23wvHlo25+37OTbI83NlSLzTQwQD7xHNu0oVZtyZWsIECKmigg2lriX1htvULC1jBBgqoYCokMcC+MNv6hQWsYAMFVNBAbBVbtvUxO93PCUkXFrCCDRRwHaxzQtKFDq6Ddc4sGm8g+DmHaLw/4Occogv7wmy/F5bZzs45RBc2UEAFDXQwwL4wLwEvxGbYDJthM2x5Sjp/W56SLP9tnnwurOsH5cnnQgEVzD3ZEx0MMG8nR8c5pwhdWEBsgS2wBbbsvBdyWILDEhyWzmE5O++J2M5+7P/93//021/+9q9//I8//+2v//wff//Tn377w3+tf/Hvv/3hf/zXb//2x7//6a//8dsf/vqff/nLP/32//3xL/+Zf+jf/+2Pf81//scf//74r49f86e//q/HPx8F//ef//KnQf/9T/zt4/O/+hhHG7P286+Xx7iorhKP//KhSPm8SIy3uLLE47n1KuDlw9+vn/99G++k5t9/NDI2QO9vgM0Cj6eun22AfP7381NE+fcftyGvbEBOscgCj6d4n22Aff73dZzP8++rx0sboLPAYxDssw2I3R60tQdf2wNjBOZqRqV8tgVl0xRz7Y5zE0r9dBN2bbnlgPC5EfIYbv68LW8aY59HspS2Cki7/fcfwwCzPz7u8tkTpXzslGXTHssY+soSj+HFVeEx0PKxgm6O5yH/jy75uwqbJtlXLjwe7L1WwWQ1iaN+XmK3MzVmjce4Q3y+M/vnNR6jo3Xuzcd4DjXax4Naj91BnQHzuGmngt1vVo+xEn5J809/Sd3UGIthzph4XDOsGvZLibZpWdJXF3lc6X5aYheWvqKiyVM/bbcr5NvlZwUrn1fYNK169HVMH6ct+mn9WMJ3iTf72GPw+PON2GTmY7B47svHYDGH4zFu9trx8M+Px65V5JcBr5PH0T8r0Tbh/RiFn6n3GGQvn5ao7x7T1t4+pk3ePaZNd9dDtq4lBrMZrfb7P6U0Xz9Fy6c/ZdM8a8yD+hiW/7R9b8Oi22oWT6eyX49pfzvAdyUecbnOho+nkJ/GnpRdH7G6+sjTzqi/bIfs9kbMA/K4mX2qoN9oGTmyee2O/nRUf20Zsmmhj2Gi2UQfe0afMuOX36K73DlWR3k88OPI3t6K+618X+X2Hokf2CP93T2y7y26eovZpwm4O8NL09llH4PF9mlT191VwrFupR5Pwp6vEur9GvWYbb3VVj+vIW9fJqi+e5mwq3DvlKL+9ilF491Tivb3LxNuH4/PLxO2zaLIugCtWj5tFlbfvauw9u5dxbbCvZPSdleo9XUtvtsVtmve65LpgfLpXcW2Rqx7gkeJ/nmNeLunWn+3p+4q3OupXt7uqV7f7ane3u+pt4/H5z113yxsNa3H48uXmlaUzkF92oxfa/gmPYvK3KPFn8Yhfr3t3Xa1vm6+Hw+2Pz+heX+7icfxbhPfVbjXxKO+3cSjvdvEQ95v4rePx4sno75ub+Q47NNmEf5+s4i3m0W82yz68Xaz6OXdZtHr+83i9vF4tVmstHg0i3jp8ldy+Y6rhnzetLq9PdDW32+d/e3W2d9uneV4v3mW4+32WY4faKD9/Qa6bxjv3ybmJ9jP9vn4UZ8PaR+b7RirJ87xDGmfn97L4buHVk9378enp/fdE5fHQNd6elibc43Q7Rv71Nmn8dphuTcEWsp2DPSYm1GlyOc16tudvpT2bq/flrjZ7XfPj+52+93zn5vdvvj73f7+UfH6WutoPWgd9loNXYM7VVv7PDw2NTRnPJ0tvVt/sUaTOzXK+08MyvsPksr7T5LKDzxKKu8/Syq7h0l2SGGEWj9v6bW/+dBguxmar4Zcm1GOzzdj9zjp/sBw2T1SujsyXLaPYm4NDe9byL2nOWX39OAHjoyvIfvxmaxNA7ldpL9YJD8scRZ5jDO8WmRNk9DnKSffK5LvIVxJVuXF1lpy7c6ztT64bVpr+YlnKl+UcS6pDrfycpkVa4/u+HQv9b0u6JV5RVY3XfB2kf5qkfV7HqivFRlLRHKMjtiV2e7cfHvwajHH08XiN49Rfl9lHqOny/jvlinlqcym/d4/o396z1t0d+3KwKV/PpJhbz+0LrvHRncHAPZF2jHj6XF/FZsi26vXNW2oumx+zfvj+0XfHuDflrh5oWXvD/EXe3uMv9gPDPLfPyqbW4p96zCuTEJeqtHK+jGtPO2Rb9Y43q7RuL5pT2MJ36uxDu6j3Oc1/Hj/9mhf497t0fa3iMwu18Ti/RovtrHHGWDNBZD4/Nj6buLL03XNY+xqkx+7DfE1OaI9zhKfb4j/wMH1f/DB9cJv2XTc2M67X1N8H2dlfXWn9vVIPzatLLZD7oy4b47t7qnU48Sxrj8et7GfJ+puO2QNRspT8/j97ties9djfWnPz01/PWeHvT8M+ANPpsr7j6bK+8+myg88nCrvP50qP/F4qvzA86l967g5DLitcXMYcHudfDPG9i393hDe+4+oyg88o7r/Sz6fF797RnXr1mUfPyJE2NO9y6/xU4/d0P2tGVb12E0xvffixv6nFKYybu5+9ttx8/WP7Yb0toaaylE3GxLv79P+7j7dl/iB3aE5TnntDtnsjt3jkPdbuso60eojfjabIbsT/rrwqOzSevxa4u2J0PutWINtz5cdv98K346/tMb4ix6fbse2SFcGcfrzo+VvFYmDcamn8/V39sgaDJW+OS67B0w/UGKMXzJSF+XTn7IvcvPI7IvcPDJfFLl1ZPbdzp5O+tFfG9ganzydD3iKx6tF1m3l+Pbai0Vk3QKNDwq9WKStkdjxFZrPo2g3gnrzBLEdnr53gtiW+IEThPE29/gezGZ36PZ+rvHCTddP+17bzVCxNXl0rMK52ZJNoEnlOqT2z6e51LYbq8t1dM6zxFE+HQOp+9eY7twlVzl2h0ZWn7Hj+HSQvso+R54eGfTaPn2AsS9ThKm9Rcw/L/NFQzkaDeV5vP5+kx1Lvs2G0mTTZPevRN0aaa9ib9+1V/F374e2JW6+HLt9Herm27F6vHvXXrW8f9d+/6hsXpDdt45bI+3bGjdH2r+qcbxd494oedW7g6BaX9yOWyP+X2zHrQHd+79lU2P7W2RNI2iPU86nNXZPpn5mO249Nbhf48X+cvOpQd29gHL3qcF+Q+49NagW7zeyfY0fOLj3nhpUL+8/NfhiQ249Nai7N6VuXg+5vP/UYLsd954afHm1K09Xu58OI+xflbp5ybwrImUNLj9SyD+96t5d6/qaRfjAzxvq9tHUzeugKG9fB+1K3LwOivdXlKjx9pISNfQHroNuH5VNru/vhNY5u/T+eZzGT0Th7laIwZDx7ZPNrdDulT6m+fjzbd23ihjzIce33V4sEusGc3xC6uU7u+c5s91evrNba5mNuzzdlNnul/WMany28NWdy2BEHJ/Ph9zeed9N+NjGwEEMxEtd5zEQsR78lc/P3m33KtW9k2bbPaW6e9LcbsfNXbo/tGuId3we8cUmX472NI1SXh7MyKla86rIX+45pR5PF1ebnrObgr/2y9PLzr+sHvfVSPHTCnTH07T37ww3n9+4nkXqZ5cjrWzXPGOVhBb+SombVzRfPNO4tz+2RW7vD3l/DL/tn3rd2SP7mdC8JNs/nD2/NZ26r4fVjyKbid27caZvTKfelRkfkuT8+dnzlX2J/ObBdUVR/bUSa32U8WG6z0rUu9dG7dUXI/p6P1S7fP4GznYFCe5G/Pm3/Dpu3urusvXeTKhW3x9TbfXtMdVtiZuL09X3x1Rbe3tMtbUfGFO9f1R8c1R2rePeTKh9jXszodru9v3m8M4XNW7d03zRW+4todjenk21LXG3pd/+JZ9eLjd5dzbVPsHWULn3vkkwaW+PhjR5fyW0Jm8vhbYtcfO4yvuLoTV5ezW0Jj+wHNr9o7JJsG3ruDca0vT9Uf8vtuPW8+m2Wx/u5q3ldurAzaGQ7Xbcu7Xc7o6bd+v7Gjfv1vXtR/7Njh+4W9e3B0D2a4H5vKKMEpsFsLfrY95apKO9v8BGM30/jfcr991K4+0evZfGFu+n8XbZvXtpvHvZ6XYa3z4q/lrjuHk5+f7yGm33UOru1eS+xs2rybebqG7HgW++1L5f8/juy+hfVLn5Lvp25eSbr6Lfr9FfrHHvRfT9ysl3B072+/Xua+jbbbndUr5YC/rmS+j7Kj/yi2632i+q3G218QOtNn6g1cYPtNr4iVb7RUu5uerB/S8WfH6VuHuJ6tZN6nZWqK8pu82fV1Arv27FZq8+fjUTup4vi75R4tZIvRxvj9Rvd4at6/YWT8P0v1vp/3h7gWk53l5hel/i3kzs/TcLbl0S7T5ZYHXNbP/wgozer7AuU+1pHYzfVdg+b3ya4Pv0hk391q6o7IraNjV2t1K9ri8BPbi/0kIfHWDd0n189eH+JzGkrDWpHl3m89UbpWyXoLg1W1nK++NSUt4el9qWuHcnJOX9cSkpb49LSfmBcan7R2XT7fet49Zs5W2Nm7OVv6pxvF3j3mxlqXdH57W+uB23Zit/sR237g3v/5ZNje1vuTdbWdrxj96OW7OV79d4sb/cnK0suw9H3Z2tvN+Qe7OVpdn7jazZP/jg3putLG07PeDebOUvNuTWbGXZXYHcG8qV3aXU3aHc7XbcG8rdXtHpuib88Lryd64J+6ogn1fY3UrenH+yr3Fv+knrPzOKsitzb/rJvsSt6SdflLgz/eSLD5TdvbHWf/RAzu02Ij/QRuJn2ki830bi/TYSb7eR3V2Ur88El6jP9+i/dH8r7w4VbEuUxzXYGqF7pPPz0In/Uqa9O3SyL3Fv6GT39ONn9oevVvo4S9TN/tivlr4WKvanG1y7X+L2txZ3z6XufWxxW+Lm4Me2xL3Rj+3euDv8sd+lN8c/tm9L3Rz/2Dezp1VNH6zt82bm2/WwnRv2eD468UuRbVu99RHL7Xbkqj9nifqUIb/fju1qXKuZVNVNkf2OlXWf++AP40K/7NjdK08382xb4l6eRfvH5tmH/aHPF92/y7P9h195Ne9Rcbdbd4fY6mon9nRBU0t7tYj/QJGn12q+WWR9g6Y+bls/L7Jb2O8xlr0Gd46ne8Rayi9FdscnfF0qRrRNkd2Q/5ruHE/TJr9XYl1shvqLJdbiHKHxdgnb7YvdUanrkrfV0E2R3WukbZ3CpW2PynYyBZcSVvTF9tHLOvP17cHd/Zy+tkR6xGtFHsOQ80TennPk1S3R4+gvHuKyIqA9v2T0axHdLa3X2tqSx3Dm5hDfzhH/PIz0ePcZ6n4zfI0S1TjaZjN2M6d1JdHjFufpWUb8UqNvx4g5dT4/Rfh4qtHdY6ran77z8bxe4a819i9vCRMyjqeE/+XX7HdrrKvO+rzy2fdONbGehD7QPi+yP4vTSB68uTjS3ZOmvp5olOPpoyOPhxTf2ZRYbb58SJPfb8omCIwrJGu1borE7jKLLwyUEi8WsdV55MO49beKOOsmP05irxV5NOm1JmTZ3NDvt0TWWlDyPEX0e1vSbH0M7vmTdN87xG11H5OyKbJ92mPrdK7P47XfK+K2zjpu8WqRTpH+ahFb4fZhDvD3ijyt6No/fHv7OzcGeqyz6LhHt5fL8Ebng+PVMvXpqW+zTQ/afanq3qjJtsS9UZN9iZujJtv94ZzANHYB2bYv7YYyGTD8s9U7dfve/q1hhq+24+m93358Nvqruxfme1lzLXr59L58X6Kun9JrjZfuyzX601o39mq/sWNNsipWjs/L6G6A/95wx77EreEO3S0w9xPDHR/3R3ljtyplan21TFm31A/endD1ePvo6NsrCOj2a84/cXQ+7A/114+OPJV59WRhwqCJqWyuCtTePlmovX2y2Jb4gZPF49aTvuN9c7Kw491HH9sSj4RuTAIxebGIc9J6cH+xCDMnHmivNftw2mtvx4vt1Q9lrxybMVjdLgf4M2VqXdMwansaVq5Hf7FIqS8WaQxbtK6fF9m/fXXr6mS7HTlt9iwhcrz4Y3TdqFS18lqRx/Goa+zjedzxlyK7/VGE9zY/rOb9Syjtvld1c/b2tsbjxLXGC709N9ZvFJGjrJHLIvFikbJGLh/nQtkU6W+fy7cl7p3L4+2JA/u9UdeneKV+uAX9dTt2D7j6+lr8Y0DfNkV2b/mx7vzTZ5J/HW/cb4axGR/GKb71W7ixP2q8XGS93Hvoy3t1rV/3GDE+Xmztbc0LeTzG2BTZDbH/SJG7EyF090jo5lVaf/stkH2JW1dp+71xcyLEF7v03kQI3T2EuTsRYnuWWeNYH+YN/HqW2ZUwXlf2D9+Y/VjCju1l3qrx9Nzj1/OUHW9/ucKOt79csb2I0XXp3Te703ZPtOrB9XtpzzPTflkz5ti9jKJrQkg8N7DfF7F3z5X7ErfOlXbEu+fKL/aGPT0W98/3Rnl7FGD/RGw9qvx4gvqldew+WXWzp5S3P6xmRf6RPYUkrhb+UvD09WrzI/vslRLtaKt11lZfKlHXzVz7+ADs14Pa3z4i9Xj3iOxL3Ltb2DeMuzV2L1cXRmbrh0+7/bLQS90Nh/L0+WlWgLdvbEZluvSjw3++GWX/xZ0V5kccm9/yAyf6fRF9+ozY4+bkaSb6r011Xyae1oiPp6XEvl2Gy6jnWULfLcNws/an24/fldkuAbqmHD8HyTjot0uMRXtXy39eZ+HXIvuf08vTz6kv71yWjHvw8wsD3ypjB4f6cckSm537jy/zYSGrtjtKuyL58bPrevdpKsj3irT1GLo+v8n5uyK7YHiMvD0tAaWfB8PuDab6NMWGJvfr2oLbl7lu3tvti9y8JfpiS+7dEtn2E0l3k3J7aGS9PFQ/zKD63aHZTb0Q1q798Em/9muR3WuD91ZtNH3/Gxamb3/DYlvi3tvx+VLf5zdGt96ON337GxamP/ANi/tH5fO3ffet496qjabvf8Pii+24tWqj2dsfBLDd45m7n9LYFrn7KY39ltxcP3Jf5OanNPZFbn5p0bYPrG5/afGrMjc/67Evc/uDjV+Vufl1kC8O9b2vg3xR5N7XQbY96ObimF98LPHOeqP7GvfWG7XtI6d7YbB7l+nuS+q2f+B0b73R7aG993WQL9rq3a+DfFHm7tdBvipz8+sgX91dHMxF+ZC1v94WxNsvvu5L3BujDP2Hlrg5zPnFfR8fCLHnz3L8bpce7399eTvi6rqy3u3DLLBvDGK7rVx013hxJLzwMlKr8uLY773j299+l3D/U2ydbML08+8DW/9HF7l927h7fnXvkeC2xL1HgvsStx4J7vfG3fvf/S69d//ru657+/53+wBK16SAau3zFuK7IjdvXf14f4lrP95e4npb4t6tqx/vL3Htx9tLXHv5gSWu7x8V3xwVefvW1XePsW7eun6xHbduXb28fbXqxd6/dd0WuXvrut+Sm7eu+yI3b133RW7euvoXn5C7eev6VZmbt677MrdvXb8qc/PW9YtDfe/W9Ysi925dtz3o3n2W7ydN3Lp13de4d+vq7e1xLG8/8GHL7Xbc3KX7Q3vv1vWLtnr31vWLMndvXb8qc/fWdXvJeGvpuS+uOu+sPXfcfJK1mR/s8va0K5e3p125vD3tal/i3i3rdn/GuhKwD7eJv+7P3aURn+4YUf9URH4psp11tb5Y2OqHhYm+U6StO6MPN6zfK+JrkbXWP6xj/o0icqwicmj/vMj7b2B9sR2rmT3Ccbcd7z5w3Va4e+e8L3LzhvOLLbl5w6k/8MB1323k6YWYsmmsuydZP1KktnVlVfXDZNbvFOHlqWr2ahFdJ5n6uDz7vIi9/Q0Bt7e/IbAvcS+cv9inTFT2Y7NPbf9QoNH5un72MpnvVxZcR7cdHyb8/boluzmtda0s+uiF9dPZAW7vP3d1f/961X/gGWNeTv7Ajdq2zP07rC8aylPA9qdFL75X5Gmm3Ifl2n/5QT/RZP3t97r3be3mcN7uvam7w3lxvD2ctytxczgv6vvDebunTjeH83YvXt0ezrt9VDbDefb+TBQPf384z39gCsi2yO1xNP+BKSD7InfH0b5I1rtjV18k691BJ/+B+RJfFLk56OTvj5DY+/Ml9jVuDjr1t7/PGscPfJ91ux03d6n/wHyJL9rq7UGnfZnbg05flLk56LR/dfHWoNMXbz/eGXT64vX49dGnBz4/cv3OO/bGqgPW24tFYq1RWPuhrxV5XME/vZK1+Tm7Banvvu2/LXJvWf19iVvL6n9R4s6y+vvj4us8Xv3lVRg+FJFXi1SKtM+PS5S31wvYl7g1eSRq+YeWuLnkwH6H2v9zZZlvHpWnO/n+aoI8b8nLRWKNGD3w5SLchG+LbBcPupft+/WHbmX7flW1df5+3Iy/uDDbeirxwE9X/NmuundvX+wX7ru1L/arRK59od5eXSUy6ioSuyVJ90XWNKnHCffVpSZp6hr+6vKbNPVHvZcXvVwjXw98eZ+wwEZ/ecFYZdERtf4DRfzFZVrF1miTmG4WjN3lu9NxHuFYuMj85QFW7EbihdsA+XgbYN/akrq2JD7fki+KMIHUW938nN1a2LLuA1zi2BTZnb6VT6U+TRCs+o0DHHwqdbfUZOhPHODtIoI3D/BXW3LrAH9R5OYB3r2LdfsA706dP3CA9ThY8WezWmVs38Wqa/RK69M4zS8rKYX27fgK98/PT6DjOz9mPaLUwz8Pxti9+HD3x+weX/3Ij2H69wNfTHlta2U5bbW9WKSyJVV/pMirC5Qz1+HjsflekbV45wNf37HGjq2vFqkUkc3ijvsvKK339+vz0fn140exG+q5ebO4LXHvTs/lH1ri5lqz2x3aWEix+bHZobuHAneWlttvhnC7KT02m9HfD7PdY6ebYfbFF7rWrJ4H6qc/5osi69u8Ve3zPSK7X3P7W2HbXXJrzGtf4taY1xcl7ox57b+vd+9btPtP9L05IVBYuPBpbZfXCtSXCtx7n2d3JG69zbMrcOtdnuPdA3n8Iw8jy+mJPy/So7enMhZ9Wp37ecLNL+uT7EoY69DY89Shb5QI5Yto+tpW9LVscz2e5sp9o0Q9SMwPD4K+sRVP3+z58EjqOyWYF/ph5aVvlCjBs6j+2lY0nvHJ873fN0o8fcxQn1at+dZWsCp489d+iBxMs63l7X3xYgnXp5XJn2fHfizRd1+4urfs9baP8BZ1/zBj8Rs/ZN0OlP48F+V3P2S3sMqtqYZ9+1mrW1MN9yXenwde1lb8siLqrztjNxfV/Onddv/0AvqrIu3pcwD22SS0XrfXaQfLmat8/nO2r00wZeoRyZ+v35VT+N4dvtr/nJCnyZdt83PevrnZnaP94Bz9YUn0cv80v+5ZxWXT53bv+9/sczXe7nPbEvf63FdtnfmF9vm3InorP9Fhth/qZOZnr6+39VsDpF8UuTdA2tsPDJDmWqrvDZBu+1w5Gl+OelyIsSX91yO8G89fe5UeI+32/QnXxfoYBmdf3C5g+vQRO3mlwFpv9lGrfr/AWBB6xnl5vu2u+o0S66K6PN+jfKcE83fq89dff20Ru0dNut4+0Xa8WGIt+P/hu7zf+CHPL9E9f4T6GyUsWMj4eS7TN0r4utmqvtsX+o8uUmx9CvsRoPFiEXful3p9sUg/+F5yfe3I1PVjavXX+kpbJ4NHSymvbQXT1Nrx0g8px9OrEfZSQy+lMQVR4rUSvLhW4rWtaKvDjjclXyqhzKXUp+umb5UwJrxHf+2H0Dpbfe2HtDXq+Mj0l34In5Z8/u7CNwr0dTHd9aUfwb3n88djvlNgtanu+uZPeK1AqboOZbXPv2S+LbEGPsvzy1wvl7CXSrQ1kvDAeK2E0T+9vVRC1/SeR/98bV80XkiRQ98v8dpBlTV3q8jTIkjfKsHZVMxeLMEPeT6HfafEunp/JP9rB1WePpV6HC+2i6eXjV86qLJe/ZJ4aWfSND+87vzrHffuK/ClktrV6mcP8XYbsQp8OH1941esMXGTlw6FrmFLfb78/0YBZg/09lqB9TS1y3sF7HhtC9aLc/ZaVOY3Ws4Crb+5Ba8dxpvvIPbdKiT33kHsfTdyc8Tz62VPCwr++spO37061GU93njcF3z+isxjiOn4B46mP26O+fbS02/5ZaeOga7dIOWNRSL2O/UR9lxsy+bVv6+ODWfjI9rLZbo/vU71NK/lm2WMD6oczwsjfLPM0yjf4VZeLtO5q4qnFPheu/U1jNH96YTwa7v9RpH+apHOtXTX14o8GvbTMTpiV2bf8J5uWaPVF3duX5cu/cPrvN/aL0+3CB8+hfK7ZNktNnh/x+zr3Jvy8kWNW3Nevqrx6aSX//n4P3/81z///Z//8rd//eN//Plvf/33x9/771Hq73/+47/85U/X//3f//nXf336r//x///b/C//8vc//+Uvf/4///xvf//bv/7pf/3n3/80Ko3/9ttx/c//8EcA/JOX6v/zn34r4/+PD7Q9nqcej//fHv//cWerdfy38Yfr+G7I43/yD+efftwuPf52O/7nf4/N/b8=",
1980
2118
  "brillig_names": [
1981
2119
  "process_message"
1982
2120
  ]
@@ -1995,18 +2133,15 @@
1995
2133
  "error_kind": "string",
1996
2134
  "string": "0 has a square root; you cannot claim it is not square"
1997
2135
  },
1998
- "2709101749560550278": {
1999
- "error_kind": "string",
2000
- "string": "Cannot serialize point at infinity as bytes."
2001
- },
2002
- "2896122431943215824": {
2136
+ "1004672304334401604": {
2003
2137
  "error_kind": "fmtstring",
2004
- "length": 144,
2138
+ "length": 48,
2005
2139
  "item_types": [
2006
2140
  {
2007
- "kind": "integer",
2008
- "sign": "unsigned",
2009
- "width": 32
2141
+ "kind": "field"
2142
+ },
2143
+ {
2144
+ "kind": "field"
2010
2145
  }
2011
2146
  ]
2012
2147
  },
@@ -2014,22 +2149,11 @@
2014
2149
  "error_kind": "string",
2015
2150
  "string": "attempt to subtract with overflow"
2016
2151
  },
2017
- "3095323350861740601": {
2018
- "error_kind": "fmtstring",
2019
- "length": 132,
2020
- "item_types": [
2021
- {
2022
- "kind": "integer",
2023
- "sign": "unsigned",
2024
- "width": 32
2025
- }
2026
- ]
2027
- },
2028
2152
  "3305101268118424981": {
2029
2153
  "error_kind": "string",
2030
2154
  "string": "Attempted to delete past the length of a CapsuleArray"
2031
2155
  },
2032
- "3367683922240523006": {
2156
+ "3738765135689704617": {
2033
2157
  "error_kind": "fmtstring",
2034
2158
  "length": 58,
2035
2159
  "item_types": [
@@ -2046,19 +2170,15 @@
2046
2170
  "error_kind": "string",
2047
2171
  "string": "push out of bounds"
2048
2172
  },
2049
- "5870202753060865374": {
2050
- "error_kind": "fmtstring",
2051
- "length": 61,
2052
- "item_types": [
2053
- {
2054
- "kind": "field"
2055
- },
2056
- {
2057
- "kind": "field"
2058
- }
2059
- ]
2173
+ "6485997221020871071": {
2174
+ "error_kind": "string",
2175
+ "string": "call to assert_max_bit_size"
2176
+ },
2177
+ "7233212735005103307": {
2178
+ "error_kind": "string",
2179
+ "string": "attempt to multiply with overflow"
2060
2180
  },
2061
- "6336853191198150230": {
2181
+ "11732781666457836689": {
2062
2182
  "error_kind": "fmtstring",
2063
2183
  "length": 77,
2064
2184
  "item_types": [
@@ -2069,48 +2189,54 @@
2069
2189
  }
2070
2190
  ]
2071
2191
  },
2072
- "6485997221020871071": {
2073
- "error_kind": "string",
2074
- "string": "call to assert_max_bit_size"
2075
- },
2076
- "7233212735005103307": {
2077
- "error_kind": "string",
2078
- "string": "attempt to multiply with overflow"
2079
- },
2080
- "11418088424205762236": {
2192
+ "13393647220875574755": {
2081
2193
  "error_kind": "fmtstring",
2082
- "length": 98,
2194
+ "length": 40,
2083
2195
  "item_types": []
2084
2196
  },
2085
- "12099279057757775880": {
2086
- "error_kind": "string",
2087
- "string": "DST_LEN too large for offset"
2088
- },
2089
2197
  "13649294680379557736": {
2090
2198
  "error_kind": "string",
2091
2199
  "string": "extend_from_bounded_vec out of bounds"
2092
2200
  },
2201
+ "14101993474458164081": {
2202
+ "error_kind": "fmtstring",
2203
+ "length": 61,
2204
+ "item_types": [
2205
+ {
2206
+ "kind": "field"
2207
+ },
2208
+ {
2209
+ "kind": "field"
2210
+ }
2211
+ ]
2212
+ },
2093
2213
  "14225679739041873922": {
2094
2214
  "error_kind": "string",
2095
2215
  "string": "Index out of bounds"
2096
2216
  },
2097
- "14514982005979867414": {
2098
- "error_kind": "string",
2099
- "string": "attempt to bit-shift with overflow"
2100
- },
2101
2217
  "14657895983200220173": {
2102
2218
  "error_kind": "string",
2103
2219
  "string": "Attempted to read past the length of a CapsuleArray"
2104
2220
  },
2105
- "15366650908120444287": {
2221
+ "15200354114977654233": {
2106
2222
  "error_kind": "fmtstring",
2107
- "length": 48,
2223
+ "length": 144,
2108
2224
  "item_types": [
2109
2225
  {
2110
- "kind": "field"
2111
- },
2226
+ "kind": "integer",
2227
+ "sign": "unsigned",
2228
+ "width": 32
2229
+ }
2230
+ ]
2231
+ },
2232
+ "15760694058516861966": {
2233
+ "error_kind": "fmtstring",
2234
+ "length": 128,
2235
+ "item_types": [
2112
2236
  {
2113
- "kind": "field"
2237
+ "kind": "integer",
2238
+ "sign": "unsigned",
2239
+ "width": 32
2114
2240
  }
2115
2241
  ]
2116
2242
  },
@@ -2122,22 +2248,17 @@
2122
2248
  "error_kind": "string",
2123
2249
  "string": "Input length must be a multiple of 32"
2124
2250
  },
2125
- "16775516380094354375": {
2126
- "error_kind": "fmtstring",
2127
- "length": 40,
2128
- "item_types": []
2129
- },
2130
2251
  "16954218183513903507": {
2131
2252
  "error_kind": "string",
2132
2253
  "string": "Attempted to read past end of BoundedVec"
2133
2254
  },
2134
- "17843811134343075018": {
2255
+ "17149600165939355391": {
2135
2256
  "error_kind": "string",
2136
- "string": "Stack too deep"
2257
+ "string": "DstLen too large for offset"
2137
2258
  },
2138
- "17879506016437779469": {
2259
+ "17226037485472400844": {
2139
2260
  "error_kind": "fmtstring",
2140
- "length": 128,
2261
+ "length": 132,
2141
2262
  "item_types": [
2142
2263
  {
2143
2264
  "kind": "integer",
@@ -2145,11 +2266,20 @@
2145
2266
  "width": 32
2146
2267
  }
2147
2268
  ]
2269
+ },
2270
+ "17610130137239148460": {
2271
+ "error_kind": "fmtstring",
2272
+ "length": 98,
2273
+ "item_types": []
2274
+ },
2275
+ "17843811134343075018": {
2276
+ "error_kind": "string",
2277
+ "string": "Stack too deep"
2148
2278
  }
2149
2279
  }
2150
2280
  },
2151
- "bytecode": "H4sIAAAAAAAA/+29C5Cc13Ue+Pc8QEwDg2kCfIEAKFIUKZEiqX7NdLet2ND7Qb0oyZJsWbJ7+gFRBAmSACiAlIjGYPB+kaDeD+ply5ZlW/FDshXFjuy4ks0mm413N5vdTVWyu7VJ1Xoru6nKlqu8yVYyl+zT/fU357//39PnDlrk3Cpg/v7vvd8599xzzz33+Weifsh0/05FIwQB+ZtbXvw70/09AfGTK//2dn/nRwuFGaJriV/N18ozSvkM+S/NdDEzYfDzgh9I/vlrujif7fTxsSxCd/PKvy3w/FjU149Q5Zf6C1n+HZ4yi+68qRP1Qp9uu1wpNSv1hcZitblYapTr1Uq5XqnP1xYKhWY936zV8ovFRr5eaVfnq/OtdmGx1So0avV2vjpfLwn2mzt9ulORrd648JYw+L12+9Yw+EXBf1tHk32ptVjJl+brC9XFQru+0M4vlivVUr1dqTTrzVq5VZnPNwuNhUKjWGhXq/X5+XpjvlYotFu1+XZ1QbDfrmK3qtVGbbHSzrfr7Vqxni/mi4uNZns+v7BCo91qzLfbpXItP1+qNuuNZqVRqDVK1WK70aq187Vevb5DxW4W5+vtRrO5WM63a6VKvVJd0Z1aZXEFoFooLRTqjdqKTrULrXqj0list/IrtFqFerNSaFZK84L9TpB5CFt8fxD8Qk8n3xUEv7Qo+O/uaLKvFuorbbTZLBeqzUazlG+V2iuts1ovNxcKVac+pepiszRfaa006kK1XinOt+YX6vUVPao3Cj3ZvEfFbhUr5XKpVqiUC5WFZmmh1cxXG+1qs1SoFwqLhWaz3V6xDYsritleqNQWVnSn1WhVWtXFhRUF7enMexXsQrVULFZKtUq+Vm3mC+Vmo1gtFp0CrTDfKLZq5UKtXS6WS43miiEqV+sFp7iNWrv6olQE+30q30NWIAXBfqAToj77NuD9YfB7vsEHwuD36vWDgJ8xwy/17NgvdKJR65ZDz9Z8KB57zaop2B9WsIv1UiO/Yknr8ytNsFWdX2lbK11oa7Haai8U64uNcr7YLBQKrfLKf8VWs1xbXGm+iwutlea6uEKup5Mf6YSo00JD8H/RGH+hnq+1FhYqgv9LxviLiwuV+oo8Bf+jxvilxkKrXar02uwvG+PX58vt9nypLvgfM8afL+Rb88VKTzc/boxfW8zPL6x4FoL/K8b4K35OqVmr9/rAX7WWz2Ir32gWarNdnHoXX2i4ILQXjWl3Qy1D9KIuPr8T+lni1dpfyhA95AflI+MJkV2js5rXnBKHNobjJpV3QkfD+iVDrI8aYv2yIdbHDLE+boj1K4ZY0q7DtrVyrx9tBMEvVQW/GQQ/3xL8Vgj8Qt/3bQN+ZMd/D39fGPn08D/RxQ/B+4NhZNMbi33Snvce9kP22D3faL89dm8s83AniL70/MZHwuD3xjIHwuD3/OpHw+D37NljYfBrgv94GPyeX30wDH7PLz0UBr/nVx8Og98U/CfC4PfGHZ8Kgl/oyf8I4NvNRRR7Nv9oEPxSD//JMPg9u/9UEPxyD//TYfB79vMzQfDne/3L02Hwe/p/LAj+Qk/+nTD4vbm+42Hwe/JfCoPf699PhMHv6edyGPxe/34yDH6vfz8VBr/Xv58Og9/rH8+Ewe/1j2fD4PfGc+fC4Pfsz/kg+JVe/3UhDH5vbHExDH7Pvl0Kg9+zb5fD4Pfs2zNh8Hv27dkw+D37cCUMfs8/fC4MftPtHXH7RmZ3voi3deXfti72vtahN+4/0HjoPYcfXmw9jjO5wkUUDc7winfMYWv3Xxf1gw8+3Dp4qP7wo5x3IgZzKgZzex/zTQceOfR4vXHoDc3m462DB+O4ykT+4FCzfdQPtR4/+OCBR+L4GRLtTZ+oP/jIO5qMNp0STfbcbIL0hr5efraLdw3xh7Q3w3vDcVBT0yauM6SfJV6Nx32FDNETflg+uIaQifrzv5g3p8RxHc4odGYUOjkljn3PUbAuGGKdMMQ6Z4hlWcYzhlinDLHOGmItG2IdMcSylL1lG7o4pljHDLGWDbEsZW+pX8cNsSzbtqVOdAyxLG30M4ZY49o/yphkJlrtH4TYq74lDH5JZJH1yALpi6+EvlUm5q9gcZzQyhKWcdkKvrIh/1zPWeAHZRCHlR0Sa0aJC1GnM55yM/249Jq/LOm3evAx/Vy0Woe3kixmw8ii6Ku3rUBT6G+FMjRbi4f3vevAvojCJMlB5Lab0sk+g4lotby3xGBF9Hs3vZsEPAyO77nuc7t1qPGJD9b37Ws1V7g/SClXZZWjGPyeh0WYJrAKF9dqSgKZ4UIaM+mCqLyrDqni/QfqzTfVHz14eH9rgkSJI2AWJ8JxsbmqMsBSRCLAgKduXJBTD9q8D+MI3S0Qp4lAMKXVx2k9V9c1Cl15N6GkzxJWVsknvE968iMG5mNV8jWHNOoq5XBBm1UQ2mlmcsI0u0Jprc0u9EyOr65QrmG9pULR1wa2KPKRutyqxAmW9DzTkd4zbYEyck85C3xM07t/2/2bI0wXZIearyfHdyJfN/P1v1LZsG5YT8PUQ7mQVk+FfjYK2l0VfHqheYcz0ep6ttxpmqZekV+py1klTrBkZQH1FNNvhTJienyW/Pju/+3+zUWrdZr1dFYpD75DPf2/u88zMeXZ2/2dHylUKtzGhQbSDuPdFhpp24HQz0Yh9a7fDrR60uyJyG6bwmtOieOZ920KnW0KnZwSx7MBo2CdM8TqGGItGWJdHFOsU4ZYZw2xlg2xjhhinTbEstT7ZUMsK3n5+sFhsVyw1NVLhlgnDbEsddWyjMcMsZYNsSzldcUQ66ghluyAYT9T8F2YiVa3PeuxG9KTcuA7pJ8lXm356ftKmlw1n1bkMxdGPj1+5hR+5hT5SF3mlDjBurb7G8cMmH4Oyojp8Vny47uf61ZYjjBd4DFDTikPvsMxQzUzWDasG9bTkPWA9IRvfIf0s1HIdpP36oXW/mei1fVsKJ98mnpFfqUur1XiBEv2oqGeYvoclBHT47Pkx3fvIj1FnWY9vVYpD75DPX1rF3cmpjx7u7/zIwZu40IDaaOczOq50E7dDoR+Ngqpd/12oNWTZk9EPtvDyCfPuov8bFfkI3W5Q4kTrOu6v7EdYPrtUEZMj8+SH999lNoBYrLu7lDKg++wHfwCtQMuz97u7/xIoVLQ6tIQvzqrlJPbGcraTq9LqduZ0M9Gq+swRDu7jviJ0wOR3fUKrzmKc4FPc12v0LleoaNhnTTEWjLEOmKI1THEOm2IdcwQ65Qh1hlDLEudOG6I9bQh1kUjLM3+j8LXBSO+XLhkiGXZtq8YYlnaQsv2eNYQy7IenzPEstQJS9lbte3IuIyWOnHOEGtc7YQlXy8Hn2mjT7t6srdsjycMsazK6J55HPpS8yesy8jrDzi2zHT/zig8GI6zWxmiJ+XAd0g/S7za8tMfZ2tyvU6Rq8juBoXXHMW5wOPsGxQ6Nyh0NKyThlhLhlhHDLEsy3jKEOusIdYlQyxL2V8xxNqox+GwnjPEstSJ44ZY5wyxLO3XRUMsS9lb6qql7MfVflnqqqV+nTHEsqxHS/2ybEOW+nXBEOuYIZZlGcfVl7Mso6U/Ma71OI6+nHvmMehL0c+x9DE3/ImXRhuytBOWfFnpl3vmedVR+LpsxJcLlrK39AGkr+X9dILvQtA9T/li6j28Qj8bra7rEHNo2h4sbe9e2DnGondOT5tb1eb0uM+7sfsb94Rh+uuhjJgenyU/vntvVyha2+Q9YWn11u0Je0f3R9g9W/mCVpeG+NVZpZzczlDWhnqd6qtASD8bra7DEO3sRuInTg9EdjcpvOaUONa3mxQ6Nyl0NrDGC2u7IZa0a9El1D1uh5jP2p4jPSkHvkP62SioXSj45HqjIleRz84w8untgd6p8LNTkY/U5c1KnGDt6v7G/g7T74QyYnp8lvz47hD1d4jJbeBmpTz4Dvu7RyYGy4Z1w3oaph7Sn1kR+tkoZLvp66mmF1r7n4lW14mhfPJp6hX5lbrcpcQJltwMhXqK6W+GMmJ6fJb8+G6J9BQxWU93KeXBd6inn+7+mIvi22ea9oy4mt1mGWI+bg9B6rvQyqdtD0I/G4Vsn/32cHNKuYp8dgWRT7OdRn+QX6nL3UqcYO3p/sb2gOl3QRkxPT5Lfnz3HLUHxOT2sFspD77D9nCR7DbWDetpkHrI59tp9VToZ6OQdrKvp5peaP3fTLS6Tgz5aaWpV+RX6nKPEidYt3R/o55i+t1QRkyPz5If332T9BR1ms8a7lHKg+9QT79C42kuz97u7/xIodzS6tIOv9Ubr+8Jgl/v3dR6SxD8Yk3wXxEEf7Eq+LeGqd95wb8tDP8Lgv/KIPjVnv7cHgR/vif/V4XBbwr+HWH0s8f/nUHwSyXBf3UQ/FaP/9cEwS/38O8Kgr/Ysw93B8Gv9fT/tWHk06vfe4Lgt3v2594w8unxf18Y/nv9Sx7wLedSBL8YBL9/K3Uh6odJpUxCX3yp10H6TMxfweI4oZUlrFB+q1Y25J/HrQXgB2UQh1UYEmtGiQtRp3lPuZH+rIdXLocLfAfRWmXiwnEjLM0HHoWvC4Z87Tbk60lDvvYY8aX516NgvcIQa5Mh1q2GWLcZYr1yTLFuN8R6lSHWHYZYdxpivdoQ6zVGWC4827Hj6y5Dvs4b8nW3EV/u+bWGWFZ9h3u+xxDrXkOs+wyx5sYUS9bAw+5/KdfCzteV6mHn68rNsPN186Ww83XlStj5tHI57HxauSFjAelvhQbqLvafduOWcuqzuEI/S7za8tMfP95B/LB8eH/TnQqvOSWObcCdCp07FTo5JY73Uo+C9Ywh1jFDrNOGWKcMsY4bYh0xxDpjiLVkiHVxTLEsdXXZEMtK9ppfMC66atkeLxlijWt7vGyIZdmGxlX2Jw2xLO2EZV9raaMtZW8pr3HVL0vfxLIeLWX/crATV4yw3DOPkUfButUQ65YxxHLhqY4dX68w4stS9i7wHa3johO3G2JtMsJywVIndhnx5Z5vM8S6dQz5csFSV8fRFrrA96GNi65a1qMVXy6Mo7xcsNTVV0Z2WLcaYlnZLxf43otx8b9OGGJZzilY+uSWYwXLuUfx72Ue+3aIy3T/hl0DyK95DeD2MPx41wBuV+Sq7bc15KeZpp6RX6nLVytxgiV7BfDsA6a/E8qI6fFZ8uO7H3QrLkeYLvDZh1cr5cF3It9NK/++PzlYNqwb1tMw9ZD+G79CPxsFbTcFn17cochR0wvJm1PiNsHzMPWl1T3vrRsF65whVscQa8kQ6+KYYp0yxDpriLVsiHXEEOu8IZZlG7Ksx2cMsY4ZYl0yxLJs25b6ZdmGLO3qy0H2ZwyxLG30chdLzvejP7Q5GqQz7NgB80u6sOfN5othz5vNLwQ+b9YWv+sukGuGZId7Ue18xGrq+0CEfpZ4teWn77PeTfywfNhnvUfhNafE8f6qexQ69yh0ckoc29ZRsJ4xxDpmiHXaEOuUIdZxQ6wjhljnDbEuGGJZyn5cdfWSIdaSIZalflnanHOGWC8H2Z8xxLIs48UxxbJs28uGWFayd8+8d3JcdHVcfQBLrI1+e6Pf/mnpOzb67Y1+e6PffmnKflx19bIhlqW8LG2OpexPGmJZtiHLfntcbfS4+hOWZbT0fS3r0VL2Lwc7ccUIyz3zHopRsO40xLKaJ3fPrzbCcoH3h46C9RkjLPd8a2SD5cLThnztMuLLPb/GCMuFl4Ps9xjx5Z5vMcR6hRGWC5byeq0RX5a6atmGXBhHvR/XMrrwUreF1rLf6Dt++vsOFz5thOWeLX25Ww2xXmmIdZshllVf64Jle7SU162GWJb2i88gjYJlOeY7YYhluaZjOQ9gOT9huT+HzyDh3rBM9692J7mjs7f7Oz9SKKY+2yH0s8SrLT/9fXKaXO9W5Cqyu1fhNafE3QbPGId07lXo5JQ41vdRsC4aYnUMsc4ZYj1jiLVkiHVhTPk6boh1xBDriiHWUUOs5wyxLOV11hDLsj1eMsSy1HtLW2hZjycMsSxtjqVOnDHEspT9sTHl67whlqVOWPomlv22ZT2Oq/2y1C/L9jiuNtoSy1K/lg2xRPaz3Tgc32S6f7XvQxmO9coZoiflwHdIP0u82vLTH+tpctXG0CK7+xRec0ocr0Hfp9C5T6GTU+LYNo+Cdc4Qq2OItWSIdXFMsU4ZYp01xFo2xDpiiHXeEOuYIZZle7xkiGWpX5byOm2IZalflm3I0q5a6oSlXR3Xtm3ZHi3b0DOGWJbt8eWgX2cMsSx9gOUultwTgf423xMxrM+P+SXdrJIv0/2rfbPVzseupb4HQehnFZmE8PnvSylXkV1e4TWnxPGegLxCJ6/QySlx3DeNgvWMIdYxQ6zThlinDLGOG2IdMcQ6b4h1wRDLUvbjqquXDLGWDLEs9cvS5pwzxHo5yP6MIZZlGS+OKZZl2142xLKSvXvmexDGRVfH1QewxBrXfttS9pY+gKWNtvQnxlVXN/rtq9enbfjkw2Ft+ORXT782/MKrp1/LhljjKvtx1dXLhliW8rK0OZayP2mIZdmGLPuOcbXR49qnWZbR0ve1rEdL2b8c7MQVIyz3zHucRuHrKUO+7jTk6zOGfFmuD1nK65WGfD1tyNcuI77c82uMsFyw1IlbDfmylL1V27Zsj5ZtyD2/2gjLBav26MLLQb/2GPHlnm8xxHqFEZYLlvJ6rRFflrbQ0ka7MI56P65ldOGl3tday37DN/np7ztc+LQRlnu29CduNcSy8snd822GWFZ9rQuW7dFSXrcaYlnaLz5jPgqW5ZzCCUMsy3Ury3kmy/kvy/2FfI8L7m3NdP/ORKv10tHZ2/2dHy2kvsdF6GeJV2N+Cj65avu0RT6FMPwsZggf+Sko8pG6LCpxglXq/sZvSWP6ApQR0+Oz5Md3/6I78M8Rpguf6AzyUFTKg+9Evg7yLzcNlg3rhvU0TD0Ummn1VOhno6DtpuDTC639a3oheXNKHM/hpK0vre55b8IoWOcMsTqGWEuGWBfHFOuUIdZZQ6xlQ6wjhljnDbEs25BlPT5jiHXMEOuSIZZl27bUL0u+LOvRki9LO2GpE5b1eMYQy9LeL3ex5Lwh+lZ83tDnn2p0ML+km1XyiW81E632Uez8qep8huhJOfAd0s8qMgnh3xVTylVkV1J4zSlx2+EZ45BOSaGTU+K4jY6C9Ywh1jFDrNOGWKcMsY4bYh0xxDpviHXBEMtS9uOqq5cMsZYMsSz1y5Ivy3q05MvSrlrqhGU9njHEspT9xTHFsrQTy4ZYVrJ3z3x2cVx0dVz9CUusDR9gwwcIaVc3fIANH2DDB9jwAZKwLOU1rrp62RDLUl7jaidOGmJZtqFx7TvG1fcdV/2y9KMt69FS9i8HO3HFCMs98z6IUbDuNMSymr93z682wnKBz7KMgvUZIyz3fGtkg+XC02PIl2U9WvO1ywjLBSudcMGyHvlM0ihYtxhivcIIywVLeb3WiC/3/BpDrHHU1Y32ePXKOM76tdEPbeg9x33aCMs9W/qYtxpivdIQ6zZDLKt+2wXLtm0pr1sNsSzbI59vGgXLcix6whDLct3Kcn7Cct7Ecj8Tn2/aBHGZ7l/ZV4i2ztHZ2/2dHy2k/naZ0M8Sr8b89PYVbo9Wy3WTIleR3S6F1xzFucDnfHYpdHYpdNYLS6tv929v93d+pDA/PxPpts0Gf2FR6mM3lI11GceidrpTqKbVZaGfJV5D6fIe4oflw7p8i8JrToljHblFoXOLQienxPE67lqxNN0aB75cOGeE5Z63RDZY1mU8Yoh1xhDroiHWsiGWpbwuGWI9a4h13hBryRDLUvanDLGOG2JZlvGKIdZRQywZ27Dv4sLe7t98vl2ulJqV+kJjsdpcLDXK9WqlXK/U52sLhUKznm/WavnFYiNfr7Sr89X5Vruw2GoVGrV6O1+dr5c1v8Wur56vBPZNCjPR6j7EEL8o+K8Ig18S/FvD4Pfq95Vh8Ht+751h8BcE/9Vh8Hv6+Zow+NWw59cKNcEvhcGvC345DH5T8OfD4LcEfyEMflvwK0Hwi3nBr4bB79nPWhj8nv38mTD4Pfv5s2Hwe/bz9WHwe/bzb4XB79nPnwuD37OfPx8Gv2c/94bB79nPN4TB79nPN4bBXxT8N4XBbwj+m8Pg9+z/W8Lg9+z/W8Pg9+z/24Lgl3r2/+1h8Hv2/x1h8Hv2/51h8Hv2//4w+D37/64w+D37/+4w+D37/54w+D37/94w+D37/L4w+D37/EAY/J79fH8Y/J79/EAY/J79/GAY/J79/IUg+OWefftQGPyefftwGPyefftIGPyeffvFMPg9+/ZLYfB79u2jYfB79u2Xw+D3/NuPhcHv2c+Ph8Hv2c9fCYPf829/NQx+zz7Xw+D37PNiGPyefW6Ewe/Z52YQ/Pmef9sKg9+z/+0w+D37vy8Mfs/+fyIMfs/+PxgGv2f/PxkGv2f/H4r6wQa7v7awPwTvhXZP9x9WeS+1FisrA4T6QnWx0K4vtPOL5Uq1VG9XKs16s1ZuVebzzUJjodAoFtrVan1+vt6YrxUK7VZtvl3t9VuPAO8ZM9lUe7wfCIKf7+nlo0Fk3+zZtccU2RfLzYXFer7SrtTr1fZKJ1RsrvxZWJF8e75Yr5Ua9ZWaaC626ivLbbVio1lsllrVlbbaKtUWWq2+zX9crddR+M735H7QGjtf6vW1h1TsVrXaqC1W2vl2vV0r1lfmpouLjWZ7Pr+wIo12qzHfbpfKtRUxVJv1RrPSKNQapWqx3WjV2vlarz4Pq9jN4ny93Wg2F8v5dq1UqVeqK/KtVRZXAKqF0kKh3qitrHG2C616o9JYrLfyK7RahXqzUmhW+mPcJ4LoYn8N51Pmulh94X+3/+4H3YsR54B/oTVD5ZI1Y7nH24V9ncE0Eo/pfzj34l9H70dderOUJ4LnGcpva7sLtQzRiyJ9X5nQzyqyCbGvbIL4YfnwvrIphdccxbnA+wymFDpTCh0N6zlDrCOGWOcNsZYMsc4aYh03xDpliGVZxmVDrHHVr2OGWBcMsS4ZYlnql6W8ThtiWeqXZRs6Z4hlqROWdpXPWmAc+xHT8N6w3y6m9SOEfjZa3W+H8COmo3Ry3Rr19z3vP1Bvvqn+6MHD+1sTJEp0w1icCMfFRrFg3CS9m6R0b+sM/n5nZ3W+SMFGlwmPlmgiEExxe7FMm2LyoSwi5d2Ekn6asKaVfML7pCe/C4HVuTftcE0Y/JKvbrBMQn82Wi3zTMxfweI4oZWNdJnvNZKdr2zIP5s0PHaFMojD2jQk1owSF6JOpz3lRvqzHl61ckyRTLQuI6PIRN5f4+EL088ptCWvyBA/IWDdjcTJENui0N8Kz83W4uF97zqwL6IwSXIQud1E6cQOTkR+O4hYEf2+id5NAh4G35A/TXsWPl3IKVgyFbHhEvTChkvw0nYJNFPLqjQTrS7r3u7f/Ehhvjmj8NTHrhbq5Xq12SwXqs1Gs5RvldqNfL1aX5nmLlTdokKputgszVdazUq9UK1XivOt+YV6fWV1od4oFJ3Mb+tOQWrmmfVKTCV+ZXCTIttpSv9xmJ28o0vPNYNcN37x8P6H3t869PiDrSdaK5YWJ8B7dRCRzDG8uzP4+z2d1fm04HN/xtWMhXavfLofRUObMVah0GZMql6ClRmbUDDTmDE240wX5cDpfWYsQ7xPevK7MKu8Y1UP5MGmVnUeSYQahfnqGeUzoqqjOBEuisanx9ac92kF0+e8+9QzUt4lOcK+Xmgyht4mDz1eK8O805T2jd3eKXCTyOM9BFyGjV6pFzZ6pZd2rzSp5GNVGnWOKopWj2m18s9Eq+Wxt/s3n28VK+VyqVaolAuVhWZpodXMVxvtarNUqBcKi4Vms90u1yuL5ValvVCpLcyXqq1Gq9KqLi4UC+2y1mwzkVUz6R/V2hQEf6GozVsa8t90fH+YBiI4F8T1Jdsm4rZJbIZ4TP+x7oOj91EYiMgR8yfq+x9s1g+13vLIY4dbh1vN9xw41Dr4hkeab3mi9cihoYclb+8M/n5HZ3U+LTgDJlLAjoKlsINoY3oXxCJI+uu67zdFfR4wjeSdpvSLXUk5qe7Y+eKz1pKEn1nKL/EuiCZdT7zv7f7OjxZSd2BCP0u8hurArid+WD5DdmB8jxGKE+G42FezA7sB4jQRcAeGZbohJh+rPL+bUNJfT1jXK/m4A9PyIwbmY1Xi5oezJzsU2tz8DkLzu2FnPN0d0Wo5cBPMKPSkud5AaV2Q5nojlWlv93d+pDBfSdtchX6WeA3VXG8kflg+QzZXVDGE/xDBSRpMi+FDwFJEIsDfXO2fVPJxYH/rRopzQdThJsqzt/s7P1IopLbeQj8bhVTPvjrcRPywfCZIPjvDyKfHz06Fn52KfKQub1biBEuuB0KzhOl3QhkxPT5Lfnx3tmu2coTpAl8DebNSHnwn8nWey4mZQXrStr4Mvt158iWx/aGuxJnz6xXaOSW/pNPoZEekk1XoSH1uhnztzmDcjCduK2DeSJizkI/X+bZB3Ccobg4ws4SZ82Beq2C6urtvSx/P/bsD0mmmmN2GVwE/mBd/T1NaFz7ZGYyTtL8FevV10ivshri+b0jg21ffkk5khXrCdYrtmesU7QTLX2uP2tWwXKe7PZi3K5gvLPpsGUyHcue+5Q54b+hqLKTtW4R+NlqtTyH6Fk2/UT7ct9wVRj7zGcJHfu5S5CN1ebcSJ1j3dH9j34Lp74IyYnp8lvz47o+pb7kb0nLfcrdSHnyHfcvvzwyWje2H9ldw+R23b5SN1K/ma0mbcvz8ycxgWSQfyhP7owchHtPfDwuwP/HYMK6/V1EZk2zvjUoZ09rxBwjrVR6+7krA+gBhYf67COvuBKz3Exbmv5uw7knAepiwMP89hHVvAtYjhIX57yWs+xKwDhAW5r+PsF6XgPUoYWH+1xFWPgHrMcLC/HnCKiRgPU5YmL9AWA8lYB0kLMz/EGHtT8A6RFiYfz9hPZKAdZiwMD8fFz2QgNUkLMzPR0MfTcB6grAw/6OE9VgC1v2EhfkfI6zHPVjuWa4unVPyS95ZBUvsPB/ZtO2T04+HhX6WeLXlp++zHFTkivKZINkdVnjNKXE8Njus0Dms0NGwXmWIdYch1l2GWHcbYt1jiHWvIdZ9hlivM8TKG2IVDLEeMsTab4j1iCHWAUOsRw2xuP/x+c/uWdYdff6z5EMbxPOdPG7E9IgR55/jMsUdCTy/gnheq5/unm8lrLX66e75lYS1Vj/dPd9JWGv1093zqwlrrX66e34NYa3VT3fPRcJaq5/unkuENYqf/qnOINYofvpHCGutfrp7LlMZ1+qnu+d5wlqrn+6eFwhrrX66e64Q1lr9dPdcJSyfn34wAatGWJj/IGEdTsD6GcLC/IcJ64kErJ8lLMzPV5Z8KgHr9YSF+T9FWEcSsP4WYWH+I4R1NAHr5wgL8x8lrCcTsH6esDD/k4T1VALWXsLC/E8R1qcTsN5AWJj/04T1mQSsNxIW5v8MYT2dgPUmwsL8TxPWsQSsNxMW5j9GWJ0ErLcQFubvENbxBKy3EhbmP05YSwlYbyMszL9EWCcSsN5OWJj/BGEtJ2C9g7Aw/zJhnUzAeidhYf6ThHUqAet+wsL8pwjrdALWuwgL858mrDMJWO8mLMx/hrDOJmC9h7Aw/1nCOufBcqHRGcTC/OcI63wCX+8lvjD/ecK6kID1PsLC/BcI66IHy4V3dQaxMP9FwrqUwNcDxBfmv0RYlxOw3k9YmP8yYT2TgPUBwsL8zxDWswlYHyQszP8sYV3xYLmw2BnEwvxXCOu5BL5+gfjC/M8R1mcTsD5EWJj/s4T1uQSsDxMW5v8cYX0+AesjhIX5P09YX0jA+kXCwvxfIKwvJmD9EmFh/i8S1pcSsD5KWJj/S4T15QSsXyYszP9lwvpKAtbHCAvzf4WwvpqA9XHCwvxfJayvJWD9CmFh/q8R1vMJWL9KWJj/ecL6egJWnbAw/9cJ6xsJWIuEhfm/QVjfTMBqEBbm/yZhfSsBq0lYmP9bhPXtBKwWYWH+bxPWryVgtQkL8/8aYf16AtY+wsL8kndWwcp0/8qa0Xfgvd0aTbmQIXpSDnyH9LPEqy0//TWj70Sr5Yry4TWj31B4zSlxPOf4Gwqd31DoaFh3GWLdbYh1jyHWvYZY9xlivc4QK2+IVTDEesgQa78h1iOGWAcMsR41xHrMEOugIdZhQ6wnDLE+ZYh1xBDrqCHWk4ZYTxlifdoQ6zOGWE8bYh0zxOoYYh03xFoyxDphiLVsiHXSEOuUIdZpQ6wzhlhnDbHOGWKdN8S6YIh10RDrkiHWZUOsZwyxnjXEumKI9Zwh1mcNsT5niPV5Q6wvGGJ90RDrS4ZYXzbE+ooh1lcNsb5miPW8IdbXDbG+YYj1TUOsbxlifdsQi+cck/bJySfCfPvkJF/ceaxJSKPtjUOMuH14k8Bz0n68B4lnjaZ2vvHBzmAcnm/kPfl45pnPPuIZZj5vhecbec52N8TxWbfbIU7Ko51v3Owpzwxg8LlePJ/LZ7hnIW4nxW2DuJspbg7idlFcDuJ2U9y1EHc7lFXO505TWQvd94FveFGvTvOdj87E/I2i1fPiLnC75Tupkc71hnQQ622dQTo3GNJBrP2dQTo3GtLhPcpIZ6dCR/TmZsq3t/s7P1pIfZZG6Gej1TYmxLqIdvfBTkWuKa8a4esdUJwIx8VGsWDcJL2bpHQWNwPhNRKaCPiYKZZpV0w+lEWkvJtQ0t9MWHHXZkzG0NOqEvOxKmXofdzNQDdBPKZ/d1cfnInaubOfPo4WyoMvBxPe4y4HYx4k/QPAw46dOuZUTLl2xmA2t/R5+eAWHTNSMLVy7aJyMQ83Ew+S/iNQrt1069IuJX8U8w7bFufl35rO7KD0uxPKw/Uk6T/uqaebFB6wTbJMmQdOsyuGh0WFBzRrjQOPHu2atYgCf2mAzRKLnG9AuknBiQuC74onqjhJuGyimI78zig8uSKLN9ds7W8dasUUekJhSiM2EemBXWjJ50LYq4rSd7dCPxvpurjXhh/v1UkoH96GoF2FlFPiUDFYAX10tkZ9t//goQOPx+lC2n44o/ATRfH9MSppRHk29Gft+pPSXWO1QXEiHBc7rsqS1ERGFhLW4q753BzEFHfN52JhdV2n0JV3E1G8O6W5YnwJo88dQwzMp3WL3MVqXTBe9IjpO9D93bBTL6f8fhie+aLG9R89FVLvKnuJjp5yBCdpMC2GHLAUkQjwN6u8XG6RpjmGvRCqMs+XN2CQONxwwhNWuIGEJ6xwQwh+TYfDpFJ2Ka9rRq/Y2cfldMwrNu0nKA6bzacoDj30IxSHk4VHKe52iHuS4vDQ9FMUh5OvshGE74T9Ek22Ber11Mk2oTUXrZYrTmDGeUHatcc5Jf91HjpzI9KZU+gElmUhbHvtfyjQ56EgfW4XEq/9FSyOY+8r9DXavi7bBa5nbTbIh7VzSKzAXnCJXQ6t3Jp91XjVysGzH7I4cUe3Iboh8Pc9ixvsfswEkUMp9eWNQj9LvIbSxxnih+XDo8mtCq9s+1z4dKefjuMmlXcTHqxzhliXDbHOGmIdN8Q6YohlWUbLerQsY8cQy7KMZwyxzhtinTbEWjLEumSIdcoQy1InLNujZRuy1AlLeS0bYl00xLKU/QlDLEvZXzDEspSXpS08ZohlKa9xtYWW8rK0OS8Hn8lSJyz7bSvZu+ctkQ2WC5Z6byn7k4ZYlnpvWUZLO7FsiGUpryuGWM8RVtpxvaTfpqTX5qVkLhM3c0pemUPBuUnrFdU4OeEGUqG/FcrcbC0e3veuA/siCpMkB5HbPKWTJcGJaLXNmY3Biuj3PL2bBDwM+DHJNEtmYeZjS6lXsIX+ei2ZaZvNtXlP7QMfkjenxL0WnjEO6Wgf3sgpcdxvj4J1xhDrvCHWaUOsJUOsS4ZYpwyxLHXirCHWEUMsS52wlNeyIZalvE4YYlnK67IhlqWuHjfEejnU4wVDLEt5WfZDxwyxLOU1rv2Qpbws7b2lflnaHMv2aKkTlj6TlezdM8/BjIveW8r+pCGWpd5bltHSTiwbYlnK64ohlszBaAeGeZu07yOVGh3Mf1cKLG08LOnvVdL75nrugfySV+Ye8AK9EHM9Wn1oHw1Zy1yPyK1A6XiuB23bPTFYEf0u0Lu4uR7et/TF7sSSyDfQfjR1XyTvV8S9ULdT+bT5RXzH+ov5Zzx0to5IZ6tCZ1bJJ+UOLOdmhuhJOfAd0s8qMgkxh3ZdSrkG3h/YyESr7dWkQlP4lbr02VZpr3i8AdPzB+GxfaO9maZ3v91Vrly02u5+ojPIQ1r77uZ6v7N1sGxr3c+KuFq/kaY9rJUOYu3rvPhXOz7DdmTYPayYf2cMltS7C4c6/TT8QUWpjykF04V2p4+H6X/UrS/X35yC/fsuDe5zFTm4Ov7xVj+vmBd55RPT9871Mf+0i6nJWepd0wM+BTij0NUw2TYPW3dbFR58WFhfs5QeLy/R0vPJbEn/X0Hd7aZTxPxxahdQf3bG8ID6gx/Mi9Off7IG/fmnW/28sv7MRoO0e/UK+vOXpD8oY5/+zFIc6o/ISOvb+czDsH075vf5EDdQHPJ+I8XdoJQrQ3HI3w0e/mYVHqT/5I8V7u3+zo8Uhj/jNEdxeMYpR3F4xulaijsKcdyv4KW03G/jJbN8mQ9eGsuX+eAlsLMUh5e68vFTDJP0G+vFtcWzQ5zFQr3hs1jYDvkSYpEV3iihtXkeF/w/3bbq2u1/MztIz+fX5uC9nd4tlNL4CUh/vfzaHPETZ1O0S6Ikb47iXHiq00/HcZPKuwkP1hFDrPOGWMcMsS4YYl0yxDpliGUpr9OGWJb6ddYQ65whlqVOLBlhuefpyAbLhYtGfLlgqRMdQyxLnThjiGVpVy3btpWuujCudtVSJyztl2UbstQJS3ktG2JZyuu4IZalrlrytdFvXz15Wfqrljba0ge4bIhlab/GVScs7cS49kOWYxjLMj5riLVhV18a9suqHt3zpsgGywVLeY2rzVk2xLJsjycMsSzbo2Vfa1mP4+ivuudrIhssS75csLSrJw2xLO3EuM4zWfJlKftxtROWPvnLYVxr2W8/Y4hlyZfluNayHi3bo+UYxnLe1xLLUie4Dcm6J14tL3tXXJAPAE1T+n/SXYeeiVb354ZrzWXfvjihvTsQ7QzRiyJ9nZv3KyA/vLcT46ZG4LXWqsyXiq1mod6oLrYWe3spdxOv/G4C6Lt/r1LS+/aChjlvvlDsnaPv9PHxw1cuTEHcboqbhji8Y/ezuwf5D7MXZ6GYRv5IP6ek532kaetyezSoa9getT0juE+C21KYdlxKvWdE6GeJV1t++ntGNFuaU2Q865Gxtk/uNnhm+zWpvIvbu+sC+/ujYF00xOoYYp0zxHrGEGvJEOvCmPJ13BDriCHWFUOso4ZYzxliWcrrrCGWZXu8ZIhlqfeWttCyHk8YYlnWo6X9spTXeUOsY4ZYlvKybEOW/oSlvE4bYm3Y1atnV61k7575PoFx0XtL2Z80xLLUe8syWtqJZUOscfVXnzTEEn+V5wrdM54/CTufli+u1zdktDktLJPlN2SEVjZabbtCzFdoZfPpAc53oQzisF41JFbYebV+ne72lBvpz3p41cpxraFMbiastHNLw9btXLS6PiVv4DbWm+e82SMnpL+WuzlEbkVK90CnLweW9+4YrIh+F+ndJOBhEBnj/OONhKXZZDw/yJ+SRF27jrBuTMB6gLCu8/B1cwLWBwgL87MO707Aej9haXXi02/EepiwNP0WrLsSsB4hLE03BevuBKwDhIX57yasexKwHiUs7X4Zwbo3AesxwtLu6hGs+xKwHics7Z4dwXpdAtZBwsL8ryOsfALWIcLC/HnKl4c4vFNAOyu7r/PiX7c+8uC2QZ60+xnw7GrcF+2/s62PuX/bIN+YX+zhHP12z9cTzygLsVFi4/Hea2sbj/SiSPd9hH6WeDXmp+f7aPeUo3ykf3R9TorPpfKVFihOhONio1gwbpLe8dHszZRvLV8vnoO4NF2OdjU650NZRMq7CSX9NsLapuQT3ic9+RFDu1ady49XW8j7HQrtaUr/dJegq4OddPWHRgvlITJlPZHrRzgN8yDpl4CHHTt1zKmYcs3GYH4RTM7JbTpmpGBq5ZqjcjEP24gHSX8WyrWbvgyN+spt4JOdQd5yCq0o5h1iY16O89FNyuue8ao0jtP0dgelx2X4NPoq6a94dGWrwgOWl+uVeeA0czE8fF7hAU1r48CjR7umNaKAu4k0U8hVyVWwVcGJCyIGV7wvbtNx5LdP/dCEabeAzMbwiHm3Qrpma3/rUCtGQNy3zMQQm4j0wJ/klHxR1HcPAnXHqd0DoZ+NdL3da8NPge248MPy4a0ccwqvOSUOFWMYOlvh/cFDBx6P04W0foPWX3H+iPJmlHcu4GdG1uuqNo3O7Ih0ZlPSCXF9mUZnbkQ6cwodxtKGJS4sdvrxmP4HYMe/vlvHnIjBlKkCSf+QUh7tWixJv19J/5BSRpFlAeL2R8m0UZbc7z0yJK8HlPSPQJqHiFfk78CQvD6wzrzuVHidVWhzH4Lluhp9iNDPKmUM0Yf45OrCkENMVHUWJ8JxsVEsGMddRY7Svb0z+HstQ8xHIU4TAQ8xsUyPxuTjJsHvJpT0BwjrgJJPeJ/05EcMzMeqpOVzvw8pedI0nUcJf2/3d36kUJhP23SE/no1nSS9YffrMYXXnBKHw0KMQzqPKXQ0rF2GWAVDrGsNsa4zxLrREOtmQ6zdhlivMsS6yxDrbkOsewyx7jXEus8Q63WGWHlDrP2GWDsNsbYZYt1BWNqwJ86NWssQmeeLDsTQv07JH1HeDL27LgZLcNw79GV42FHovt8U+Yc805R+ojv2w2nUSUrD/KT5Qij7Snu7v/OjhdQuvNDPRqt1OIQfkjT0Yj9kv8JrTonj/r6Qko6Fjrsgvn1G4YfzR4SVUd5hnKbjOA0gOs4rqZgXV1K1VXdpV9oq+gzxo63IY/qbKP09wIOWHr8KgemvV9qctpq+NYYe8ofvfNNH98Rgxd3mvieG913AO0/raDsHtClKSa/tDsB+XvjRZMN9+L1KebA+ZUV/mtLfppTHdyq0d5s2xBnak6bj41vAB8t1ujNYbp8MXWCZa7soUJYisxylR/lrO6bvpThsW+yfajtycEcot3vtKxX4hQLf1yjGqd2XUrb722PoIX++do/5h2n3LsguGua9NmS7v13hb5za/c+nbPeiUxvtfvR2r/X3ads99vc/jvkyieAilovn+QThC3UGfYZPQjymf6+nDWg2xDeVrrVpHHvzV3FQlvdQHPIuY6Kr14fNL2i6PPCVq056WbjAstPsDdoIqe9ctNq23EVxOIbkuQ+tn8Ids6yvqGfYT/0JLXnyTYCIgXsFJE7GVIG+ZJF6TCX0s8SrMT+9MZX2tR6Uz5DLInzhG4oT4bjYKBaM46ETD4Xe1hn8vZZlEXSfNRHwsoj2YUPOh7KIlHcTSvoZwppR8gnvk578iIH5WJUy9B5N9SaF9jSlPwCm+oad8XQ3RavlwE3wYYWetrmXm2uYnSeFQtrmKvTX60M4mq5ql/qssbkKfI7gJA2mxZADliISAf7mjbL3d1bn4yA4UuXb6f3e7u/8SGH4b26xmuI3ofjbWfjNLfyuHIdJpexSXie7VwzxLSts7vwtK2w2n6I43HhzhOJwZvkoxeEGlycpDlf6nqK4ayFOvhXGpuZsF1x0gM3h3u7v/IhB+34u1/OG9/CS8R7e3Rn8vRbvYTvEDes9bI/Jh7KIlHfj4D1o+dzvaSVPmqYTxqznU19PJvTXq+kk6Q0vZuxQeM0pcVg2jEM6OxQ6GhZPjid5yqMujPDvmRj6E0r+iPKyTeAB7malLNjmePFPeNkU+dsHf+LxO57FPy2/Cxtdzer2krar0Vwcyast2nCfc01KOhY67oL0QRmFnygabfFPKwuOxljHpZybouFGgn+o6HguGuQR8zvM22jCBj8Ty+0ePxM7Sem1cjxN5eA07GZK+h9DOXZQOZAn4Yc/VSvxUdRvp8eI973d3/nRQup2KvSzxGuodnqM+GH5DOkSolqwOBGOix3XNJKa45s6g7/X4hJ2IE4TAbuEWKZOTD5WeX43oaQ/RljHlHzC+6QnP2JgPlYlbn44ofQZhTY3v3/imVBCup+JVsuBm+B2hZ401w6ldUGa63Eq097u7/xIYb6atrkK/SzxGqq5Hid+WD5DNldUMYT/MMFJGkyL4cPAUkQiwN9c7buUfBwEZ5p4/jdd9XO9xv/YfZ6LVqs6ewzIg8/i5ZT8kk6jkx2RTlahMxutlne7Mxg3oZRV4vDY5j7KNw1xn6C4I0q5JO6oB/NJD+ZTSpyru/dd26cVZ8Y68I7NsWYC0zYXvswF8x8nrKUELL7MBfMvEdaJBCy+zAXznyCs5QQsvswF8y8T1skELL7MBfOfJKxTCVh8mQvmP0VYpxOw+DIXzH+asM4kYPFlLpj/DGGdTcDiy1ww/1nCOpeAxZe5YP5zhHU+AYsvc8H85wnrQgLWYcLC/BcI62ICVpOwMP9FwrqUgPUEYWH+S4R1OQHrfsLC/JcJ6xkPlnuWbYRzSv5nCOvZBKxbCAvzS95ZBUv6E3GjrsB7w3W51LN5Qj9LvNry03ejrkSr5Yry4dmJ5xRec0oc9kUYh3SeU+hoWMcMsY4bYi0ZYp0wxFo2xDppiHXKEOu0IdYZQ6yzhljnDLHOG2JdMMS6aIh1yRDrsiEW92U+v949v6L77PPrJd9xiONpDW365LhCO27cgFMjxxN4vpV4Xuv4wT2/krAw/zDjB/d8J2Gtdfzgnl9NWGsdP7jn1xDWWscP7rlIWGsdP7jnEmGNMn74VGcQa5Txw0cIa63jB/dcjgax1jp+cM/zhLXW8YN7XiCstY4f3HOFsNY6fnDPVcJa6/jBPdcIa5Txw88Qlm/8cCUB62cJC/NfIaznErBeT1iY/znC+mwC1t8iLMz/WcL6XALWzxEW5v8cYX0+AevnCQvzf56wvpCAtZewMP8XCOuLCVhvICzM/0XC+lIC1hsJC/N/ibC+nID1JsLC/F8mrK8kYL2ZsDD/VwjrqwlYbyEszP9VwvpaAtZbCQvzf42wnk/AehthYf7nCevrCVhvJyzM/3XC+kYC1jsIC/N/g7C+mYD1TsLC/N8krG8lYN1PWJj/W4T17QSsdxEW5v82Yf1aAta7CQvz/xph/XoC1nsIC/P/OmF9x4PlQqMziIX5v0NYv5HA13uJL8z/G4T1mwlY7yMszP+bhPVdD5YL7+oMYmH+7xLWbyXw9QDxhfl/i7C+l4D1fsLC/N8jrN9OwPoAYWH+3yas30nA+iBhYf7fIazf9WC5IDffzSn5f5ewvp/A1y8QX5j/+4T1txOwPkRYmP9vE9bvJWB9mLAw/+8R1u8nYH2EsDD/7xPWHyRg/SJhYf4/IKw/TMD6JcLC/H9IWD9IwPooYWH+HxDWDxOwfpmwMP8PCeuPErA+RliY/48I648TsD5OWJj/jwnrRwlYv0JYmP9HhPV3ErB+lbAw/98hrB8nYNUJC/P/mLD+bgLWImFh/r9LWH+SgNUgLMz/J4T1pwlYTcLC/H9KWH8vAatFWJj/7xHWTxKw2oSF+X9CWH+WgLWPsDD/nxHWnydgfYKwML/knVWwMt2/sv709+G93XpPOfW5MKGfJV5t+emvP/39aLVcUT68/vQXCq85Je44PGMc0vkLhY6GtWSIdcIQa9kQ66Qh1ilDrNOGWGcMsc4aYp0zxDpviHXBEOuiIdYlQ6zLhljPGGJdMcR6zhDrs4ZYnzPE+rwh1hcMsb5oiPUlQ6wvG2J9xRDrq4ZYXzPEet4Q6+uGWN8wxPqmIda3DLG+bYj1a4ZYv26I9R1DrN8wxPpNQ6zvGmL9liHW9wyxftsQ63cMsX7XEOv7hlh/2xDr9wyxft8Q6w8Msf7QEOsHhlg/NMT6I0OsPzbE+pEh1t8xxPqxIdbfNcT6E0OsPzXE+nuGWD8xxPozwlpSsDqQ5sHus2+fnOQ7AXGYbhLSaHvjEEPDz0B8XL4OpP0k8TzKfrxdhIX5Ja92buzBzmDcBOTjswJTEMdn0fDGkGMUh+fG/pzijkLccYp7EuKWKO4piJOy4rmxaSrrB7rvA5/oVi8fYnmg/DMxf6No9Zy0C9xmMlQOpHPMkA5i7e8M0ukY0ulAGi7PcUM6iCXHxbV2yLenaHZoyUMH80s6jc7EiHQmFDqMJUe5XdjX6aeZgnhM/4lum3FHuf+YrnHVbNsEvOPzmJptk7a4DHGW6yqCfyoMfklkoe1vxjIJ/VlFdsPoMdLKRqvtfIg1Ka1syD/rIa6doAzisE4OiTWjxIWo02VPuZH+rIdXrRxxbRPp+D4FcMrDF6b37X8XGeJ6kqEMiz4ZanvoXXnlFppma/Hwvncd2BdRmCQ5iNx2UTqxOxPRah08GYMV0e9d9G4S8DCslx3X6MyOSGdWoTOr5Bu1n9V41m7ckf7I+XBn6ey/6DdeRYLndPgTHJL+P97Ux7zQxdTOEcW1yQzQkz7SBb6pCP3PSSXNVAx/z0L/yl8Rn1LKvMfDs2Cij448tzs6D58nvzhQX6z6xUJrjvjFdjlHv93fYxSHvjyftdXOl+E71lffvRHyO86PQj8L0z8/pB+V9pohyauN+VgOGh1fP/50SjrbRqSzTaEzqp+k0dF45jGvC2iHvkd2SPQV2yTmlfsApin9/wl26Hc9dojH/OzbsW1mOyT04uwQ66ek/wOPHdLGDvd34nkWTGzLyDPbIUn/x2SHAvl3qh0SWlo/m4t0eURRun42p8ghdD+bIzrLhnQQS9qK5muy/RnW98f87GvHtdd/cK1OU2uv7hn9Ckz/e9Be/xG1V9R3n3/GfduyQjcTrZbppPLOZ8uWY7DS9lGS/i89fZRvLOSCb6wfx99UtLpNZaL+BeQTHqxIeSfpsX/k+a+TlHbZkzZu7Oqe5TOEYecXqhXRdzynLEHizig8SxyeI35vp5+OwyT9xjI5ffgxffYJ0zE/KKczMZiaTfhkZzCtlHlCwT1FuNjOWV5ypxi38X/f1XfXxv/NtToe64kLv9DFCzuGrla5fjFw/bJ8OGj1K3y7+v2rIeoX6/AsxaFdln6ex3qI4WT//1G/P25taS3t5a9GbC+aPHmdRusfUZ7ThLFnez/NfyJ9lzTcJ7gg7UfarMhvSsnvAvt3PXl36Tv5LOzR6fvaWxTpdgHlwPdInol0XrQyS9qbu3yKPmIbs9PHckHq8RzxjLTPB6KdxvdD+rMKP8J3VombGoHX+UKlUlwoN+fbiwvV+flWhvCFV37H827a/RLXKelF1hejELIuNbXPy10AubowBXHnKW4a4oRH14Y+u3uQ/wuB+E8jf6SfU9I/1OmnG6YucwodHleMgrW8Rqzt0WAb0PpC9G24L0T/Be88rcHnJDS76LN1YtvY7mM52Q4ukK3D/s9Qh8qaP8q27lwg2mltndCfjeLrNqvEjWLrmvPlQrldm19stkutZqWdiVb3CZPKO7Z1mt7uUNIHthV5zdaxPZuCuHMUh7ZOeNRsXZh+sZRPI3+kn1PSs61LW5c5hQ7bulGwlteIJbYO/SD2U9HWsZ96SikP2joel72ebFKgLx2o84BsU5FfF3AMfQrkxPJlHHyHfjPm4XkZSf9m8NvfsF3nT8rwCYU/bV8Xluut2+PTnVLSubVamaPZ1zr0gU/UH281P9BqPN46NBnp7HERufg8nIoonQtT9O4p+s3TNxOEI13wVJQcUCUQS6s6xOau950w5Kl1hzza9jMX9nb/5kcM2tCRu9owS3zF1MMKoZ+NVqtciC0s2vQlyoe7xzBLD8W8G3Xz9LYLrc5q2TAfvIVQ+1hNGvljebWpdtYboauZwLjlzjaYrI9s76dnG5Bm2xi2E5wK1uwJp3+E4nB5LOPB52mQj0M73k3f7kRXB/XIhSmIs2xn2lfD0f6hGxWn/5heZM5LPCgT3/K4k6fUuW9JXlvyxO+Gsl5ry+Gsu9cqdEK3kWupPKiXvGVg2OVCTR+Tlr0ej2ljccteFYjH9N+CZa/DVJ+a+3AV20Bx2Dag1QPKWq71zCnpP9gZjNPagCYn1oUJhQetH9J0YSKGjgv1ztrpcH6JS+NHhHHN03+2W+ivlx/xdEq5inyWwsgnn8a2aPZQG6IIlrZUrvUD2nIcDv94OPds1474tg/4+iltGdzZp/M0bAntD/naw1rpIJZ8qma6+1vGFF8BX+pL2+Pzy+dpNkEebesBlwd1CPuU56lPweUSTdd4ilHSPwh9yjfX6COwHR3WR/BtD/T1Cy7wZ3/SbBvdEunbVOX77VLHMlXy21DHvxUzHHcB6+f7VD9oC7X64W/Hx00HfB+mZZDHPwAef8/T9pDHH8Skc8+filanY1sURbr/wnWI0xRaet4eIOl/lNKvF30I69MUVL8e6599mqT+SHTXt6WK6/m/hXr+M2qvml1ca5uM8yfjbHngY3u1tD7HOHyIVfM54tqOC+Lfaem14yRavbkxD9tt3NoodPED0qfoHfc5Ph/FBbQl/912HQPLp/k5csU+YqSx5cPqs1amcWg3afRao+PzgUIcK8V6C3xsryyyPw18aj4vb1c7A2WYJAwtPc8jMj5fwSf5pyJ9i6y0B+7Hru+u9b2wlY36Ul8ZXZBPSmYUniaVNHw1oiwLbYrh+f3Es6T/K+h7ecu5NhbBbVu8zV7S/zvA/Ppunc8oSmdHteUxXAITfrStz+coHy7DcZ1r2LwUruHwlYtczgl4d72CrS0Fu397u7/zIwbBk6VS3O57QeFnmtL/R9LjSyRTn8zcv4sKXbwq8Xqie5HoOh16/Z5BTOEN/Xusd64T9juZzwMU38OC9vyfqd/D/hr7x2t26LRxPHDew+s5hVdsM0c6g/G99F26Tl4/v0fnFflBXq/e/KHuaw/MY3QG5aPZD+34wrD2Q1uqP0Vxmt+eiVbbsDR9DNaDlh7H+Zh+B9SzjJV885QOX/olbR4i7mhdUj+ljV9xHWLnDh1Xmwt3odkZLK+k/yWYt9i9Q6ftArbBW4ak/UAM7e1A+zaSoTaXYen/aXV1YzRYrmGPq2B+PqIQ4mgS0tT6Z/b1hz2ahPnjrgGQeBcC+7Opx65CP6vIJMTYVRtbakdvJb32Ob4lT3rtk3taveHYFW1rRHRx7HqG3o1yLK06pF3AuWBM/29v7GP+LNkF5IuPnqHNuCnSeYkifx3llPy8JyHUuPAmKs+SpzzDrrdifl5vXTIsj8Zzkt68k/RmrceP/yHozbs9euM7Vr9Ecdp8x1rr4OmUdE6MSOdESjovZZ36mJFO/QB06lc9ft5LXc4nDelocz3cb7F8MU7o8DufnxS3TRR5cHV8YIdOM63eSPqvgd48nkJvtDqIu14J6a7X3pz1soc+LM33lvSab+vzwdKuB2jHKUW3wx4nSb8/ROhniVdbfvr+rjZHcFqR3daoP/dRbx0sFKtvbjUeP/roIa4MAcxFg0I+Q4CSPqLfnM8xNUVplhQaLuAdH6hIfB8GO9SMn4anpLRJ8VojPB1TzihK1wgxf1wjFOPnAm5m4XOnkv4cTKKkuWMBlSfNHQu+jTssa3mfjcmHk8YYh2V+p6fMkv5ZT5lPJpT5ASpz3F1u+JvTTSpl2BzpmyR898DsjAZ5H1afMP96OSs7iU5c5/61mMnjuA2kj0I8pj8Hnfs3qHPXnO/Q5ecBwwmlXI9Cmrg7P6YUTBfanT4epv9ut+yBJ37UM0y+cz+4Af57O5Jl46tzSf9pqPPfTVHnvvaDsn3JOzKFVj6NjiP9n3pH5l9nBoWc1pHhfD5HhtPGNepRHRmNp7i0wzoyOAJgR2bYHSOYX9KF3U1VXLVDGVd1sDHxiOwElEHroON2gmZi8LkDkPxTMbLjHRaS/s/BiXljd5VTq6ubY/iLonR1hfnXa3fPzUQn1KXxPKOx3s56nA7KaZgkJ+kvh+wwcZCA6e+BDvN/oA5Tm0VY60wt63wUpZvh97W3tO2HZTSlYLrADpSk//fkQIU5sTqfv3qrdvOpO3926LRdFVklbqRLeCrtQn5hoVJqF+vV1vwC95HCK7/jflxb0XuVkj7sjFFZvYTnNMjVhSmIO0Vx0xCHK4N8MUUYx6zcTCN/pJ9T0n8SyjBMXWpY71wjllwmoQ3Wr5Yti5vEeRriMf1feyY0Tij8Yb+V5jJnHgxxGdkmurC3+zdJk9oJQehJ/Vyj8MInfSTt/w9yecuewbLE7fyZiimv76LPTBQvO6YxoeR9LBrk7WQK3rSJJ8Q4FsOnw1ivHSgandtHpHO7QifkyhfSTPLH5q7r50F7E7cidbjTj8f0N4M/tr2LqZ3m5Z132sSqdnE7y1523nEatjeS/sYuT9pO6aepzFhOn56hP4Y8x01o7e7ycDUntLjMU1F/dy/axzd39DLH2XmWkeazoB6xDdf6X8aKmzTnMYKU7W+6s+9OV24nPRfZxJX/LZ1BTEn/RsC8c0jMt8ZgvuG6PuZd1HawDndHOj0XtHkTtg+c3wXRRWyjlpNhgj8dBr/3oaEpRRZYJqE/6sfjkFY2Wl1HISYStbL56lm7VNaHNTUk1owSF6JOJzzlRvqzHl61crAPpNHZrchE0h/x8IXppQ2j7ktekSF+uNFQhkVffeOHJIX+Wj4eJeW8kdLxx6NQ9tMxWBH9vpHeTQIeBmczT9zw4vOcUr484Wp1h+9YbzC/pNPobB6RzmaFjg8rr2Bx347pNyvppRz4gdD1mdvu6+dRhVdtjm4t+ily203pxG+ZiFa3wSdjsCL6vZvexennpELjBOXztUsX5hQMrvOjHppR5D8BK+nELxF/ax/5q2FsVf9S+SeBX/ZPng5EO0P0RH74DulrtzAI39pp9lHmD4v1drnRKOULtcJ8u16q+dq3th4i6bX5noKSXmR9Ioysy75bIbT5Q74haxrihEdt/jCMzaqW08gf6Wu3FPL84bBrW76xcVosmT9Euy9te71sjQ9Lm+vLEM+bIn1tk22ZpH8Exv9y8m4yipdDpLybiFbbqfd1Xvyr9aWbIp13jbbgu5BT8ku6q2cr8/PD2sqsIpMQ46OnU8qV12Yxr7bWyh/tGHbefNyxULdno9X6n4n5K3T4HdPBtr6J6IRah0/TTtZKB7HEhwy93i9zievRNztMXjPAMuLcLesNzt+xr4TzeVw/2j4W/tCBez4Izxwm6Tf7B2+HE/WcToK22Y77PW1dCt/5+r0TVDakjfPxX7lOp4nz8ahXcfsj7oZ5yuc9c4pxe4fi9m3F7TX4No0Vwuw18H8Ad0Ypn2EbKc1Gq+tcgnZrErcRbD/cRrD9cBvB9sM3nmPQ2oGkc+3g+BDtIKOUw/eBXG1zuZRD6w8yFIc2/ATFof/Ap5bQVsrtaxmi54LWXnkNwlfm0P7wjFLWq6m77DOdVOSWVgelTE4Hf5RCB9kXYd5YhmsZN3AatqOS/i8864ZPQh7BPASYcfNyaFvRp2DbKun/EdnWQHNyqm1Nc2P+eswVIr0o0scd43CroDbednOXW7rP+w/Um2+qP3rw8P7WBIkSm75m6jk9po2UuEl6xx/teEdn8Lc0B27CjI1uCDY53/K9b1uSNoXypEJX3k0o6Y8R1jEln/Dum7JBDG1aXDC0fO734Zg8cbLCboJl5TvAeiIBi898Yf4ThLWcgPUBwsL8cccC4rDeT1jaliDBOpWA9TBhYX7e7nA6AesRwvJtRziTgHWAsDA/XyR1NgHrUcLC/HGXj8Vh8SXMvovfzidgPU5Y2ne9BOtCAtZBwtK+hyhYFxOwDhEW5r8Ykw+7ahfSXNof5juXhVLark7or9el/ZrcUT7sLl5SeM0pcTzMvKTQuaTQ0bCOGGI9bYi1ZIh1whBr2RDrpCHWKUOs04ZYZwyxzhpinTPEOm+IdcEQ66ghVsYQa9oQ6ynCyihYms3d2v3nwsFDBx5vdccXEQXfeMD9PhZDf7uSP6K8GXq3PQZLcNxv9PF5uC5l2xTp/rjgTVP6V3SnPbVlvgklvwu+LYGBty+mHtoK/fXacjhN/LB8uL8/ovCaU+K4DiZS0rHQcRdkzJtR+OH8EWFllHcuaFvQtKm0DMUJPX7nmy7kYyPiD7wO9D7uOI22hOACb+mX9EXA/HqKe1Y02yTpT3rKjPxoY0zJG3ZpoTqvTXVK0KbpeXpfOyKuLXPx9D76Ajzdhn07yoSDNu2K97SkWQJjfRFc1hex1Ww3MS8uZWnbYO8hmpq9wXfcJjC/pNPobB6RzmaFjg/rHgVL0mvbP3zbMrVtiYG3ePS2ZWpbTrX5sLVsyxS53U7pZBl0IlrdbxyNwYro9+30bjLSt2VqujIRw6fQTdIVzB+nK7hUIHN0Ln4J4jH9vq4Nlno/QmXb2/2dHynUSr7tH2GXpmqp5zzitnYg39qWo5G2YFZLhUI1X2i18uV8vZn3tWVty5Gk17Yo3aukD7uUUstrWzB5m+UUxD1JcdMQJzxqWzDD2KdaKvkjfW3rDm/BHHZbHsY9sEYs2YKJNp6PF4S2TXw8cb/iQ643L+JDPebxZ7W+CX1PXvvQjt9oRzi4XMMe4ZhISee+Eencp9CZVfJlYv4KHX7HdDSek7YvPX19Pw/qd9zYQ+b+pyn9v4XtS8e7z9o2DZ7zTdoWwO1V8uO2AF+/LOlPgX7ytoAjVGYsp6ZnUuYppVwu8LYASX+efINA22zVbQHcF6+/35B+7oSPZwQ6clfw9QHadqCU2wJYxVGcCMfFRrFgXNIUyds6g7/Xsi1Ac3d8S91a160t0x1R6Mq7CSX9k4T1pJJPeJ/05EcMbVgiGFo+9/vhmDxxssK6Y1lhfl6mOpaAxV2jtgVC8iwlYPG2AN+NM8sJWLwtAPOn2WKAWLwtwLfF4HQCFm8LwPxptgUg1qjbAhBr1G0BiDXqtgDEGnVbAGKl2RbA+bB7dSHNUj4uUxku5ae+X13or9dSviZ331L+RYXXnBLHUx7aloGLCh0N65Qh1glDrKOGWE8bYh0zxFoyxFo2xDppiHXaEOuMIdZZQ6xzhljnDbEyhlhXe8n8yRj6OSV/RHkz9C4XgyU47jf6v2mWzI8o9HjJ/F9uLJmb9Ksv1SVzGQ9mFH44f0RYGeWdC7hkLum0UzSYP26qFaeWEIOXtSX9X3mWtbWxmG9Z23cCAPnRxrl8+7A2zp0V7M5qzLDf9s03tG/7onymO+ll4UKabRDsx7igfW+LT5Zhe2G/KkmvfMvZkhenNrXx7h1Ec9gT2Zjfdyv15hHpbFbo+LDuULAkvTZG9S1na2NU6Sv4W+17u7/zo4WiT9e0ce5alrNFbrsoHS9na9+TZqyIfu+id0nL2VinR2L4FLpJuoL5fTqZxib66EwodHg56NZuXxH4hpeSdgqe/ZozgWhniJ7ID98hfW1rkfCdVeJGWQZvV4v5Rqndys+XFhcb+d5N2tqcF75LYzPuUtKHtQtVdRn8LMjVhSmIO0Nx2PcJj9oy+NlA/KeRP9LPKel5GTxtXWpY71wjliyDazdbr7etkfmFO7q2RlsGD81L4C2OFd6qiEGzJzxmwfY77Clw3I44zClwlDnPtSQt97Je4qe7JpU0vNwr6cugE7zci3kE03cKXDBxuRd55uVeSV+jPvAklX1v93d+xKAt9/Lt6DhHGOJ7sGHLOHw74G0WaNd5GzD2WbxMzvNoGIfrEHyzrTY3rh21O0FxlyGOtxY/A3E8psegtWWpF9cezu7s43K6iGii3rAfgzZP5Ktt+bgbnjPRan+J37G+cX4tH/LjQuDbegthb3fq36js25qg6c9atxMhrSxhWcvOVzbfNipt+6gPK82WQMQKvP2lV6dHPeXWbJDGq1aODD1r7exuRSaS9oSHL0yvzY1J3sB9nfcWYmyLQn8t8wMit9dSOr4ley23EL+W3sXND0h6bavhMYWnNFvtjiZg8V6TuH0zce0NsXiviSYrn94hFu810fROsE4mYPFeE01nBOt0Ataoe00Qa9S9Jog16l4TxBp1rwlijbrXBLFGvYICsYa5gkIbT7qgzbfLfKIbuxyjtRPJi2shOA/OxwYl/Z/c0Mdcgmc+zoh2oBMNxqHdP07845qYYIQ9ypJ+fVDoZ4lXY34KPturbZNPuS2Ub85AcSIcFxvFgnG8DJih3xOUby3bQrUuY1rB9HUZnA9lESnvJpT0RwjriJJPeJ/05EcM7SMXXH4+BebefUahzafAPgfTDztp+kGjhfLgKRBtxzumYR4k/Zc8UyCSZiqmXNMxmN8Hk/PVG3TMSMHUynWUysU8HCEeJP03oFyy/SGKVusrtwGZPuXhAfOuvUNszMtxPrpJed3zp+GZ4zS9/Qyll+01cTJlXZH03/XoypTCg7Y1PI4HTnM0hoffUXhA09o48OjRmB0RvMuHTSFXJVfBlIITF0QMrnjSHBhHfvvUT9tNEsW842qQvPgh+mZrf+tQ3JYR7lsyMcS4z5AwG+kFdGFctw8F+tiVd/uQ9mEuPnGDebWLdnnYlpbOWrcPxfkNWn/F+SMPFuZxjeUHmwfT+VxgFxY7/XhM/xOwE7wdSNJMxGDKsFTSa7f/aFPfkv6ykh6nc3mKBKeBL0fJtLH9sV19Zkhen1XS4xTyJeIV+Xt2SF4fWGdeJxReZxXabKOwXFfDRgn9rFLGEDbKJ9coGnoIw5dyoTgRjosdZxbYFHH/+/bO4O+1DGGuQJwmAh7CYJmuxOTjJsHvJpT0zxLWs0o+4X3Skx8xMB+rkpbP/T6k5EnTdK4Q/t7u7/xIoZD6GzVCf72aTpLecPf+nMJrTonjaYDnFDrPKXQ0rFOGWBcNsTKGWEcMsY4aYj1piHXCEOukIdZpQ6wzhlhnDbHOGWKdN8S6YIh1zBDrsiHWhCHWtCEWn1KaULDi3CiLU0rPxtC/TskfUd4MvbsuBktw3Dv0ZXjYIf3Cpsg/5Jmm9LPdDwJrp5QuKvlfyKO8k/LMKLSvhgsv9Nfr9G/S0Iv9kMsKrzkljvv7tBeGW51SEt8+o/DD+SPCyijvME7Tce0jF7xqh3m1VTvtAwe+Ibv0nzjFgRjNTj8e098CbYenOLSVZN/QWlstxr5Y+NFWnnlXF+YTP0PbmS3pAp94amknnrC8051BWWir3ZieZaetaKO/wH0I9v+nKQ79Mty5zjZE6sPp39x1g+m0Uw5p7Fak8IpY8n1K7ULVUekgVpvonIA4XC0v39jHRZlgO0KfuQLxmP59N/YxK91n384PvlD3Z6Ad/vs98flFltoNJvy9NdQD9su0cqL8mh29nHuBz/9AO7WxXeJ391yYgjjDdtnW2iXaPW6Xmo3C9Nwufe0YZZaLVrdZHmudULBQ5kk70rlOBY93g9+v+EPat/ROEe/HhuRd6480O3MCyvGXO158TvMxHa0P1Ooqp+Q/FYM1ofCP7ZrrfVKhraUXncBlbs1+T1P6j0BdvX6PjhnF8HAihudNMenPEg+S/pcVffHZCdT/M4Qp6X8FMPmSxiTMR2MwFz2+itZOcVfdsP0t+yMox/MUh7xzv3kO6HPax4k+xqGeM93Iwy/3uUn8cn8kcUehP3u4+zxDeMa2vOSry9cp5Ulblyc85WcsyTcVrdZXXxtCeR26UcecHhLzU4pPoPk6D3b6tI/G+DMusD/jAttttCnoH5bJp8F+aIn4F4xjSnvVfAXBCuorFFp5zVdAWbCvkCQ7tinaLl6sZ19/NUdxSxAXqi/+3o5B3JMeXPe8h/jw+ZDueT/EY/pLHjuuydAnc22MinLl02lYH2coTtPpcdNXlA/rq08WLgw7Xmd91fonTV/Zj/PplQs+fZW8Tl+/5vEdhb42t8DrFEk6EyenTTHp2QeS9N/2+FVaH6d96CVtH8fbQdL0cdhuUSb3dwbLI+m/m9KeS72EHfsVClr7QLly+/DJ0AWWuXYyAGUpMstRepS/1j7OUZzvNEfaecCk+Z0DZOuTPtLDY1H0E1lfNVsv6X/ksfXW/SvPjWhy9dmOcdPlcbH1PMeh2XpN/3D+4mMpfA3fjVCarpxU+NfmxXjeWZsXu2r9fEzd++awfO0giob3kbjutVtjtDkinmNJsin3UzmSbArPtUr6fzGkTfHplaVNQd59NmV95kbHW698NmVYvfL1gWiD3kn+I9Lkm+E0PfKtfaUd+/n0aFLhC+3kjILrwt7u3/yIwbcmMxOtrl/DuZ/Ue/OEflaRY4g1ca1eUT4TJJ8wN4Dly9dGq9uKC63OatkwH9yeloB3kfH7AYfX+fEEK66d/XWKtTPtdDXPB/wnmDv7G8LUbk5K2/Ylr8Ot7tB5RdwlJS/rwaaY9Fj2Ab256cU/2hhQs5+abkn6JB+Ob8dKu76+HENH20ug9cuS/hooq298uD5r9sXC1V6z5zkS35q9dsONT1e1mxm0W7FwDPjXMW1LWxNzAW0C8ih8uNCENCwfzb/Tbg9g/+5GRY98soCjcUP3y9xmhh2La/Xgsxla3azak+OxGUn7fFimkv42j0w1O+STqcU+n7Qy5eM+QietTCX9a1LY4bQylfSv9chUk5FPpkn7DFimKG/eV5wkUz6aps1v+mQq6YsemeINimlkKunnr6JMscznKB/aDPY52d5lY/Jd78E8HYPp8z8ZI64uNZvGdfnznrrUynU6ZbnOGJXrzJDlkvRvCVSuYzHlOjZkuU4nlCvu1uP7lXJpfVjcuFabc3kBtzNIT9K/N6Vv93KZM+N5Mc0P9+258unLWsY3t9DcBuon6wDe+OObp+N9ZR9PqQN4Y60LUxAXWgdQl1kHtDln35pb2jnnnJJexsmaDvB4y0oHdu4YTBdqb62UjeWE4wico+BxBN5wr7VFTi/tDvfWYXvj/Se9DwWDvr4e9qqyfHFO4+BNOu24tsJzGpL+1E19zCe6z9qRct6fMKztRjnH2e6nNmz3gO0WmWm2m/XeZ7u1sx9YH9xulxQ6Tj+e357MvzaXLOk1n0/zwdjnO+fxjbQ5IJRTNQbzMuj9xZsGy6/td3LpvnCTDe0rnrFD0u2Dw87t8N4hbb+FVu6zSrl9Z15YJuirYnr2VTFumLGFtreXZbgpJj374JL+eUXP0ux90PhL2y+iX8023fd1oSiKn8fC9NiH89qOtn7jO69x9dYIi0XNFmN52Rb7fKIost0TyXYabTG3jyWFTlpdkbxOVx7v2mJt7urpFGXT9mBo/HNbkfL8ENoK75vX5lN9fntvD47HLmpl8K2Xp13z1fyZM5582jon0trb/ZvPt0cKQq+3ZqHwEtdf/hnI8S17dF4zq/gdLWh7gTIkJ7TBhrYhnyF6UbR6rMB9k9bf7DXhp78mq80Dau0u7JeCCm1ck0X9bXVWyybOf9D8XxyP/GPquzQbgPZ0AeIx/V+CX/ZPYzCjaHjbiftz/8G1g7jWe9R8+7h865tLFKed12EfB+WL6Xmfo6T/n8E2+M5FrsvaZ6F91ffG8v5X3BvLfbemf3FfE0IZxvmh2EYw/f/h8UN9+3OXh+T9lMI7t3NuO/84hY86yv7cPRCP6f/dkGut67WXDvOd6D5v7M9Ntz/3BMSl3Z/7PbLdJxR+tHstWF9R/5CPWyAe0/9nj/4l9UvDztcKP8PuEfbt5VynObPi1Z4zk7pPs0dY2xel3X8i9eH072xX/0LKsVLN93xaqUPRVw5TEI/pt3f7jSyUQ/6O9BXNSr3QLtXb9fl6s1lu1PlLay5InW0JQL9YrS7Uiov5cqXZaDfLpfWm31hcWCy3FhsLhfJCqZxvrnv5m81WoVyo1KqtcrlZm19v+uX5eqVRrxQKtXKhVS4k0nf2YLari2JTJW21+961q1fCF9gyhCfPMk5Cm2A4bmtkiF4U6eNIoZ8lXo356Y0jtfl7Td4zwEMAfhYzhI/8TCrykbrcosQJltybhf3xFuJfyojp8Vny47s8+c1bIK3c7ZNR4iaVd7gGcjfp6RSka3cG46YVmhK3yRN3jSduczTIO8bNQL59lC+rYDoenqb1FK1uNX9e+6rOJPG2JQGLv66F+bcQ1tYELP66FubfSlizCVj8dS3MP0tY2xKw+OtamH8bYc0lYPHXtTD/HGHlErD461qYP0dY1yZg8de1MP+1hLU9AYu/roX5txPWjgQs/roW5t9BWNclYPHXtTA/3yd5fQIWf10L819PWDckYB0mLMx/A2HdmIDVJCzML3lnFSzun2+C91ejfxb6WeI1VP98U7Rarigf7g93KrzmlDi2WzsVOjsVOhrWrCHWNkOsOUOsnCHWtYZY2w2xdhhiXWeIdb0hFtutpP76ic6Lf339teRD3cV0uMdL66MRI84fQN88yS+4n3jWaGo+ptyhxD6m0MW4TcQbxl0DcVsoDn1MtvszELeV4nCsKeVBH5PHdlg2LivyqPGcpTgcV0xTHMpoM8Vh/7GJ4lB+Uu4QY+rF5kIjXysVmvV6JV9ZqA4zpuYxFuaT/pj1fO8a+RwMjUJG4VPrj4V+lni15affH2tjBW08J/KZDSOfvM9+zSryEX62BeEnXxJdySm0hVfp93A8julnQYaYHp8lP757nvRVG2/kKM4FHqtrYyR8N3GVsLTxFspN6tTZlOdIFqivmZi/gsvvmEesT7brWwzpIJbMNWjtyf3b2/2dHymUilKObUo5hDbqlV3bma+ktXVCPxsFbcsFnw6jfHjskVN4zUWrdfipTj9dkn4jHQ3r0phiLRlinTHEOm+IZSmvU4ZYZw2xlg2xjhhiWZbxnCGWJV8dQyzL9mhZj8cNsSzb0EVDLMt6tNTVZwyxLPXrgiHWs4ZYlno/rjbHsoxXDLGOGmI9Z4hlKS9L38RSv8bVL7TU+3H15Y4ZYp02xHo5+HLjqveWvslGnzYc1rj6cuNqCy19OUtbaFmPlvIaV//rSUOscfW/ThhiWbZtyzZkKS/LfsiyDY2r7C3t17Ih1rjODVnql6XvO64+5jj2He6Z16ws+o65GGx89q0Na3QyCs/amjLuNZmJVpfXcl1Z8LcHwpdya/tQsUxCn9eYJV77K1gcJ7SyhGVctoKvbL61aFx3RxnEYV07JNaMEheiTnOeciP9WQ+vWjlmDWUybYi1ibA2KVja+u2weuLbix24vRZ9tk3bz+32LMi+rGZr8fC+dx3YF1GYJDmI3D5E6eQcwES0Wg9yMVgR/f4QvZsEPAxzkV6nGp9Cl9/57HvcfrQI0oXdw/RiXSI9KUcU6X1RVpFJCHs5m1KuvGcE8+ai1e3toc5gPqTDMg+zt6NYSytzoZ+NgupAT+banlbNV9H2eEneXLTaZn2m00/HcWn6Qow7aYh1yhDroiHWEUOsjiHWOUOss4ZYlwyxLhhiHTPEsqxHS3lZ6upxQyxLXV0yxBpXO2HZHi1lP666etkQy1InLHXVUl7nDbEsbbSlD/CMIZZl32HZhsZVv14O9itEP3T19tyXFjNET8qB75D+T/ue+093+uk47mqu45wyxLJc47BcE7Lc42u5xjGua44vh/0q43qm47Ih1rjuH7PUL0tbuLGn8KWhEycNsSz1y3I/gWUZN/YwbdiJl6OdsCyj5TkfS39iXGVvuTd0ow0Nh/W0IdZGG7p6srccu1uOkWWPnG+vVuh9axmiJ+XAd0h/vfaCaXLV5u2G3RNltY/JBb6XFO86Xaf6K661/qbD8OOtv2lFrsPUnwv7O7pcI7sylGYVulyfIfeNIT2RH75D+llFfiHqU7uzVGsnIrsdCq85JS5H+fCO3n2dF/+6PU3NXf087p/ckYZ3NOGdZBMQj+n/9119zH27BmmjzLm+J+C94T6nn/r7trU75NhmTkI+nt+fVOhMKnQ0rHOGWJcNsc4aYh03xDpiiPWMIdYxQ6zThlinDLHGtR4tddWyPVry1THEWjLEumiIZakTJwyxLHXigiGWpbws7ZclX5cMsSzr0ZKvce07LOvRUvaWbduyjFcMsY4aYj1niPVy6Lct23aIvnauG4fjObkvdo7yuectFId3cyMGxiF/Ux7+MP9UTD4uh4xHQ50tEvzNYfB7Zx6vUWSFZeI7yrW5Nf4rWBwntNZr7ksrmzb3laP0LIM4rGuGxJpR4kLU6SZPuZH+rIdXrRxTJBOtnWUUmcj7zR6+MP2cQlvyigzx7n9DGRZ9MsS2KPTXcl5U5PZaSiffs5qIVuvgNTFYEf1+Lb2bBDwMc4Sh2VFuz3H1m4vJ78Ksh472vQQp35ZIt/X8zbFhbT3ml3QancyIdDIKHcbS5kxdWOz04zH9/9WdJ9W++zqj8Odri9q6ALYp4UeTTS5FPhdmFVrC03rc04D0hF98h/SzxGuoPkmbv9fWKYedv2e7oH2PbIdCR8OS+pyLVtcv94ua3s146GjfMQmrC4USyxKDxF2nlFHi8HtCqB8cJuk3lsm12b+mb9xHCpb2bRvhbdzkNENx+K05uftA4vDbce1OH4NDkgyzt/RxOR3zinXF35fqfTNZ4csF+bbRNKW/tWt3w9ZFsa7VBdvO6wLRTms7hb6mG8J3Vokb5ftErWqjVVsslxcq5fn5UqOSIXzhld9x/6d9F1G7P0BkfUMYWVe176NfD3J1YQrirqO4aYgTHl07+Szp6fWB+E8jf6SfU9Lz92vS1uX2KL6PHLWdL6xLOy81r147LzXHuZ0X3XfN6/V2qdHON+rtlmU7187HhW3npfpPdzsv1S3a+Sc7/XTD1GVOoYNzA1Y2Q/N354jOsP4u5vf51dMj0plW6Iybv8jfQkRdRTlxWC+/msdTe7u/8yOFQpllESl8oSzYr0bfmf1q/LbvsH61lHdYvxr16XqKm1HyhpVv+rE+91WB5hB7Y31tDK61YV+/qtk+HNeMakfZ9mHdpvle+nYPHe1+vXFra3ynI/b/qB8cktrTMDZJa0/jJie+z3TcbBLW1fWUVnifVtJOUZykfbjrV7m5oGe7z9pcKK9ZIjZ+W5b50OwBz/tK+se79J1M/sMeHXMiBhPrxgX0P6UcvTESxNnpWqPg+P7W7j4fbBvRt42zZ9rcpaTXfHzNxuWi1XrNtlSb50cbJ2s0mjyFx6shT5xDZnmmnXP2yR9tlMgozVheo40y9slTeLwa8kQeWZ47EsqURp6+eX2fPH3rNi68k9IL9qZIX68RPLY5l8Dm7N45yB9+15d1YYuCjTbU186ySjn4PALm5fMILlzTGcR94S+8mwbcF8qH6SluBuKmOoN0st3fU0AHsYSPaUr/PPQlL5QB8kj+nEJ/E9Ef4Ft5hzrIWJPKO0nvZPqFLo8hvi/fmF9YbJTn6/lWwf0sJn1fXpMT2ggXRNZYF5uUsk1T+u9AH/+b0P5fSKvQc+n+yJMuE/P3BQzl3VRn8J1WR6i7kr53v3FnNY8StwXi0H65sLX7G+WFWMLHNKX/Q9Jd1DfJn1Pobyb6A3wr71h3tyjptyjpXf38TpdH0Vssu/UY7wWahI/vmLc/CtiuWovlWmWx1pjPN/O1Qq2U1K6cXZ+lb7+jTR5Wl3nsh1gy7xd4z1xR218V2eEX0pwvDbNfr91OUw9If7322KXd0xV231a75cbx2j4kbS8j83EN8ZgNxKPm4+L+ShemIE74cGkev2WQx4lAPIZto+0mn1N0YV/nxb+O5j8jP1HqBsfMqPfYt2P6fw59+39P43e2uS7gfjNtz6P8lvqaUNLymgTv89TkiulFJzfFlHUTlVXS/0vw1Xfs1DFRfsjXRAzmvwJM3muGfrqvzUv6LUp6bGPCj28OReMdxz38TqufDKXlPhjXp66htNfE0GF5aDxsVnC4n2RMpsn64AKPkSYVOtimsM+fUegb9g/zWl8pgb8hgnXDe5Jd+FCnn46DNocoZXLl/TH565iO+dHamqVvJO+n4T3TnaS0mygtrxMij2vdm488auuJ/K2Xazz8ZwhnSsnnO+e/Vn4zCr9aXzMqHcT6cGeQDtYz9mlTNGeLdnxSyfupTj8e08/s6WNe031O6tPYlmAZPtLpv4vbq499F7ZJnmfivovTYD+O6bd1y4F9F9sHxHLvciRPzUfQ/D72EfIgzx0kT80HmItWy4Z1eIZooX8s/QvLYBfwcdOeeFoi11lPGd27PXv0dMgDpmMMre/kcyHanvw5hS9ue2w7NnloaP2ZRmOa4katH63f1vZjZBPisT9HOvxuQkmf5H9kY7A1XO0ciWbnN1NcRoljG4blRRvGvok2JkPbqLW7uLrz+d4a72n8qk0e3jX5oR2ynsvJV/OFfKMy324Xmgv1xXLSXI41/eJ8rVqvLeYLxXaxWKourDf9hfJCoVqtVxsLjXat3Fhcb/qN2kK7ViotFkq1ZqtWWPfyt8qlxXahvTKfV2rnS9XCetNfmZ0vtsqFxcX5Qqteq7WHmUvU7DOff5I2hO+x/cmeAe6v39Ntb4HPxua3K/JM08dp5dPsywdiyvcg+AHv35NMz2cztb6Qz1dq+yAEozd/nrIMkv4XwZ/7Oo29cN4L59xcmOoMlm9v931+tFDW1nZxvD7dGSy3b67CBfaTtyrpcQ2UfRpcO+Wx3LSCpfVLrGebIt3vFTzWsybUEa/tos5niXcsO/sKkwpd3xyH47ND7TnQukBFm1OQMBvp/g3GYTvhPXs8V4xxqAcoAw7aHIbIwvF1PMVeMs1OsC3Q5v00OzEVDdLDdotn2V2YgrjQ7RZ9bG632pykti8iF62uN9ZXzXfU2gD7nJMeetp4CdtA3Joc2gScU1hOMaeAedleS/qvQJ9zmvoctE+sL5qdYV6iSLdjaeaatLGr1EvgexTmM0RPyoHvkP56fWc47X0Wgf2jsvCjjXm1enZrc9ui1XWmja9xnvX9nRf/avros23sH2m2TWvrbAe0MatvbsLX1nF9KY3vqLVjbueY/uvQjn/o8R3j5vmiyF+HvjpH+fJcjLZe45un8dnzzR6+ktaYmC9tjSlSaCeVwad3mn99FfvUea1PxbJzn+rzbV3gOphV0mv+bo7So8x9c09au9xCcWnbJfqhP4zpS7EcaGd5fkhrn9hHY7+eIV6QBs6fHeoMpp8GXE6PeNOU/k8VX58xxda4cLizGpN5xvcoFx63S7o/Bx5Owp5+lgP374H2rqQ+99rbu6nII0T/ro3/tH3FgcdLDV870Pw+Hl9x3WEbjtuHwOuc2Deg3ed5+3/W1S2+r8oF3jud9g4vx8t/TWsoodZWsV9A++UC+vv/nGyUdocQ5hX7wW3xfwE/4X/yrCEKj1siv83S9uKw/sTtZ2GbJen/lcdmaeMc5OtwR8f835R5KZ9eaPXHuozpfeuF2jqddpYI29ML2J3VmIF9hKbmI6B82EfwycKFYf1H0Y8cpUc5au2I50B9uuqCb+8Mni/454HWeFqFQqG9UF6sLjSK+Xazsd5z/OV2pb7QruTni81yq9isDzPH75NxRpHxnEfGaf0hxsp4sKYTsB4grLg2yPnWyT8pZ4ielCOK/P5JmD2hfv8E5cNzo5qvoN0DxmPgYeePtDlPCyzumxE7rm1oY3aUURTp/g7K9n2dQbq+/eaB5sBS6+C43umqzevzeBD7LvYVtX5Nm39YLyytL2ZdCDTfl3o+lM8eBNLNwrC+h7aOw3MK6Jdw/Q17F8u4Y6H98c2zp6l3jY5vjBhqHBV3p7EFHcSSMRnbFws6iCVzKdpcIvdxw+oB5ue7ZtAPw/Hnwi06zbhxGK83SfqP39LHrN0ymEZk9LOQ5q107gV5N7QpNW2NMSLZoA/O7QfXelnncQ6U9RTnQPmudbynDM8mcJik3ygnh3kmxT0aKGvNx+a5etEp9r0l8FygpL+f6pP3vu/t/s6PGLQ9PELr5aRLa9GXP0uhL5qObKK4CaUc2liQ/TLNn9dsfpydRnzNtsqdjxlKG0XDjz0lL86T+WwjYrNtrIPdO0D2VlsP0/oSeZ+0HsZzVNp6WNjzkPlFbQ1Kgqbv3E5Q37mdbIM4bid41xzbXLwPBmXCQWtDeF4zrc09ENOvCg2sKxd43ipuTWsB7OwL7zr9dIZ12PtO6nSnz7PIZqrT53sT8O0C3h0g6Xr3FobhNS+8yl0DuO6Fdy9IWSYoPT/z3R7LUJdYRrQTvjs6tHsO8P4H4VG7E2NLZziszYR1zQhYwpd298M1a+RLw9pEWMPcafJEt25CzKXWK61aeaFUbJTatXo1Xx2X/dKXyNd6qe2X/i70l1duSaY3jvulv9Tle2O/9KDMxmm/9K9BHV3N/dI/ofa8sV+6nwb3Sw8zftnYL63PGY3rfumfQD8+zH7pvyA/e637pf8l9Dn/kPqcjf3Sg+XAd0h/Y7+0v5439kuH3y/9r6Ed/7XHd9zYLz3IC+dl2kll2Ngv3U//07pf+q9j+lIsx1r2S0sf/V8Au834W4EHBQA=",
2152
- "debug_symbols": "vb3druzKcWb7LvvaF8zIzIhMvUqjYchudUOAIBmyfYADw+9+KoOMGDXX7srFWbV0bqShrT1jsEjGx59Mkv/12//607/85//55z//9X//7d9/+8P/+K/f/uXvf/7LX/78f/75L3/71z/+x5//9tfHP/2v3471H6W03/5Q/+nx3/23P/T13/rbH2z9t/32h7n+e/z2h1IWzAesf1OOgBIgATWgBfQADbCAERCVa1SuUblG5RqVa1SuUblG5RqVa1SuUblF5RaVW1RuUblF5RaVW1RuUblF5RaVe1TuUblH5R6Ve1TuUblH5R6Ve1TuUVmjskZljcoalTUqa1TWqKxRWaOyRmWLyhaVLSpbVLaobFHZorJFZYvKFpVHVB6r8tqPhgTUgBbQAzTAAkbAvGAeAVF5RuW5Ko8FLaAHaIAFjIBHZXns2HI8KktfUAIkoAa0gB7wqCxzgQWMgHlBeVSux4ISIAGrcl3QAnrAo3JditWCJ4yAecHqwRNKgATUgBbQA6KyRGWJyhKVa1SuUblG5RqVa1SuUblG5RqVa1SuUblF5RaVW1RuUXn1YLUFPUADLGAEzAtWD55QAiSgBkTlHpV7VO5RuUflHpU1KmtU1qisUVmjskZljcoalTUqa1S2qGxR2aKyRWWLyhaVLSpbVLaobFF5ROURlUdUHlF5ROURlUdUHlF5ROURlWdUnlF5RuUZlWdUnlF5RuUZlWdUnlflehwBJUACasCjcjsW9AANsIARMC9YPXhCCZCAGhCVS1QuUblE5dWDrS+YF6wePKEESEANaAE9QAMsICpLVK5RuUbl1YNtLKgBLaAHaIAFjIB5werBE0pAVG5RuUXlFpVbVF492GXBCJgXrB48oQRIQA1oAT1AA6Jyj8o9KmtU1qisUVmjskZljcoalTUqa1TWqGxR2aKyRWWLyhaVLSpbVLaobFHZovKIyiMqj6g8ovKIyiMqj6g8ovKIyiMqz6g8o/KMyjMqz6g8o/KMyjMqz6g8r8rtOAJKgATUgBbQAzTAAkZAVC5RuUTlEpVLVC5RuUTlEpVLVC5RuURlicoSlSUqS1SWqCxRWaKyRGWJyhKVa1SuUblG5RqVa1SuUblG5RqVa1SuUblF5RaVW1RuUblF5RaVW1SOHmzRgy16sHkPtgUlQAJqQAvoARpgASNgXqBRWaOyRmWNyhqVNSprVNaorFFZo7JFZYvKFpUtKltUtqhsUdmiskVli8ojKo+oPKLyiMojKo+oPKLyiMojKo+oPKPyjMozKs+oPKPyjMozKs+oPKPyvCr34wgoARJQA1pAD9AACxgBUblE5RKVS1QuUblE5RKVS1QuUblE5RKVJSpLVJaoLFFZorJEZYnKEpUlKktUrlG5RuUalWtUrlG5RuUalWtUrlG5RuUWlVtUblG5ReUWlVtUblG5ReUWlVtUjh7s0YM9erBHD/bowR492KMHe/Rgjx7s0YM9erBHD/bowR492KMHe/Rgjx7s0YM9erBHD/bowR492KMHe/Rgjx7s0YM9erB7D44FI2Be4D3oUAIkoAa0gB6gAVF5ROURlWdUXj2ofYEE1IAW0AM0wAJGwDxBVw+eUAIkoAa0gB6gARYwAqJyicolKpeoXKLy6kG1BT1AAyxgBMwLVg+eUAIkoAZEZYnKEpUlKq8e1LFgXrB68IQSIAE1oAX0AA2wgKhco3KLyi0qrx60sqAGtIBHZasLNMACRsC8YPXgCSVAAmpAC4jKPSr3qNyj8upB0wesHjyhBEhADWgBPUADLGAERGWLyhaVLSqvHrS1dVYPntADNMACRsC8YPXgCSVAAqLyiMojKo+oPKLyiMojKs+oPKPyjMozKs+oPKPyjMozKs+oPK/KdhwBJUACakAL6AEaYAEjICqXqFyiconKJSqXqFyiconKJSqXqFyiskRlicoSlSUqS1SWqCxRWaKyRGWJyjUq16hco3KNyjUq16hco3KNyjUq16jconKLyi0qt6jconKLyi0qt6jconKLyj0q96jco3KPyj0q96jco3KPyj0q96isUVmjskZljcoalTUqa1TWqKxR2Xvwcb/OvAcdSoAE1IAW0AM0wAJGQFQeUXlE5RGVR1QeUXlE5RGVR1QeUXlE5RmVZ1SeUXlG5RmVZ1SeUXlG5RmV51V5HEdACZCAGtACeoAGWMAIiMolKpeoXKJyicolKpeoXKJyicolKpeoLFFZorJEZYnKEpUlKktUlqgsUVmico3KNSrXqFyjco3KNSrXqFyjco3KNSq3qNyicovKLSq3qNyicovKLSq3qNyico/KPSr3qNyjco/KPSr3qNyjco/KPSprVNaorFFZo7JGZY3KGpU1KmtUjh4c0YMjenBED47owRE9OKIHR/TgiB4c0YMjenBED47owRE9OKIHR/TgiB4c0YMjenBED47owRE9OKIHR/TgiB4c0YMjenBED47owRE9OKIHZ/TgjB6c0YMzenBGD87owRk9OKMHZ/TgjB6c0YMzenBGD87owRk9OKMHZ/TgjB6c0YMzenBGD87owRk9OKMHZ/TgjB6c0YMzenBGD87owRk9OKMHZ/TgjB6c0YNz9eCQBRpgASNgXrB68IQSIAE1oAVE5RaVW1RuUXn14HicOs7VgyeUAAmoAS2gB2iABYyAqKxRWaOyRmWNyhqVNSprVNaorFFZo7JFZYvKFpUtKltUtqhsUdmiskVli8ojKo+oPKLyiMojKo+oPKLyiMojKo+oPKPyjMozKs+oPKPyjMozKs+oPKPyvCqX4ziSSpIk1aSW1JM0yZKWwpxm0GrHix6OeThJUk1qST1JkyxpJM2g1ZgXpUPSIemQdEg6JB2SDkmHpKOmo6ajpqOmo6ajpqOmo6ajpqOmo6WjpaOlo6WjpaOlo6WjpaOlo6Wjp6Ono6ejp6Ono6ejp6Ono6ejp0PToenQdGg6NB2aDk2HpkPToemwdFg6LB2WDkuHpcPSYemwdFg6RjpGOkY6RjpGOkY6RjpGOkY6RjpmOmY6ZjpmOmY6ZjpmOmY6ZjpmOMpxJJUkSapJLaknaZIljaR0lHRkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn5fs85J9XrLPS/Z5yT4v2ecl+7xkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5ZJ9L9rlkn0v2uWSfS/a5zx2a4qRJljSSZpD3+UklSZJqUktKx0jHSMdIx0jHTMdMx0zHTMdMx0zHTMdMx0zHDIdPKrqoJElSTWpJPUmTLGkkpaOko6SjpKOko6SjpKOko6SjpKOkQ9Ih6ZB0SDokHZIOSYekQ9Ih6ajpqOmo6ajpqOmo6ajpqOmo6ajpaOlo6WjpaOlo6WjpaOlo6WjpaOno6ejp6Ono6ejp6Ono6ejp6Ono6dB0aDo0HZoOTYemw/v8nLVsSSNpBnmfn1SSJKkmtaSelA5Lh6XD0jHSMdIx0jHSMdIx0jHSMdIx0jHSMdMx0zHTMdMx0zHTMdMx0zHTMcPhE5cuKkmSVJNaUk/SJEsaSeko6SjpKOko6SjpKOko6SjpKOko6ZB0SDokHZIOSYekQ9Ih6ZB0SDpqOmo6ajpqOmo6ajpqOmo6ajpqOlo6vM/NSZJq0pqufRyOHVTQwAHORJ98f2EBBawgto6tY+vYOraOTbEpNsWm2BSbYlNsik2xKTbDZtgMm2EzbIbNsBk2w2bYBraBbWAb2Aa2gW1gG9gGtoFtYpvYJraJbWKb2Ca2iW1im2nzSVWBBRSwgg3soIIGDhBbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bGRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLOlkSSdLOlnSyZJOlnSypJMlnSzpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WdLKkkyWdLFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxM4sqY4DnIlnlpxYQAEr2MAOKoitYWvYOrYzS5qjgBVsYAcVNHCAM/HMkhOxKTbFptgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsM2sA1sA9vANrANbAPbwDawDWwT28Q2sU1sE9vENrFNbBPbTNs4DrCAAlawgR1U0MABYivYCrYzS4ZjBRu4bOVwVNDAAc5Ez5ILCyhgBRuITbAJNsEm2Cq2iq1iq9gqtoqtYqvYKraKrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6to5NsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDZtgGtoFtYBvYBraBbWAb2Aa2gW1im9gmtoltYpvYJraJbWKbafNJh4EFFLCCDeygggYOEFvBVrAVbAVbwUaWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZMkkSyZZMsmSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZmSVyZJbIkVkiR2aJHJklcmSWyJFZIkdmiRyZJXJklshxYCvYCraCrWAr2Aq2gq1gK9gKNsEm2ASbYBNsgk2wCTbBJtgqtoqtYqvYKraKrWKr2Cq2iq1ha9gatoatYWvYGraGrWFr2Dq2jq1j69g6to6tY+vYOraOTbEpNsWm2BSbYlNsik2xKTbDZtgMm2EzbIbNsBk2w2bYBraBbWAb2M4sqY4dVNDAAc7EM0tOLKCAFcR2XuNMRwUNHOAMLOc1zokFFLCCDeygggYOEFvBVrAVbAVbwVawFWwFW8FWsAk2wSbYBJtgE2yCTbAJNsFWsVVsFVvFVrFVbBVbxVaxVWwNW8PWsDVsDVvD1rC1tPksNX9jlpzZ2Bx9j1PHBnZQQQMHOBPPFDyxgAJia9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tY1Nsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZtoFtYBvYBraBbWA7U9B3szMFTxzgTDxT8MQCLtu5e3oKXtjADi6b+P7rKXjhsok5zkCf1RZYQAEr2MAOKmjgALEVbAWbp6AMxwo2sIMKGrhs/ia8er5Y0vF8teSJy1aro4AVbGAHFVw2f81YPV81eeJMPF83eaLbfMnOV06eWEEvVhy92NrGPo/tkWmO689ac6xgAzuooIGrbnObh8KJHgoXFtBtvgweChcu23oTkPistkAFDRzgTPRQ6OpYQAEr6DZffR4KF7rNF9JD4cIBzkQPBXWxh8KFAlawgR1cNvXF8VC4cIAz0UNBfSE9FC4U0G2+93koXNgTvbsv9D/zX+F9bL4TePNe/3Qtg/lCevM6+lS1wAIKuJZhvfVBfLpaYAcVNHCAyzbWQvqktcACCrhsozg2sIPLNnzJvHkvHKDb1v7r09ce9/8c3WaOAlawgR1UcNmmK7x5L5yJ3rwXFlDACjawgwpiq9gqtobNu3v6L/buvrCDCho4Er31pq8ob70TvfWmb0Jl0ZVFVxbdm2H6ivJmuFBBAwc4E70ZLiyggBXENrANbAPbwDawTWx+LJzD0StMx0eFx7W14wBnoM/hCiyggBVsYAcVNHCA2Aq2gq1gK9gKtoKtYCvYCraCTbAJNsEm2ASbYBNsgk2wCbaKrWKr2Cq2iq1iq9gqtoqtYmvYGraGrWFr2Bq2hq1ha9gato6tY+vYOraOrWPr2Dq2jq1jU2yKTbEpNsWm2BSbYlNsis2wGTbDZtgMm2EzbIbNsBm2gW1gG9gGtoFtYBvYBraBbWCb2Ca2iW1im9gmtomNLOlkSSdLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLlCxRskTJEiVLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLjCwxssTIEiNLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCWDLBlkySBLBlkyyJJBlgyyZJAlgywZZMkgSwZZMsiSQZYMsmSQJYMsGWTJIEsGWTLIkkGWDLJkkCXjbMjqWMEG+uJ0RwUNHOBMPBvyxAIKWMEGYjNsZ0NOxwHOxLMhTyyggMvm434+ESqwgwoum4/j+ESowJnoDVl8ybwhLxTQberYwA4q6LZ1V8KnPMn6LIz4lKdAASu46srhuOr6R2R8ytNjSMrRwAHORG89v/PvU54CBayg27qjK3x5vd/8TrrPcxK/Z+7znMRvfvs8p8ACCljBBnZw2WpzNNBtLj6H3xy93y4soIAVXLbm68H77UIFDVy25ovj/Xai99uFy+a3z32eU2AF3aaObvNl8GP3hQYOcCb6sftCt01HASvYwA4qaOAAZ6Ifuy/EptgUm2JTbB4V3fdJj4oLB+jbzfcoj4oLCyhgBRu4bN3Xr0fFhQYOcCZ6VFxYQAEr2EBsA9vANrB5KHRfSA+FCyvYwA4qaOAA54X1OD8XdWIBBaxgAzuooIEDxFawFWwFW8FWsBVsBVvBVrAVbIJNsAk2wSbYBJtgE2yCTbBVbBVbxVaxVWwVW8VWsVVsFVvD1rA1bA1bw9awNWwNW8PWsHVsHVvH1rF1bB1bx9axdWwdm2JTbIpNsSk2xabYFJtiU2yGzbAZNsNm2AybYTNshs2wDWwD28A2sA1sA9vANrANbAPbxDaxTWwT28Q2sU1sE9vERpYUsqSQJeXMEnWsYAM7qKCBrpCFZ4CcWEABK9jADipo4ACxCTbBJtgEm2ATbIJNsAk2wVaxVWwVW8VWsVVsFVvFVrFVbA1bw9awNWwNW8PWsDVsDVvD1rF1bB1bx9axdWwdW8fWsXVsik2xKTbFptgUm2JTbIpNsRk2w2bYDJthM2yGzbAZNsM2sA1sA9vANrANbAPbwDawDWwT28Q2sU1sE9vENrFNbBPbTNv17coTCyhgBRvYQQUNHCA2skTIEjmzZDpWsIHLtqZNVH+1XaCBA5yJniUXLpu6zbPkwgoumxbHDipo4ABnomfJ+gJL9TfdBQpYwQZ2UEEDBzgTG7aGrWFr2DxLtDl2UEEDBzgTPUvWHJfqEwsDBXTbcGxgBxX0ur5hPR/Mt5Dnw4UNXBXMt5Dnw4UGruVdn1ipPlnwQs+HCwvoNv9Bng8XNrCDXtdXn/f8mhpTfQJgYAX9F7vCe/5CBQ0c4Ez0nr+wgG7z9es9f2EDO6iggQOcgT4BMLCAAlawgR1U0EC3+ecivbsvFLCCDeygggY+1Z2J3t0XYhNsgk2wCTbBJtgEm2Cr2Cq2iq1iq9gqtoqtYqvYKraGrWFr2Bq2hq1ha9gatoatYevYOraOrWPr2Dq2jq1j69g6NsWm2BSbYlNsik2xKTbFptgMm2EzbIbNsBk2w2bYDJthG9gGtoFtYBvYBraBbWAb2Aa2iW1im9gmtoltYpvYJraJbaatHQdYQAEr2MAOKmjgALEVbGRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEknSzpZ0smSTpZ0sqSTJZ0s6WRJJ0s6WdLJkk6WnJMx1yzmek7GvLCBHVTQwAHORM+SCwuITbAJNsEm2ASbYBNsFVvFdgbIdGxgBxU0cIAz8QyQEwsoILaGrWFr2Bq2hq1h69g6to6tY+vYOraOrWPr2Do2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Eb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2Ca2iW1im9gmtoltpu2cgXlhAQWsYAM7qKCBA8RWsBVsBVvBVrAVbAVbwVawFWyCTbAJNsEm2ASbYBNsgk2wVWwVW8VGlihZomSJkiVKlpwzMNczIPWcgbke8ajnDMwLCyhgBRvYQQUNHCC2jq1j69g6to7Ns2Q9h1LPGZgXGjjAmehZcqHbxHHZ5okVbGAHFTRwgDPRs+TCAmIzbIbNsBk2w2bYDNvANrANbAPbwDawDWyeGuv9zvWcVTnUsYJewRw7qKCBA5yBPquyrlky1WdVBgpYwbZQHDuooC2sjgOcicVtzbGAAlbQbd3R66rjAGeiHKDXHY5edzquuutZ/OrzJx/3WhzXryi+ZCsJanHxSoLAAc7ElQS1+JKtJAgUsIJu81VdXeGLs9q/ii/Oav8qvn5X+1fxxVnt/7jt4lhAASvYwA4q6DZfhjYSved95zpnSl4oYAUb2EEFDRxg7r/nTMkLsan/IF8lWsEGrh9UfUWtng80cIAzcfV8YAEFrGADsRk2c5svrw1wJo4DLKCAbvO1PhrYQQXd5vvvGOBMXOcPjzsAjpkw50zJCyvYwA4qaOAAM8/OmZIXFlDACjawgwoaOEBsBVvBVrAVbAVbwVawFWwFW8Em2ASbYBNsgk2wCTbBJtgEW8VWsVVsFVvFVrF5gKxnoKvPlAxce0k7/4WZ6AFyYQHXPtm6YwUb2EEFDRzgTOxuU8cC+jHLHP0s6Px3FfS6578wwJmoB1hAASvov2I6dlDBZeuH4wBnoqfGmn9WfTpnoIA5lHFO57ywgwoaOMCZeF51nFhAAX2IxBf9HCI50X+Fb3nPhwtnoufDhQUUsIJrnfXq2EEF3dYcBzgDfTpn9dFJn84ZKGAOV53TOS/soIIGDnAmntcXJxZQQP8V3VFBAwfov2Ktap/DGVhAAev1AG0931V3YQcVNHCAM/F8oPrEAq669cT1K3w81mdrBho4wJnoPX/h+hU+JOmzNQMr2EC3+Srxnr/QQLf5evCeP9F7/kK3DUe3+a9Y5w91Pa1ffbZmYAcVNHCAy+bDlz5bM7CAAlawgR1U0MABYjNshs2wGTY/f/CxUJ+tGaig23zt+PnDhTPRzx8uLKCAy+ZXST5bM7CDCi7b+vpt9dmagTPR88GvvnwO5yM7HAWsYAM7qKCBA5wXNp/D+QgMxwIu2/poWvM5nIEN7OCyrdPF5nM4Awc4E/364sICClhBtzXHDrqtOxo4wJnoqXHhQ+GvRWo+cbOutws0n7gZ2EEFDXSFrx2/1DjRLzUuLKCAFXzY2uG/bQVIoIIGjoW+vCtALlwBElgW+m9bARJYQbeZo9t8cze3+eI0Awc4E/sBFtAPSU49SZMsaSTNoNXBbV3aNZ85GVhAASvYwA4qaOAAsQ1sA9vANrANbAPbwDawDWwD28Q2sU1sE9vENrFNbBPbxDbT5jMnAwsoYAUb2EEFDRwgtoKtYCvYCraCrWAr2Aq2gq1gE2yCTbAJNsEm2ASbYBNsgq1iq9gqtoqtYqvYKraKrWKr2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6tY+vYFJtiU2yKTbEpNsWm2BQbWVLIkkKWFLKkkCWFLClkSSFLCllSyJJClhSypJAlhSwpZEkhSwpZUsiSQpYUsqSQJYUsKWRJIUsKWVLIkkKWFLKkkCWFLClkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKllSypJIllSypZEklSypZUsmSSpZUsqSSJZUsqWRJJUsqWVLJkkqWVLKkkiWVLKlkSSVLKllSyZJKljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJ2NnpzrGAD/baWkyZZ0kiaQX4n8qSSJEk1qSWlo6WjpaOlo6Wjp6Ono6fjbGt1bGAHfRUORwPXKlyjsc1nT17obX1hAQWsYAM7qKCB2BSbYTNs3tbiG8zb+sIGdlBBA91WHWeit/WFfhfGSZJqUkvqSZrkFX138SZd71FoPheyia9vb9ILO6igL6lvBW/SC2egz4UMLKDfuHSqSe6ajh1UcLnWO4abz4QMnIneomvwtvlMyMD1y9bbGZrPhAxs4LJ1J02ypJE0g7w7T/KKJ64/ruroS2qOA5yJfvC+0JfUf6D39IUVbGAHl83Xmx+7TxpJS+Xl/cB9UkmSpJrUkpbE9w+f2RhoiX50vnD9ffOV7w174argK8L79SRLWkvZfNN4t57o3XrhWtBz9Xq3Xugqr+DdeqEvrC+3d+v5871bm68n79Y1qNV8quKF3q0XFlDACjawg76r+PJ6t3bflbxbuy+v92X3hfTG7L6Q3pkXNrCDCho4Er1Ru/9Mb9QLG9hBBQ0cgT55sK2nEJtPHgxU0MD1Z2ugqvnkwbaeC2w+edB/u88dvEiSalJL6kmaZEkjaQZJOiQdkg5Jh6RD0iHpkHRIOiQdNR01HTUdNR3ebeuhyuZzAPtJM2i120UlSZJqUkvqSZpkSelo6ejp6Ono6ejp6Ono6ejp6Ono6ejp0HRoOrzX1NeC99qFBvoe4juL99oaiGw+la+Z7zfeVeb7jXfKenCx+US8Zv7v+nHtwgJ6XvkO6/1zYQM7qKCBA5yJfrq6hu2bvwoxUMBlG/7bvJWGL4630oWeuOe/OwN9el5gASX+zKfnBTawgwoaOBL9UHfh2kDDSZJqUkvqSZrkxc1xgDPRzzgv9MXzP/NDnQ8K+ry7wAHORD/UXVhAAdfK8FFDn3cX2MFlm8XRwAEum48P+hS8wAIKWMEGdlBBAweIrWPr2Dq2jq1j69j8AOmDmD4bL3Ak+sHQhyt9sl3zcUefVhfoi+NbyDtt+hbyo9qFAnoFX+t+VLtw7Rg+wuiT4roPFfrktX64Yh5gAQVcu5sPK/rktcAOKmjgCPRpat1HI32aWmAFve507KCCBg5wJvqR6sICrn93zTFtPsnsQj/iXFhAASu4lqwUxw4qaOAAZ6Ife/yyzieZBQpYQbdVR6/bHL1ud5yJfjC6sIACVrCB/ivUUUED3ebbzY9KJ/ph6UI/ZvjaOQ9MJ1awgR1U0MAB+vHJ19l5gPL1oF7B14MqaOBINF8y/5kmYAUb2EEFDRygL5mvHe+hCwsoYAVd4etsKOjFfLf3dvLLH5/V1auvB28cv+bxWV0n+qyu9b6C5pO6LpKkmtSSepImWdJIcsna/3wyV2ABBaxgAzuooCV6x/kFm0/b6n5p5tO21hSl5rO2LtIkSxpJM8i7yi/NfMJWoIAVbGAHfTWvDeVTs7pfsPnUrMBVwf9Vb5+TepImWdJI8nW6tqxPygosoIAVbKCf0K4dwidadb/48olWdpIk1aTHn9v5Jz1JkyxpJM0gc4lvIm+jCwXsoJ9i+zb01jjRW+PCtYv6z1idcVFNakk9SZP8h/taHAOciX7AurCAAlawgR1UENvE5n23Ljy7z5YKLKDbpmMFfT85HH1HKY6+p1RHAwe4bGu/6T5bKnDZ1iVm99lSvbt4NaD5X63+u6gnaZIljSA/2K1Tw+7ToHr3hfbDmvqS+mHtQgPXkq6Lou7ToC70BrywgAJ6XRd7q62riO5Tm7r6D/QD2IUFFLCCDeyggga6zVect+GJ3oYXus1Xp7fhhRVsoNt8nfkB7EID1+o9y86g1bAXrX71pfJ+PakmtaSepEku8W3kx7gLZ6K37IUVXItpvhP60ezCVcF8e3rLnugte+FaUi+wWvaimtSSepImWdJImkGrXy9Kx0zHTMdMx0zHTMdMx0zHDIfPiLqoJElSTVpbdk0S7T4bKlBBX2XNcYAz0TvUN67Phgpc+9Gp8EPkhQ3soILLth577j4bKnDZ1uOH3WdD9eFL5t275ot2nw0VWEG/GPSF9J6+UMGH7ao1kmbQauiLSpIkecXu6EvqP9u7eV1Adp/bFFhAAX1J/Wd7N1/YQQUNXIvqv8+befpq8Wae/k+9mS9csunLuNr2+odrvvfhv98/6nZ4Vf+o24UVXMu1Lqa6z0sKVNDAAc5Eb8kLCyhgBbEZNsNm2Lx9py+kt++J3r4XFlDACvZcD/7xqgsN9BXlNv941Yn+8aoL10H98D10tW9gBRvYQQXXKd3h+9Nq4sB1UrceZ+w+GSmwgD6T93CsYAM7qKCBA5yJ+cHsLvnB7C4FW8FWsBVsBVvBVrAVbIJNsAk28TVZHRvYQV+TzdHAAc7E6muyO/qaVEe3ebHzU7EnNtBt5qiggQOcie0ACyhgBRuIrWFr2M5PxYrjTDw/FXtiAQWsYAM7qKCB2Do29d82HAsoYAUb2EEFDRzgTDS3TccCCtjBVaF4i6xQ0HN5VygEFlDAtbzn5vYz8Qs7qKCBA5yJ8wALKCC2iW1im9gmtonN82HdCek+wSjQbeooYAXdZo4dVNDAAc7EcoAFdNtwrGADO7hs6+5G9wlGgQOciSsfApdt3XroPsEosIIN7KCCbpuOA5yJng8XLlt18cqHwAou27qQ7z7BSKsrPB8uNHCAM9Hz4cICCljBBmJr2Bq2hq1h69g6to6tY+vYOraOrWPr2Do2xabYFJtiU2yKTbEpNsWm2AybYTNshs2wGTbDZtgMm2Eb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2Ca2iW1im9gmtoltps0nGAW6TR0FdJs5NrCDCi7bulvTfYJR4Ez0LLmwgAJWsIHLtm79dJ9gFOiHjuk4E+UAXVEdBXSF/2IPkAs76Ar/8R4gFw7Qf5D/Yg+QCwsoYAUb2EEFDRwgthUVfj7vM5UuaknrbP/89zTJkrzicJyJHhIXFlDACvry+5r1kLhQQT+N9i12Xm+cOBP9+7YXFlDACjawgwpiU2yKzbAZNsNm2AybYTNshs2weUj4rS6frhRYQImrtXZehZzo1zznv9BBBS2u4fxlb4FuW0cgf9lboNt8D/CQuLCC/ttO7KCCBg5wBvpUJl1zA7pPW1K/NefTltRvzfm0pcABzkRvfL/p5tOWAgWsYAOXzW+k+bylQAMHOBM9Ay5cNr/h5S9wC6xgA91mjgoa6LbpuGx+s8QnOgUWUMAKNrCDCho4QGwNW8PWsDVsDVvD1rA1bA1bw9axdWwdW8fWsXVsHVvH1rF1bIpNsSk2xabYFJtiU2yKTbEZNsNm2AybYTNshs2wGTbDNrANbAPbwDawDWwD28A2sHk++E1uf5dboNu8eT0fLqxgA93m+7qfRFxo4ABnoJ6jcicWUEC3DccGumI6GjjAmegB4jcGfRJWoIAVbJFRPhErUEEDBzgTPUAuLKCA/bof55OvLrKkdbfOf7jfWHTyG4sn+fIXRwEr2MAOKrhMzWkkzSBPCL9f6RO0AgVcJw++pvzk4aSepEmWNJJm0IqGi0qSJKWjp6Ono6ejp6Ono6dD06Hp0HRoOjwMznXvYXChgj6M6pvOw+BCH0j1jeJhcGEBfaX5zuphcGEDO6iggQOciR4GfmfX54AFClhBHyf07X4OFJ6ooIEDXLbp29vD4MICrvV4Uk1qST1JkyxpJM2LfEbYRSVJkmpSS+pJmmRJIykdJR0eAn7e61PCdE0U6j4nLLCBHVTQwAHORA+BCwuITbAJNsHmZxF++u1zyAIHOBP9LOLCAq7RG7+X6XPIAhvYQQUNHOBMXBkRWEBsDVvD1rA1bA1bw9awdWwdW8fWsXVsHVvH5gOMfk/3nC1WnFqS/9F0VNDAAc5EO0CfXeC7lglYwQYum9+K8xezBRq4bMWXdvX/hav/A93mu4sPOV5YwQa6zXcMH2L022s+i+1CH2S8sICrrt9T81lsJr6ifKBRvJl8pFF8eX2o0e+e+Sw2Exf7YOOFM9BfwRa4bGtmT/e5bYEVbKDbpqOPzxdHH6AXx6VY82S6T2gzvz3hE9psPUbR/b1rgRVsYAcVNNBtvgxlJq42N9+NfB5cYAWXovlCrjYPVNDAAc7E1eaBBRSwgtgqNm9zv1Phs+MCBzgTvc0vLKDb/Bd7m1/YwA76QPzhaOAAl82vRAdtPmjzQZsP2nzQ5oM2H7S5z44LHGCGis+OC8Sm2BSbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDNvANrANbAPbwDawDWwD28A2sE1sE9vENrFNbJ4afovBX8wW6HvJ+S8McAb6FL5AnxdijgJWsIEdVNDAAbptNbrP5Qv0w+p09LondlBBA31qy+E4E+UACygxKeCc4XdhAzuooIEDnImeDz4PyWf0BTawgwpaoieB3xLxGX3mU5J8Sp/5lCSf0xeooFfojgP09eBL5j1/YQF9eX1beM9f2MAOKmjgAN3mm/CcUnRiAQWsYAN7zAA6J/2d68G7+0Rj7Xh3+z0en/YXWMEGdnD9ilPh3X3hAGeid7dfsvsUwUABl82vyH2WYGAH3ebbwrv7wgG6zbe8d7fPz/GJguZX5D5R0Pwy3CcKBjbQ6/pv8z6+cF6oPiUwcNVd197qk/9851Kf/BeooIEz0WcOXVjBBvZr8pz69L5AAwc4E33m0IUFFLCCayHXBbb6vL/AAc5EP4yvq2n1eX+BAlYwZhnqORvwQgUNHOBM9FlFFxZQwJiVqudswAv9V5w4wJnozXuh/wpfD968F1awgR1U0OeQnjjAmagHWEABK9jADirov6Iv9Oa9sIAC+q9QxwZ2UEH/Fb6Nz/m9J87EcYAFFLCCDfRtYY4DnInephf6rxiOAlawgR1U0MABum3tMOdMwQsLKKBPFjwcG9hBBX2KuzkOcCaeE+pPLKCAFWxgB71udfTpjmul+rzAwAL6jEdx9F/RHRvYQQUNHOBM9J6/0G3q6HV9Ib2P16R+9XmAtiatqc8DDBSwgl7B17ofhC9U0MABzkTv4wtLLsM5uf7ECjawgwryK7yPL5yJq2PH4Vt+dew4fK2vjg3soILrpuXhm2UdhANn4urjcfg2Xn0cKGAFG9hBBd3my2sDnInDbb41RwEFrGADO6ig23x/GAOcidNtvpfMAgpYwQZ2UEG3+b4zBzgDfQLhWNPp1CcQjjXjSX0C4Vi3LdQnEI51g0J9AmFgBxVctnX/QX0C4Vj3H9QnEI7itnKABRRw2cQXZ3X3WPcf1CcQDvElW0f0QAMH6L9t7eA+gTCwgAL6vu42P/G+sIMKGjjAmXg+YHNiAf1X+JqsHVTQQP8Vvib9Fv2J7QALKGAFG9hBBb3u2hF9UmBgAb2ub8JewQZ2UEGv65vbe158a3rPX9jADipo14Ober517MKZeD7OeWIBBaxgAzvo69e3vHf3id7dFxZw/YpzE3rHVt8RvWMvnInesdX3Pu/YCwX0ISDfxt6b1Ve192b11ee9ea4H701Hn7wXWEABK+h1zdHAAc7E82lp/zN/MciFAlawgR1U0MCR6G/pWTNy9Hzj14UVXPvDupWm9RwgO3H9Cj8L8gl5gQP0oau1Un1CXmAB19rx8z6fkBfYwA4q6DZfO+c42Ykz0bvwwgIKWMEGel1fJed7QvxXeGc1/8XeWRd2cC1Z9xW1jrGBa8n6WWEmrnPlwLVk3deDd+GFFWxgBxU00G3VcSb6kffCAgpYwZa/2I+x3Ve1d+GFM9G78EKv2x0FrGAD1z7pPXS+metCAwc4E/1VBxcWUEBfOycqaOAA/Vesze1T5AILKODqAE/a8x1cF3ZQQQMHOBO9j09cO/j0XdknjAUqaOAAZ+LawQMLKGAFsTVsDVvD5uO33gw+6StwgDPRx3AvLKCAFWxgB7EpNsWm2AybYTNshs2wGTbDZtgMm2Eb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2Ca2iW1im9gmtoltps3fahVYQAEr2MAOKmjgALEVbAVbwVawFWwFW8FWsHnw+00Sn0R1oQf/hQUUsIIN7KCCBmJr2Dq2jq1j69g6to6tY+vYzkPHcJyJ56HjxAIKWMEGdlBBA7EpNsNm2AybYTNshs2wGTbDZtgGtoFtYBvYBraBbWAb2Aa2gW1im9gmtoltYpvYJraJbWKbadPjAAsoYAUb2EEFDRwgtoKtYCvYCraCrWAr2Aq2gq1gE2yCTbAJNsEm2ASbYBNsgq1iq9gqtoqtYqvYKraKrWKr2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6NLFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSn5Y11gi0+rSs4UNmPi0rcIAz0bPkwgIKWMEGdhBbx9axdWyKTbEpNsXmWeKjcj6fK1BBAwc4Ez1L1mC0+nyuQAGXzXydeZZc2EEFDRzgTPQsWWO36vO5AgWsYAM7qKCBA5yJE9vENrFNbBPbxDaxTWwT20ybz/IKLKCAFWxgBxU0cIDYCraCrWAr2Aq2gq1gK9gKtoJNsAk2wSbYBJtgE2yCTbAJtoqtYqvYKraKrWKr2Cq2iq1ia9gatoatYWvYGraGrWFr2Bq2jq1j69g6to6tY+vYOraOrWNTbIpNsSk2xeZZsmZFqM/9CjRwgDPRs+TCAgpYwQZiM2yGzbAZtoFtYBvYBraBbWAb2Aa2gW1gm9gmtoltYpvYJraJbWKb2Gba5nGABRSwgg3soIIGDhBbwVawFWwFW8FWsBVsBVvBVrAJNsEm2ASbYBNsgk2wCTbBVrFVbBVbxVaxVWwVW8VWsVVsDVvD1rA1bA1bw9awNWwNW8PWsXVsHVvH1rF1bB1bx9axdWyKTbEpNsWm2MiSSZZMsmSSJZMsmWTJJEsmWTLJkkmWTLJkkiWTLJlkySRLJlkyyZJJlkyyZJIlkyyZZ5Y0RwMHOBPPLDmxgAJWsIFuU0cFDRzgvNCOM0tOLKDbpmMFG9hBBQ0c4EwsceZoPhVtrImQ5lPRAg0c4Ez0fLiwgAJWsIHYBJtgE2yCrWKr2Cq2iq1iq9gqtoqtYqvYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gUm2JTbIpNsSk2xabYFJtiM2yGzbAZNsNm2AybYTNshm1gG9gGtoFtYBvYBraBbWAb2Ca2iW1im9gmtoltYpvYJraZNp/iFlhAASvYwA4qaOAAsRVsfq6xZsOaT3Eba4Kl+RS3wAZ2UEEDBzgTPUsuLCA2wSbYBJtnyZq4aecL8S4c4Ez0LLmwgG4rjhVs4IjILGdUOLYDLKCAFfRiJ3ZQQV90cxzgTPSoWLMXzGfGBQpYwQZ2UEEDBzgTz1MJ3/LnqcSJArptOjawgwoaOMCZ6FFx4bKtKY92zpe7sIIN7KCCBg5wJnpUTN/yHhUXCljBBnZQQQMHOBMntoltYpvYJraJbWKb2Ca2mbZzvtyazmnnfLkLBaxgAzuooIEDnIkFW8FWsBVsBVvBVrAVbAVbwSbYBJvESZmJVLCBcVJmIgoa6DZznIkeFRcWUMAKNrCDaxh3zS41n0UXOMCZ6NMbLiyggBVs4Bo0XpNSTc6H3U80cIAz8Xzg/cQCCljBPOE859ZdqKDbxHGAM/F89P3EAgpYwQb6b+uOCho4wJno0yYuLKCAFXSb7wQ+QWLNOTWfhxfodf1n+gSJCwu46hbfFj5B4sIGdlBBAwc4E32CxIUFxDaxTWwT28Q2sU1sM20+ky+wgAJWsIEddFtxNHCAM9EnSFxYQD9Yrsbx6WXTD+4+vSxwgKvYeiLCfHpZYAEFrGADO6iggQPEZtgMm8+z8cO4TxmbfsD2eWLXP/W9xA+sPk9s+qHO54kFdlBBAwc4E30vmb4BfC+5UMBlm75+fS/xA6DPHpvT16TvJX7o8Nlj16L7XnJh/iCfHDbXM2Lmk8MCO6iggQOcib4TXFhAAZfNzzX8/WlzXcSbvz8tUEEDl23dIzV/ldqF69ARWEABK9jADnrdtc789WjTjy3+TrS5nlOzc4qbH1DOKW4XKmiJnvYXegVfv57rF3qF4ehiXyWeyn467m8wC+yg7zu+Hs7GOXGAM/FsHP9tZ+OcKPwLFWxgBzXXgzfOhQOciZ6/5y82frHxi33a2om+I3Zfqb4jdv8z3xEdz/lcFxZQwKVYMxrtnLm1xhbtnLl14QBnou+TFxZQQK87HRvYQQUNHOBM9H1yDXWav9orUMAKNrCDChroTba2kL/PK7CAAlawgR1U0MABYmvY/BxmPYVqPhUtsIIN7KCCbKzGxmpsrM7G8t1+Dbeazx6ba9zUfPZYYAEF9MXpjg3soIIGDnAm+pHhwgIKiM2wGTbDZtj8gHL+Nj8D8ctJnxwW2PIH+VHkQgUN9EX3vvCjyIl+FLnQF91Xqh9FLqwgtoltYpvYvHkvzM3ik8MCCyhgBRuYCj0nWA7HAgpYQZ9gOR07qKCBvp8djjPR2/TCAgpYwQZ2UEEDsQm2iq1iq9gqtorNe3NNsjefxDXXFHnzmVtzzXW380VZFzawgwoaOEBfSN8AZ+udWEABay6DH6gu7KCCBg5wJio/yPv4RG+ycqKAfp7qy+tNdmEHFfTzVF9eP+O/cCZ6v11YQAEr2MAOKojtPKHvjl5MHb2Y77TnCf2JHVTQwAHOwPMNVhcWUMAKum06dlBBAwc4E88T+hMLKGAFsRVsBZs35Hoyz3zWVOBM9Ia8sIACVrCBHVQQm2DzhlyP+ZnPmgosYAP9312t53OeAgsoYAUb2EEFDRyJ3nrrcTzziU5zPTZnPtEpsIINdEV3VNDAAc5Eb70LCyhgBRuITbEpNsWm2Aybd/d6dM98olOgK3wLefOK77/evBfORG9e8T3Km/dCASvYwA4qaOAAZ+JMhc/UmevJPPOZOnM9g2c+U+dC338vLKCAa8nWk3nmc3LmejLPfE5O4ABnou+pFxZQQK/bHBvYQQUNHOBM9H19PShoPicnUMAKNrCDChroirW5fSJOYAEFrGADO6iggQPEpth8X1/PIppPxAmsYAM7qCAbS9lYysYyNpYfkta7vMznzszqu5HvvxcWUMCa+5nvvxd2UEH2Sd9/L5yJfgp4YQEFxDaxTWwT28TmhyT/bfN8COdwrGCLH+RTYwIVNNAftymOM/E8GzzRzwbFUcAKYivYCraC7WzeE3OzTDnAAgpYQWxnH8///u9/+u0vf/vXP/7Hn//213/+j7//6U+//eG/8h/8+29/+B//9du//fHvf/rrf/z2h7/+51/+8k+//T9//Mt/+r/07//2x7/6f//HH//++H8f6+5Pf/1fj/9+FPzff/7Lnxb99z/x18frP30MAK4TOv/zxwhgkSzxGCX8UqS8LuIPvnuJRyZkAStf/l5e/71/P8j//nGizAJ0u70A6+roXIBxvFqAtlmAdUfF//5xgvTOAvhJpBd4BNerBdDXf++fgvW/f1wWv7UAPX7B4w7VqwUYmzVYcxP299bAGuW4dqNSXi1B2eyKtu7WnBvB7OUi7Pblxw3DKPEYeB399b682RlntkNhSzw2yt2/r9Vib67taU08hs+/1tjsj2Xd7PMSjxG6rPC4Mf+1Qt9sz6P9X1rydxU2u6TfrD73qPlmBW25SxzyusRuZfq37c6V+bgif70y5+sajyE/ibVZ61N31fY1oI7dRo2Aedwup4La/V+iwi+p9vKXyKbGei1zxMTjcjNr6NcVui4IXvfIjKAovcvLEm23a8WO8Tg9e+rTfr9Cz7g2fV1hs2s9hp1zm67mzj6VryVssxAjI/v5qPfjQmwy8zFiGyUeI7ZPO3if720Pe709dnuFtdgg6y3Dr0rUTXhLz+PXYwC3vCwhn27TulkVUqrlNn06CP2wTetmx5IRR7F6vCzwk3VZWJfj5Yr4PPV2Jarfx7viZr4+hNSx27Esl6M/HcnWAeVLjbk7Lxt5XqZPFeT2L2nHEX36GJZ7nd+t7A6GeW5TxvP5Yfl6UG+b7VqK5c5VyuPM/6nK+Fqlfr5OW/t0nW5/ixwaK7VIKf31b9klaDESdMynJfnasW0ToWK5deVxy41u+cZvqTNP2aQ9n3r++Ft2R3jNU0dRZX08Dg1favTdEb5IbJi6Uov18XU5etme+sVOVh/Hhtc1dsshLU81nk9hf1djs5+2mcuxPj/+ssZ+y/jHxq4tY0/76o9bpvfdWs09pIptauz2VP/ww7WX1eN1jd2eKhKJKlLHezVaa3m4n68TpO8StcXqUOUcsM6v+6keu9PywXXWfF1is5uud/lxvX28rrHbPdY8zliQNWvxdZXNjro+Zxo7qsyn3ePrGtXtpbvkKn3cGn9ZYrc+pFuuj7HZLJudtDxuCOaF44PbyyrbXd3yLOqBr9tl27i15kp9XOLo64bRuTtgDu4LlccNyhfhbsc/9PDQjjxLf1zd99eHOpN/6CG3ae4iD56vD1O2OzutXNY/X0bKD3cnrH+6TrdL0UpGYWvHy6XYnZJJaflLipWXp2Q2dhfEefVU7ekexeNU7XaNVvNatNUve/rXGuP4/KRulI/3sO0azUuXdax6fZK7qyGVGputMj6+8zQ+vvM0Pr7ztF8TI7vkcd/l9ZrYXUDVmUfa9nxgKV9PkMfcnRBK7uN12Osa2wu5PCY8Wu11jblbHzXvL0tv+rLGdp36N2uvdfrlt3xjD9Vcp2JfluNrjfnxHjo/3kPnP3YPtTygyNz0+9zdfzqMGyb1+dj4NbnmZg9ds1Lyrnsfb9V4DIvm4IF+uYT74a75UT6PYb+g+AfmsA/6XtvF9L293GdIX7ehZLysUY7+8RDAoR+PARz2j9zR61FnXgFW2ayMub0YzWvR+mVPb98o4lPirlU62usiZbebrnfRxqKst7Q+rZQfhiR2owEjx4jG04G6/nAyub9TeXCn8ukOuN4fXGk1V8jjAKevB1d2A02PPTzvuZYv4xr1G0XksP/7TvJjEft4aKOU8enYxr7ErRvhZTfadHN0o0j5dHij7Haxu+Mb97eKbbbK9i5S3nmpsjvAyOcjovL5kKj8gjHR7eromYZ1e7yV3YHfcgdZU95ejorui4wc1LQvDfNjkVo+79vt6NO9vv18AKtsh59u9m3tH/ftbtDldt/e3iqbvt3vHpr72Jhv7mOj5AjBqE8L8rsibXeR7594uY7aTwft343gb/tu5kSCOm1zqNvfSrq3t+/GoW7u7dsS9/b21j/f23ejUDf39u0g1N29/fZWefcoNfMWzmPYU1/vHv34fPfYDUPd3D22Je7tHrtBqLu7R28f7x67Eajbu8ftrfL27pHp8dg9xnsnyu0oecPzaLt9bJOoN6cRFf0F+6l+vp/q5/up/oL9VD/fT/VX7Kf6C/bT7d7xCy4s/YPY515qNl9fWO5GoNZ3p+JmTqub4/5uCGoejJY+7em/O+zvV4iwQsTeXKm35mgV2+2ojVtTj6Ho1zXa521r/eO23Za417Zmn7ftbvjoZtva/AVte3urbNp2v3fk/JXH3qHv1ejcIev6+sAw6u4WLJP5j9LeqtFnzsff1tj/lltTGsvQj/f0bYl7e/oYn+/pu4Gom3v6PHZzNXJyfZencePf7enbgag7EzT3a+PeLNEy66dLsVsZzR9tPo9w86lTfr8ybhcZ7xXpR85/6cd2s2yLaG7b43li0veK5O2x/hjaeLNIyVsGvczXReTYnQbNIyc3Png8xXLp70bIy8nAshuRMu6A2OYaaH/qcGdKshzt88uGfZGayf44HxubItsZTsoMJ3v9CMPx+Y1+OT6+0b8vce8phvL5jX4pH9/ol/ILbvTf3yqbJxn2ewfrY7w+8G9rPMaSGHB8fbr+sxrHxzVayaNMexrh/1YN5qA8yr2uUebHJ2TbGjdPyH6yPkzzt8zxcY1+yJvrNC9OH+Ofr7ft7gGmxz3knGJpbdN12wUxTkNsvo7C3XDS3Y27q/FLNi4Hqbpr3N2N/sfg/dOjl8ebK5URqcfg/Ou9bDf00XIwuslm29btJNyZswTa8frUbr8cNY+3z4/O/G51bI/ZOVTY6pc56z8cs3dDUjdvPMhuTOruMbvax8fsbYl7x+zdQ1F3j9m74aibx+ztJKPbDx/q58fs/d5x68bDvsa9Gw+yG466G2P75bh100Da53tp+wV76e1f8joHd6Met65d9vHT8mGmpk+T+n4XP10+nbghu7GoexM3fvJTCpOldlc/2+W4N/tjvyD+BpW4zJbNgtjn63R8vE63JX7B6ui886GXtlkdu2Gkz/f03vJA2/vcXGHr/rk9fgol5g+JvhuJuvd8iOwfysr7Dc/T3n+3FLvHfktetzR5Pse+X2KN1zy9mKYf7xVhzueDtbxZhLP98jyy/52VmtO9+9hsWiv/0BLlMM5Lj1Fe/pR9kZtbZl/k5pb5SZF7W2bbuZpTg/p8nhr0nXtjWvLX6Nfn3L9VJPv/sUybk/XdgFTe+HyaoNS+sxAtJ56v79i/+Uuq1Sxir2co+mM6Hx6jxufH/fEPPmSvr7PH6tCyWx27GOr+FsDrZH32lzv72Bz319e3Y/84dHO03A3BNOFUSObrkXkZ+9n4OY5z1NeXHtsBlHsX6rsBqTIOXkAwHpv45VDBzzbOUdk4T6e630ii9dWD2DiP232vN85sn99g3z0gdfdifX48drovce8yaH4+dirz47HTuhuQun2xfnurbC7W93vHvRvsuxp3b7D/pMbxcY2bN9i3Ne7dYK+7gY+nGw99Tnurxs37uHeXY3sDZL9OeVrr+W0sv3uXVPl8fdys8cFvuTfgcLfGbsBhv4/dGnCou1fp3R5w2C7IvQGHunu66fbGHZ/v7DeX4/0d5N6gRd09I3V70GK7IPcGLaq0T8+F6u4JqbuDFvvluDdo8bMz3fZ0pvvqLkbdvZzv7unytsjN+xjb81xea1pMX+9kv+AJqfr5E1L1V7zi7/MnpOrnT0jVX/GEVP0FT0j95Coorz7k+aGA323ZXzA4v72Sutm1u3Exf5z92rRS31odUvLOkpSnK/YfV8fuyaabQbh7R9/tINwux71V+pP7W09Hl+NpTt13bpI9/nBSRF4GYRuf32nbFvkld4VvrpFtkbtrpMsvWCO7IvfWyE8mTJZ8mKfIu/M/y8GYkpTXRbZPe3LAfdxltpe3her+JXu35hrUPj4/XO5mXd48XG5L3Dtc7sal7h4ud2/qu3m43D4idfdweXur2Gar2MdzDfY17s01qPoLLtf188v1n/yWe+9t3j0idXNP35a4t6ff/yWvT4R287XvzbXeR1i+l8Wer25/F2HWPz/jt8+nS1WzzzfsxxNRqn0+XaqOj6dL1fELpkvd3yqbCNvuHTfP+Hcv6bsbHfvluDX+Uod+fKq9G5C6d5a8X4p7JbZv1bx37fKTGveuXebHM0/r/AUzT/fLcWuV/uS1HflyulHG5qsb23dc3Xrydvtlg5vnk/Pz503q/Ph5k32JW2Hcjs+fN2nHx8+btOMXPG9yf6tswrh8fjpZPj6bbMfnk/i3Ne4eEn7BHcLPd6/y8bG+bd/Rd/vxv/vfRHl5oG7l0zPS7ZdALKefPM6ynl8T+uP3M7Zv12OQsz7vG98owXMEX15k+2MJ+/Rex3Zl6MxB43H0zcrYXtjfmVXUZPsK/lsvxdyWuPmRmPHpJtl+3iXfqvf8Frnffd5lV0H5nMF4XWE7TJO3r9Y7up5q1Ps1Wo7jPWr0lzXa7nNQZUp+auzB8+U+/vHtvP13alTzjSWPQd/nGVo/fqfm+LjjtyXudXz9fHXsDijGG47tOYO/Vmif7uPbCrf28e1ng27u4/tPD93cx7eNcncf3w2dSd4q/vKi+t99N2hXo/Mq8d43Nbbfp5G8SHmwbr4ctCtzs1O2Je51ym4f+wXB8cPqmK9Xx/ZDSpwQ69OnEn/8kNL9GvZ5jafpLt/6oNOhebZw6OYjSNsXvw3LthujbopsP4+bV8KtvFki3x03nkZWvlei5VL08XEJre+tUOl8o+L5WvqbRTgsaOlvbtpZ8vpxbrbL7nmuqnm1UnXMt2q0mgeYR3jX92rwwa82x+ute/vjZZsatz/EZq/7tumnF03bpTDenT+OTYrt3sdnPTvf+vOT0z9+Ym/7qoHBkeF5OMF+qLEbGJlPLyt6ftzvxxpjO+Cd3x178NMX8r5zbBgyc60+H7S/k+sjr3seqK9rbI90veUUgEcSbI50u49CTW4RHM83GuzrfrYdsyqskdLHZjl2r47M4YBZNit1V+JpSsTziMLva+zuH937ElvbjRbd/BTb9reUIz/UV55fZ/X7H7OdVcVF1JybABjH5wEwyucBsHsM6m4A7B5iuh8A221T+RhbnfLezvq1yHx9arf9miOHGRmvz/z3NbhX+bgIeK9GVQYXjtdfhNTt2HmeU433PufYuJv+uEgcb9V43OvMad1lvP54YdsNPanmJcgDy3tFrOYNOqtPU7O+WWT0LDLHm0UaHzdotb5ZZOT4gD2fNH9r47ScrtafH1L5Vg3LNdLHUd6skVdUfcjmC5fbd/PVIx/Yf/BmlfTt56KEyfsP1rIpszuZ6J1ZfF2P4+2l4ZHox9LMTZnte2BH55tzw8a7q5hvGT+4v7vHPL930N6rwSSDPp8+Zvytr9UeuedqKe8th5a8ctWy60L5+Oxm+9Fc7RmzD356/vZbn95VzkwePN6totwLVDvszSom/KLnT/p9s0oOqTx4E9j7KiPHUR9cyrvL8rR2R3m9dvvu+aRv5NNutGrl09PcgznfL3Mz5n7yo+7G3PaZqcd5dyHmdqv4J2VupuVPtnd/2vf07X0vX0v84P5uN012Gp3a3q3Cp7l12nyvikl+M3Rxf7cKn5G2xzXm6yq7CRK/5APdxijMsF7erDJ4dGCMcrxZZT4ty9ycKu8/Fs4ng20zUritMZj4Ng57s0bnxpC+vgra39SZ9E89jtcf+u51+2Tpne9/7kvcGjDcl7g1YviTr68/PVwyj1dvx+m7dTqLcWvp5bjUvoTk26SmyHhnXKp2bujUbuO93aPy4eBSrbyu0pt+Oti3L3FrsK9//hjUN1aHvL9S6Tmrb3bu+ng7VfrmTkr/eBx2X+Lepun/2HHYr6tjNw77k03DRbLZ8bLK7hb3vSjbVrg392F7klbr02fUNzfJ+u4u2b2JINsSjzSsfEhd25tF7Ol85nlv/16RHKB68NB39rP1xd5cr72+PvzvPzyjeWb14FneqiL+hqXrVurxPDyt79Uo8l6Nnm8bfdwgLm/VqEwdrceX0dgfanz+WstdiXaUHNAtzzcbfrjrv61R8k77I9fayxp990zVzVzelriXy7tnK+7l8nZlSOXRii8nyz+ujN0U1pnXrY+bvropsntzCa/Ge7p8+N2ow3YxlMWw+u5v4WWjXz9S/70ifDemv71W84mVfujxssjYv78gP3BSdzXKp4fLbYVbh8ux/U7tvamC2xo3pwr28QumCm5fnNbzcmx0ef325z4/nsq6L3EvgObHU1n3K0OfpnDZZmW0T1fG7rXxVfIpolqfnzErP66N7bv97syh77und+7Nod+XuPkp9eNX1NherHMxJl8+rtR+GAXebJeZt5Xm0/sX7IdPXe6fernXsfsiKsaogDw9cbK+lPaNMrzK8sFPh5dvlxHKNNmU2d3FyCuQ59dA1R8OuT9bEh6r1C/PVX7vB7XGcEl7HhX4Xpn+tHr705ORP5bR3aNWv6iMHDwodTzfy/xxZGxbhNe4P+479zeLSGasiL0usm1n4TNn8oj91+1cPn9X509q0Iq91JfH8X2RmycUP1mSe2cUuh2DuptP243T2E36HK83jmznU+SE7P7lFdf1xyLbkY1bb3lQqTf3ktcPFuvufXv3ntrcl7j1YLHuviF188lP3T2Bde/JT929r+/ug8X3t8qmd7d7x723PGj9/B2oP1mOW2950PrxC9V099q/+2/Z3i/JrdcSbFfIzTc9/KTGrTc9aB2fr9RdoN5808N+Oe696eEnJzVPszfa0+Th351GfP4kln7+JJa29g8tcfOlbj9ZpUxPf6ze/nKV7i7Tbl7c7K5aH3e4cyKllteftdle+TL5alRpb1753tsuuwdcbm6X7bsvNF9IMp5vEv34U8rx8bDMvsStG03bn3L3xHBf5O6JYf8FT15v3/Pf886sPE89/nHDaP/8Vb26Hdu5eUq3m61485RuW+LeKZ1+/jIP3X2N6uYp3e45rNundLe3yuaUrn/+ql7Vz99a/pPluHdKZx9/OEXtl3w4Zb8k907p+ucvHv5JjXundNtBqpsrVX/BKd12Oe6d0m2PL5ZTrkd/8xCVs2h1vJ6KNT4/fdm9T7pKvpL2ceP7eQSi369hebyu88vEtPs12pE12vFliswPO8f4+Ob/fjHyRL2V7WJ8/hLEn9S4eWtr/5mAm7e29kty8wxmHr/gDGZ7KtWZnVLs5bbZ1RBmuIiqvlej5wQXUWuv95HZPh0g0t3Xju4NEO1L3Lz+2a7Rpzm2h27Wxi/4FIXO7UPtuW3r8WXg7uuS2O7JoLtfbrPtSf+9ExDbHR3uHSvtqL/kBOQnG+fWl9vq9nOnI68sn88efnwxmR3b6dy3Ptxmx+dvqrTj4zdV7kvcuvqw8vmbKq18/KZKK7/gTZX3t4pttsp277j14bZtjZsfbvtZjePjGvc+3Lavce/DbVbufThl9y2rbY2b7+68uxzbGvt1euvDbbYb+Li7Pm7W+OC33Ppw2+0amw+3/WQfu/XhNtt+hurmh9v2C3Lvw222e5/f3Y27q3F3Z7+5HO/vIPc+3GbbIambH27bL8i9D7dZ/fgl6lbt89sG++W4dyfmZye6dz7cZu34/Gx5W+TmhOHtae69u8HWPh/gt/bxAP++xL3zsfb5AL+1jwf4rf2CAf77W2V3PlY+vhtsvfyCKJRPu3b7U27eP/1JjVv3T61/fP/U+i+4f7pfjlurdDsP/Nbt032FO3dP9w/D5DXpA59fTfiNB2qUh3J01vdqjHyBgTzfPv3eQzmciB3y+rd0274P9N6TPdsij+2Zg7fDXj6Wuy0xs910ir1XgiHk5y+tfWOrWB6oxZ5fs3a8W6O9WUOoUTd7mJVPb4zvS9yaXmCfP+a0LXHzrGW7PvX/+pzk97bJ0z3P+WZyPC/HuzU4bVmvGHizRpNbNT4eDLOPx8J+8iR+DnZMkTcf5s9X7z7w5ZOr2zcb3FoVPylxa11s3zfBK4S/nBJ/650VhVfEbp6f39fI81l5fnff92rQJ2O+fsz7J+8kabxNZPTN663uV9m9m+onVRpV7PVbY2zu7iLdexup7cag7r6va/+eFuH133PzNsKfrBOuNx4b+e13xjwvS327ClfoY7Y33zD0uAXIA+zS6rtV9OndQG+/p4hHPx8s8m6V9lSlv/u2o1qfq+i7VZ7uGdbx9nqxpyrzeLNKe3oLVJN3t3Q7nqu8vdfx6tjHBf7rbTS2j+u1p2fT2m6H+VkZXifxWJjX73Aa25m+t19i9rOlyQuTB29ecfidH/VBGePlFM+vCv79uun/f6ybp7sCz68g+eBHfVCmFV65sXuv7Ng+TfWr1g3fR3xw67/kR7V34/M4mAPz/En1b77+bh5PVV7vfD95+2++Q/yB880iWpg+L/ZmkZ6Ti6zPd3+O5Y1TG2+/m/n557xfhO87qL37bmbL+d6P6/r27pLkKzAeRfq7S9L5XEVvv2DrlE0k1F/y9uCfvLG66J09Zf9i9MrL1fvmxWLbD03lZx7kee7mjx+JGtuP5N2bM/n5d/ZGO/6hJW6+mWy3PitvR6r2+qNbYzd0cuvlNdulaNxceh7b//1S9I8vD8duQe5+rGL7GTPhC6HSX/6WfY3n78e+Xh+tbeds3vye2q7IvVvb+xK3bm3/pMSdW9vb7/Xduke1r3DnFtX2u5i3lmFf4c4ybF8y15/eMfc8bf2HUai+G261fP/n4079q+H87czoHNQr88u7Ub7xQwYf833+hsqPP2T/SNWdCcljd155b0LyvsS9Ccnb12QMvnwix2Zl7K6r1Ngqai+PJj8rUp/fm11fFtmdJ3SGnvuX84Qff85u1snTR6W+rtbyQ5HtQ6o5f+5xTWqbIrYdbXiao11f/5ztg1WNV6GUJk/5UY5vrNrH2Q4TNY/NnrIbkBLlC1faXr+tZl+EV9g/8qRvivR/8PapkrMU6pfp779bJ9uvfjVasIzNzxmf/5zdGaHl29Wa1flOtDbNPa1Z20Tr+Dxax+fROj6P1p9F2tPr91+/3HWMX5GL4+P3Xe5TcQpH3v52KkrOHCvPN0G+VyTPhoaUzZLsHrGymXf5bT4Pcf2uyG6UP7+i2p7eZfA4kH4jnQ/ugTz46Utq84eLj934Vs5EeXoRYKtvHmja5kCzezyqjKehoKcroCbfieWbO8i+yN0dZPyKHWR+voPYpxcwPzk43F2p4/OVOnfPWN1dqXP3VaubK3V74GaMr9Yv7934RpHHLft8+O3Q10f/efyji9y71N6XuHWp/ZMSd/bU3VR+xgb7l6FBs9slembQ4/z/zRI5leNRrbxTQgrPzT5/Lu3HfXRfIi9CytNs8W+VYLalPL2W7scSs9ju1lg+5VGPN0tMvpXW3/ohTDR63MSVt0rw2MzXmaffKGF5H1tsty62r/r6FUWKKt8le56U960iZgx+T3mzCK+ZfZwfvrdlJH+MiL3XKzWfuH3sKeW9peCash5v/ZByCF+A1rd29PXgUJR4fkv/t0ooH+Yd7y1FffqMy3xvKZ4+0tOfLgS/VUJ5qGLM934Ie+fzO4O/VYLpZ7W/9UMsZ4w+f87wGwVmnpvP/taP4J7p85Sz7xTIfWpa//AnvFfgcTg0jqjl1bXF3I01ydN3r19W+PwR8rkbabr3yNLcjfCsW+DcwD6eP9f5w3sKdic5OWWpf3n+Qd4o8GW6/+0C9z6ttitw67V3uwK3Xnp3fDoqc/wDB2Xu3dfZvsgsHxkr7Wkw5Mc3XO8/MfH0xpv2Vgl7mizZ3luKoU9zYvWtEjNP/Mus460SyiCZ2ns/RHmO+PkNMd8pcTCv8RjvLYXwClZ5vof6jRKV2bhfvjL+naVofAlB3/shnBuWWvTTdfF2ifyk5eOHPAfud5bC2CLyeQl9q0TNAdwHjvdK6PNXAt8q8Rw57b11UZlD3748Rvhmifc2apOn6bHlvRJcDDbVN0vwQ77M5PlGibwp97hweW+jtsmz/sfx5n7BNYO8tVF5zUcbb61Mds3nTxT9WGDuXsz3iL1GWjydJt5fiMaNNHvrV+T79LS9tSl6Hgj7892rbxTIWRp91vcK5Jyu2T4roMd7S/D0OP5bUan5tRqt88Ml+HEz/s/H//zjv/757//8l7/96x//489/++u/P/7uv1epv//5j//ylz9d//N//+df//Xp//2P//ff4v/5l7//+S9/+fP/+ed/+/vf/vVP/+s///6nVWn9f78d13/8D3vcZ/8ne9xg/5//9FtZ/3s9YGWP4YjH/67+/z/uhlkVXf//+gNtj8uKx3+M9Q/8L/RxsHj8x/yf/70W+f8D",
2281
+ "bytecode": "H4sIAAAAAAAA/+29C5BcV3oedntewDQ4QAMESYAAySG5fHO53dPd0z16LXb5BvgACb72pUXPdDcIEgRAvPhYKepVZEuqqLYqkqKKHJUkK9mSpXWtrWTjjdayndhVqUguKVLkrFKVkiU7UklJSklZieU8LCVzyf67v/n6u6dvT/93pknOqQKm7z3/+f7//Oc//3mfm4v6Idf9OxONEQzkW7e8/3e++zwF8dPr/451n4vjhdI88fXErxdra/Mif47yl+e7mLls8IuGn5H+i7u6ON/X6eNjXozv7vV/e+D3o1HfPrLKv5Vflvm/PpBns52HO1Ev9Pm2K7Vys9ZYXlutN1fLa5VGvVZp1BrVleVSqdkoNldWiqtLa8VGrV2v1qutdmm11SqtrTTaxXq1UTbsRzp9vjORr93E4dFs8Hv19rFs8JcM//GO0n25tVorlquN5fpqqd1YbhdXK7V6udGu1ZqN5kqlVasWm6W15dLaUqldrzeq1cZadaVUardWqu36smE/IbFb9fraymqtXWw32itLjeJScWl1rdmuFpfXebRba9V2u1xZKVbL9WZjrVlbK62sletL7bXWSru40ivXJyV2c6naaK81m6uVYnulXGvU6uu2s1JbXQeol8rLpcbayrpNtUutxlptbbXRKq7zapUazVqpWStXDfs46DwLX3wiE/xSzyafkrqplxrrdajZrJTqzbVmudgqt9drT71RaS6X6nHxluurzXK11lqvdKV6o7ZUbVWXG431cm6slXqyPy2xW0u1SqW8UqpVSrXlZnm51SzW19r1ZrnUKJVWS81mu71ed1fXDae9XFtZXi/b1lqr1qqvLq8bUK9MnxHYpXp5aalWXqkVV+rNYqnSXFuqLy3FBbwu/NpSa6VSWmlXlirltea6o6jUG6XYsNZW2vX3tWLYz0q5R1QwBcM+2cnEXnp19Lls8CuG/3w2+L1yPdUZW/ccenX1hWTsTZuOYb8osJca5bXiuidqVNerSKteXbf99SaotVpvtZeXGqtrleJSs1QqtSrr/y21mpWV1fXqtbrcWq9Oq+vsejbzUiY6L/X6Yy8DvqPee/K/kon8ffzPdAZ1XxwzGPZns9FNz0d+zl/2Hvbn/bF7fuYLnUzKdNXwvzcb/J7NfzEb/Kbhnwb8nBv+Us8uG5ngl3v4q9ng92xzLRP9V3ryNzORv9KTv5UNfq8/3M4Ev9prx89kgr/c08+r2eD3+glns8Hv6ee1bPB7fZHXs8Hv2c+5bPBrhv9GNvh1wz+fDf6K4V/IBr/XvlzMBr/XvryZDX7L8C9lg9/rL1/OBL/W8/9XssHv9X+uZoPf82/XssHv+be3ssHv+be3s8Hv+bd3ssHv+Yd3s8Hv9W+/lA1+M54XjueEv3rofbzr1v/d0MW+euXsubNX3nm8deXT5y6svf7M1TdWW5dsYIPCRPDXfk9HgyEGv34A/IWzb7QuX2m8cZEhphKgZxKgDw9AP3zh/JVLjbUrn2o2L7UuX06SMReFQwy+fwD8pdaly2cvnE+SbnOgD7/aOHv+ySaDzqYEtSn3OaB37A4WF7p4u0g+5L0b3jtOPzSVpXEJIv88yeo95ZojfiYP68fM2HQ3L2QtiDguw3nBZ17wKYg47p6Og3XFEet1R6xLjlieebzoiHXeEetNR6xzjlinHbE8de9Zh65OKNYZRyxPm/DUvad9nXXE8qzbnjbxqiOWp49+2xFrUttHG7bMR4P9gyy2quzJBr9susgHdIH8ra+Efatcwl/D4jjjlScs57yVQnlD+bmc8yAP6iAJKz8i1ryIy6JM5wP5Zv5J9Kq/bPTXBfCRfl80aMPXkS4WstHFUqjcrgOexv+6rrxx6A7+HmmtXj3z1IUzEYVpUoep7yjR2arpVDSo9j0JWBE9H6V304CHIRb/xo3iP9a6svbqC40zZ1rN9UxcpgQDCLYvi9/zIAlpMjbopc06loyccimN04yDVYC4VA50f3dL5akLjebDjYuXr55rTZFGcVjMWkVUzj2XWA4ki0gTGHAnXhxsJ5SaKGIc47sH4pQmDNNcQVId4FLbJfjauylBnyesvEhnsk8H0iMGpmOLCtWKNFZr+YiDmmow3mmmd7KpfaXKZmtf1tM7obJCvWbbhSqVQ3Vgj9CPleV1Is6wrDmajXRztQfyyM3nAsgxS+++1f1bIMw42O6bUPOO70y/8XTYNyhvWDZsp1mWA/IzufEd8s9HmbZapZBdqC7jfDRYzo76WUpTriivleWCiDOsvd1ntFOkvw7yiPT429Lju/+m+7cQDdo02+mCyA++Qzv9x5Q3LBu202zKoVJKa6fGPx9lWW/6dqrsYo/QY7Zd9koxTbmivFaWe0WcYVmXHu0U6Rcgj0iPvy09vvt2928hGrRpttO9Ij/4Du30t7u/5xPyc6z7XBwr1Gpcx40H8kY9ee5aTVsPjH8+ytLu+vVAlZPyJ6a7fULWgojjZaN9gs8+wacg4ngqaxysS45YrzpiveaIdXVCsc47Yr3piHXOEeu0I9YFRyxPu59EfYXawVGx4uBpq9ccsd5wxPK0Vc88nnHEmtS6/a4jVsMRy3Z4cT/T8OMwHw3WPe+xG/KzfOA75J8nWX3l6feVlF5Vn9b0U8hGPz15CkKegtCPleV+EWdYNmOLYwakL0AekR5/W3p8t9gtsAJhxoHHDPtFfvAdjhlu7uLuE/nh+aVR6wOmZx1iOq4PWZY38rN84Dvkn4+yrJ/FoP0pvZp+9mejn2Ia+0F5rSwPiDjDsg2iWB+Qfj/kEenxt6XHdyWqD1h3uD4cEPnBd1gfHshtzBuWDdtpNuVQqaa1U+Ofj7KsN307VXZREHqcjwbL2VE/lTTlivJaWV4v4gzrYPcZ7RTpD0AekR5/W3p890myU7RpttPrRX7wHdrpShd3PiE/x7rPxTED13HjgbxRT27lXGqn9tfGPx9laXf9eqDKSfkT08/BbPRTZNtFeQ4K/VhZ3iDiDMv2AWA9QPqDkEekx9+WHt89Q/UAMdl2bxD5wXdYD54gf41lw3aaSTkUK6n72cY/H2VYb8BOlV0ofzIfDZaJ99rFsHJFea0sbxRxhnVT9xntFOlvgDwiPf629Pju82SnaNPsr28U+cF3aKcvdXH3ifzw+lioPiNuQaQ3OmXzfu1Cta1sxg+/VpqPBsvUEb9uNoa2wP7iELz3qw/l1O2a8c9Hgzachb84RPKwfngN47CQtUBxcWh3+nQcNy3eTQWw3nDEes0R67Qj1quOWBccsc44Yp13xLroiOVpE2edsJQfH0euq45y3eAo1xUnueJwzRHLs26/64jl6Qs96+Objlie5fglRyxPm/DUvVfdjpzz6GkTlxyxJtVPeMr1Uegz7bRp26d7z/r4uiOWVx7j3zwO/bD1J7zzyOvfOLbMdf/OCxkcx9mtHPGzfOA75J8nWX3l6Y+zlV4PCb2a7m4WshYoLg48zr5Z8LlZ8FFYbzhiveaIddoRyzOP5x2x3nTEuuaI5an7dx2xdspxNKwvOWJ52sRZR6xLjlie/uuqI5an7j1t1VP3k+q/PG3V074uOmJ5lqOnfXnWIU/7uuKIdcYRyzOPk9qX88yjZ39iUstxEvty8W8eg34Y+zmefcyd/sSHow55+glPubzsK/7N86rjyPWWk1xx8NS9Zx/A2lret2f4cVD7ZPzmrJZS71Ux/vlosKyzmENTe6/UHsFs5xiXenswQ3OlKK+a0+M270j3Gfe2If1hyCPS429Lj+9e6CpF1U3eg5nWbuO9bc90H/aJ/HCdT7tnTu0TZR1iOq4P2ZR3MfV9ITynnE39DM8pK72OMqfs6bMRa180WEbjrrndIPKzINKxnaB8fuWS/qyR8c9HmdptKVR+Sq+mnyPZ6KfIvg7lOSL0Y2V5VMQZVvdDuRv8JtIfgTwiPf629PjuTfKbiMl+86jID75Dv/k6+U1VJzdb7zA96xDTcX3IpryLqc80Gf98lGX97NeHIyn1quzvCOkc47j80trFBxHL7PdIgE+onis+mN7oFkQ6tl+Uz81eSq1iWvs1/vko0/pUCpWf0qvp55ZM9NNssw9GeW4R+rGyvFXEGdZt3Wf050h/C+QR6fG3pcd3P07+HDHZn98q8oPv0J//2NTGvPH9q3HItByKxXZaOzX++SjDegN2quxC+Zn5aLBMHOVppSlXlNfK8jYRZ1iL3We0U6S/FfKI9Pjb0uO7nyc7RZvms0i3ifzgO7TTv9F9mE/Iz7Huc3GsUGmpsvTDb/XOCN2WCX6jd436Yib4SyuGf3sm+Kt1w78jm/KtGv6d2ci/bPgfywS/3rOfuzLBr/b0f3c2+E3Dvycb++zJf28m+OWy4d+XCX6rJ//9meBXevgPZIK/2vMPD2aCv9Kz/49no59e+T6UCX67538+kY1+evIXs5G/176UMsEv9sq3DPiec9+GX80Ev/9JikrUD9MiT8bf+mpLQJ9L+GtYHGe88oSVVb9Y5Q3l53FxBeRBHSRhVUbEmhdxWZRpOZBv5L8QkJXzEQe+w22zOonDWScs1cceR64rjnLd6ijXqqNctznJpfrv42Dd7og154h1hyPWnY5YH5tQrLscse52xLrHEeteR6z7HLHud8KKA38Jehy5HnCU67KjXA86yRX//rgjllfbEf9+yBHrE45YRUes/ROKZeOPbOfrKivZzteVG9nO11Wa2c7XVcvZzqdVatnOp1Uq2c53VdZsLGBtpPFA28U2z2/cUkl9ltT450lWX3n648d7SR7WD69f3ydkLYg49gH3CT73CT4FEcd7gcfBetsR64wj1gVHrPOOWGcdsU47Yl10xHrNEevqhGJ52uo5Rywv3at+waTYqmd9vOaINan18S1HLM86NKm6f8MRy9NPeLa1nj7aU/ee+ppU+/Lsm3iWo6fuPwp+4l0nrPj3YuSHdYcj1u0TiBWHZsdPrjud5PLW/cEJlesuR6w5J6w4NDt+ct3iJFf8+2OOWJ7l6CmXp60uOmJ56SsO7Y4fVtMJy7McPeWKw6Tqy9NW73bE8qzbXv4rDnxvw6T0v153xPKcU/Dsk3uOFTznHq1/b/PYd0Fcrvt3vvs7mzWA4qbXAO7KRp7gGsBdQq/z0WC9dZSnmaacUV4ry/tFnGHZmjyerUD6+yCPSI+/LT2++8+7BVcgzDjw2Yr7RX7wnek37lv+nemNecOyYTvNphzSfyPd+OejTOtNKWQX9wo9KruwtAURx336tOWlyp731o2DdckR61VHrNccsa5OKNZ5R6w3HbHOOWKddsS67IjlWYc8y/FtR6wzjljXHLE867anfXnWIU+/+lHQ/UVHLE8fbb7Q7g/A/tDuaCOfUccOmN7oVL8r/nes+1wcK1SX5qPBvokjfu88ZDbnzSpt63c9CHrNke5wn6ZfH7Ge+r4c458nWX3l6fdZHyJ5WD/cZ/2EkLUg4nh/1ScEn08IPgURx751HKy3HbHOOGJdcMQ674h11hHrtCPWZUesK45YnrqfVFu95oj1miOWp315+pxLjlgfBd1fdMTyzOPVCcXyrNvnHLG8dB//5r2Tk2Krk9oH8MTaabd32u0PStux027vtNs77faHU/eTaqtvOWJ56svT53jq/g1HLM865NluT6qPntT+hGcePfu+nuXoqfuPgp941wkr/s17KMbBus8Ry2uePP59vxNWHJodP6y2E1b8+47ID+ugI9YtjlgPOGHF4aOg+0VHrNsdse50xPLU18cdsbxs1bMOxWFS7X5S8/hh94Xecu20HR/8tiMOrY6fXJ59OU993e2I9TFHrNsdsTzro6e+JrXt4DNI42B5jvled8TyXNPxnAfwnJ/w3J/DZ5Bwb1iu+3c+GrTLmM+x7nNxrLCU+myH8c+TrL7y9PfJKb0+JPRquisKWQsijv1pUfApCj4FEcf2Pg7WVUesVx2xLjlive2I9Zoj1pUJleusI9ZpR6x3HbEajlhfcsTy1Nebjlie9fGaI5an3Xv6Qs9yfN0Ry9PneNrERUcsT92fmVC5LjtiedqEZ9/Es932LMdJ9V+e9uVZHyfVR3tiedrXOUcs0z2f6zH8OMxTulzkOtar5Iif5QPfIf88yeorT3+sp/SqxtCmu5KQtSDieA26JPiUBJ+CiGPfPA7WJUesVx2xXnPEujqhWOcdsd50xDrniHXaEeuyI9YZRyzP+njNEcvTvjz1dcERy9O+POuQp1/1tAlPvzqpdduzPnrWobcdsTzr40fBvi46Ynn2AfieCOxv8z0Ro/b5Mb3RLYh0ue7feZIvF3n2sVdS34Ng/PNCJ1n0+Usp9Wq6KwtZCyKO9wSo74KWBZ+CiOO2aRystx2x2A+Ng3XBEeu8I9ZZR6zTjliXHbGuOGJ56n5SbfWaI9Zrjlie9uXpcy45Yn0UdH/REcszj1cnFMuzbp9zxPLSffyb70GYFFud1D6AJ9akttueuvfsA3j6aM/+xKTa6k67vX1t2k6ffDSsnT759tnXTr9w++xrEvuFcfDU16Ta6luOWJ768vQ5nrp/wxHLsw55th2T6qMntU3zzKNn39ezHD11/1HwE+86YcW/eY/TOHI1O35y3ecoV7vjJ5fn+lCz4yfX3U5yxb8POmLd4oj1gBNWHDxt4g4nubx171W3PeujZx2Kf9/vhBWHZscP66NgX4uOWLc7Yt3piOWpr487Ynn5Qk8fHYdJtftJzeOHva31lmunb/LBbzvi0Or4yeXZn/DUl2ef/GOOWLc7YnnWR099TWrbwWfMx8HynFN43RHLc93Kc57Jc/7Lc38h3+OCe1tz3b/z0aBdxnyOdZ+L44XU97gY/zzJ6ixPKaRXtU/b9FPJRp7VHOGjPBWhHyvLqogzrOXuM35LGukrkEekx9+WHt/9XnfgXyDMOPC3pKsiP/jO9BtD/s7cxrxh2bCdZlMOpWZaOzX++SjTelMK2YWq/8ouLG1BxPEcTtryUmXPexPGwbrkiPWqI9ZrjlhXJxTrvCPWm45Y5xyxTjtiXXbE8qxDnuX4tiPWGUesa45YnnXb07485fIsR0+5PP2Ep014luNFRyxPf8/nDbFvxecNQ/1TxQfTG92CSGd9q/losI/i15+qV3PEz/KB75B/Xugki/5dNaVeTXfLQtaCiOO5q2XBZ1nwKYg4rqPjYL3tiHXGEeuCI9Z5R6yzjlinHbEuO2JdccTy1P2k2uo1R6zXHLE87ctTLs9y9JTL06962oRnOV50xPLU/dUJxfL0E+ccsbx0H//ms4uTYquT2p/wxNrpA+z0AbL0qzt9gJ0+wE4fYKcPMAzLU1+TaqtvOWJ56mtS/cQbjliedWhS245J7ftOqn159qM9y9FT9x8FP/GuE1b8m/dBjIN1nyOW1/x9/Pt+J6w4NDt+WG0nrPj3HZEf1kFHLE+5vMrRW65bnLDi4GkTnuW46Ih1uyPWnY5Ynvr6uCPWA45Yk2qrO/Vxe/I4qfa10w7t2L2Sq9Xxk8uzj+lZjnc7Yn3MEet2RyzPuu2pr0mtj3y+aRwsz7Ho645YnutWnvMTnvMmnvuZ+HzTHMTlun9tXyHWt5jPse5zcbyQ+ttlxj9PsjrL09tXeDAa1Ouc0Kvp7hYha4Hi4sDnfG4RfG4RfLYKS5V3/O9Y97k4VqhW5yPt23zwl1etPG6FvLEt4/4JP9sp1dPasvHPk6xZ2fJtJA/rh215UchaEHFsI4uCz6LgUxBxvI67WSxlW5vF8pQrDpc6Pljx7+siH6w4eObxtCPWRUesq45Y5xyxPPV1zRHrnY4f1mVHrNccsTx1f94R66wjlmce33XEanT8sGxsY+dwsF26K9rIR/XrDgb4YHqjWxDpct2/qn/j2KanPmdt/PNCJ1n0MW5Jqdds+2Dv35eA+CjPbUI/qs/D/Yfbu894HwDS3wZ5RHr8benx3dXuIS9l09y3XxT5wXem33iMcqGLu0/kh+vDqGMGTG908yLdse7fYrFdqZWbtcby2mq9uVpeqzTqtUqj1qiuLJdKzUaxubJSXF1aKzZq7Xq1Xm21S6utVmltpdEu1quNSrb2Uq3NR4Pl6TgmKBv+7VI3Y4Webu7IRvYlw78zG/yS4d+dCX6lp5/7ssHvyX9/FvilYtHwH4i8baev+2zOi5bahr+ciW7aPd3UpG7KrdVasVxtLNdXS+3Gcru4WqnVy412rdZsNFcqrVq12CytLZfWlkrter1RrTbWqiulUru1Um3Xez6hDrLn3HRTrBv+CuBPueGXlw3/O7LB7+nnOzOxnaVe2X5XJrbT7Nnmd0eDtrNUaS6vNoq1dq3RqLeLldWl5vqf5XXLaVeXGivltca6JTVXW431pmxlaa251Cy36sVquVVeWW61Kk3D/h6BXRwngD/4ZCZ6L7bmyc7dZC+WVw37UxK7Va+vrazW2sV2o72y1Fi3gaXVtWa7Wlxe13a7tVZtt8uVlXU115uNtWZtrbSyVq4vtddaK+3iSs/Pf1piN5eqjfZas7laKbZXyrVGrb5efiu11XWAeqm8XGqsraz3T9qlVmOttrbaaBXXebVKjWat1Kz169LDmei8VIn7az9O/TXsx8/Db6vHcbC+aBxe6WyksXik/4F97/+N+f1Ul98CpYmiwXHMVDb5XskRvyjS4xjjnxe6yWIcM0XysH54rnRGyFqguDjw2HlG8JkRfBTWlxyxTjtiXXbEes0R601HrLOOWOcdsTzzeM4Ra1Lt64wj1hVHrGuOWJ725amvC45YnvblWYcuOWJ52oSnX+X9AxjH/YhZeO/Ybi+l7UcY/3w02G5n0Y+YjdLpNV7HO2D6vHL23Nkr7zx1odF8uHHx8tVzrSnSKPbGWKuIyrlH7WDcNL2bJrrHOxufj3cG00UCG3tOuGtCacIwrfeLeZpLSIe6iMS7KUE/S1izIp3JPh1IH4eMrbo3O7MrG/xyqGwwT8Z/IRrUeS7hr2FxnPHKR1rnx5x0F8obys+eDXcUoQ6SsOZGxJoXcVmU6Wwg38h/ISCryscM6US1HDmhE3u/KyAX0u8TvC2t6RBvx/NuTZJ0iHXR+F/XlTcOXe/9SGv16pmnLpyJKEyTOkx9h4jO3OFUFHaHiBXR8yF6Nw14GEITAGmqtckZh4LAsomJnQ5CL+x0ED4SHQTleNmi5qPBvB7r/i2OFZaX5oVMfex6qbG+DNtsVkr15lqzXGyV2+sLsPXG+tx3qR6vlJTrq81ytdZaX7ct1Ru1pWqrutxorC+ZNNZKS7HO/4qmLPkYMP42x4nL53NCt7NEfw9MWU5150Hj2nBTN75bGz599dzrz7euXDrbutZa97uXIwrDTPipzsbnpzuD6VQI9Ykm1all3ecKVYEo2qxTY4PK2qmZBVjwcmpTAjONU2OnznxRD0wfcmo5kn06kD4OC+IdW3xGvdvUFs+jjKxGaKFyRv34WDxqFVGjaHKacdW/nxWYof59yEoj8W5YJznUNE0n8JsL8ONVNUw7S7S3dZusjGtG8QDgch522qhe2GmjPhJt1LRIxxY17mxWFA0Oe1X+56NBfRzr/i0WW0u1SqW8UqpVSrXlZnm51SzW19r1ZrnUKJVWS81mu11p1FYrrVp7ubayXC3XW2utWqu+urxUaleyrb3V5Wy9VrUa45a7HtLsC2dYWJ8245K07wEHGUi/0uUR86vBIOKubny3Zr/UOHe22bjSevT8m1dbV1vNZy5caV3+1Pnmo9da56+MPKR4orPx+cnOYDoV9kR9ZewHfFbGAeKN9HGwimv013ffz0V9GZDG0s4S/fd0FRYr82vdSSVl8CbPAqW3+DiYQd1Ash/rPhfHC6mbG+OfJ1mzam5uIHlYP5trbtA6WKuIyrnfzubmRohTmuDmBvN0Y0I6tnx+NyXobyCsG0Q6bm5UesTAdGxRXAtxHuSA4M218FmohV8/lMz3QDSoB66JOcHPau2NRBsHq7U3UZ6OdZ+LY4VqLW2tNf55kjWrWnsTycP62VytRUtDLi8RqtEgLYaXQLKINIHPXPqzIh0H7iTdRHFxMKs4RGmOdZ+LY4VSal9u/PNRllbat4pDJA/rZ4r0czgb/fTkOSzkOSz0Y2V5s4gzrCPdZ/ROSH8Y8oj0+NvS47tW13sVCDMOfMjpZpEffGf6jfsxX6TOI+ZnD+VNldshgVsQ6Y1O8blpTD43peSTRX6snMwn/QB0lC+Sbm8I5Fm1hjekzPMNUTKfPWPy2SP4WD3AqaqXOxvjdgficDP2TYSZh3S87rkAcZ+huL2AuYcw9wUwCwIzLrv78n28+J86CIktGfe68DIKTIvPs0Qbh891NsYZ7Y+BXf3Q/MY8YPmxrlU9szj0e6wX5V8sDn0W6/poAFNdlBLnZzG/kY71FYdsDxhWl9O2lcY/T7Jm1VYukjysH24r785GP9Uc4aM8dwv9WFneI+IM697uM7aVSH835BHp8belx3d/g9rKe4CW28p7RH7wHbaVP0n1bhHocgl/DZffsZ9dBBorX3UJj9WpWJ6fm9+YF/Qr09GgH5qDeKQ/CCvEv0BtFqZfJLlUPd1s/m8TeQzpOVt7L5XT+gPjn4+y9E99f6Dq32I0qFfTzz3Z6GcpTf1Bea0s7xVxhmUHgNF+kf4eyCPS429Lj+++Qf4AfQf7g3tFfvAd+oOvkz/Ashm3PoR8KvY70B/8KvkDS4f6xBH/HRCP9H+5t4/5a+QPFiE9l21W+ed+y02OfBCLDwAqW1gETNOf6Qbt/l5Kh7bKdVLZ+v2Ct8I3jGG28RvzOm9JtnEPxCP9vwTb+M0UtrEvSi7PffSM7UDIvyD9HZHO11wCfVK+/hnMDv7KoY2YN0EaVRbcrhr97wHmNw5pOTFf6jI59o1Ir3yj0ilflKx4o5553cPSz0VhW2S/+8+FTrm9x/QLQharu/ORtvtj3efiWKGSeq7M+OejLNvXfns/rKy4vc/kEo1ipRSyw/uFfqwsHxBxhvVg9xnrFdLfD3lEevxt6fHdn1F7jxd/cHv/gMgPvsP2/k+ovceyGbcdUnV5mE//c/Lp6NuUT78P4pH+n4JP/9fk01U9zzr/PKdwvyMfxOL2/kHC4vyb/kw3aKsPUrqHIA7psL1He35I8Fb4adv76bzOW5JtPADxSP93wTbm8hvzj+mt/JTd3E9xWNbc3g9r5/jjRib3XBTuR80S/UI3L6q9V30j9HHc3ht9ATC5vVd+JtTeK1tUvlHp9EHCulVgoZ65vVc6xfzfSvk3+puETlV7b+nV/OVnOxvjcP5ykdLhGg2PRXDNhccPOH95I8UdhTj2w3gBHPYzef5yVyA/uwGD59NxXpzXnPIQd5jiFiDuZorDefEjFLcP4o5SXAHiboG82rw4nzJ4sPs+4/0pcptmaF0il/A3itK1F3x0FPnc4MgHsR7vbORzoyMf9Nm3Rxv5ZDGuVno7LPiY3dxM6Y51n4vjhdT9e+OfjwZ9TBb9e7VWe1jodbQdErwqjVpFVM49agfjQjsk4uCxrwlXv5UmeIUN83QkIR3qIhLvpgT9zYSVtNo/ncBPlSimY4vK0fukfU284mz0T0Cr+03qdSheqA9u+U32pB2OLIPRPwUyfO2QxpxJyNfhBMwv5vuyPJvXmJHAVPk6QvliGW4mGYz+lOjRTBMNy6PeYd3itPysbOYA0R8dkh8uJ6P/TKCcDgkZsE6yTlkGpjmSIMMXhAzCuz184eI7Xe8WUeDzz+ydWPO8f+uQwEkKhv/eXpmu5Go342GRjs+P54RMcc7tgufe0fdzrSuthLxPCdkUz6lIB+5XW7o4ZLvfKn0bbPzzkbbMYz7yBPd/qX1AamxhaQsiDu2D7TDE5zqg7drEqSsXLiWZRNrGOSfEiqLkRhpNNqI0O2a0eTMarSvHRoRaRVTOfVLJDbMWG3xY2ExXLtQFQkzryoW6X1hq1wu+9m4qSu5qqW4aby8PddUQA9OpJpObX9U84xZ2pP8SNI1fP6Tzac81+M1b0Ld+gPX+ZlrkZzrDd8j/wznAKhCq0SAthgJIFpEm8Jkt/0RnMB0Hw8l261ylYlb3iJDB4h4F3jy19RjE8dTW4xCHF39wmBZ5X+z+jmvTtw71cZmOZcUa/ijFYe15jOKwE/84xeG04hMUh9OKT1Icbr86TnE4pXqi+5sPvfwkTctl1AbKaTneio165fuYVddIHe8qiPTXB/jsHZPPXsEnY12Wsq2v/RvOQv0V5M/1wuLVX8PiOO6LZX1cMNRyx4HLWU0YhbAOj4iVcZ+4zD0PlW/lX5WsKh88QWLLGIvdtdp4ePzLgWUQ7oVkc/NcOfU2buOfJ1mzssfdJA/rh4eY80JW9n1xaHX6dBw3Ld5NBbAuOWK95Yj1piPWWUes045Ynnn0LEfPPL7qiOWZx4uOWJcdsS44Yr3miHXNEeu8I5anTXjWR8865GkTnvo654h11RHLU/evO2J56v6KI5anvjx94RlHLE99Taov9NSXp8/5KPSZPG3Cs9320n38m7+bPil276n7NxyxPO3eM4+efsKzD+Cpr3cdsfibYWnH9Ua/IOjVvJTNZeK2T0s7333GuUnv9dUkPeFWU+M/xu39pr4q0fHt/eh68glYET1X6d004GHAK/TSLKAtEuax7nNxrFBOvaxt/LdqAW2R5GH98NSVOrmqTnV+HH5jHPK5W/ApiDhuvsfBuuiIddkR64Ij1muOWNccsc47YnnaxJuOWKcdsTxtwlNf5xyxPPX1uiOWp77ecsTytNWzjlgfhXK84ojlqS/PduiMI5anvia1HfLUl6e/97QvT5/jWR89bcKzz+Sl+/g3T8VMit176v4NRyxPu/fMo6efmNT+17uOWDYVo26f4U3Ti4LPYoAPpl9MgaXGw0avbvAITfmoGxds7iGb2z36Uz6qPNRp+jGmfBa7zyWi4ykfdHH3JGBF9Fyid0lTPryL6Se6u5hMzRntTpO7JHn3Iu6MuoXyp2Yb8R2bMabfHeAzPyaf+ZR8Do7J56DgsyDS5RL+Gh9+x3yUzOPuglR8EMsu71BnItgORt2RiOkPJ2DhF0G+t9OnuZXoF7vPMwIzDnYBLV8q90vdOhbr9rPdBOoUEV5i8rU9YVkxLcrKR2R/HC4x+XoXU+mZd9rtFnlUTYTxVZhct0Ytu3khQwgLyytP9ItRXw+Kno/iGv1/AWXHl6WgzpX9HE6QAe0HLyhJsp9f24T9/MM9YVnZfvLRRt5GfwXs578i+0Edh+wnT3FqV67ymbyDfVSfuVfIp/jcSHEoH1/Yd6PIV47iUL4bA/LlhQzWDqNt+rXDo59Y2Utxj0HcPorDEysFinsC4rj9ehLirqe44xDHl7icgDi+xOUpiMtT3NMQx2cKMUzTM5ZLnIcvQF1kuoh4ot3wyRqsh6hf1BVeIaDqPPfrfrIrVFxv/2DPRn77hKxmdwV477jEl/pSYeOfJ1l95ekv8RVIHtYPL/FdL2RVfu1j8BvjkE/oVAbG8dTEOFhXHbFedcS65Ij1tiPWa45YVyZUrrOOWKcdsd51xGo4Yn3JEctTX286YnnWx2uOWJ527+kLPcvxdUcsz3L09F+e+rrsiHXGEctTX551yLM/4amvC45YO351+/yql+7j37zENyl276n7NxyxPO3eM4+efuKcI9ak9ldXHbGsv2rpcIyPcwk2B4A3dngutWW7jbh/E4C69BnzZPw9bncwXlt1u4PKW8gOcB4RdZCEdeuIWNnOV/bL9Ggg38h/ISCrykfBUSc3E1bauaVRy3ZfNFieljbjOtZbLr85oCfkP8ZyualviehOdvrqYLUfTcCK6HmJ3iUtl5uqcRqSlwTQhO5KyIPJxO/YnDB9ISFd/BuXv9QyMC4Fta/bKJOZFC4F4XII36Bq9H/zuj7m2es26gDT2yGgffQc/+b7yvGbp6Z7M2E8cONtwsgvirRrN/55kjUr164OSKF+zFZGu66NF2FRq4jKueeakAPJ8B1vPthF6TZzieJeiFOa4EsU1dEsToe6iMS7KUG/QFgLIp3JPh1IjxjqPBfnHxdj7f0BwXuW6L/UrZXqPmzFC/XBdxyb7LZgzjQsg9H/AMjA9ywbTdJ92OwN9tIz2hZ/LdiwfxK81L97neYfCf6cP/T6cwnyGt4s0f8w6IDvzt4n0kcJ71AHmDbpGWn3Rxvzwgt7bIt8z/b+IXnn8jf6rwTKf17IgK0h659lYJpCggw/LmQY755t9nJcSlwS8wInKZg24lya9Ya8RZTwji3A0o57z/buBJ5TkQ47bfvm23b17RpLq7a1cOs+n5LPmPdsJzX6qqJz+ojS5sS7OMTVwQ4nq0878s7Am0hefhfaGRj6LGd+TD75lHzmx+Qzn5LP3jH57BV8GEsNLeKw1unHI/3fBYf9jYRPkE4lYD7f2UivRqZqF5bRq5kF9QkttcORZ1QUb9QlN3C3jijroqBXMxBqhmBxRFlPbrGsNwlZFwRvbkoW4f12NCXGPy/ymEVTshgl6zUOmxsm8tzVIjwjKucetYNx3GLsI7onOhufNzNMVEc2bhWYoY80hywzEu+mBP0iYS2KdCZ7aK4MMTAdW5RKFz9/SqQJ1aA0Fh4H7pzc7Yi19R88LlXT1uxJ/eAxfxwW0xZEHA45MQ753C/4KKwjjliHnbDiwB833sHawdrB2sH6oGGpdcV7KB22vzb6UaOTfLRRvlHPX2F6PqeDfO4ak89dgk/oOjL+a3z4HfNRMqujx6y3e0R+7gnwwfT8IWVcz8VFuj0LmieOpDGtnTPjD9r/NTj3sXchOY+o5/fy1RmUuTeJCXGO/Z5WPIo/fWSjfrAPNNvZqBNVv5D+i1161dfgsxpoC/dGG2VIKqNDVEbqTOb1Qh4+k3keyugIlRHuacBz4En1SvFjG5oT9Cw/0i92ZcLlCyUfn49VNot6fjiB38eA3zfoa0Vol8Y7W7ssVZVdYn1nu0zbb09jx6gzZcc846T2halPB+co/Vykywg3ByD9J4RNpKkHqtyNfilluW+NP9Lljrrkclczh6Neh4HlaTorRIM2kTTTilhoC2nK/XqBz+X+3YFyVxtJUE4ud6M/lrLcTZfbUe6oyzTlrvZphfoPWO6ms0I02E4vEJZqA0IzzKrcsYy4DTD6E4FyV7P8IT9v9M98APw86jJNuauVkrTlzn4ey/02isO2ln3BVrUBnxU2wWMS9itJ8im9jbkoyWvwiwliHBTpI0qbo3cHE7AMJ36H08ascsvuXKSneFnlRt8QKlfVGOUJbWu2qdVJ+0Bx1tum034Ub9TvXI/aLGdg6nGw1ZScEIvTR4SVE+8wTpk6rr+aqfM2VEyL21DVDAKPdJTnVCMXo78f+Ch6HJkg/eVAKzdstMne/gFBjz13k0fl/wGKw3S3JvDB1hdbDm59jf7dlK2v8d6O1hd1yK3vgxA3Lei5PB4S9A8CDc+qPQRxXOWxDB4gPsNcC9cPZcdqdkGNFvJRcn6HjSrZ/tBm7qc4NRpVtoKX9MVhBuKyninC/LKthOpiHFh3IdtC3RWi4XaE9fp+4hPya3EI2QrO5ths4TxgI59j3efiWGGpZvhTmeAv906ETWcjf9P0yNs5UXez8N7PZpdT33hj/PMkq3Md6nWFZkke1g93heaErAWKi0Oz06fjuGnxbiqAddoR67Ij1hlHrCuOWNccsc47Ynnq64Ijlqd9vemIdckRy9MmXnPCsvRecl11kisOnjbxqiOWp01cdMTy9KueddvLVuMwqX7V0yY8/ZdnHfK0CU99nXPE8tTXWUcsT1v1lGun3d4+fXn2Vz19tGcf4C1HLE//Nak24eknJrUd8hzDeObxHUesHb/64fBfXuWYiwbn/CZFX5Pqcya1X/i6I5ZnffRsaz3LcRL7q7locI58UuzL06++4Yjl6ScmdZ7JUy5P3U+qn/Dsk38UxrWe7fbbEyqX57jWsxw966PnGMZz3tcTy9MmuA7luu9xnfTlTv/3Z7u/Z4nevp6k1tEd15p7X/WZBvlMhozXuSs54hdFG/sqEfFfSJAnDnkRNzOGrO3KcnmtWGw1WvVGtdZYyxG+ycrv0ox91Jq56XpXNrpeUntw5kCvcZiBuFmKm4U4kzHeW3PtyEb55zKSP43+kX9B0POpy7RleSDaaGtYH23fE+7z4i+GLUIc73C+W8iA9IeIXp3MQnrD45NS73b9iTqZhfu55hP4oXyhE4yY/p4ErKQvyd2ZIHsHZOc7ftRet3khn9EP2+tm8oT2ujFvzA+WJ5+0NPq/LvKj6ifezBuHGYjzq1vFpvdpylH3t5rOCkSP+rc43CPMN1dg3VokGdQdRHiDOe+fU1/IjOvcP0zxJcxJqvf/Ycp6f0sCP5QvVO8x/Sj1Pg5f6GjZf3bEen+LkG+S6v1/krLeb83ptY9GvVd7rNPWe9xjzV/VtX28aAP4pcb7IB7p/7OATat956HTwJ8Q9LgXnb9OinuPP0FxmO5eivsExHFdKEaDekC5+N4+o//7oIcvgw2+l5dOn4fJlW1dqJRUXTBZ35O/szHf+NX0aUHPZbUk6EtAYzorED2XGz4jFuqcj5CZDucEPdsy0v/Xou1QJ4yLJPv9I8p+o5Bdff30QcxH90CD8te3Ec/7AzxVe/UA8hH0hsfnZH5b6CvUBqKe5gjT6H834C+Uf1X3+YV0/4DIl9LpgxSnbhDbvjNBlaXtPhNk9qHOBHFbhnWHzwSpflfa+oF9xD+f34ir+iyY9g6IR/o/DtifqleL8G7U/gC3V0pPyv7upjjUKR+zVO020vMY1Oj/LGV7tUVn4KS9o02zvYfsNw6j9i1MZ4VosD25l7BUXx1tgdsrdSbzAYHPZzL/r0B7dTekf5Bkv2lE2dPWx3shH79B91EvAh23VyEfwGmZT6h947o91T0MrNqrRUjDfVHVXvXoATPNmC3UXg0bs5k8SqehtsxsYRtvjClv99iL2yusX4sUh3WH68ei4JO2flja2JZ+ldqr2wgXsdBuciQj2ivWq1mIR/pDAXsd1hazzkO3OaE8+6Jkve4Tsi92fyt7Nbps7bW6vN03W1l5qzEGzyMsQhz37W8TfNTNz+prcJY2ttefI38+R3wQYzfgW5ytl/CHTY51n4vjhdTXaRj/PMnqLE/vDKn6zATqx+xitDvIcdWMtYqonHvUDsbxaug00T3e2fi8mTvI8xCnNMF3kKsPunA61EUk3k0J+nnCmhfpTPbpQHrEwHRsUTl6jx57TvCeJfo6eOyvH0rmiyuvLIs91wS/BZEvrrV5ytOx7nNxrFAqpa21xj8fZepFSiFbVats49Va41IgVKNBWgwFkCwiTeDzbkp3ojOYjoPhWMkfoPfHus/FsUKltw/jESGDxT0KvNlaH4O4eYp7HOLwjgAO0yLvlt9Yd9+iNYtIYKm7fB6lOKw9j1Ec3lr3OMXh92OeoLh9EPckxRUg7jjF4cfOTnR/s8d5vgue7R6NYhFtK4p0Oe/0JT5sfYmnOhufN9OXwE8RjtqXOJCQDnURiXeT0JdQ6eLnWZEmTQ3KxrsXU9/oYvy3qgYNs5sp0t31Qla1Cot5wzjkk+Yb9Nxa4PMwmce8KI+f5xPEmBLpI0rLroEHv7tFlrDq8QSpyTIXhavJLNFfEBN+ofRx2Gl4BqtN2oZHdXgsbUHEcdOzKyUfR1OPg7VIOSFWFI1m6rlIYxlO/A5Hamzqlt25aLRR4vcLUy9EG2XE9DHmX3UTWyv5BNBx9X8SnqeJXuXjOOWDaZ6gfBj9D0E+vkb5QJm4z3scZOHqeoJkP9Z9Lo4XUldX458nWbOqridIHtbP5vqJaB2sVUTl3CfVkGG18uHOxufN9BOfgjilCe4nYp6eSkjHls/vpgT9CcI6IdKZ7NOB9IiB6diiuBbinNOTgjfXwv8gMOeEfJ+MBvXANfEWwc9q7VNEGwertU9Tno51n4tjhWo9ba01/nmSNata+zTJw/rZXK1FS0MuLxOq0SAthpdBsog0gc9c+reJdBwMZ5Zk/nrXCt9bf+j+3hcNWjz3mFGGkP9TXRKjU3z2jMlnj+CzEA3q285LWdyUyKu6r/MVSqfOgvC8G8rF824K87EA5uMiLi67cmEjHXqzXMLfOEyLd6zTE0JWKzv0INzVVLXt6QAfTG90CyLduPlRMqs+Dn5t6Vf39dPE/57p0qDXRztehHik/8qhPuavUX17BtKbjErPXBdH1XNe8Mlaz1ynnnXkg1hWZqab5wiL9bzY/W16Pglxz1G65yEO6bBH8Ry8f17wVviGMcwGf3OfzluSDZ6EeKS/DDb425u0wWcp7lmI4/bQ5EA9IP1ipPM1l0CflK/fC4zPToj0SvYCyfJsQPY4sC1ieqPL0uaR5zD7+UOyH9Sjsh8+/2P0nwf7+Z/IfrAHl0X+Q/Uae3I86lD1TvkPTod19PoUMjwnZFYzkEa3INKNaxtK5mG28a/INsx3JdnGfRCP9I+CbfyfZBvoP01GpWfuA46q5z2CT9Z65v7dKUc+iMXt24uExXq2cjI9vwBxL1K6lyAO6bB9exHevyR4K/y07dtsQectyQZfgHikvx9scHdhY/4xfcgGT1Ec6hR9L5dPqAxyJPdcAv0pypfR7+vmRe2tVfX1FGCyLzf6A4DJexWNL+ZLjZZDtviCyJfS6YvRcN6oZ54LtfRzkc5/kq0cDugUy0Hlh3Vq9EcDOlU6CulU1bEXRb72iTy/RFhqpg71nEanmP+nKP9Gf6fQqeq3PEWyY9+B+5CqH4b0dxO9qmOqb8J17L6A7CdEejW3YPevqLmFZygd7p3hsRiuOJ+kOJxb4HkO3NPD7R/u6Xme4nBPj9kRzi3wfTLL3fcZrwHIPSwnSHbUfy7hbxSla29zlA/kk8W8Svz7duLzlCMfnlVFPlmM9+NgKwtqXIn7sTDO+PA75oPpjU7xmRqTj6q3jGVtQxywbzYD8Uh/AvzLDx3ZiKl8HM4d89gEZbK0Vhd5fuJY97k4XigZ/vPZ4JdNF6rPj3li37XZsSXyyhOWt+5CeQvNKWC/FHWQhPXciFjzIi6LMh02D5Q0VsO0Kh9JdRP5LAidGP3zAbmQXo0TLK3pEPtf3uvgSTpUY4frov7+1e4K1iOt1atnnrpwJqIwTeow9R0hOnM/U9GgKT6XgBXR8xF6Nw14GLbKnSs+e8fks1fwWRDpxm1ulczDhtjnaIiN3WA1xL4T4pH+EAyxLwSG2ElVMwf8cHmNhyDGL2mLy0yCfFegmf0aDcFmRJ7vDMhsmNhVV1cvsgzvUPc4oyZZdo95inuG8oRxmO4ExWEX9ThhqA0T+I7tVW22YKyk7hR2t5D+yyN2p9JuTAktb7AeRl0iOJ6Sz74x+ewTfLJeithHfLD7in7oK+SH1FIEprVjNbwUMQd+6N8P+CGesuMuHvtm9kM9fpH2Q2yfRv9TAT+khhAnOskyGybWZZSZ/ZDR/0fkhzLq5kk/xFOs6FsPRFofUZSunT0g9JB1O3uA+Jx05INYvM0Cy4z9z6hDADUFPqy+/lJB81T1FW2Xl2h/66Y+5t+m+or2Huqfcdt2UvDlOhNFg8PIKAr7spMJWGnbKKP/RqCNCg2J4hAa8ifJNxMN1qn4937IcxJWJN4ZPbaPPA32HNGeDNAmDWHj33ZlRLbTDNWyWqazYHEvCJktDqfxn+n06TjwljzMU2wPP0zX/iAdy4N6eiEBU/mEz3U20lqepwTu84SL9Zz19ZmOloFtIA6nOhtxDPd3u3Uj9ge/Tu1UNkPpaoXLFwOXL+uWgypfkzsu37+3yfJ9keLQL/PWReXPY33+/oTqE+s/h+3QJy/XDNOnxVl+1WZ03BSO/P4/sPc/JLwpSoP1h68Zt/zMiPRx4L6g0f8RtEXTR8P80f89n5Cff0s2xkv+x7rPxbFCpWRlg8uhVubG++WMeKfpzyH/BSGPyZ0XceN8UmCtvFqp1qsrtWq7srJa600xv0yy8jueS3tF0B8S9Kbrz0RZ6LrcVNcRvQJ6jcMMxL1McbMQZzLGts6fFHglI/nT6B/5FwT95zt9ulHKsiD48FhhHKyTm8SyTx3gdgT2x9hf4fZN9Tli/3nz/v77Yf6Lt4wa7U1djGz7m+WK6jey/3opI95p/ZfxX4iSyysv4sbxX8Vmu1QtLpUrtfpyrVip5KJBPz8t3rH/UrZ4k6DPuP4Xlf9iHzUDcS9RHPovk1H5r2zaunIxjf6Rf0HQs/9KW5YFwYf91zhYJzeJZf5LjQmU/+L+5CmRH/RfPCa6hXxSRkdZ5XwdHy1DeeOAY10eR54M4OA77LNiGp4/Mfq79vdluGO/ls/y8Bkhn9qGhfm6Z38y3SlBFy+t2pWN3aXVx1tXTr3auNRqnmqtXWpdmabc82wkzxry6qkKlsMZevc4PfNsyxThWOs6Ew0PxnNfNKiZG+A381Ez+FwzbxAyKj43jsnnRsFHjQJzCX+ND78LrS7fSHzUprGt2EgTDckH8s+TrM7y9EYmarOFWjVU3vN50jnG8aqt2pR9SvBRWDzDjNi8cjnqqsUJIfOwVftP7tc81ap9HE52+vFI/90w+/7p/RvziHKF6iN+nGgz9fFwSj43j8nnZsEn63p/M+UH7Yb1NqrdYPq0dvOck938Hzf2MV9IYTehPGJd59WN0IbLk0OwThJW2hWjqRR8QitGUyn5pMlPiM925sew1EojlsHznWS5niOsYe3Ac4SlVimUDbLMo+5SUStXis9zY/J5LiWfrcrPs2PyeTYln8Nj8jks+GS9Of8w8Unyt++Svw0doowD72ox+n8B/vb7yd9if/HDruesD1EOK88fpfLEQ2RpytPofx3K88dSlKfSTVLfF/mGyhr9LbcRqq/8XIBeHc5Tbcr2zXqmv/aaV2ayWcEqBldmXhS6i2cZDnZ/d2cZPtW6XFqqP7I+xfDOxStJM6AF0vVLhGv0ET1zulg23jV6QvCIA9vfKaJju7H3alfqMJmG0Q6LV77yxYR8RlE6X4npR93Z+hLEI/3Pdv1E2l1DaEOhna0nKd3JBNmnRR7yCenqkZYP83w8kGej/2ogz88NyTP3/1Xfk30b002LPOyOBm0AMZSOj0QbZR/VnjD9VrW9R4hPUpv4K9QmDruE5rsgHun/HrSJ36A2UfUls85/0g5hzNd3AU3S2GhGYMaBd2QY/T/YkhVIPdvPqxjq8qC4fP7R/uG6CZW50f8tKPN/nKLMQ/VH7XwP+YpnAvRqLKrmlkL9Uis/vjjjWPe5OE4otYppbBz550lWZ3vq9WfUhQZqnnXU/ozh/kFuo65fIFyjj+iZ04X6M0ybVLe5j/E8vR/Wn1EyJdGO2p9Rq1a5aNCW08ydYnpeOc9mfWCpt/L8DMhpsmKdSroYYioarOuKforkZ/ykeZCZBN1Z28j9t29DX2auu9NOldXRBPmiKF1ZYfqtmuc+Sny26rJJLFe28VHn00NrR8Ns8Du7v4f1lf54xHaTV8CN/hVoN/+U2k11QlbZWWiuiPM/an81VN/S1h/W0YzAjEPSacuZbgcn29OW1WLoIrGMTy2k7gNwv05dvJYXcePs5GosNcvl5bVypbjcrq6tBNd7R52LUh95zLS/VazInai4oyQOMxD3PMXNQpzJqHZyZdM/qzTT6B/5FwT95yAPo5Slwjq+SSzbfaXG7Nvly5LmcngHam/epOub0p5SVidRQ2s2PCbiPLJPjMOx7t9hltQeEoyflc8uIQvvvjXa/aCX+aMb85I0LzWTkF/MWyQwknTHPNRutu+ONsr2XArZ1PwTYiSt8cUYas2T7XrUU5/PCHkUn7vG5HOX4JP15Zt3EZ+k/tidB/pp0N8kred8sdOPR/rHoD92dxdTnTrnNWJ1+wX2hdhH8kXITMP+xugfgHrFp86nKM+Yz5CdpT1pZPRF6o9tx7wW53km6p+ORf/4SEfnedhJ31CfJXTThGp/GStp7pzHCJa3v9+dXIltpUZ2brpJyv+jnY2YRv+t6/uY3zEi5mMJmC8e6GN+N9UdLEP+GDv7B37H/oHTx8FskecAjnWfi+OF3uVos9ng9y7SmhG6wDwZ/3EvR0Re+WiwjLKYT1R5C5Wz8kshrJkRseZFXBZlOhXIN/JfCMiq8sF9IMXnVqETo38kIBfSWx1G27e0psNHIc5Rh0uh8saLUo3/GJejWXZvIjq+HA2LYDYBK6Lnm+jdNOBhiF3nx7v759VUTzlBZpOB37H5YPrQlNLuMfnsFnxCWGWBZfSPCXr1WUPLB5qipd2Kb9klVSm8l9f4O5jpUaKzXsxUlFw7hpnpUXqXZKaqBvK9S6r1QvXsExh8JuyRAM8oGjS744IX32/xJeq9PkJyH+s+F8cK9Rpf2Ww8kPdjGfHOET/TH75D/uoKaZM7L+LGmU1stYvtpWazXF1Zqlaqa2uhao7v2C2o2Z+KoDddP5uNritqNhF3NsRhBuIeo7hZiDMZ1WxiNq6rXkmjf+RfEPQ8m5i2LBXW8U1i2Wwiun+r21vla0JYoTvoTOa5SK90si8z+h+E2QD+QrPSQyTeTUWDfurZzvt/VZM6F2nZFW/Dj0NBpDe67fOVxeqovjIvdJLFaOmxlHrllVpMq1Ze+b6ZUWfRJx0LbZs/qWDx6q/x4XfMB+v6HPF5zJGPaotD9WSzfEKfq8xq9d9mFrNtm/sruryCgHnEmVy2G5zN474Szu5x+ahdLeq+rGPwm8M0PXP/4LqjfVyms7BVd9yq2Sicnf87BzRPnJ1Hu0raLfELMGv5nx5IziOv7ln5p93BafTfpLHCdtyv+lGqI5upB49ush5w3/CkyIdaRbN8qPbgWYpDH36S4tSnfJSvtDtHctGgv+YVyTjwioSaB1D9OvYLo/brjgs+2fbdKm1157UFtmuUUa1aYp+cg7JBy1Nsg9+fwga57WbZlJ7QF7KMmJ+0d1cb/f8QWEXkj97H4Xs7g/k2etwFFhFGHNi3Gv3vk2/lFdRj3efimEH5Vj5lH7rFIyO5lnLEL4r0uMP4b9UtHsNO9uOub9NtdwrzqQuN5sONi5evnmtNkUbZu6BWEZVzz7UxB5LhO77z5snOxmerFVyTGRt7I6pnFLrjQH20Se0JOS742rspQf8MYT0j0pns04H0iJH0xYbphHTx86dFGs+RgvLm42KdFFjZ9uZKqe/n4f2a2exrDX+cKnS2V+0tLYg4Phux2b2EuSjd+Z20+xJ5RmEHawdrB2sHayuw1KwkjwCxneMzzugHccSAcShfaDEe04cW/e8ak89dgk/W55XuovxgG8p6U2frTwb4qJHasJmue6/XPNVMVxxsZMUzTz8BM10PXL9RZrXBIQ776B2Xw3sYncG0892/MxDn2P9oxaPM03C7P+t9Fvim6afYnla1X5hnZ9BW0pbhMpUh76vltLyX2Oi/D8pwpftb7Yfkc4mh/WLIL0d5nov0bCrKj/Tf05UJVw+VfDyb+ijgqV0edyTw+zTws4+nK7s03tnaZams7BJnuNgu067IhfyNqpuFaNB38YpyTmChnfDMkKWfi3QZGd4s0T8tbCJNPVDlbvQnU5Y7zhrGYQbisi531CWXu1rNV+1gyE64POOgZolniW5WYKEtpCn3nMDncv9coNzRVqaFnFzuRv+9Kcsdd+rEYQbisi531GWackd6Lnc1Y47lbjpT/YvHKY59Lv5W7QPaSRqbwPLj9sHoXxM2wX1X5VeGtV84g9hlYTOIp65cuNTqTiFGFEJTfvHzMwliHBDpI0qbo3cHKE65X3UMhHnPRXrKjd2v0b8pVB5y33EIHQXI+NhC6kls479VRw2GuU0enoSqKcZNgKnHwWa3c0IsTh8RVk68i8OwrefcS1XeDos1qVVMapmwV4n0Xw60TKqlVSM6o1cjC17PSso/n6xUeyOZD7aY6O25xTT6H0nZYm7NyE23mKhDbjHVzEnotkl1ug5ng3k0p26vUS0mn84cVk3NfbMrZVfOI0NlT6ERQUg/yv5wRMA3Iz8nZFS2gvtI4jADcVmP8jG/bCuhso+iQd2pm0n5hGUcCkSPelSzAnyiVI3a0toK3qx2L4341T6EEM/QzJS6zY33Sv0i+JKkmwnSzmgY/S8L/xTKw3GRh1Dd4f0QcVB7d3hvVEY3wpSUz7OgVsl4bxTaJ++NQvvkvVHq1lH17S7UCQfuA6Ce0u4fZHsx3FHqhKXFfYCqff0E8Rx19hnTh2a5t/po2ycEltGrPlToaJvay5Xx/vje0TbVpVYz0Q5H2+4kOj7apg6iMlZEz3fSu2nAw6BM5niCnMZ3mMlg+iSTwe1WthgUxyddCvAHXVec7QhvpRzaQp/t4d+V1BspkrbHo9zq2MY4x9iaS+2leqler64ul1vV5kqoSoe6hGoIUxT02R4DWymGhhnqGNujFDcLcSajOsaWjZtaKabRP/IvCHo+xjbqFliMO7lJLDvGpmYktso38bD0j0RXcqtlsa7U/xzo1qomSn0EScnOOp4N5EvxmU2ZrxCf0ph8SoLPgkiXS/hrfPgd81EyD1tU/QsaOuORRtWl/EKnH4/0fwsuw/m/aYil6kwu0u0jtq1xSKqvuLU61C4b/V+BffLWal44xXwqmc1X4QY79Bm8tdrop7s62s7PjIaOxGUsV+pZaeOvjrhnMSt9nORh/eBscfqt1bzNhT+cyvRIG4m4YZPPj3c2Pm9ma7U63KkOgaur104kpOPawe+mBP1xwlKHWEz26UB6xFC9DcNQ6eLnmkjjeag0i23azwisbCdk0n/6x/jnSdasaraa/HomoDt15anazpRm0ix0ZaP6tJ4H1rNOWHHg7Zc7WDtYO1jbj6W2Jz1D6bA94U+Eou/i7U+jjgzVGrzic3BMPgcFn6y3MB+k/KiLX3IUh/kJfQoB0/OhR5QPR2rHD2qeaUdqRv/TMFJ7+uBGmdVILQ5qVBxa3DS6jBc3m2pxE/U+C3yxfcQ8I71t+1bbqUw3ylbSluErVIY8y8xpeRu60f8glOHnur/TbBEetuCOB4qxHNNuYTb6012Zhm1h5k0euA1S+QX+3KfRN4HfBGxhLim7xPrEdqm2NKoZpZC/Ub64EA36Lt7SGNrmmhN8sDy8tjdfFPaSZsulkk/pzXlL4/EEMQoifURpc/SukIBlOPEzDp/TbGl8VPBjF/KWUHmoyOKws6WxX8fZZaH+UEburnzAtjTarFJOiMXpI8LKiXdxGLalkWt8SMVKVZvdbP/DokqEPHToA4eqp6EOG4S2dKr588cS+KhDAHHgFtPov5KyxcQLpeMwA3FZt5ioQ24x1czOqB+oxNkwropqtke1mKMeEku7pZF7iiF7UvkN6UfZH/YQTlKcOlSgbMXotqPXP87BRdZd2u2g6qIEHokjNm+jU724tLZiadXIcNgBmaQ1NfQhiMHbDo3+bwsfYphq/0Ro22Fo5QHlUVdk8Yf2VBO7fb6tuKbsFfXD9jpsFSZNXVe9ZnWgkbdyY/eN25phdhWyV2yT/4LWh1HWe4nnqNeNYvrQBxh3j8lnt+ATwrpXYBm9+qBvaLshblG1tNb9xm2o3t3vJFvDbbHGf4zthqa+I0TH2w3RjF9IwIro+Qi9G7bdUN1eu1mTwfQh0zw+Jh+1KMvbdf4lbUXI6Bbzcpr7nl7IiHeO+Jn+8B3yVzvAecES48bapthYXSmvrrZK5XqpWSm2coRvsvK7NK7jQUGfrXuoy22KL4Je4zADcS9QHDaBJqPapvhiRvKn0T/yLwh63qaYtiwV1vFNYtk2RfSN2+VrrMv8J9BN5G2KWcuS8UmUMp8owaD8CW/Dwvo76k2neGpklJtOUecoG+tQTXOwXeLJqmlBw9vxjP4vwCZ4Ox4vbMUBFyaSTmnhdjyUOekW6f+X2sDtuEVaDb+5Oznq4qK6YzLbPI5eD/hEFvp1PjaAbRZvwnoZ4nIU9wrE8bfcPgNx/O3uz0Ic36T+OYjjE2Cfhzje7IdB1WUrl7g+fOFwH5fpIuKJdsP9GPR5pl+1CPcQ/M5Fg/0lfsf2xulVOpQnDhl/n66U7e3s/W8Ihu4eUvaz2S9eIK88YXnrLpS30Jd31IbPEFaaLw8hVsYn6npl+mgg38oHKVlVPnL0W9Wzh4ROjDbtFLC6CQGnZjNs65ZCOlQnhceYJjD1PUB0/F1Ite932DTBA/QuaZpAuTmc5VR7lHA/yH03bOSrTl+oGWReuWrd0Md8EH7zKhvK+VS0MQ75PE3yq1Mq2X6oL/2CL58kzGgBusRlZPKwfjZ3WoAva0atIirnni0SG+AogY4tMg6bOS2gKvmswAwdk+Z0qItIvJsS9I8Q1iMinck+HUiPGOprspx/tVvpScGbdyt9slsr487eN2nwo3ihPobtuGEalsHoHwYZvpaw1j2TkC/2Bo/SM9qWTYow/1fASz2e4AUjwZ/zh159LkFe9KpIfwJ0wFtg1NpTlPAuqZVJekbaJ6KNeXkcnpUtPkn0TwzJO5e/0T8fKP8ZIYPJFQfWP8vANI8nyPCSkEF4zYcvXHwnYfcKb8xiL8elxCUxI3CSgmnjvdX5ruQhbxElvGMLsLRxzm3Pca8rdK51JWnnDrcIuQSe7Okt7LTtm2/bQzcaFKLkMuYaNozPmJu5khp9VdE5fRTAwjRxdfjx3Rvp1IYCNMO1Tj8e6V8Fh/CNhEO6UwmYdszB6NURwFE3bKljh6HRVYh3aA/ncyPKqu7owhHdcZIV5Ts1oqwnt1jWR4Ws6r4ndlWYr+1wVcY/L/KYhasK6TUOmxuG8Nw6ahVROfdJ3oE9Eje0T3Q2Pm9mGKLWxtQX5MzCME8vJKTjmsHvpgT9KcI6JdKZ7NOB9IiB6diiVLr4+VMiTagGpbHwOHDj94Ij1osCK9s161LqL0wb/zzJmlXNfonkYf2w7l4WshZEHHdCXhZ8XhZ8FNbzjliPOWHFgQ9c7mDtYO1g7WB90LDUMYTQ3iM+5I0+9a5oo3yjrsVh+iwuQSkEZFbrpriA8g9o6tB0lLSVnQ/UGn3txj7mf0mLJtje89V7ar/bdtzojH2G2c5GnSh7RHr+bpPaU6HK6KVoowxJZfQbVEaGkfa4gdEvQhn9JpURTlTxnqZh69j83SYrx7koCq7/sg39d2I6WcnHR0mUzaKeH07g920xW7KNR7iqyi6x38p2mbafm8aOUWfKjnmGRk30qYuucpR+LgovEfAxu38hbCJNPVDlbvR/lLLct8Yf6XIPHW9RM22h4y3KTkIXM6BN8D6U0N6OOKQpd7WMyeX+vwfKXS3yo5xc7kb/5ynLfYu+QiHLHXWZptxDRxjV3nYsd95rg+30LGGF9mnFIU25qyU+Lve/DJS7mhUP+fmefDf2MSfVz6Mu05Q70o9a7uznsdz5cgv1DcqtbgOug/Ljyy3UntiQfEpvzpdbnEoQ46BIH1HaHL07mIBlOPG70Pe6LLtzkZ4SZZUb/fVC5aoaozxpblTP8jJ/5Gfy4jvkP2lbQE13x4Ws6njGqM1yBqYeB1t9yAmxOH1EWDnxDuOUqePqCR+WRS+Im3ruo5EOmiCPdJTnDF0e8TLwUfQ4MkH6u0T1YkyUAXtw7O1fEfTYc+eD35iHVygO0z2XwAdbX2w5uPU1+gdTtr7GeztaX9Qht76fgbhpQc/l8VlBj6cleBYKT0twlccyeIX4DHMtXD+UHavZBTVaUKfG0tirsj+0mZcpLumkynvYnX6c0W3HTBHml20lVBfjwLoL2RbqrhANtyOs1zwDFfJrcQjZCs7m8Gyhuugj1B2xrhH6EFwJ+yTEI/1x4UMMU61eh/ZTKF1gO8Dfo8PuHJ8CwnS4UvwedqcfZ3TbYa9bOYNkZa9mkE5RnJqZV90gK4/Y/u48sJEOT0TlEv6arPyOZ88Ry1YRPFf9CwLrZeKDIz2cAT59Yx8XdYL1CEd43wnxSP99MAO81v0d+g4dj8TaWA+PJqfnC5DwJB2fskE74JObKp9I/8mEfJ4DOb8M9SEOWC9NrozrZXvUb0gqHxX6hmSoHqPO1Awfz+yq2Qa1G8jo+QQzlxFesIb0bwVG9Zi/50n2EyPKrtoj5WdwduKP97//e1802Ebx8F61gaqsCiL98wlYU5Eern8n0b8EfFV7yvRmE3gwQflvXin5ISirbx7VmFGCDM8myDyXQM9jJqP/kcCYSfkJtP8XCNPo/z3A5I8uDcP8rgTMrwT6Kqqe4u6zUdtb7o+gHrlvjbJzu/kS8Gfa7yH+GId2znyjgLzc5g6Tl9sji/sqtGc/3f09T3jOvrwcKsslkZ+0ZflsIP+MZelmokF7DdUh1NfP36gxZ0fE/I9Fn0D1dT7b6fP+akJ/Jg7cn4kD+230Kdg/PE19GtW34D7N11LOT2zJ96ZLreKoF3kO012a/eRYztyHx/ZqP8VtRVv8j/ZvxH0ugBv/vpPkGNaHXIZ4pP9WwI8rHYZ0Puwb33ybCZbHCxSnbHrS7BX1w/Ya0kUcRh2vs72q9knZK/fjQnYVh5C9WtrYXn+F+o4oK98k9WJAnmF9ej5poOai1cWCPBf93wb6VWo+KzQOGTafxWdVsF37TKR5Y71FnfDFzEb/36f051szJ6MvZt7K+Wbe0Y7zzS9THNaPVyhOzYOF6nTaumNpY7v9UfL13vOL7OuN/o9HnF8M+fqs5hdDvn47bXlS5xfRltPOL76boq8RWgsZdvE1+7+TQg7Vzh+OhssV+gwWps/iRFMhILPq03B+Rp1DwfR8+9jzjvlRMqvPJOFc7cxN/TRJPgnTcjtm9Lfe1Mfc1f2tbrvjvmNam0qyXTX3FAc7x7ptfc1isbrdfU3uT2I7+AxhqVsH0TaxTXyPptNPbzJuhz7RH7A+Q/4tDmnGPaHL/tXNwWpOmPcmKF2n7X/ghwCe2z9c/tCHD4bZj/H64K0tbn/bz7Yy6toi+2Pko/wx2wD6byw3Xmsz+oe6Plv1KZWdhOxq2FjQ5FG28xLFqfWH7fNBk21XL1Ccmg9Na1fsg7C9sLTYfwj1H80fsu0w/XQCDq/H5uh9PtIn9OuUZ/b9jL1C9NjXngrIznNxj0JdSlr7SZLhO0iGU0NkeJ5kMPonhQyqz8Vr2OqDD6quq3HLyYR0rPud+z36DiVUH1VfRd2uzO2J6pdkq9dqRd0SEZHMao1M3fqMNsVhmp4xT7Gtf2uEm9HVjcmTpqeTFIftiZ0CVnv9bK/OZnT4WyPoUPVdttPPPC9kVGPsSfUzz2cjT9DPqLmLD4uf4fmWHT/zwfQzqi+rdBiHY92/xTFDaN9mtl8zWiql9R/GPx8N2loW/iPtHEO2X/BZKsZTH2r8fL/QDctximTM2n5C/dxJs5+s+7nDbm/bDvtB3zKK/ai1ghvgN7etadYKMP1WrRXcQHyS1gp+2mmt4JdgreBnAmsFvB6g9mVv4z7pctbz0ePsfQp9mDar+ehP7tfy5wD3O0Va9g1If0rIYfR8cwvToH0i/ddhbuRrCXul0KZRLp4/Nfpf2cL5U95jhXrm+dOkvvB72J1+3NbcHrJU8r7NaNTzpVwvcL8P72ni+hcHnG9n+1WyPjeGrFzOWJZ8vnKz8/7/RNjt9p1h1PaBfYY09hH6guYwnfMYF/XM+8HVvseQ797M/PpPU/uYdMtsEk+1fqyO6LOvNLv9XbAPPnOA89/Gbwr4cftv9N8O+MrQrbiYB7Z7lWeUR+0peCGQDuvtvOB1rPu3WGyPFYyf2dYuIQufBzHafw56nD+qZc0NyDteUPsYcqSnrPrsOeIXRXpMY/zzke6HHHORpz+mUe27qncZ33DcTjMmVnts0V7UWAPHAH9KYwDlA9AvViEe6f83GAP8rwmYUaT9SuguDdzb/EuFjbhZ7a9RviW0P4L3Vah5OJMB90GrviDvETX6vwDfEDpTuiX7MUrtbe/3cduN7TqPh5T9oS0kfa05aS87rxP3bKHb9qkzpdgf4D3RJ0eUPWkfF9dVrDtcz9V6jaqTIb+Act8J8UifB518I7B2nqZvMGz8zOe+1e38ao7H9lOr+mR027EPZSv3FnJfMnR+W32PRPluPJv9FfLdac9nsb0m3TlwB8Qj/dGA/Q1rl0bdX81nKNPuhTXfsH17W0tLo94RkHbdMY29Ytmn2Yup5hSHneM7R/anbu3FtPdBPNJ/PGBPap4npJO05w1GvbuI92Sr8TC3s6gHlIu/9WT0VdBDqD+yNfMMlW0/58RnmfCcE+/VU74Ydc6+T91ZoPpC3Gc8FuiPqLu90py1UrKnnVvG+d3Zbn0MtcchX6PO0LCvSbp2kudGjP640Bf7/qT5uLsJ0+ifDvgL5ROfgnejtuGhPg6PX9TcyPbtw60sjTpPGNJFHEadg+f2B/0pn7tQc05sJ8gnbf3A/an/at/7v9PsvRp2Jv1kgoxJ9SNpH2wjUD9U/wz1dBthGn1zxPFBqH4MGx+Ezipx3VH9uu3rn1WqH6T+mbofg+0E+aStHzie+MN9G3HV+BTTLkI80l8b0f5G/VaiWt8ddXz6NMVhuXBbOWzdiMdJRv/vpOzPbdF4uLzd7QGvG6n+dcj/hta5lf9V7TH73x8N9OeehvR8buTZEWXfzL0Tv0ntFY7RuL0Kjf05Ldd7RZ90x9tPBNqrZyCNmk/g9srofyrgL5RvC7VXSvcnRb7SnLtF2c0WVP01uozrb0XVX9QP19+QLuKw2bPuam2X9wxg3eG+ktdeml/t1o8s9V6rF3tralbmZt8cZiAe6X+5a9N5yIf9nRlDznatUWqXG+1GtdFsVtYaBwg/DlbGezLgv1SvL68srRYrteZau1kpbzX/tdXl1UprdW25VFkuV4rNreZfqTZqa41aqbRSKbUqpeqW57+6vLq2LkSxVYofl7a8/JvNVqlSqq3UW5VKc2Vo/mP/9VXYP5Prvo8ona0BXwfvHdek13JCTrVGbvzzJKuzPL018utIHtYPr5EvZCPPao7wUZ4FoR8ry70izrC6rnpD3wDpFyCPSI+/LT2++3Xqs+0FWv4K5V6RH3xn+o3bln9yaCM/s4tvH+rT/FM6M4q2g7aCcchb1ZNCQvo4mJ7xmx183/QsxPGd13OBuF2BuN3RYL4sbh7SvULp8gIzlmHx8EY6bEtzCX+jaLCOxoH7MMpm1RqslRna6QJh7R2CdZKwMP1ewto3BIu/VorpLa3ZxrRItyD4sD8twHtHf9FM60+Nfz4arONZ+NMCycP6YX+6Pxt51nKEj/LsF/qxsjwg4gzr+u4z+lOk3w95RHr8benx3Z+RPz0AtOxPD4j84Dv0p39C7T6WzWbrfCEa1I2V7wLIaQH3aP05jTNV+4Rp+Su5Rv/w4T7mv6b2AO2byzar/LN/3uPIB7FMlyFbwLpm+jPdoN0foHRoq1wnla1fL3grfMMYZhvTh3XelG0gr1mivxdsY+7wxvwrv6jsZg/FcR8U5VT+DsvMyoD90ZygR7xZol/o5kXNAe2BNNNCLt7vbPQFwOQ5IOU3Q3tKlC0qP6t0eoCwpgQW5ofnIZVOsX4aHuv0JqFTbu8xveoL2n3c3BeMf3NffQ7iFihuF8TtpTjsC+Yobh7i2A/j2NP0rfqCWC9mEvKKMiqZ8xSH9jFLcaij3RSHep+jONSf5XtPlM5nxIHbE6N/IFAPlJ9T/RmjPyjoryeaKOrXA7T9gxSH6bj+HIQ4HrfYuUnUA8r1hU4/HunLoIfQ2onJlfE5xjU192qyvid/Z2O+b4S4aUHPZXWToL8RaExnBaJXPkv5P9Q5+yzT4ZygZ1tG+u8J+Cz0eTeQ7HtGlD0nZFf+4gDmg9pbHmsgz/0Bnpx2gI+gT+oPPBFoN1X/E+XidtPoTwT8hdJlqN1U/kWNKZROr6e4pHHNe9idQcyM629T1V/UD9ffkC7isFlfW4gG6xeP77HucP1Q8whp64elxfGP95zwanN5rbhSLjUbjVqxtlz/YMwJr6W+C+KjOSe8VswRPsqj5oRNnr2ZyFMs8ziabYP9sOqL85wz+iz0vdxXv0R9VjXOL0SD9ZXnT1RdVv25rcZS40jUm5Vp7EfOkC7QXnMJfw2X37GMWJ5bPa+h6lP871j3uThWKC/xmgnKaLyzmR+t1tL6OuOfjzKty6WQDav1GVX3k9rQODQ7fbph9o18FNa1CcV6zRHroiPWZUcsT32dd8R60xHrnCPWaUcszzxecsTylOtVRyzP+uhZjmcdsTzr0FVHLM9y9LTVtx2xPO3riiPWO45YnnY/qT7HM4/vOmI1HLG+5IjlqS/PvomnfU1qv9DT7ie1L3fGEeuCI9ZHoS83qXbv2TfZadNGw5rUvtyk+sIrjlievtCzHD31Nan9r1VHrEntf73uiOVZtz3rkKe+PNshzzo0qbr39F+e83KTOjfkaV+efd9J7WNOYtsR/+Y1K4+2Y18CNv4OrQ0rPjkhs1pTxj0rGZ9lKBv+gYzwLd9qzxHmyfiHznXwX8PiOOO1VecuVN5Ca9Fqr1AIa/+IWBmf7yiH6hnqurd/OiCryseCo05mHbHmCGtWYKn12zT6Qnrle7aobJdylFeUFW3V+F8Hebh65ey5s1feeaS1evXMUxfORBSmSR2mvpeIzo54TUWDal9IwIro+SV6Nw14GPZF2kyUnMaX34XcfNL26wjo5kU+vYsU+Vk+IpLV+OeFTrJwm3Mp9Wq6WxCyFiguDp/vbEyHfFjn2WwfW1pJq3Pjn48ytYFSqMuC+mGdqyPLhWjQ1bU7fTqOC7lGhfWGI9Z5R6yrjlinHbFedcS65Ij1piPWNUesK45YZxyxPMvRU1+etnrWEcvTVl9zxJpUP+FZHz11P6m2+pYjlqdNeNqqp74uO2J5+mjPPsDbjliebYdnHZpU+/oo+K8s2iF1PQ0e///FmzfytGPHeIwEj01NQTzS33Wkj/nLN2/knQPe9nue8HKR6xgs9bVXxj9PsvrK0x+DTZE8rB8eg00LWQsUF4dWp0/HcdPiXQjrkiPWW45YbzpinXXEOu2I9bYj1hlHrAuOWOcdsSa1HD1t1bM+esr1qiPWa45YVx2xPG3idUcsT5u44ojlqS9P/+Up1zVHLM9y9JRrUtsOz3L01L1n3fbM47uOWA1HrC85Yn0U2m3Pup1FW2trqTiesyPt+yhd/JuvesPrrhAD41C+mYB8mH4mIR3nI+N12JLh784Gv7ctY5fQFeaJr/1Sa9L817A4znht1ZqxyltoLR6vSePtGwpr14hY8yIuizINrZUj/4WArCofM6QTVc9yQif2fndALqTfJ3hbWtMhXqfnqMPglhasi8Z/jC0tpr4HiO54p68ONsVdCVgRPT9A76aj8JYWrKZcbFytk4q5kJA+DgsBPuomQsvfnkg3FXzTopommwrIuFvIsS8g/2b5pNGrmjqNA38J0+gf6k6d4q1m04IfYrGOI6C1KsVN3bHuc3G8UM4RP5M3InmNfz7S9nDMR55SyH2pslRu0tIqN8l1c5ymw/Sj6ilvQxu1nqptbPMiD466r7EuMahbVHlLHLp9tA8O0/SMeYrxv3W0j8t0LA/qnJuhSdET+1n88gDfgo9+wb6QsBkd/tYIOgz5bqNXX26Ig93cy37QbizMtiyWGuo2Ya4vsxnxTus7Qzf3sl/luGOblHV1pdleW11qV9pL7dVmq9f9TLsFNuQf1TbDbIdES3V1Ayd2leMwA3GzFDcLcSZj/Pca2Wk23f+lehr9I/+CoOfb7tKW5YFI9yHi0LtZswNYwCcOu7rPM5AO6XEZGembsIzcppuQZwW/mO5qgC6X8Pc9DPFuprPx3XxnkH66M0jf28rbGZTR4vZAHNpWHK7rPqO+EMvkmCX6S928W5nshjSWviD47yb+G+QW77ht3iPo9wj6uHxe78po7RTm3bsf+B5Pwsd3LJvZjt1mHoddIm9Y5ia/lSvqnMsc7WcG5IqD6RfLHLFMjlmi71CZY94sfUHwR70wL8Wfy1zVhXlBH+v1HdCr+5fo2rXGcrtWrC41K62l5pZ/CbC1Wlmpra6sVYvN4kpppbyZW39V3yOtj+J+P2J9rvP+36yPlai2L/LDL6U5MpNNv6HdTttHM/5bNf2Zdrot2ym1dis+/aXmhtQ0M8uxi2TMZySj6vvh1HccZiDO5IhpyrdslDGbeYt2K9s62m7yFrI44Na/nznS54tlg/NXaPfYZ0P6vwl9tp+DtslwLb35KZwDVHMw9mzlNSVoeU6F++BKr0hvNjmXkNc5yqvR/yLM1X3tkMZE/aFcUwmYvyzm/wwTx/Zpxl57BD3WMZNnXzRYN/dQOpQd5x/4nSqfHNFyG2ztFKZLep4XOEky7BY43E4yJvNke4iDzeGrbZmWFusUtvkZz8dWVVtpQX3BJ0dxmPcXOn06Dmr+yPIU5/eHaRyGdCyPqmuefSN7Pwvvme800c4RrZpPHXfZFGVU87Z8XHVXQP4c4YS+GMX1Uf1NK29OyKvamnH5INaLnff/ZttmllbVugq2mb+Tos1UfSJuM78NbeY/S9lmWhz3e+PwUqf/jtsE7gciRhyOdzbSm4+dA3yk2U15Mvr/UbSNyscYVoz/+6RPxA61Q7NE/5egzz8kfaK+TJ+q/Utqs7i9joO1X6yDPwU5/vhIMi/T60IgjzHG/3JE06EMSMcYm20XVf+M63aa/hnXZUyneMxS3LjlMxWF+xBmY3uGxGP/JU1fKC/ym/S8JwFb4aotFKodmae4nIhjH4b5Rf/HfR/0L9j3+Z1AvUsqO2WfuwOy5wlTjYl3BWRX+kM/5D1XVKwXS8W1WrXdLjWXG6uVLZ+rqpRX26X2+nxVuV0s10tbzb/aKC61KqXV1Wqp1VhZaY8yV2Z2NEey2G8sT3yPfShbd+T290B3rTPjbXnFA0Kf7P9C41TMn1pLez4hfx/v5m9u/d+NR4fzU744R3GhPTboU7iM0E+nyYPR39KVG8fFoTW9jL+qV1Ff1cO2YrazMd+hsXgcuJ8W+voZ6qxA9Oz78RmxUOfc50M/ruZPDI/t7F4oI/4qpvLbat6Q/f204Bvqq8RyPkL1OaN5b7d9HKgDtiXUAX8BjHXAQY3RTRexXI+m2OOh/AT7AjWvFepvq3qL22jjMANxWddb7GdxvVX9P6S3ulOIBsuN7VX1u1QdSOovK35Y/tiHsTqQtOaEPgHHtE8c7eNhuaC/xrTsr43+i9DmnKA2B/0T24vyMyxLFIX3koTmUtJcBZbRFu5qjvhZPvAd8t+qq8DSbqXPuH9UMXnmhTyqnOO1p73RYJmp9SacR3yu8/7f0JV/oTFvyLepus5+QM0JqfYuNDY33rh+kqbvqOox13OkX4N6/G6g75jmOIAqw1CZq72iqlx4nkK1uSF/vjsg17A1lNAcBX+pk9crQnkI2Z3qX29jm1pVbSrmndvUtF/2NXp1VaHq7xaIHnWu6iX3NZHvHopLWy+xH/puQluK+UA/y/MTqn5iG43teo5kQR44f/O9nY30s4Cr5qzxChik/0HR12dM8zVx+GJnEJNlxveoFx63G91fBxke667Tb99+3mIzR/yiKAru580LfWTRvqvxnzoymfF4aS1UD1S/T83TcVs9bI2A1/HU3KKlx3c/2bUtPrcRB95Hm/YMSCzLV45uzFtWa4fYLqD/igP293+afJS68gnTmv/guviz0E/4GeonKNvfE4V9ltprwvaTtF+DfZbR/0LAZ6lxDsr1xY7G/KqYlwrZhSo/tmWkV3tiVP+L5xGVL1V9BKPLuI/QVH0E1A/3EYbN5Y/afzT7KBA96lHVI54DDdlqHEJ7Qywt1jv3Of5SqdRerqzWl9eWiu3m2lbP8S9Xlkv1eqO+trzWXqmsrY4yxx/ScU7oeF9Ax2n7Q4yVC2DNDsE6SVhJdZDTbVH/pJIjfpaPKAr3T7LZ8xjun6B+eG5U9RUKIo7HwKPOH6k5Tw8sbpsRO6luqDE76iiKdH8HdftsZyPf0H7qjObAUtvgpF4noeb1eTyIbRf3FVW7puYftgpLtcVsCxnN96WeD+W99RnZZmnUvodax+E5BeyXcPmpPsu84PNBwUL/E5pnT1Puik9ojJjVOCrpOhUPPohlYzL2Lx58EOtl4jMjZIj1/G9oXKj2s2NaXgcy+ttu6WP+P0c30pjs/xbGjrvovAXm2bGur6i1PwtqDZbtGtdg2RZxbpLtB+cm+folvLIZ98RzmKZn1FOM+STMhTGdBdS16vsm3cHCfWILPEdn9NdRefKe62Pd5+KYQe2tMV4fJVvajL38YAp7UTYyR3FTIh9qjMb9JdXPVr44yX8ivvJ5dsdEjmijaPQxoaXF+auQb0Rs9o13gG8s3rJRRrVOpXy8vR+2ThXa62xpsz2HV1xVa0MWlL1zPUF753qyF+K4nuCXCNnnFiAOdcJB1SE8J5jW53I5q74Wtqs8n5S01vRvYM/Te+86fTrHMux9Qm6205fZdDPT6cs9B3LHAc+SG53JOp+NrEWT1c7K43oUnlW3vEwRPf/ms/ePQlliHtFPhM7Qq3sT8G4Bk1Gd7d/TGQ1rN2HtGgPL5FJ3SezapFwKa46wRrlzoNYtm0z2UTfb7ZVWrVlsrK2utNoTs4/5Weprfdj2Mb8G7eWpW4bzm8R9zJ/tyr2zj3mjziZpH3MLymg79zF/merzzj7mPg3uYx5l/LKzj1nP6U3qPuYvQzs+yj7mv0b97M3uY/4ZaHN+hNqcnX3MG/OB75D/zj7mcDnv7GPOfh/zz0M9/mag77izj3mjLJyWeQ/Lw84+5j79B3Uf8zcT2lLMx2b2MVsb/f8D/0e/RsS6BAA=",
2282
+ "debug_symbols": "tb3Rjiy5cbX7LnOti2KQEST1KoZhyLJsCBhIhiwf4MDwu//FyIz4qlsudnZVz432p5nZazFJRlQmM5L8n1/+7U//+t//8S9//su///W/fvn9P/3PL//6tz//+uuf/+Nffv3rH//w9z//9S/3f/o/v9zW//T7/9bf/dLLL7/X+x/yy+/7/Y/6y+/n/Y/2y+9Luf+p9z/Xf2Tnn/38c5x/zuPPcTv/LOefcv5Zzz/b+eepN069ceqNU2+cevPUm6fePPXmqTdPvXnqzVNvnnrz1JunXrndAkqABNSAFqABFtADRkAol1AuoVxCuYRyCeUSyiWUSyiXUC6hLKEsoSyhLKEsoSyhLKEsoSyhLKFcQ7mGcg3lGso1lGso11CuS7kvGAHzhHYLKAESUANagAZYQCi3UG5LedxBbwElQAJqQAu4K0tZcFcWXdADRsA8wW4BJeCuLHNBDWgBGnBXrrcFPWAELOXVUSvEDigBd+VqC2pAC9AAC+gBI2CesALugBIQyiOURyiPUF5hV1f/rLg7YATME1boHVACJKAGtAANCOUZyjOU56kst1tACZCAGtACNMACesAICOUSyiWUSyiXUF4x2G4LNMACesAImCesGDygBEhADQhlCWUJZQllCWUJ5RrKNZRrKNdQrqFcQ7mGcg3lGso1lFsot1BuodxCuYVyC+UWyi2UWyi3UNZQ1lDWUNZQ1lDWUNZQ1lDWUNZQtlC2ULZQtlC2ULZQtlC2ULZQtlDuodxDuYdyD+UVg60u0AAL6AEjYJ6wYvCAEiABNSCURyiPUB6hvGKw2YJ5worBA9aPc1kgATWgBWiABfSAETAPqCsGDygBElADWsCZN+rNAnrACDgzUi23gBIgATWgBYRyCeUSyiWUVwxqu8OKwQNKgATUgBagARbQA0ZAKNdQrqFcQ7mG8opB1QUaYAE9YATME1YMHlACJKAGhHIL5RbKLZRXDOpYME9YMXjAXdlkgQTUgBagARbQA0bAPGHF4AGhbKFsoWyhbKFsoWyhbKFsodxDuYdyD+Ueyj2Ueyj3UO6h3EO5h/II5RHKI5RHKI9QHqE8QnmE8gjlEcozlGcoz1CeoTxDeYbyDOUZyjOU56ncbreAEiABNaAFaIAF9IAREMollEsol1AuoVxCuYRyCeUSyiWUSyhLKEsoSyhLKEsoSyhLKEsoSyhLKNdQrqFcQ7mGcg3lGso1lGso11CuodxCuYVyC+UWyi2UWyi3UG6h3EK5hbKGcsRgixhsEYMtYrB5DLYFFtADRsA8wWPQoQRIQA1oAaFsoWyhbKFsodxDuYdyD+Ueyj2Ueyj3UO6h3EO5h/II5RHKI5RHKI9QHqE8QnmE8gjlEcozlGcoz1CeoTxDeYbyDOUZyjOU56mst1tACZCAGtACNMACesAICOUSyiWUSyiXUC6hXEK5hHIJ5RLKJZQllCWUJZQllCWUJZQllCWUJZQllGso11CuoVxDuYZyDeUayjWUayjXUG6h3EK5hXIL5RbKLZRbKLdQbqHcQllDWUNZQ1lDWUM5YlAjBjViUCMGNWJQIwY1YlAjBjViUCMGNWJQIwY1YlAjBjViUCMGNWJQIwY1YlAjBjViUCMGNWJQIwY1YlAjBjViUD0G+4Ia0AI0wAJ6wAiYJ3gMOpSAUJ6hPEN5hvIM5RnKM5TnqWy3W0AJkIAa0AI0wAJ6wFIeC+YJHoMOd+V+WyABNaAFaIAF9IARME9YMXhAKEsoSyhLKEsoSyhLKEsoSyjXUK6hXEO5hnIN5RrKNZRrKNdQrqHcQnnFYK8LJKAGLGVdoAEW0ANGwDxhxeABJUACakAoayhrKGsorxjsa7xWDDqsGDygBEhADWgBGmABPSCULZR7KPdQ9qXPuaAGtAANsIAeMALmCSsGDygBoTxCeYTyCOURyiOURyiPUJ6hPEN5hvIM5RnKM5RnKM9QnqE8T+V+uwWUAAmoAS1AAyygB4yAUC6hXEK5hHIJ5RLKJZRLKJdQLqFcQllCWUJZQllCWUJZQllCWUJZQllCuYZyDeUayjWUayjXUK6hXEO5hnIN5RbKLZRbKLdQbqHcQrmFcgvlFsotlDWUNZQ1lDWUNZQ1lDWUNZQ1lDWULZQtlC2ULZQtlC2ULZQtlC2UVwyO9VZhxeABJUACakAL0AAL6AEjIJRHKI9QHqE8QnmE8gjlEcojlEcoj1CeoTxDeYbyDOUZyjOUZyjPUJ6hPE/lcbsFlAAJqAEtQAMsoAeMgFAuoVxCuYRyCeUSyiWUSyiXUC6hXEJZQllCWUJZQllCWUJZQllCWUJZQrmGcg3lGso1lGso11CuoVxDuYZyDeUWyi2UWyi3UG6h3EK5hXIL5RbKLZQ1lDWUNZQ1lDWUNZQ1lDWUNZQ1lC2ULZQtlC2ULZQtlC2ULZQtlCMGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRExOCIGR8TgiBgcEYMjYnBEDI6IwRkxOCMGZ8TgjBicEYMzYnBGDM6IwRkxOCMGZ8TgjBicEYMzYnBGDM6IwRkxOCMGZ8TgjBicEYMzYnBGDM6IwRkxOCMGZ8TgjBicEYMzYnBGDM6IwRkxOCMGZ8Tg9BhsCyygB4yAeYLHoEMJkIAa0AJCuYVyC+UWyh6Dut4E3wJKgATUgBagARbQA0ZAKFsoWyhbKFsoWyhbKFsoWyhbKFso91DuodxDuYdyD+Ueyj2Ueyj3UO6hPEJ5hPII5RHKI5RHKI9QHqE8QnmE8gzlGcozlGcoz1CeoTxDeYbyDOV5Kt/f0d+SSpIk1aSWpEmW1JOWxXSaQR6OB909pjhJUk1qSZpkST1pJM2gFZgnpYekh6SHpIekh6SHpIekh6RHTY+aHjU9anrU9KjpUdOjpkdNj5oeLT1aerT0aOnR0qOlR0uPlh4tPVp6aHpoemh6aHpoemh6aHpoemh6aHpYelh6WHpYelh6WHpYelh6WHpYevT06OnR06OnR0+Pnh49PXp69PTo6THSY6THSI+RHiM9RnqM9BjpMdJjpMdMj5keMz1mesz0mOkx02Omx0yPGR5ejHNSSZKkmtSSNMmSetJISo+SHhnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnJeO8ZJyXjPOScV4yzkvGeck4LxnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeScS4Z55JxLhnnknEuGeeSce61Q7M5WVJPGkkzyOP8oJIkSTWpJaXHSI+RHiM9RnrM9JjpMdNjpsdMj5keMz1mesz0mOHhRUUnlSRJqkktSZMsqSeNpPQo6VHSo6RHSY+SHiU9SnqU9CjpUdJD0kPSQ9JD0kPSQ9JD0kPSQ9JD0qOmR02Pmh41PWp61PSo6VHTo6ZHTY+WHi09Wnq09Gjp0dKjpUdLj5YeLT00PTQ9ND00PTQ9ND00PTQ9ND00PSw9LD0sPSw9LD0sPTzO1aknjaQZ5HF+UEmSpJrUkjQpPXp69PTo6THSY6THSI+RHiM9RnqM9BjpMdJjpMdMj5keMz1mesz0mOkx02Omx0yPGR5euHRSSZKkmtSSNMmSetJISo+SHiU9SnqU9CjpUdKjpEdJj5IeJT0kPSQ9JD0kPSQ9JD0kPSQ9JD0kPWp61PSo6VHTo6ZHTY+aHjU9anrU9Gjp4XE+nSSpJt097g9Yjgoa2MEBzkQvvj+xgAJWEDfFTXFT3BQ3xc1wM9wMN8PNcDPcDDfDzXAz3DpuHbeOW8et49Zx67h13DpuHbeB28Bt4DZwG7gN3AZuA7eB28Bt4jZxm7hN3CZuE7eJ28Rt4jbTzYuqAgsoYAUbqKCBHRwgbgW3glvBreBWcCu4FdwKbgW3gpvgJrgJboKb4Ca4CW6Cm+AmuFXcKm4Vt4pbxa3iVnGruFXcKm4Nt4Zbw63hRi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcouUTJJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXNLJJZ1c0sklnVzSySWdXNLJJZ1c0sklnVzSySWdXNLJJZ1c0sklnVzSySWdXNLJJZ1c0sklnVzSySWdXNLJJZ1c0sklnVzSySWdXNLJJZ1c0sklnVzSySWdXNLJJf3IJeo4wJl45JIDCyhgBRuooIG4NdwaborbkUuOj3IFrGADFTSwgwOciUcuORA3w81wM9wMN8PNcDPcDLeOW8et49Zx67h13DpuHbeOW8dt4DZwG7gN3AZuA7eB28Bt4DZwm7hN3CZuE7eJ28Rt4jZxm7jNdBu3G1hAASvYQAUN7OAAcSu4Fdw8l5SbYwUbuNyKOBrYwQHORM8lJxZQwAo2EDfBTXAT3AS3ilvFreJWcau4VdwqbhW3ilvFreHWcGu4Ndwabg23hlvDreHWcFPcFDfFTXFT3BQ3xU1xU9wUN8PNcDPcDDfDzXAz3Aw3w81w67h13DpuHbeOW8et49Zx67h13AZuA7eB28Bt4DZwG7gN3AZuA7eJ28Rt4jZxm7hN3CZuE7eJ20w3LzoMLKCAFWygggZ2cIC4FdwKbgW3glvBjVwyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklk1wyySWTXDLJJZNcMsklM3OJ3DKXyC1zidwyl8gtc4ncMpfILXOJ3DKXyC1zidwyl8jthlvBreBWcCu4FdwKbgW3glvBreAmuAlugpvgJrgJboKb4Ca4CW4Vt4pbxa3iVnGruFXcKm4Vt4pbw63h1nBruDXcGm4Nt4Zbw63hprgpboqb4qa4KW6Km+KmuCluhpvhZrgZboab4Wa4GW6Gm+HWceu4ddw6bh23jlvHrePWceu4DdwGbgO3gduRS9RRQQM7OMCZeOSSAwsoYAVxO3JJcTSwgwOcgcdmaScWUMAKNlBBAzs4QNwKbgW3glvBreBWcCu4FdwKbgU3wU1wE9wEN8FNcBPcBDfBTXCruFXcKm4Vt4pbxa3iVnGruFXcGm4Nt4Zbw63h1nBruDXcPJes7cvk2I7tQM8lJy438V22PJecWMEGKmhgBwc4Ez2XnIib4Wa4GW6eS2pzNLAnrmg5LuLYS1AdVxNqd5yBcuwheGABBaxgAxU0sIMDxK3gVnAruBXcCm4Ft4Jbwa3gVnAT3AQ3wU1wE9wEN8FNcBPcBLeKW8Wt4lZxq7hV3CpuFbeKW8Wt4dZwa7g13BpuDbeGW8Ot4dZwU9w8LM6d4QSsYAMVNHC5teY4wJnoYXGiu6mjgO42HBuooIEdHOBM9J/YEwsoIG4dt45bx81/Ytt0HOBM9J/YEwso4HLz/c28RDJQweWm3jv+E3viAGei/8SeWMDlpt5e/4k9sYEKupu3zH9iTxyBXhN5T5COS8yOfQDXX7Pjn66/Zuo4wJnoSeHEAgrouu7mSeFEBQ1cbv3YgnCAy23tCSFeDxlYQAEr2MDl1rujgR0coLut7vPKyEB380Z6Ujixgg1cbsONPSmc2MEBzkRPCicut+HN8aRwYgUb6G7eSE8KJ3bQ3YrjTDw2Lz1QQVfwq/CQnj4JPI6Pf+pxPL2RHscnNlBBA1dzprfX4/jEmehxfGIBBby73X/kHBuooIF9oTd9xXHgTFxxfP9tdCyggO7m83e4mzm6m3fqMLCDA5yJ8wYut+IWK44DK9hABQ3s4ABnoJdEBhZQwAo2UEEDO+hu3XEmlhtYQAEr6LrTsYMDnIlyA0viisL7jYGjgMti7a0rXld4/113VNDADg5wJq64CCyggBXETXFT3BQ3xU1xM9x8Y1+/7/NawfsvuKMrqOMAZ6Jv6CvmWEABK9hABQ3s4ABn4sBt4DZwG7gN3AZuAzcPEfGp4cHg98ftCAb/D45gOFBBAzs4QNddE8br/wJXe+uxZ6yAFVy6tTguhbqGxWv6An0iqqMrVMcKNlBB122OHRygu7muT/sTC4ib4Ca4CW5iYI6m1/QF5mh6TV9gAQWsYAMVNBC3ilvFreHWcGu4NdyOiO2OM6aG1+kdY+x1eoECVrCBClrOhyM2Dxw5CTw2D/TYPLHm1PDYPOaDx+aJI6fGsdW2D8Cx2faBBWQ0PTaPSeCxeaKClpPAY/PEAeI2cBu4DdxGzh07gqE7ClhBb850VNDADg5wJh6Bc2ABBawgbgU3Dxzfj9gL2AIHOBM9cE4s4HJrfkEeOCc2UEF3G44dHKC7ecs8cE4s4HLTY4PoCjZQweXmjwReqiZ+D+6laoEFFNB1m6PrqqPrmqOBHRygu/kVezidWEAB3c2vzWPIvL0eQ/504PVpYt4cjyE7/tpM9Bg6sYACVrCB7ua97vF24nLrbuzxduJM9Hg7sYACLrfu/eDxdqKCBrqbN8fj7cSZ6PHmTwdenxYo4HIbxx7gy214G/y38EQDOzjAmeg3kf504PVpgQJWsIEKGtjBAc5Ar08LLKCAFWygu6mjgR30WTIdZ6KnihMLKGAF3W04KmhgBwc4Ez1VnFhAASuIm+AmuAlunhT8Kckr0QIFrGADFTSwgwOciQ23hlvDreHWcGu4Ndwabg23hpviprgpboqb4qa4KW6Km+KmuBluhpvhZrgZboab4Wa4GW6GW8et49Zx67h13DpuHbeOW8et4zZwG7gN3AZuA7eB28Bt4DZwG7hN3CZuE7eJ28Rt4jZxm7hN3Ga6jdsNLKCAFWygggZ2cIC4FdwKbgW3glvBreBWcCu4FdwKboKb4Ca4CW6Cm+AmuAlugpvgRi4Z5JJBLhnkkkEuGeSSQS4Z5JJBLhnkkkEu8Uq0+8Kjo4AVbKCCBrqFOc7EI4EcWEABK9hABQ3sIG6Km+FmuBluhpvhZrgZboab4Wa4ddw6bh23jlvHrePWceu4ddw6bgO3gdvAbeA2cBu4DdwGbgO3gdvEbeI2cZu4TdwmbhO3idvEbabbvN3AAgpYwQYqaGAHB4hbwa3gVnAruBXcCm4Ft4Jbwa3gJrgJboKb4Ca4CW6Cm+AmuAluFbeKW8Wt4lZxq7hV3CpuFbeKW8Ot4dZwa7g13BpuDbeGG7lkkksmucTLz8SXmL38LLCCnq6ao4IGdnCAM9FzyXQ3zyUnCuhu6thABQ3s4ADdbeVfLz8LLKC7DccKNlBBAzs41klgxXEm+pldJ5aF4ihgBRvYF3r/+tlcN+8oP53rRAFdwTvKz+g6UUFb2B07OMB5YvWSsrpW0quXlAUKWEHXnY5LYdWhVy8TCyyg969beMyf2EAFDezgAGeiuFtxLKCAFWygggZ2cIAzseJWcau4VdwqbhW36m7i6Lp1YbuBBRSwgg1U0MAODhA3xU1xU9wUN8VNcVPcFDfFTXEz3Aw3w81wM9wMN8PNcDPcDLeOW8et49Zx67h13DpuHbeOW8dt4DZwG7gN3AZuA7eB28Bt4DZwm7hN3CZuE7eJ28Rt4jZxm7jNdPOCsMACCljBBipoYAcHiFvBreBWcCu4FdwKbgW3glvBreAmuAlugpvgJrgJboKb4Ca4CW4Vt4pbxa3iVnGruFXcKm4VN3JJIZcUckkhlxRySTlySXN0t+5oYAcHOBOPXHJgAQWsYANxU9wUN8VNcTPcjlwyHAWsYAMVNNDd1HG5rfci1Xf9O9FzyYnLTdzYs4a4wpEfpuMAl8J6aVGPEztPLKCAFWzgau95MJ6BHRygu3nLPD+cWEB38/Z6fjixge7mTff8cGIHB7jcVplSPU72bOK4dNf7gHqc5XmiggYu3VW8VI8zPVfFUj1O9VxvCepxrud6H1CPkz1PFLCC7jYdFTSwg8vNjzj0wreq3hwP//N8wWWxlvCrF75V9b/m4X+iggZ2cIAz0cPfvM88/E+sMY282i1QQQM7OMCZ6DF/YgEFxK3h5jHv59R5tVtgB5ebeUd5zB/oMX9iAQWsYAMVNLCDuCluHvPmw+Ixf6KAFWyggsute697zJ84wJnoMd99lnjMnyjgcuveMs8E3eeO3z+c6G4+qz0/nOhu3hzPDwd6fjixgAJWsIEKGthB3AZuE7eJ28Rt4jZxm7hN3CZuE7eZbr5BYGABBaxgAxU0sIMDxK3gVnAruBXcCm4Ft4Jbwa3gVnAT3AQ3wU1w8wSy3mdVL5ILNLCD+TvkRXIn1htYQAEr2EAFDfSrWOFfj/zgxp4fVm1d9cK3QAUN7OAAZ6JngvVWrnrh29kPyhUrV+wxf+JM9Jhf9XLVK+MCBawgo2m4GaNpjKYxmsZodkbziHlvwxHzB1aQ0fSYP9rgMX9iB3Ej5isxX4n5SsxXYr4S83UwdwY9OejJQU8e53p7GyY9OelJYr4S85WYr8R8JeYrMV+J+Tpz3NoR8wcWUMAct3ac+n2ggunWiPlGzDdivhHzjZhvxHwj5lvJcWtFQQM7OEDvyfVb6PVygd6T1VHACjbQr83b4DF/YgcHOBM95k8soIDu5o30mD/RY/7mOCIKfffAOvxEYb9TOLGAAjJCjRFqjFAzsIMDzNnnpX7nACgjpIyQMkLaQAWZD8p8UObDkR+mo4AVXLrT+8Hzw/SWeX44sYMDnImeH04soIAVzPWddjwdHDjAmXisHhxYQAEr2EAFcRu4DdwGbhO3idvEbeI2cZu4TdwmbhO3mW56u4EFFLCCDVTQwA4OELeCW8Gt4FZwK7gV3ApuBbeCW8FNcBPcBDfBTXAT3AQ3wU1wE9wqbhW3ilvFreJWcWPNUStuFbeKW8Ot4dZwa7g13BpuDbeGW8Ot4aa4KW6Km+KmuCluipviprgpboab4Wa4GW6Gm+FmuBluhpvh1nHruHXcOm4dt44buUTJJUouUXKJkkuUXKLkEiWXKLlEySVKLlFyiZJLlFyi5BIllyi5RMklSi5RcomSS5RcouQSJZcYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXeNllnQcWUMAKNlBBAzs4wJk4cZu4TdwmbhO3idvEbeI2cZvp1o/3m9OxgO5WHSvYQAUN7OAA3W2t+njZZWAB3c0cK9hAd2uOBnbQx+3mmG9eu9zAAgpYwQYqaGBP9Kxx82vzrHGiX0V3rGADFTSwgwP0PvOx8KxxYgHvbvfHS8cKNtDdhqOBHfT33d59njUO1BtYQAEr2EAFDeyJKz+09d6/eoFloIB+FT4nrYEK2kLv6pUfAsfCw2Im9hvobj7PuoAVbKCCBnbQ3XxO9pk4bmABBaygf3fgF+SVUL7cdJRSVm+vV0Id6JVQJxZQwAo20L9n8PZOAzs4wPjUpR6llCcWUMAKNlBBA3tiyZH3oslAAXPkvWgyUMEceS+aDMyR96LJE+UG5sh70WRgBRuooIEdzJH3oskT6w0soIAVzJE/yiN95I/ySB+3ozzywHYDCyhgBRuYI3+UR57YwQEy8srIKyOvjLwy8srIKyOvjLwy8kfM+2UeMX+ggBX0sTj+moIGdtA/9vIrPj5LdDw+SzywgAJWsIEKGjjPT9OrVz82vxHw6sdAASvYQAXXVRSfBCvmAwc4E6e7eZfMAgrobt4Ps4EKLjdf8vLqxyYeZCvmm3jgrJg/0KsfAwsoYAWXm/eOVz8GGtjBAc5EzwQnFlDACuJWcCu4FdwKbp4JfGHfqx8DC7jc1id21asfAxuooIEdXG4eb179eKJnghML6G7qWMEGult3XG7+KtmrHwMHOBNXfggsoIAVbOBya8XRQHcTxwHORL2B7uZNVwEr2EAFDezgAN3NR8izxonu5r3jWePECjZQwf7LsYlN9ZLH5u/GveTxRL89OLGAAi4LfzfuJY+BChrYwQEuN/U2eAI5sYACuptfsSeQExV0N782TyAnDtDd1o2hl0c2z1xeHtnMm+MJ5MQKNlBBA33p+ne/tKMO8qCSJEk1qQV5BK/X5s1rGQMN9DfdTiNpBvnN+0ElSZJcsTqublhfBDavTGz+7z0cDypJ3uNONaklaZIl9SQ3OXAmehiai3sYniigN7M7uoL3jIfWgUdoObnAdBSwgg1U0KJLNLtTszs1u9OyOy2706Pn6ET/dT060UNmvfxvXkd4oofMeuPfvI4wcLW0+2iukFHvlRUxJ2mSJfWkEeRh0b0hHgDdG7ICQL2X1vw/qSetv+09uyb/QWvun1SSJKkmuYlb+7w/cY17957xH84TR6CX/bX1Hqx5gV9bb42bF/gFrnYe/2mPjvH6vsCZ6L+FJ7rsdBSwgi063Ov7Ag3EreBWcBPcBDfBTXAT3AQ3wU1wE9wEt4qbR9+Jck51L+87pq+X9wUqaGBP9N+p4U3wYDpxJnow3ZxKkiTVpJakSZbUk0bSDLL0sPSw9LD0sPSw9LD0sPTwaFtvRptX2p3o0XbislmfsjY/YjdwGQ2fdP4DdaKCBnZwgDPRf6BOLKCAuA3cBm4DN/+BGj5g/gN14kz0H6gTCyjgcpveOx6oJyro92VOPWkkzZO8Iu+kkuSKxXH95bUK1rzyrs3jP5iJHqMnFnC1dC1cNa+8C2ygggb6nb/TSHKvlTC8BC+wgO41HCvYwJUj14JP8xK8wJUlb26xIjRwJq4I1YNKkiTVpJakSa7o3bZ+9PTmvbJ+9HQ9dzevrQtsoILeUr/A1sEBzsQV04HLzQVWUJ9Uk5aVN2UF9UmW1JNG0gwyN+mOBRRQQW+md77NxBWw6n2y4vUkSfIO9aHxH8cTFVwNLcd/28FlVbyFK1pPHD52fs3DB8+n1/DR834a7jYdG6iggR0c4Ez0n9QT/cq8vf6jKj4d/FdVvL0rWlW8kSswVbyRKzIDZ6BXwwUWUMAKupg6DnAmlhtYQAEr6GKro7xqTdcyTPOqtUABK3i/Nr8/8qK1kyypJ42kGbSi7aSSJEk1KT1qetT0qOlR06OmR0uPlh4tPVp6tPRo6dHSo6XHCja/TffqtZNqUkvSJEvqSSNpBq1gOyk9LD0sPSw9LD0sPSw9LD0sPXp69PTo6dHTo6eHx9ram6d5bdqJHmsnrhlSvW881tZiQPPaNK0+sTyq/MbaK8vUn4K8sswfALyw7KSWpEmW1JNG0jzJK8pOcpPpKGAFG6iggR0c4Ez0uPL7FC8oCxRw6fpvmReJ6VokaF4k5k8NXiN2UkmSpJrUkjTJknqSm1THmei/Zif670FzXBfqT29+gqz6Q6BXgQXOxHYDCyhgBRuooIG4Ndwabv6b1nwQj9+0AwWsYAMVNLCDA5yJhpvhZrgZboab4Wbu5jPCOjjAmeg/hCcW0B8JfQiP5z+fMivm/KnPi8AOWhF30poxPp9WvJ1Uk1qSJlnSapD/tntBl/otghd0BTbQH1J9nkwDOzjAGegFXYEFFLCCDVTQQHfrjgOciR6Ja4GneUFX4HJbaz3NC7p0Ldo0L+hSf6z3gq5AA5ebr2B4QVfgcvNlCy/oUs8yXtDlj8dez3VSTWpJmmRJrrjSoJdnqT/GeXmW+pOkl2cFKrha6uPo5VmBA5yJHrgnuq5foAejLyJ4yZUezfFgPHEmejCeWEABK9hABd3NO86D8cQBupt3pwfjiQUU0N28zzwYT1Rwde9BPWkkrUByoRWIJ5UkSapJLclNfIz8fvTEDo5E/zU8cTVz+CQ8VmwO9CUbH89jzebAAd5betC6xTypJElSTWpJmmRJPWkkhYeXTJ1UkiSpJrUkTbKknjSS0qOkR0kPj9BVJN28TCqwgd5lzdHADnqXmeNM9Aj1x2UvkwoUsIINXG7+EO1lUoHLzZ+JvUxK/ZnYy6TUH3m9TCqwgMtteiM9pk9s4OrCgyypJ42kGbTC+SRXVEdvqV+2R/OqkGhe9BQ4Ez2aT/SW+mV7NJ9YwQYquJrqvn4b68/LXvNk/qDrNU8n+p3szf/bFbZHa/NEwnacY1pc4DiX48ACrptDf4D0gqXABipoYAcHOBPHDSwgbgO3gdvAbbibd8jo4ABn4ryBBazZD3ngYLM8cLAdh5f64+9xeOmJA1wWjl6lFFhAASvYwHVB/iztVUqB64J8ALxKKXAm5sE+refBPq3nwT6t58E+refBPq3nwT6t58E+refBPq3nwT6t58E+rQtugpvgJrgJboKb4Ca4CW6CW8XNH0Z9TcFrlwIr6D3ZHBU0sIPek+roPbnG+Di89Pinx2EcBwrobt2xgQoa2MEBzkS9gQUUEDfFTXE7DvbxCzoO9jlwgDPxONjnwAIKWMEGKoib4ebPs+tVfvOKphP9ifbEAgpYwQYqaGAH3W06zkRPICdW0J++PUQ8Kfiqj9cuBc5ETwon+iO4zyh/Gj6xgg1U0MAODnAGeu1SYAEFrGADFTTQ3ZrjAN1tzWqvaAosoLt1xwo2UEEDOzjAmSjuNhwLKGAFl5uvTHhFU6CBHRzgcqt+8b5WdWIBBaxgA93N2+v54cQODtDdvL2+anViAX3dylt2LFwVxwb60pU4GuiLV94czw8nzkTPDycWUMAKNlBBA3FT3BQ3w81wM9wMN8PNcDPcDDfDzXDruHXcOm4dt45bx63j1nHruHXcBm4Dt4HbwG3gNnAbuA3cBm6eS3wlx2uiAgso4Mq09cAGKmhgBwc4A48DSU8soF+FOnp7zXGA3t41wb3OKbCAAlawgQq67goGr106usRrl44r9tqlwAYq6P07HTs4wJlYczRnxa0KWMEGKmhgzzYc69QH5mjOdgNLtuGI+QMriFvDreFGzE9ifhLzk5ifmnNnKj2p9KTSk0fMexuUnlR6kpifxPwk5icxP4n5ScxPYn4S8/OIeW+D0ZNGTxo92elJj3lfYPMypsDl5mttXsYUqKCBy00PsQHORI/5EwsoYAUb6G4eOB7zJzLBPdC9asJrlwILKCBTw28aTmSwJoM1GazJtJ8x7dVLmrzX1WuaAgWsYAMVNLCDI9HDf63gqW/4FlhB76jh6B3lLfPbgxM7OMCZ6LcHJxZQwAr6LeCBHRzg0l2riOoVVIFL1/yCPCmcWMF1Feu9kXoZVaCBy20tM6pXUgXORE8KJxZQwAo2UEEDcVvhPw8qSZK0ntr9wlfon6RJrmiOHRzgTPTAP7GA3n4faA/8Exvoj8PiaGAHBzgTfTXhxAIKWMEG4tZx67h13DpuA7eB28Bt4DZwG7gN3PzH3nzCew44cSYeqwk+747VhAN97eLmWMEG+tqFj6rngBP9XdrxHwzQ36Yt3XK8TjuwgH5t6ljBBipoYE/0W4C1Lq1eyGVrXVq9kMvWurR6IVeggR309prjTPRoP7GAArrbdGygggZ2cIDLbXh7PQecWEABl9vw9noOOFHB5Ta8ZZ4D1q4M6hu1BbrbGnnfqC3Q3bw5ngNOrGADFTSwgwOciX5jcCJuipviprgpboqb4qa4KW6Gm+FmuBluhpvhZrgZboab4dZx67h13DpuHbeOW8et49Zx8xuDtXysXj4WWEABVwyJD6znhxMVNLCDA5yJfkThiQVcVzE9eD3mp4eex/yJ3t41ab0sLLCAAlawgQq67prgXhh2dIkXhh1X7IVhgQ1UcPWv/wh5YVjgAGei5Gh6aViggBVsoIIGdnBkcyRH00vDAgvItXnMr+V49fKwQL+27mhgBwfo9QEu1m5gAQWsYAMVNNDrBIrjSPRAPwZL3UIcBaxgAzUHQBksZbCUwVIGywP9xAIyWAS6EOhCoAuBLgS6EOhCoAuB7jVm/ebT01/pnaigd5T3Q/eO8pb5O/gTZ6K/hT+xgAJWsIEKuq5PjTET5w0soOv61JgVbKCC/vPlF3T8uB84wBlYjx/3AwsoYAUb2I83QOrVZifNIH/LN51KkiR5+4djAxU0sIMDXE6rW7w87aSS5F3lVkf1zIENXLev4mRJPWkkzaAV8CeVJEmqSS0pPWp61PSo6VHTo6VHS4+WHi09Wnq09PAAX+9z1MvTAge45lfx/3bFeuCaX2tFXb2CLbCCq9OKj+mK9UADOzjAmWg3sIDu5qNlFWyggu7m4+5v808c4Ez0F/onupuPt7/SP7GCqx/9KlcCOMmSetJImkEr9k8qSZJUk9JjpMdIj5EeIz1Gesz0mOkx08OTgPjYehIQD0tPAica2MEBzkAvmAssoIAVbKCCBnbQ3ZrjTCw3sIACVtDd1NF115Rox/cZTpK0/tJaqtejUu5EBQ3s4AC9wMpt6w0soIDu5u2qDVTQ3by1tYMDdDdvuv/An1hAAd1tOC635u31SF+L/eo1dIEz0SP9xKW7XgGo19B1X3rxGrrevL0e6c1b5pF+ooEddDdvmUf6gR7pJxbQ3aajF0J5czy81Zvj4a3eqR7eevy1Ac5ED+8TCyhgBd3N+8x/4E9cFubd57/qJ85E/1X3JZ2juO5EASvYQAUN7OAAZ+LEbeLmv/W+KOTleIENVNDADrqbX7GHuaOX4wUW0N2mYwUbuNz8od/L8bo/sns5XuBy8/sCL8c70cPcn9O9HC9QwAo2UEEDOzjAmSi4CW6Cm+AmuAlugpvgJrgJbhW3ilvFreJWcau4VdwqbhW3ilvDreHWcGu4Ndwabg23hlvDreGmuCluipviprgpbp41Vt2ferFf8R8DL/YLnIleIXBiAQV0XXP0nxPXPWr4VqCfRXwHFlDACjZQQe8HD4bBFXvMH1fhMX9iAxX0K/Zo8Zg/cYAzcdK/E7dJ/076d9K/k/6djKbH/NEGj/kTZ6AX9QWWaIOX9QVWMN3spqCBHRxgzh0j5u2IeTcuAlawgZptKAZ2EDdi3oh5I+aNmDdi3oh5kxw3EwM7OMAcNzti/kB6kpg3Yt6IeSPmjZg3Yt6IeSPmrTFujZ5s9GSjJxs96TG/qkvVSwIDvQq2OA5wJnrMn7jcfGHSSwIDK9hABQ3s4ADdzRvpdwonelVQd2wRhb7jWfeHOTtKeQ/s4AAZoc4IdUaoM9c7c/3IBAcy+zoj1Bmhzgh1Rmgw+8gaNpgPg/kwmA+eH3xd10sFA2ei5wdf4vVSwe4Pzb63WWAFG6iggR0c4Az0+sDui1ZeHxjYQAWXri8gen1g4ABnohfj+7KX1wcGCljBBipoYE/0mPeHXq8EDBSwgg1U0Nu7flu8uq/785RX93VfiPLqvsAGuoK3weP4RO+H7jjAmehxvL5DVa/uCxSwgg1U0EB383HzOD5xJnocn1hAAetZfa5ex3f2g0fsifTOitjhq4ZexxdYQAEruMrDfVnR6/gCDezgWjzypTev4zux30B38wHoAlbQ3XwsuoIGupuPfHc3H5bubt6pw928d0YBBfQqd7+2YWAHB+iV7n5tHrHH5PKIPbGBCvZAL9PzTzTUy/QCBaznhxvqZXqBChrYwQHORA/TEwvoFf7iqKCBHfSL95b5styBvi53YgHjCxf1grzABipoYAcHOBO99v5E/6LI3bzK/kS/Cr82L7M/sYMD9KtYk8tL7wILKGAFG+jfL7mY1+Wf2MEBzkSvyz+xgAJWsIF+FeY4wJnowXuiX0V3FLCCDfSrKI4GdnCAM9E/bjuxgAL6WAxHAzvoV+Gj6WF6oIfpiQUUsIKrd3yJw8vpAg3s4ABnon9b48trXiI3xJvuX9Kc2EFX8JH3b98cvUQusIACVrCBChrYwQHiVnAruBXcCm4Ft4Kbx/EqRlbfIOxEj+MTC+i9Ux0r2EAFDezgAGdidbfmWEABK+hu3nSP7hMN7OCIwfIiuxM9uk8soIAVbKCCBrruCjIvpwssoOt2R9cdjg1U0MA18utLY53HrgwHzkT/Wu7EAgpYweXmi51eTjfk+KcGdnCAM9F/mk8s4Lq26v3gP80nNlBBAzs4wJnoMe8Lrl5OFyhgBRuooIEdHKDHkHeJb+NwYgHdzcfNP7Pz1VuvrAtU0MAODnCeaF5ZN9aarnllXaCAFWygggZ2cLmtRV/zA1ZP9DdyJxZQwAo2UEEDl9uqqTSvtwuciZ41TiyggBVsoLt1RwM7OMCZ6FnjxAIK6K+TnVqSJllSTxpBnhnagd7S6aigZ2lx7OAAZ+LxUfuBBRSwgg30l603R3/b6qPgv/AH+i/8iQUUsIINXFehbuE54MQODtDd6kLPAScWUMAKNlBBd/Mx9xyw6l3NK+sCZ6LngBMLKGDNsRiM0GCEPAec2MEBzkT/zvbEAq6xuPlc8i/hTzTQr+LAAfpVLAWvoQss4LqK9d7BvIYusIHrKtbmG+Y1dIEdHOBM9GhfxZ3mG6cFCljBBipoYE883rab45qp6wHKvFpurFpN82q5wAF6y/y/9Vg90Vvm/eCxemIFV8u694P/wp9oYAcHOBP9F/7E5bZeYphXywVWsIEKGtjziv0XvntX+y/8iQJW0HWro4IGdnBljduBM/HYeenAAgpYwQYq6L3THGeix/GJBfSr8OH2OD6xgQrauTuYHRuonTjAmegbqJ1YQAEr6L3j88wj9sQB+lX45PKIPbGAfhU+WP6rfaJfhU8u/9U+0cDlNnzCeByfOAO9Li6wgAJWcLmtRVXzurhAAzs4wJl4bIA4HOu5/aMd26h5e49t1E40sIMDnInHVocHlnPPQjs2Ujuxgg10t+ZoYAcHOBOPrQ4PLKCAFVy65pfp0b02ADCviwuciR7dJxZQwAr6WLiuR/eJBnZwXYV5c45dSB1948QTCyhgBRuooIF+FY7+231iAf0q1LGCDfSrMEcD/Sq64wBnosf88BnlMX+igBVsoIIGuptPI//tPnEm+m/3iQUU0PvMxQYjPxj5wcgPRn4y8pORn4z8ZOQnIz8Z+cnIT0Z+MvIzR95L5AILKGAFG6hgjvxRP6YHCljBBipoYAcHOBO9kOxE3BpuDbeGW3NdcxzgTFT/p91xJpq7DccCCljBBiro1zYdVxv81scLvAJn4pq/gQUUsIINVNBA3DpuHbeB28Bt4DZw87KuVb9hRw2X34kdRVx+03tUcZ0oYAUbqKDrHthBb6+P25yBXscV6C1TR1cwxw76aIrjjAHw2qzAAgrout2xgQpaDKxXbAUOEDfBTXAT3KQm+qz2VOFFUoECesuO/7aBCq6W+d2gl04Frpb575uXTp3o30SduNz8Xs5LpwIr2EAFDeygu1XHmegxdGIBBaxgyyE8osUbeUSLD8ARLY5HtBxYQAEZzc5o9oxNP5oykNHsjGbPud6OaDmwgAJWsIEKGtgTPYNPv0zP4Cca2MEBzkAvfAosoIAVbKCCBnZwgLgV3ApuBbeCmz99rber5oVPgQZ2cIAz0Z/JTiyggBXETXAT3AQ3wU1wq7hV3CpuFbeKW8Wt4lZxq7hV3BpuDbeGW8Ot4dZwa7g13BpuDTfFTXFT3BQ3xU1xU9wUN8VNcTPcDDfDzXAz3Aw3w81wM9wMt45bx63j1nHruHXcOm4dt45bx23gNnAbuA3cBm4Dt4HbwG3gNnCbuE3cJm4Tt4nbxG3iNnGbuM10O3ZJO7GAAlawgQoa2MEB4lZwK7gV3Apu5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXKJkUuMXGLkEiOXGLnEyCVGLjFyiZFLjFxi5BIjlxi5xMglRi4xcomRS4xcYuQSI5cYucTIJUYuMXJJJ5f0I5eIo7upYwUbqKCBHRzgTDxyyYEFxK3gVnAruBXcCm4Ft4LbkUvMsYACVrCBCrrbcOzgANe95837zD/QOrGAAlawgQque8/16Z95UVfgAGeiP4ucWEABK9hABXFruDXcGm6Km+KmuCluipviprgpboqb4ma4GW6Gm+FmuBluhpvhZrgZbh23jlvHrePWceu4ddw6bh23jtvAbeA2cBu4DdwGbgO3gdvAbeA2cZu4TdwmbhO3idvEbeI2cZvp5nVjgQUUsIINVNDADg4Qt4Jbwa3gVnAruBXcCm4Ft4JbwU1wO7LGcPT80B07OMCZeNxrHFhAASvYQAVxq7hV3CpuDbeGW8Ot4dZwa7g13BpuDbeGm+KmuCluipviprgpboqb4qa4GW6Gm+FmuBluhpvhZrgZboZbx63j1nHruHXcOm4dt45bx63jNnAbuA3cBm4Dt4HbwG3gNnAbuE3cJm4Tt4nbxG3iNnGbuE3cZrrN2w0soIAVbKCCBnZwgLgV3ApuBbeCW8Gt4FZwK7gV3Apugpvg5uuIq0rYvEpt+rtbr1ILVNDADg5wJh73GgcWUEDcKm4Vt4rbca8xHQc4E497jQMLKKC7mWMDFZyRMo/StBMLKGAFG7jEVlWzeWlaYAdX01c9sHlp2ol+K3FiAQWsYAMVNLCD3lEH5i3g7DfQ3aqjgBVsoIIGdnCAfm3eqX4rcWIBBaxgAxU0sIPu5r3utxIH+q3EiQUUsIINVNDADuI2w617aVpgAQWsYAMVNLAnrp+vcluztntVVPCalcll8ZpV3QujkusDtwfWB7YH7g88HnjC/u1h8IOvPfjag++x0diag/3cU2xNi37uJHb+86NtzflomzrbA/cHHg884WNDsZPLAx9tM+f6wO2BD9/ufPh6/4/D1/vZNw66rQrn7vVPcS3z9sAP1+hTaXoTfCqd2MEBzkCvewosoIAVbKC7maO7dccODnAm+l3pSlnd654CBaxgAxU0sCf6y6n1AU33DcPuV3Vz9r5dX7J0r3y6sziPB55wvT1wfeBDpzr3Bz501lzy+qU7e++047/37mn9gccDH77eLWd8HVweWB74aI9f7hFfJ+vDf2MP3B94PPCkf474Ork8sDyw0g/20A/20A9H3B3syXZ4l3uyHf43Pdme2EAFDVzjOlzM0+rw/vW0eqKAFWyggga6rg+Qx8KJM9BrhwILKGAF3c0cFTSwgwOciR4LJxbQLbpjAxU0sIMDnIn+WHZiAQXETXDz265VQdK9jCiwgwOciX7bdWIOlpcRBVYwB8urhOaqNuleDzTXclv3eqBABQ306C+OA5yJvipzYgEFrGADFTQQN8VNcTPcDDe/fzquze+f1vph9yKgwJEX5HdKB/qd0okF9KZXxwo20Jvunep3Sid2ELeO28Bt4ObBeyLDMhiWwbAMhsWD90TcJhYept2b42F6ooEd9JfxHm8epo5e7hNYQH8Zb44VbKCCBnZwgDPRw/TEAuJWcCu4FdwKbgW3gpvH5iqL7L4J1lwFhf3Y+mrVAPZj76sTBzgTPfROLKCAPhFvjg1U0MCebfAnnhNnokfsiQUUsIJckMfxgcfzirfseF45cBn7Hc9RynTiTPQgO3EZry97+lHKdGIFG6iggR0c4Ez0KDwRNw+y9ZVVPyqV1odR/ahUEp+IHmQnzkQPshMLKGAFG6iggbh5kIlPI38cOdDj7cQCCljBBipoYAdxm+l2VDWd6G7NUcAKNlBBAzs4wJnoAXkibgU3D731IVc/6pfWd1r9qF86UcAKNlBBAzs4wJnoobe+3uq+E9Vc30h134kqsIEKLosqjh0c4Ez00DuxgAJWsIEK4tZwa7g13BQ3xc1/QteJGf0osjrRLXwAPHjXLlv9qKE60IP3RBfzCePBe2IFG6iggR0c4Ez04D0RC5+/1aeGz9/1RVb36qPAAgpYQW/ZdFxtWN+gda8zCpyJPlNPLKCAFVy66+ut7nVGgQZ2cIAz0ef6ie4mjgJWsIEKGtjBkeg/M+v72+7FRYECVrCBChrYwQHOxIZbw83n+vocrXtxUWADFTSwgwxWY7CUwVIGy3+S1ve33euB5tpfrXs9UKCAFWwxz/SYvwca2MEBzsRj/h5YQAEriFvHrePWceu4HXsk+rUdmyQe/7SBmhd07Il4YAcH6D3pIXLsi3hgAb2jPHD8x+fEBuI2cZu4Tdw8eB293CewgAJWsIEKHhb/+7+/++XXv/7xD3//81//8i9//9uf/vTL7/8n/8F//fL7f/qfX/7zD3/701/+/svv//Lfv/76u1/+vz/8+t/+H/3Xf/7hL/7n3//wt/u/vU+cP/3l3+5/3gX//c+//mnR//6Ov317/lfv6yrrMdD/+n1hpWlK3P/NB5HyXMQ/eHaJ+yuvFOjlw9+X53/fVpL2v2/GNdwXGi43wELg/sLmWQPa87/ve5v637/fj73SAF8NdoH7D86zBtjzv+8H/vrfv8fLSw3QELivbz9rwNj1oGUPvtYDa73tnEalPGtB2UxF3yboaEKRp03YzeXqv5NHI+43cOP5XN5MxhkjeV8aTIFWL//9+9NMxOP9YYWeuC9FftTYzMeyHlpc4r4ClAr3p8iPCroZz1v7P0LyHxQ2U3JmXrivc76mYC2nxE2eS+w6049zPTrTynjemfO5xn11SaI374+laNSPgyq33aBGgrk/sqBg16dV9QPxziup/emVyEZD/eC5I01YpTfsk0TdzKw2M0RU5anELln2TBW1PcRpvawwWlzGsPJcYTO17suaOab3ny3iVD5K9F3Gixi7vxx+3ohNzhTfIu5oRB8Mx30B4bXx6M/HYzcrfMf+88fjNp9J1E3yvi9oRta7r0yWpxLy7pjW+vaY1vbumFbd3Q9Z3kssphn31a/rl1Jqz0vR8vRSNtNTRgzqfc3x6fzeJotpOS0efso+j+l8O4HvJO7pMn8N70vUT9NeK7sYMckYeegM+dSOtuuNEQNyvxF/UNBvzAwvYz27Yz6M6ueZ0TYz9P5sElP03jP6kDM+XYvu8s4tA+X+PoSRvTwq7ZYKrfTnP6ut7+5R8pbz/t7t4UexfOzTNrZ3bD379L6M9nDbV/pHlfn+/NDbu/Njey2t3m55LVXr02tR2WWOThIc86El46NGfXd+7Gbp9Sy4V7kaMWrvR4z2t3tkO7pWMxmuc9yfj+7uVtQPZDzace9hRrd8/IWy3a2on910ZNT1cITGp6fNsn1Giel+f81Sn2vs2iEt74nvr+aea2xmapvZjvua6HyqsR+ZkZ1a1hGZT0fGNjl17e4RCaDK8zxkm5l6f1Fwy6xaxksa69i66JEit9eupUporK+zn2vM3d1Dju59FfG5xnZk1M+XOBPz2PRq3/36F98i6nwkH/32JHq7/Kbxb77jydGK9ZXp82tpv+mvzKpvi3asOq3n7dg9PlUWGB4faO+34B813s6p21a0EvEi9/dMT1uxuwuR0vJKSi9P70LGLpNZrvnUXh971C5r3H/8IwndX6/dnmvI+/cxo749w7Y9mk8eIh8y0Dc0pKKxGxV7dw1s9HfXwMZ4dw1s3xMjo+S+AvS0J+Z+XXPkD1x7/F1pHzW2v/iSc/z+Nv+5xq4d7SH1lI3G7t605lL7faXBnmps+9RyrUHsw7V8Y4Za9qn0D+34NC5vz9D59gydv+0M9dORjsuYm3j3m5vnazedBY/6+DAon0Q2c7RbXky/v997TWQYL6NMy0akvp+Jy639pqnYiwjOoen22kSf2Yx6k7EZ3v72+4jbePuFxG3+lnO93vIF0T0fyvPOKLsbUuHZuNbHGVa/IeJvvM8uHbeNyG6a6uDl7drxm075hwvarUnlGszjJFuXdjmrG/cM/fY8q5fd66KiXu4TV6P25JbSD4d5ns14U3P78MTxuSWbudqkxOW0e058+sao7F47lZkPP3J7+LX8tP5atq+dckW83Z6vZxfZTLS1yw0v129Pl2DKbi35HpYirORIfboKs/+V0HxTIVY3uXn38uhyv+r7/Wo/0a/9R/q1bF/fpIrobM+Tieye+JvkWow+rMX8w6Svt/cHZ/cy6uLg7F5GXR6c3Uuc64Ozfw2Tq1PrbKvn03X3bKmZjtpjdcbnl+DVdj99eV9Uy4f3z/INEbn1//v387PIePsVdNm9wLj2Dnorce2FZdm9mLr4xrLsXkxde2VZWn3/PfT1UembUdlNj9KyxkF2997N3r5R3N3mXSxd2UpcrF3ZdocfQHR0x/ZRZPdiqvd8NX/H9jwtb0VGFp/cNTa5XeX9uN29mroYtzuJi3Gr+n7c7l5LXYzb/Vupi3F7eVQ2cbufHpZzbMwX59gok7Htm5vm3Yupormce1/dflhk/1xptY27mQVf9/fLm586e79QqtjblVJbiYuz3d6vlSr2drFUsR+olro+Kq/+Ss18WG23Dw+rnzpk+1bq4vTYvZW6OD3621VXZfdO6ur06Pr29Ni+DLo6PS6PysvTQ3n+uI3XbpSb77twirTNHNu9U7pY7unva96dp+P9eTren6fjB+bpeH+ejp+Yp+MH5ul+drz/YNnzkb/dL+v5g+XurdA6oSOrDermd39uv594KBS6Pf/Z33dIp0PGi516rZa2zN1Ebfkq+P6Guz3X0PfDdvd66mLY7iQuhu3uBdXVsJ3z3bCV7dLj1bC9PCqbsN3ODl7m3meHvaahuZYjWp+W9sr27dTMl7nrOMcXNbImbqfxRbRcKj2X3eupi18k7CQufpKwez119ZuE3TdQF2f6bjF4HVDIe0d9OtNl98twrfp81wydWfiwzprcNONHKkhl9zHU1RJSKdsf/iv1TvsZcu2zANm9m/qBken5/nIdlr4Zmcsi80URP975ELkvH7wqkt/b6eO3i98T8Z0Tz0wm7cXZel9RzBcGd66b2fojxddfyPTKl73dyssyk7cg4+GB6Hsh2IUPVE02IXhZZL4qktdzR31NZO2pxhjdxk5m27l+hM85Y24PN4vfHKPx8KZqPNyEf1cm33svmefz9xu/6JuvFHf3rixI9s2j3vZp4NLnT7J7J3L1KX4vwmch98ej5+sJ0m6Xyhqkt+dX095fCpD29lLAVuLinVZ7fylA2ttLAdJ+YCng+qhsPgDdzw7j1mS0lzRqyYupZfZXNW5va1RucOrDUsD3NHJw73LPNXavma4+H+01Lj0f7a+ltQi52my8r/HiHLv/BOSr/zaej61uP6LgR/O+9LSJul1DelZD1G7PU+Hu26Wrg7vX+IHB7YVr2QTu9pXILYszy6pjfLFTZ765H5tZZm8XVYntSwD5yOa2uQ3ftaPlWmJ7/HDpczv2v9n55r7VDwVVn35hdp9QXVwHlH57/zd791Lk4m/2TuLib3Z//+t+6W9/3i9df+A3+/KobPLpdnZcWwfca1xcB+zz/TS2n+nX1vDG+7N0vD9Lr1/J8zy4e1F16dlln35aI4V9+IDzk8h4u45Kxtt1VF9cCqXUbff0M94vxto3xLdTPOZ5uT0vXZTda6qLfTrl7T7dSvxAd6gXN5/d0Xbdob/lTNeWP7R6Tz+bZvTdD37eeMjjjgmfJcbbi7vbVuRq2+Ntx+dW1N1LqsZH6E0eq6evS/i6DWs4entNZCoLQfPx5fK3RMaNta2bvdSpuaDa5tx0qv6mEmsNlNW+Uexpf+hPjIz+xMjoD4zMNnLt4b7hw2fo3wh/K3k19nEfmm+J5JPpvU3tRZGWT1H24euHb4nUXM1dhyo/Fanv79xX39+6r/7A3n377mBr0XVW8aY75vaR8NJXYXX3HdU6kzd+qW72/Neu7r6kuvpVWN1+SXXtA5m62zPu2oN23X1EdfUDmSr7PHLxA5m9zPqonddm1p/LfDFRbpWJ8rjkf33KrsMVYqLUtpmyuy+pLi7W1/r+g3+tbz9SbSWu7ur3A9v6/cC+fvUHHvyvj8rzB/8vZselxfqtxsXF+q80bm9rXFtor61cXIBQebEdl14afNGOS2vC169lo7G9lpalCPX+k/O8HfZbt+PSi4frGi/Gy8UXD3X3bcrVFw/7hlx78VB3X+tcnWR7jR8Y3GsvHqrq+y8evmjIpRcPdfcd1cX7oe2bqYsvHrbtuPbi4cu73fZwt/t0c8/9R1QXb5l3IhfXIrb3uj0rEe/4fKLuvn+6eh+0eyF08T5oJ3HxPmj3CdXV+yAbb98HbVe4r94HXR6VXV7fPgnlb3aZ83k67T+RCnePQiyGrIN7N49CuzV/KoX642Pdt0SMmkrro74oMvIBcx2F/vKT3WPd7bSXn+xyt6/1lKcbmW2/5Gsu601e7VwWI8Zts6337sn7YobfTft7GriRBsZLoSOlsOnh5td795bq4o/m7muqyz+au3Zc7dLt0OYS732U5cUpX271oRSzvbyYUfThrqi/HDm+L1DeXG0iZ7dBVPbLw1fQn44y+Wql+OE4lNtD6fx3lpuPg7xDRJ7ejsz2/pr1VuRH3q9c7ZHbT/TI+IkeGe/2yL6emu9l54ffz28VZc98430X2ZSH1+0uVZeLsrebBw1t/IKWp8uIO4l5y1/yKf01idxLxaY+H5mrqxH11c8rJttCzfb8O579BhM8kPTHi/m8dN5u79dTtfL+smorby+rbiWuPU608v6yaitvL6u28gPLqtdH5fnjxH52XKun2mtcq6dqZb69wvOFxqXHmi+i5VJNVpO3q/23Ehdn+vUrGc+v5N1KlS9SWC6X9zk3KWy739+1FZEm72+f1mS+P7Bvb5/W6vvbp7X69vZprf7A9mnXR2WTwraz49qKSKvvr/x/0Y5L76jb7kXqtcfLttug7+pyyLYd1x4vt91x8Yl9r3Htib21t1/7t+2JPBef2LftuNalX+wVltuFjzI2RzJuN9a8tN3H/ti7a3eU+8OnrqXj/R5/l9LxtkevpWOV99PxdnO+a+lY2w+k48uj0l+bHNduKLcSF+8nd2+mrt5P7jUuLpO//Q5lvxh88ev4/Sl8V79q/0Ll4kft27P8Ln7Tfl1jvqhx7Yv2/VltV9dO9v169Xv29iP7KLQf+Zq9td/8ii7P2vYjWzFsz9O7OGuva8wXNa7N2p3G9VnbfmT7hOtn6D6/TdxtWnDpMXV73GrPut3aHzdS+3yw526zviqTqq7H26JvSPAB5Yfjhj5LvL9Yv+sMyxv3Om666Yy3P6Nq739G1X7gC6hW3h6S3ZJ0HiFlH76z0esKeZdqD9tp/IPCtrblocj34UMd+UZPlCbcHEp9rrF9ITUlj6a/83w+x9+d4l8coJuPMHfeHBjZdp/ZXIz4rcS16bXb5u9id+yLW3KDrf7wPcn1c4CvzfGtwrU5Pn9gjs/357hu39xenOPbp0q55WPU43GC/3Cg8U5DOfBN9bnG/pjYZg+n6M3NAb63+W6k7CUuRYqW8psmjg/doY8LSt86zzjPIharj+cI1xc1+vsaDxVC3zpX+WZ5t3Cz52cR6+74qTI4JXaMuhHZVfnlG9fx8OLmexL5Tn5of1EivxAaD2fxvSphm0Omd2uNNT+WuC/z1tcGRZRfBSv64sjOPJj5vj5eXrsajrv+cFD1dzSq5WNGfTyG/B8u5uox5P15uOjujcelZxXd/1hn0I7bJnnsvsjpmgHXPxx99enXZXvgVB0k5Mdly0+JcLc+JvNhX87H7QU+a+x28ik3zsu+r8Dq06vZ9erIH355/Mj4W+l05OPGHe2pxv4Hhgly593vbe3bVYJ88HnYIbT0j49w22PZLedZ+/Dxx3eOdu9sCHTPaq9ptPy2sD2+bfjW8fBes3+s5Nb+4tHuPT+oueN4TYMDHz+8fPmWxsOOHPPD8UjfOWL+lr/867bZXlWhlO7O40UVeXjpUG1zS7WTuXZs7Fbi4kPMVuLSU8z2LI77DRD1ifP2rJBOd3f+s+R7h1me3ytvJSS39pgi45V7ZR3z4aMce3GS2Y3DWq3cnquo2tsPIFuJaw8g+tuuXHzsjvJ6pyoqIi+qlLzlvvMmv6u9vW66l7g2NNZ+26H50B3aXx6a9qDyPKnutny7lsq2CtfWY7ZX0oWp2ufzSab99vbi1Hbjufs9FR+yWntRpGvemd15vijC1593tJfm2ejMkFmfL17uDo663woqfXIb8yUVkayMkfqwGiK3+ZpGkdc0NAvhRa28pHFvf55/d3t8aP6ksXsTdfGFw06i3Uo+7Zb2GP7f0Cj5tHvPa+2pho76dl7eSlzLy0PfzcvbzpA8PqLJh5vuz83YfaQ884SjNsU2Irt7VPY5ejja4/NT6r4ZRjM+PMh861p4krnJeFkk68hu+nKv5veSel9HfD7Xt8c856uc+7LXRqO++3O5Vbj0c7m7jquvL7YaV19fbL+Quvj6otx2n2povr8Yjy35vCOQ3W7vZqC9xKUMZDd5NwN90Rv2sLDcN73R3n7buH1fmT/5tX646ddPzXj7zb7d3n6zv5e4eND07o3SVY2yfVznGVc+bAj66RXKTuRhG56H+vX+qTJ491nT5ZjdiujDfo06Hraeq58myBcy42Ezjsdzs78tQ0J8fBPyjzLbKqXG9pGPFWS1fKctMzcquLO8fEl8DVP0wweb35KxGx18TxnjqYzJ7TeX+VCj/7CS+LmD9yJS8xlAHpbfvyfiG4mcDxLjthnqsn0aeShu1+cBLe+fePiFhrEbza08/S3fi1y8qfiiJdfuKmz34dPlDLXdSO7ah2BW3z/Px94v695KXPvywOr75/lYffs8H6s/cJ7P9VHZHUG9mx3XPgSz+v43pGX/Dfq1rXG2Ile3xtm35OK3YHuRi1vjlO1L2stb4+xlLm96+pXMxR12vujeazvsfCFybYedUreVTZc+LttFz8Xv9fYa177Xs92Lp2vf65l+cbv2cGPzPCOpvN+l26G9tsPOF3P16g47X8hc3WHnK5mLO+x8dQt7413Jh/z2+d7T3l8gsPcXCN5/+7SVuLjG8MXDBVvs2OPGNp+7dLf4c/m5erfTh2aq71aen06xXzIpVMFVaS8umVwcmberq8tt+3Vn/kwM07Lpj7ff6O0lLq1Rbi/l6vPEXuTq80T/gSLrstsC7erzRO/vP0/08fbzRB9vP0+M2/vPE9vDpK49T+wWsS8/T1welc3zxHZ2XHye2L2+uvo8IfYDzxM7kcvPE9uWXH2e2IpcfZ7YbrZx/XliK3P9eeILmavPE/vuvfg8sRe5+Dwhbx8GuY2eq88TW42LzxPz7S1VbM4feJ6Y4/0utR94ntjP1cvPE3uZy88TX8hcfZ7Y3tpkaY59OEXsW3dHMyXa8ze47987707Kq5I7/t1f1j2+Nm3XNXpugVjnh+93r2u0W2q0m86nGn37WuvS09m+GZnL7uGza0Z9+1bgC41ri/F7kYs3z1+05NrNc99/lXPt5nluG/JQP1b682m220OMujyxDwXC39DQjH25/2o+nyPy9gmVXd4+oXIvcfHhe7s//PU7mrI/UvrSsVB1++g88tG5fPiS5VPkbbcAu3YqVP+Bvf/6+3v/9ff3/us/sPdff3/vv/4Te//1H9j774vZcelUqK3GxVOhvtK4va1x7VSofvn1lcqL7bh0KtQX7bi0/Vb/gVdx+2u5dipU3+1z8zPtuHQq1HWNF+Pl4qlQfV9/fu1UqH1Drp0K1XdbRlydZHuNHxjca6dC9e0rq4unQn3RkEunQvXd8VTXHpe72vuPy9t2XHxc/uIe5tKpUF1/4CDVrcjV1zvz7aXqbvL+fdDuQ/qL90E7iYv3QbuDpa7eB+0+Cr54H7Q9nOrqfdDlUdksVW9nx7Wl6t7fT4Vl9xx1fam6/MRSdfmJperyE0vV8jNL1fIza8zlJ9aYy0+sMd/ez/Dz/TXmrca1NeY+3q5Z6eMHala27bi6xlx+Yo1ZfmaNWX5mjVl+Yo15+4XPpSXm/TdCV1aY95855orKHR/LAL7xqaTxuaXN+prGyK1fZH7YbuE7n1vm19J3fH4tOra7T137ZnMrcu3kor3EpZOLvpC4cnLRdlR6/oDfl8pur43sB432ooagUXcf0r69K8Be4lL1z3i/gGgrce3ef9+f9n9+Af+9MckbRHncVeh7Gg/teFVj5DP7HV/V4KCNrcbbLwz72+8Lv9hjJX+vp8iL27TkhzN3fLonwXbPmktd8cW2N1f6Yr+7UnaF9vri7krMzzu+qDEk2zF2u15tNXIvovuP9Iu7PBEnOl7dsYo4ucu9uttUrm3d8dX+4CvvWTbjstsFTPnwXW2+r9Ff20msWb4Wa6bPt97wrVefPuAScvcp+/wzy7F7m9R4YGgfHxjsWy3JEwZtPG/JFyLU+/b6/KPGsf3epeUTw331+bYR2e03kVfzePSIiF4f38E7y92WVaPqD4xvtffH96uWXBrfL0Suju/8gfHdzbT3x1dvN3ac2Ox7NXb7savkKpfKw3rOp508xu44KOvCc/bjNi/jG9eSLz/11ufmWvQHrsV+22uh3P+Or+V3rSUvpUp9TUNox8cCrFc1+osaQ/7PYfmWRm7yeseX+9ToU3lRQ9Bom9/M7X7o+Rm/PI7L573Mx/ubAI73NwEcu00Af0Di2jPltj8rG2bV/nxv+GG7Q44v7We0a0XjqbTNsWlFfT+D7Xb/u5jB9rvtCwfZiD69lr2GcvKZPe8P31znuci1bf+3IhfXxLYS19bE9hJX1sS2x0pce7i9vftsuz2+5VIb9gfAXFpr2B0bdfG4+b3GtdPm2+47pW+cPdXfnp97iUvz8wuJK/Nzf/Tb5UO09io/cGjb1Tmy17g4R+xn5oi9P0fs/Tlib8+R7aYn+rBl6GM9/8dtbcbc7qJ6o1BS5IVWTD7Yns2etmJ7IXlPWz6cBf4PF7IrHrlUqT12Z1Bdq9TeS1yr1N5ulZCt+HDAzz92xq6O3/rDZ/T9+faYX4jUh316rT4V2b1F1xsbsGp7ejlzt1lfoTKozP58P6q5/fr86uLL9nJGprH7y8m6uZzdK/06a1b2tNvjmQGffrl3VRL9xjEMdb4Sd83y+av11jcX8/a2f/P9bf/mD2z799V8p5TOnm/kPMvt/aDZz/eHbyymvD7fLy3xfSFybYlv7rbau7rEN4u+u8S3j7tb5QiFW3vYIHt+HuHNNMnCgof9Olu9GnOq+YGV3hdy6YvLAsYLoMeb/m8IZPK5a8n3BaTw5U15fI4U/YZEVgKUxyeX70hQrrJe8D6dEbvviDW/mdN6e1EiC+c/nIX1jQt53OLw8bC1b0hYzuuPpTvfkOi5nid92xfzNxYplgfH3RPoeFGkc8z04wkD3xOZN84ok9dGRvJi7i/yX4uVmj8G95lSXmsFZVn19tKFlNvD46i9NNGLbxF2SDxuYP8tCT63LeO1VtQM2Du+1gqlbFAf7pu+JWHUdo/52oUwO6u8diE1H0HvOf2lC+lZStCbvSLwsC6gL10Ez5+P++9/R8A4OF3fvITXBC5+tTB3y5HXvlqYWrarRY8F6fq8TH9uS49aviq/t/j5Gs3U+huuS9xvMTp3KeV5n+6+Jnk4hHCjsN0GvHUyVtt8KvDVyFxcx/tCZvaH8uuHN13flHn40u/2+H3+N2UeHpVu3crLMvNhpfSh2v97s7bnveDsJptZe1lkvioySUhTXxO5vlT61cS7uAy9v6SLK8hfiFxbQp67d87f6Bezd5eQ9xKXlpC/kHhzCblxVsvjneU3VqEQkJcErh3P+PYJ828fMP/2q8S33yTe3n3tv70dfThb7nH9rF5fxDdOQrDHlcBvSAzltG99rRUzj0CT2628IiE33td/+ELpG614OKv3w7dS35HIIS0fTtz4hgTbrJQyX2tF5eOz9lhr+A2JZpwo+7BC8q1WcMBe7a9dSMvV8vK438OrffGihGg+sok9P2x8K5EJs8jjwsarEvaSRM278zuO1ySM5/BeX5JQboq1vdYXdT68idH3JV4b1JYfF5RWy2sSrJo1sxcluJDHtarvSOR93n2F57VBbQ+HA99uL86Lh63QXhrUlrsZtPFSZzI1P2zG9kng/gy2DVSWZ+ThkeRT8dmuFSnwYZ3qG5eRP6fWXhoLzRoFfby3+YYA9a6zviaQVYCzvSdgt9dakJtB2Gu50koWIdb5Zgs+D+M/3//vH/7457/9y69//eMf/v7nv/7lv+5/73+X1N/+/Id//fVP5//99//+yx8f/u3f////jH/zr3/786+//vk//uU///bXP/7p3/77b39aSuvf/XI7/+ef+v1B63f3BZ35z7/7paz/37r+rrdZ7/+/+r+/rwz3W7utf7/+gq21TaulrX/gf+N2fzV7/5/6z/+7mvz/AA==",
2153
2283
  "brillig_names": [
2154
2284
  "sync_private_state"
2155
2285
  ]
@@ -2405,149 +2535,145 @@
2405
2535
  }
2406
2536
  },
2407
2537
  "file_map": {
2408
- "106": {
2538
+ "105": {
2409
2539
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/functions/utils.nr",
2410
- "source": "use crate::macros::{\n functions::{abi_export::create_fn_abi_export, call_interface_stubs::stub_fn, stub_registry},\n notes::NOTES,\n utils::{\n add_to_hasher, fn_has_noinitcheck, get_fn_visibility, is_fn_contract_library_method,\n is_fn_initializer, is_fn_internal, is_fn_private, is_fn_public, is_fn_test, is_fn_utility,\n is_fn_view, modify_fn_body, module_has_initializer, module_has_storage,\n },\n};\nuse protocol_types::meta::generate_serialize_to_fields;\nuse std::meta::type_of;\n\npub(crate) comptime fn transform_private(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[private] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n // Private Kernel Circuit.\n // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n // about the execution context (e.g. the caller).\n let original_params = f.parameters();\n f.set_parameters(&[(\n quote { inputs },\n quote { crate::context::inputs::private_context_inputs::PrivateContextInputs }.as_type(),\n )]\n .append(original_params));\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n // TODO: Optimize args_hasher for small number of arguments\n let args_hasher_name = quote { args_hasher };\n let args_hasher = original_params.fold(\n quote {\n let mut $args_hasher_name = dep::aztec::hash::ArgsHasher::new();\n },\n |args_hasher, param: (Quoted, Type)| {\n let (name, typ) = param;\n let appended_arg = add_to_hasher(args_hasher_name, name, typ);\n quote {\n $args_hasher\n $appended_arg\n }\n },\n );\n\n let context_creation = quote {\n let mut context = dep::aztec::context::private_context::PrivateContext::new(inputs, dep::aztec::protocol_types::traits::Hash::hash($args_hasher_name));\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // All private functions perform message discovery, since they may need to access notes. This is slightly\n // inefficient and could be improved by only doing it once we actually attempt to read any. Note that the message\n // discovery call syncs private events as well. We do not sync those here if there are no notes because we don't\n // have an API that would access events from private functions.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is passed to a second args hasher which the context receives.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment =\n quote { let $return_value_var_name: $return_value_type = $return_value; };\n let return_hasher_name = quote { return_hasher };\n let return_value_into_hasher =\n add_to_hasher(return_hasher_name, return_value_var_name, return_value_type);\n\n body = body_without_return;\n\n quote {\n let mut $return_hasher_name = dep::aztec::hash::ArgsHasher::new();\n $return_value_assignment\n $return_value_into_hasher\n context.set_return_hash($return_hasher_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(\n quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n );\n }\n quote {}\n };\n\n let context_finish = quote { context.finish() };\n\n let to_prepend = quote {\n $args_hasher\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $message_discovery_call\n };\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $context_finish\n };\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n f.set_return_type(\n quote { dep::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs }\n .as_type(),\n );\n f.set_return_data();\n\n fn_abi\n}\n\npub(crate) comptime fn transform_public(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // If a function is further modified as unconstrained, we throw an error\n if f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[public] but marked as unconstrained, remove unconstrained keyword\",\n );\n }\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n let args_len = original_params\n .map(|(name, typ): (Quoted, Type)| {\n generate_serialize_to_fields(name, typ, false).0.len()\n })\n .fold(0, |acc: u32, val: u32| acc + val);\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let context_creation = quote {\n let mut context = dep::aztec::context::public_context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len] = dep::aztec::context::public_context::calldata_copy(1, $args_len);\n dep::aztec::hash::hash_args_array(serialized_args)\n });\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n quote {\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n f.set_unconstrained(true);\n f.set_return_public(true);\n\n fn_abi\n}\n\npub(crate) comptime fn transform_utility(f: FunctionDefinition) -> Quoted {\n let fn_abi = create_fn_abi_export(f);\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // Check if function is marked as unconstrained\n if !f.is_unconstrained() {\n let name = f.name();\n panic(\n f\"Function {name} is annotated with #[utility] but not marked as unconstrained, add unconstrained keyword\",\n );\n }\n\n // Create utility context\n let context_creation =\n quote { let mut context = dep::aztec::context::utility_context::UtilityContext::new(); };\n let module_has_storage = module_has_storage(f.module());\n\n // Initialize Storage if module has storage\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(context);\n }\n } else {\n quote {}\n };\n\n // All utility functions perform message discovery, since they may need to access private notes that would be\n // found during this process or they may be used to sync private events from TypeScript\n // (`sync_private_state` function gets invoked by PXE::getPrivateEvents function).\n let message_discovery_call = create_message_discovery_call();\n\n // Inject context creation, storage initialization, and message discovery call at the beginning of the function\n // body.\n let to_prepend = quote {\n $context_creation\n $storage_init\n $message_discovery_call\n };\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, quote {});\n f.set_body(modified_body);\n\n f.set_return_public(true);\n\n fn_abi\n}\n\ncomptime fn create_internal_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called internally\";\n quote { assert(context.msg_sender() == context.this_address(), $assertion_message); }\n}\n\ncomptime fn create_view_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called statically\";\n if is_fn_private(f) {\n // Here `context` is of type context::PrivateContext\n quote { assert(context.inputs.call_context.is_static_call == true, $assertion_message); }\n } else {\n // Here `context` is of type context::PublicContext\n quote { assert(context.is_static_call(), $assertion_message); }\n }\n}\n\ncomptime fn create_assert_correct_initializer_args(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_{fn_visibility}(context);\"\n .quoted_contents()\n}\n\ncomptime fn create_mark_as_initialized(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::mark_as_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\ncomptime fn create_init_check(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_is_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\n/// Injects a call to `aztec::messages::discovery::discover_new_messages`, causing for new notes to be added to PXE and made\n/// available for the current execution.\npub(crate) comptime fn create_message_discovery_call() -> Quoted {\n quote {\n /// Safety: message discovery returns nothing and is performed solely for its side-effects. It is therefore\n /// always safe to call.\n unsafe {\n dep::aztec::messages::discovery::discover_new_messages(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n );\n };\n }\n}\n\n/// Checks if each function in the module is marked with either #[private], #[public], #[utility],\n/// #[contract_library_method], or #[test]. Non-macroified functions are not allowed in contracts.\npub(crate) comptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_private(f)\n & !is_fn_public(f)\n & !is_fn_utility(f)\n & !is_fn_contract_library_method(f)\n & !is_fn_test(f) {\n panic(\n f\"Function {name} must be marked as either #[private], #[public], #[utility], #[contract_library_method], or #[test]\",\n );\n }\n }\n}\n"
2540
+ "source": "use crate::macros::{\n functions::{\n auth_registry::AUTHORIZE_ONCE_REGISTRY, call_interface_stubs::stub_fn, stub_registry,\n },\n notes::NOTES,\n utils::{\n add_to_hasher, fn_has_authorize_once, fn_has_noinitcheck, get_fn_visibility,\n is_fn_contract_library_method, is_fn_initializer, is_fn_internal, is_fn_private,\n is_fn_public, is_fn_test, is_fn_utility, is_fn_view, modify_fn_body, module_has_initializer,\n module_has_storage,\n },\n};\nuse std::meta::{ctstring::AsCtString, type_of};\n\npub(crate) comptime fn transform_private(f: FunctionDefinition) {\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to the\n // Private Kernel Circuit.\n // First we change the function signature so that it also receives `PrivateContextInputs`, which contain information\n // about the execution context (e.g. the caller).\n let original_params = f.parameters();\n f.set_parameters(&[(\n quote { inputs },\n quote { crate::context::inputs::private_context_inputs::PrivateContextInputs }.as_type(),\n )]\n .append(original_params));\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n // TODO: Optimize args_hasher for small number of arguments\n let args_hasher_name = quote { args_hasher };\n let args_hasher = original_params.fold(\n quote {\n let mut $args_hasher_name = dep::aztec::hash::ArgsHasher::new();\n },\n |args_hasher, param: (Quoted, Type)| {\n let (name, typ) = param;\n let appended_arg = add_to_hasher(args_hasher_name, name, typ);\n quote {\n $args_hasher\n $appended_arg\n }\n },\n );\n\n let context_creation = quote {\n let mut context = dep::aztec::context::private_context::PrivateContext::new(inputs, dep::aztec::protocol_types::traits::Hash::hash($args_hasher_name));\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // All private functions perform message discovery, since they may need to access notes. This is slightly\n // inefficient and could be improved by only doing it once we actually attempt to read any. Note that the message\n // discovery call syncs private events as well. We do not sync those here if there are no notes because we don't\n // have an API that would access events from private functions.\n let message_discovery_call = if NOTES.len() > 0 {\n create_message_discovery_call()\n } else {\n quote {}\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f)\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is passed to a second args hasher which the context receives.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment =\n quote { let $return_value_var_name: $return_value_type = $return_value; };\n let return_hasher_name = quote { return_hasher };\n let return_value_into_hasher =\n add_to_hasher(return_hasher_name, return_value_var_name, return_value_type);\n\n body = body_without_return;\n\n quote {\n let mut $return_hasher_name = dep::aztec::hash::ArgsHasher::new();\n $return_value_assignment\n $return_value_into_hasher\n context.set_return_hash($return_hasher_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(\n quote { let $unused_return_value_name = $last_body_expr; }.as_expr().unwrap(),\n );\n }\n quote {}\n };\n\n let context_finish = quote { context.finish() };\n\n let to_prepend = quote {\n $args_hasher\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $message_discovery_call\n $authorize_once_check\n };\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $context_finish\n };\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n f.set_return_type(\n quote { dep::protocol_types::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs }\n .as_type(),\n );\n f.set_return_data();\n}\n\npub(crate) comptime fn transform_public(f: FunctionDefinition) {\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n\n let args_len_quote = if original_params.len() == 0 {\n // If the function has no parameters, we set the args_len to 0.\n quote { 0 }\n } else {\n // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as Serialize>::N + ...\n original_params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::protocol_types::traits::Serialize>::N\n }\n })\n .join(quote {+})\n };\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let context_creation = quote {\n let mut context = dep::aztec::context::public_context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len_quote] = dep::aztec::context::public_context::calldata_copy(1, $args_len_quote);\n dep::aztec::hash::hash_args_array(serialized_args)\n });\n };\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_internal(f) {\n create_internal_check(f)\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n create_view_check(f)\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (create_assert_correct_initializer_args(f), create_mark_as_initialized(f))\n } else {\n (quote {}, quote {})\n };\n\n let storage_init = if module_has_storage {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n quote {\n #[allow(unused_variables)]\n let storage = Storage::init(&mut context);\n }\n } else {\n quote {}\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n create_init_check(f)\n } else {\n quote {}\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $context_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $storage_init\n $authorize_once_check\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, to_append);\n f.set_body(modified_body);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n f.set_unconstrained(true);\n f.set_return_public(true);\n}\n\npub(crate) comptime fn transform_utility(f: FunctionDefinition) {\n let fn_stub = stub_fn(f);\n stub_registry::register(f.module(), fn_stub);\n\n // Create utility context\n let context_creation =\n quote { let mut context = dep::aztec::context::utility_context::UtilityContext::new(); };\n let module_has_storage = module_has_storage(f.module());\n\n // Initialize Storage if module has storage\n let storage_init = if module_has_storage {\n quote {\n // Some functions don't access storage, but it'd be quite difficult to only inject this variable if it is\n // referenced. We instead ignore 'unused variable' warnings for it.\n #[allow(unused_variables)]\n let storage = Storage::init(context);\n }\n } else {\n quote {}\n };\n\n // All utility functions perform message discovery, since they may need to access private notes that would be\n // found during this process or they may be used to sync private events from TypeScript\n // (`sync_private_state` function gets invoked by PXE::getPrivateEvents function).\n let message_discovery_call = create_message_discovery_call();\n\n // Inject context creation, storage initialization, and message discovery call at the beginning of the function\n // body.\n let to_prepend = quote {\n $context_creation\n $storage_init\n $message_discovery_call\n };\n let body = f.body().as_block().unwrap();\n let modified_body = modify_fn_body(body, to_prepend, quote {});\n f.set_body(modified_body);\n\n f.set_return_public(true);\n}\n\ncomptime fn create_internal_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called internally\";\n quote { assert(context.msg_sender() == context.this_address(), $assertion_message); }\n}\n\ncomptime fn create_view_check(f: FunctionDefinition) -> Quoted {\n let name = f.name();\n let assertion_message = f\"Function {name} can only be called statically\";\n if is_fn_private(f) {\n // Here `context` is of type context::PrivateContext\n quote { assert(context.inputs.call_context.is_static_call, $assertion_message); }\n } else {\n // Here `context` is of type context::PublicContext\n quote { assert(context.is_static_call(), $assertion_message); }\n }\n}\n\ncomptime fn create_assert_correct_initializer_args(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_{fn_visibility}(context);\"\n .quoted_contents()\n}\n\ncomptime fn create_mark_as_initialized(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::mark_as_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\ncomptime fn create_init_check(f: FunctionDefinition) -> Quoted {\n let fn_visibility = get_fn_visibility(f);\n f\"dep::aztec::macros::functions::initialization_utils::assert_is_initialized_{fn_visibility}(&mut context);\"\n .quoted_contents()\n}\n\n/// Injects a call to `aztec::messages::discovery::discover_new_messages`, causing for new notes to be added to PXE and made\n/// available for the current execution.\npub(crate) comptime fn create_message_discovery_call() -> Quoted {\n quote {\n /// Safety: message discovery returns nothing and is performed solely for its side-effects. It is therefore\n /// always safe to call.\n unsafe {\n dep::aztec::messages::discovery::discover_new_messages(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n );\n };\n }\n}\n\n/// Injects an authwit verification check of the form:\n/// ```\n/// if (!from.eq(context.msg_sender())) {\n/// assert_current_call_valid_authwit::<N>(&mut context, from);\n/// } else {\n/// assert(authwit_nonce, \"Invalid auhtwit nonce. When 'from' and 'msg_sender' are the same, authwit_nonce must be zero\");\n/// }\n/// ```\n/// where `from` and `authwit_nonce` are the names of the parameters that are expected to be present in the function definition.\n/// This check is injected by the `#[authorize_once(\"from_arg_name\", \"nonce_arg_name\")]`, which allows the user to define\n/// which parameters to use.\npub(crate) comptime fn create_authorize_once_check(f: FunctionDefinition) -> Quoted {\n let maybe_authorize_once_args = AUTHORIZE_ONCE_REGISTRY.get(f);\n let authorize_once_args = if maybe_authorize_once_args.is_some() {\n maybe_authorize_once_args.unwrap()\n } else {\n // We need to for authorize_once to have already executed so that we can retrieve its params - this depends on\n // the order in which the attributes are applied.\n panic(\n f\"Functions marked with #[authorize_once] must have the #[private] or #[public] attribute placed last\",\n )\n };\n\n let (from_arg_name, nonce_arg_name) = authorize_once_args;\n let name: Quoted = f.name();\n\n let from_arg_candidates =\n f.parameters().filter(|(name, _)| name == f\"{from_arg_name}\".quoted_contents());\n let (from_arg_name_quoted, from_arg_type) = if from_arg_candidates.len() == 1 {\n from_arg_candidates[0]\n } else {\n panic(\n f\"Function {name} does not have a {from_arg_name} parameter. Please specify which one to use in #[authorize_once(\\\"...\\\", \\\"authwit_nonce\\\")]\",\n )\n };\n if from_arg_type\n != quote { dep::protocol_types::address::aztec_address::AztecAddress }.as_type() {\n panic(\n f\"Argument {from_arg_name_quoted} in function {name} must be of type AztecAddress, but is of type {from_arg_type}\",\n )\n }\n\n let nonce_arg_candidates =\n f.parameters().filter(|(name, _)| name == f\"{nonce_arg_name}\".quoted_contents());\n let (nonce_arg_name_quoted, nonce_arg_type) = if nonce_arg_candidates.len() == 1 {\n nonce_arg_candidates[0]\n } else {\n panic(\n f\"Function {name} does not have a {nonce_arg_name}. Please specify which one to use in #[authorize_once(\\\"from\\\", \\\"...\\\")]\",\n )\n };\n if nonce_arg_type != quote { Field }.as_type() {\n panic(\n f\"Argument {nonce_arg_name_quoted} in function {name} must be of type Field, but is of type {nonce_arg_type}\",\n );\n }\n\n let nonce_check_quote = f\"{nonce_arg_name_quoted} == 0\".quoted_contents();\n\n let fn_call = if is_fn_private(f) {\n // At this point, the original args of the fn have already been altered by the macro\n // to include PrivateContextInputs, so we need to adjust the args_len accordingly.\n let args_len = f.parameters().len() - 1;\n quote { dep::aztec::authwit::auth::assert_current_call_valid_authwit::<$args_len> }\n } else {\n quote { dep::aztec::authwit::auth::assert_current_call_valid_authwit_public }\n };\n let invalid_nonce_message = f\"Invalid authwit nonce. When '{from_arg_name}' and 'msg_sender' are the same, '{nonce_arg_name}' must be zero\"\n .as_ctstring()\n .as_quoted_str();\n quote { \n if (!$from_arg_name_quoted.eq(context.msg_sender())) {\n $fn_call(&mut context, $from_arg_name_quoted);\n } else {\n assert($nonce_check_quote, $invalid_nonce_message);\n }\n }\n}\n\n/// Checks if each function in the module is marked with either #[private], #[public], #[utility],\n/// #[contract_library_method], or #[test]. Non-macroified functions are not allowed in contracts.\npub(crate) comptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_private(f)\n & !is_fn_public(f)\n & !is_fn_utility(f)\n & !is_fn_contract_library_method(f)\n & !is_fn_test(f) {\n panic(\n f\"Function {name} must be marked as either #[private], #[public], #[utility], #[contract_library_method], or #[test]\",\n );\n }\n }\n}\n"
2411
2541
  },
2412
- "111": {
2542
+ "110": {
2413
2543
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
2414
2544
  "source": "use protocol_types::{address::AztecAddress, debug_log::{debug_log, debug_log_format}};\n\npub mod nonce_discovery;\npub mod partial_notes;\npub mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n messages::{\n discovery::{private_notes::MAX_NOTE_PACKED_LEN, process_message::do_process_message},\n processing::{\n get_private_logs, pending_tagged_log::PendingTaggedLog,\n validate_enqueued_notes_and_events,\n },\n },\n utils::array,\n};\n\npub struct NoteHashAndNullifier {\n /// The result of NoteHash::compute_note_hash\n pub note_hash: Field,\n /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained)\n pub inner_nullifier: Field,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, note nonce, storage slot and note\n/// type ID and attempts to compute its note hash (not hashed by note nonce nor siloed by address) and inner nullifier\n/// (not siloed by address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in a\n/// contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, contract_address, note_nonce, storage_slot, note_type_id| {\n/// if note_type_id == MyNoteType::get_id() {\n/// assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n/// let note_hash = note.compute_note_hash(storage_slot);\n/// let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n/// RetrievedNote{ note, contract_address, metadata: SettledNoteMetadata::new(note_nonce).into() },\n/// storage_slot\n/// );\n///\n/// let inner_nullifier = note.compute_nullifier_unconstrained(note_hash_for_nullify);\n///\n/// Option::some(\n/// aztec::messages::discovery::NoteHashAndNullifier {\n/// note_hash, inner_nullifier\n/// }\n/// )\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack_content\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\ntype ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the message discovery process, in which private are downloaded and inspected to find new private notes,\n/// partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowledge of its private state.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn discover_new_messages<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log(\"Performing message discovery\");\n\n // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n // notes, private events, etc.\n let mut logs = get_private_logs(contract_address);\n logs.for_each(|i, pending_tagged_log: PendingTaggedLog| {\n debug_log_format(\n \"Processing log with tag {0}\",\n [pending_tagged_log.log.get(0)],\n );\n\n // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n do_process_message(\n contract_address,\n compute_note_hash_and_nullifier,\n message_ciphertext,\n pending_tagged_log.context,\n );\n logs.remove(i);\n });\n\n // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n // executions.\n partial_notes::fetch_and_process_partial_note_completion_logs(\n contract_address,\n compute_note_hash_and_nullifier,\n );\n\n // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n validate_enqueued_notes_and_events(contract_address);\n}\n"
2415
2545
  },
2416
- "112": {
2546
+ "111": {
2417
2547
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
2418
2548
  "source": "use crate::messages::discovery::{ComputeNoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN};\n\nuse dep::protocol_types::{\n address::AztecAddress,\n constants::MAX_NOTE_HASHES_PER_TX,\n debug_log::debug_log_format,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub struct DiscoveredNoteInfo {\n pub note_nonce: Field,\n pub note_hash: Field,\n pub inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub unconstrained fn attempt_note_nonce_discovery<Env>(\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n contract_address: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n let discovered_notes = &mut BoundedVec::new();\n\n debug_log_format(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n );\n\n // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note hash,\n // is one of the note hashes created by the transaction.\n unique_note_hashes_in_tx.for_eachi(|i, expected_unique_note_hash| {\n // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the\n // new note hashes array. We therefore know for each note in every transaction what its nonce is.\n let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n // Given note nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n // the note hash at the array index we're currently processing.\n // TODO(#11157): handle failed note_hash_and_nullifier computation\n let hashes = compute_note_hash_and_nullifier(\n packed_note,\n storage_slot,\n note_type_id,\n contract_address,\n candidate_nonce,\n )\n .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n if unique_note_hash == expected_unique_note_hash {\n // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n // perform no validations on the nullifier - we fundamentally cannot, since only the application knows\n // how to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then\n // PXE may fail to realize that a given note has been nullified already, and calls to the application\n // could result in invalid transactions (with duplicate nullifiers). This is not a concern because an\n // application already has more direct means of making a call to it fail the transaction.\n discovered_notes.push(\n DiscoveredNoteInfo {\n note_nonce: candidate_nonce,\n note_hash: hashes.note_hash,\n inner_nullifier: hashes.inner_nullifier,\n },\n );\n\n // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n // multiple times in the same transaction with different nonces. This typically doesn't happen due to\n // notes containing random values in order to hide their contents.\n }\n });\n\n debug_log_format(\n \"Found valid nonces for a total of {0} notes\",\n [discovered_notes.len() as Field],\n );\n\n *discovered_notes\n}\n\nmod test {\n use crate::{\n messages::discovery::{NoteHashAndNullifier, private_notes::MAX_NOTE_PACKED_LEN},\n note::{\n note_interface::{NoteHash, NoteType},\n note_metadata::SettledNoteMetadata,\n retrieved_note::RetrievedNote,\n utils::compute_note_hash_for_nullify,\n },\n oracle::random::random,\n test::mocks::mock_note::MockNote,\n utils::array,\n };\n\n use dep::protocol_types::{\n address::AztecAddress,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::{FromField, Packable},\n };\n\n use super::attempt_note_nonce_discovery;\n\n // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n // implementation, and as a sanity check that the interface is sufficient.\n unconstrained fn compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: AztecAddress,\n note_nonce: Field,\n ) -> Option<NoteHashAndNullifier> {\n if note_type_id == MockNote::get_id() {\n let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n let note_hash = note.compute_note_hash(storage_slot);\n\n let note_hash_for_nullify = compute_note_hash_for_nullify(\n RetrievedNote {\n note,\n contract_address,\n metadata: SettledNoteMetadata::new(note_nonce).into(),\n },\n storage_slot,\n );\n\n let inner_nullifier = note.compute_nullifier_unconstrained(note_hash_for_nullify);\n\n Option::some(NoteHashAndNullifier { note_hash, inner_nullifier })\n } else {\n Option::none()\n }\n }\n\n global VALUE: Field = 7;\n global FIRST_NULLIFIER_IN_TX: Field = 47;\n global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n global STORAGE_SLOT: Field = 99;\n\n #[test]\n unconstrained fn no_note_hashes() {\n let unique_note_hashes_in_tx = BoundedVec::new();\n let packed_note = BoundedVec::new();\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n STORAGE_SLOT,\n MockNote::get_id(),\n packed_note,\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n #[test(should_fail_with = \"Failed to compute a note hash\")]\n unconstrained fn failed_hash_computation() {\n let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n let packed_note = BoundedVec::new();\n let note_type_id = 0; // This note type id is unknown to compute_note_hash_and_nullifier\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n STORAGE_SLOT,\n note_type_id,\n packed_note,\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n struct NoteAndData {\n note: MockNote,\n note_nonce: Field,\n note_hash: Field,\n unique_note_hash: Field,\n inner_nullifier: Field,\n }\n\n unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n let retrieved_note = MockNote::new(value)\n .contract_address(CONTRACT_ADDRESS)\n .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n .build_retrieved_note();\n let note = retrieved_note.note;\n\n let note_hash = note.compute_note_hash(STORAGE_SLOT);\n let unique_note_hash = compute_unique_note_hash(\n note_nonce,\n compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n );\n let inner_nullifier = note.compute_nullifier_unconstrained(compute_note_hash_for_nullify(\n retrieved_note,\n STORAGE_SLOT,\n ));\n\n NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n }\n\n #[test]\n unconstrained fn single_note() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n STORAGE_SLOT,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 1);\n let discovered_note = discovered_notes.get(0);\n\n assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n }\n\n #[test]\n unconstrained fn multiple_notes_same_preimage() {\n let first_note_index_in_tx = 3;\n let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n let second_note_index_in_tx = 5;\n let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n // call.\n assert_eq(first_note_and_data.note, second_note_and_data.note);\n let packed_note = first_note_and_data.note.pack();\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n STORAGE_SLOT,\n MockNote::get_id(),\n BoundedVec::from_array(packed_note),\n );\n\n assert_eq(discovered_notes.len(), 2);\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == first_note_and_data.note_nonce)\n & (discovered_note.note_hash == first_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n }));\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == second_note_and_data.note_nonce)\n & (discovered_note.note_hash == second_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n }));\n }\n}\n"
2419
2549
  },
2420
- "113": {
2550
+ "112": {
2421
2551
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
2422
2552
  "source": "use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n processing::{\n enqueue_note_for_validation, get_pending_partial_notes_completion_logs,\n log_retrieval_response::LogRetrievalResponse,\n },\n },\n utils::array,\n};\n\nuse protocol_types::{\n address::AztecAddress,\n debug_log::debug_log_format,\n hash::sha256_to_field,\n traits::{Deserialize, Serialize},\n};\n\nglobal PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 2;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private message\n/// (e.g. the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN;\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n pub(crate) note_completion_log_tag: Field,\n pub(crate) storage_slot: Field,\n pub(crate) note_type_id: Field,\n pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n pub(crate) recipient: AztecAddress,\n}\n\npub unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n let (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content) =\n decode_partial_note_private_msg(msg_metadata, msg_content);\n\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later search\n // for the public log that will complete it.\n let pending = DeliveredPendingPartialNote {\n note_completion_log_tag,\n storage_slot,\n note_type_id,\n packed_private_note_content,\n recipient,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n )\n .push(pending);\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_partial_note_completion_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n debug_log_format(\n \"{} pending partial notes\",\n [pending_partial_notes.len() as Field],\n );\n\n // Each of the pending partial notes might get completed by a log containing its public values. For performance\n // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n // waiting for the node roundtrip.\n let maybe_completion_logs =\n get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n // same index. This means we can use the same index as we iterate through the responses to get both the partial note\n // and the log that might complete it.\n assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n maybe_completion_logs.remove(i);\n\n let pending_partial_note = pending_partial_notes.get(i);\n\n if maybe_log.is_none() {\n debug_log_format(\n \"Found no completion logs for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n\n // Note that we're not removing the pending partial note from the capsule array, so we will continue\n // searching for this tagged log when performing message discovery in the future until we either find it or\n // the entry is somehow removed from the array.\n } else {\n debug_log_format(\n \"Completion log found for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n let log = maybe_log.unwrap();\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n // private and public packed fields (i.e. the contents of the private message and public log plaintext to get\n // the complete packed content.\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n log.log_payload,\n );\n\n let discovered_notes = attempt_note_nonce_discovery(\n log.unique_note_hashes_in_tx,\n log.first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n pending_partial_note.storage_slot,\n pending_partial_note.note_type_id,\n complete_packed_note,\n );\n\n // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note\n // being found?\n if discovered_notes.len() == 0 {\n panic(\n f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n );\n }\n\n debug_log_format(\n \"Discovered {0} notes for partial note with tag {1}\",\n [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n pending_partial_note.storage_slot,\n discovered_note.note_nonce,\n complete_packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n log.tx_hash,\n pending_partial_note.recipient,\n );\n });\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we\n // simply delete the pending work entry, regardless of whether it was actually completed or not.\n pending_partial_notes.remove(i);\n }\n });\n}\n\nfn decode_partial_note_private_msg(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>) {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n msg_content.len() > PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN,\n f\"Invalid private note message: all partial note private messages must have at least {PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n );\n\n // If PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the partial note private message encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN == 2,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_CONTENT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have two fields that are not the partial note's packed representation, which are the storage slot\n // and the note completion log tag.\n let storage_slot = msg_content.get(0);\n let note_completion_log_tag = msg_content.get(1);\n\n let packed_private_note_content = array::subbvec(msg_content, 2);\n\n (note_type_id, storage_slot, note_completion_log_tag, packed_private_note_content)\n}\n"
2423
2553
  },
2424
- "114": {
2554
+ "113": {
2425
2555
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
2426
- "source": "use crate::{\n event::event_selector::EventSelector,\n messages::{encoding::MAX_MESSAGE_CONTENT_LEN, processing::enqueue_event_for_validation},\n prelude::AztecAddress,\n utils::array,\n};\nuse protocol_types::{\n constants::GENERATOR_INDEX__EVENT_COMMITMENT, hash::poseidon2_hash_with_separator_bounded_vec,\n traits::FromField,\n};\n\n/// The number of fields in a private event message content that are not the event's serialized representation\n/// (1 field for randomness).\nglobal PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN: u32 = 1;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN;\n\npub unconstrained fn process_private_event_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n) {\n // In the case of events, the msg metadata is the event selector.\n let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n assert(\n msg_content.len() > PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n f\"Invalid private event message: all private event messages must have at least {PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the private event message encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN\",\n );\n\n let serialized_event_with_randomness = msg_content;\n\n let event_commitment = poseidon2_hash_with_separator_bounded_vec(\n serialized_event_with_randomness,\n GENERATOR_INDEX__EVENT_COMMITMENT,\n );\n\n // Randomness was injected into the event payload in `emit_event_in_private_log` but we have already used it\n // to compute the event commitment, so we can safely discard it now.\n let serialized_event = array::subbvec(\n serialized_event_with_randomness,\n PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n );\n\n enqueue_event_for_validation(\n contract_address,\n event_type_id,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n );\n}\n"
2556
+ "source": "use crate::{\n event::event_selector::EventSelector,\n messages::{encoding::MAX_MESSAGE_CONTENT_LEN, processing::enqueue_event_for_validation},\n utils::array,\n};\nuse protocol_types::{\n address::AztecAddress, constants::GENERATOR_INDEX__EVENT_COMMITMENT,\n hash::poseidon2_hash_with_separator_bounded_vec, traits::FromField,\n};\n\n/// The number of fields in a private event message content that are not the event's serialized representation\n/// (1 field for randomness).\nglobal PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN: u32 = 1;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN;\n\npub unconstrained fn process_private_event_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n) {\n // In the case of events, the msg metadata is the event selector.\n let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n assert(\n msg_content.len() > PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n f\"Invalid private event message: all private event messages must have at least {PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the private event message encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN\",\n );\n\n let serialized_event_with_randomness = msg_content;\n\n let event_commitment = poseidon2_hash_with_separator_bounded_vec(\n serialized_event_with_randomness,\n GENERATOR_INDEX__EVENT_COMMITMENT,\n );\n\n // Randomness was injected into the event payload in `emit_event_in_private_log` but we have already used it\n // to compute the event commitment, so we can safely discard it now.\n let serialized_event = array::subbvec(\n serialized_event_with_randomness,\n PRIVATE_EVENT_MSG_CONTENT_NON_EVENT_FIELDS_LEN,\n );\n\n enqueue_event_for_validation(\n contract_address,\n event_type_id,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n );\n}\n"
2427
2557
  },
2428
- "115": {
2558
+ "114": {
2429
2559
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
2430
2560
  "source": "use crate::{\n messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n processing::enqueue_note_for_validation,\n },\n utils::array,\n};\nuse protocol_types::{\n address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, debug_log::debug_log_format,\n};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\n// See the call to `std::static_assert` below to see what's in these fields.\nglobal PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN: u32 = 1;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN;\n\npub unconstrained fn process_private_note_msg<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n let (note_type_id, storage_slot, packed_note) =\n decode_private_note_msg(msg_metadata, msg_content);\n\n attempt_note_discovery(\n contract_address,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n recipient,\n compute_note_hash_and_nullifier,\n storage_slot,\n note_type_id,\n packed_note,\n );\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is\n/// suspected the note was created.\npub unconstrained fn attempt_note_discovery<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n storage_slot: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) {\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n storage_slot,\n note_type_id,\n packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes from a private message\",\n [discovered_notes.len() as Field],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n storage_slot,\n discovered_note.note_nonce,\n packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n tx_hash,\n recipient,\n );\n });\n}\n\nfn decode_private_note_msg(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>) {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n msg_content.len() > PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN,\n f\"Invalid private note message: all private note messages must have at least {PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the private note message encoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have a single field that is not the note's packed representation, which is the storage slot.\n let storage_slot = msg_content.get(0);\n let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_CONTENT_NON_NOTE_FIELDS_LEN);\n\n (note_type_id, storage_slot, packed_note)\n}\n"
2431
2561
  },
2432
- "116": {
2562
+ "115": {
2433
2563
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
2434
2564
  "source": "use crate::messages::{\n discovery::{\n ComputeNoteHashAndNullifier, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, private_notes::process_private_note_msg,\n },\n encoding::decode_message,\n encryption::{aes128::AES128, log_encryption::LogEncryption},\n msg_type::{\n PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID,\n },\n processing::message_context::MessageContext,\n};\n\nuse protocol_types::{\n address::AztecAddress,\n constants::PRIVATE_LOG_CIPHERTEXT_LEN,\n debug_log::{debug_log, debug_log_format},\n};\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier` function. Once\n/// discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved to\n/// search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn do_process_message<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n message_ciphertext: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n message_context: MessageContext,\n) {\n let message = AES128::decrypt_log(message_ciphertext, message_context.recipient);\n\n // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n // have 3 message types: private notes, partial notes and events.\n\n // We decode the message to obtain the message type id, metadata and content.\n let (msg_type_id, msg_metadata, msg_content) = decode_message(message);\n\n if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n debug_log(\"Processing private note msg\");\n\n process_private_note_msg(\n contract_address,\n message_context.tx_hash,\n message_context.unique_note_hashes_in_tx,\n message_context.first_nullifier_in_tx,\n message_context.recipient,\n compute_note_hash_and_nullifier,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n debug_log(\"Processing partial note private msg\");\n\n process_partial_note_private_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n debug_log(\"Processing private event msg\");\n\n process_private_event_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n message_context.tx_hash,\n );\n } else {\n debug_log_format(\"Unknown msg type id {0}\", [msg_type_id as Field]);\n }\n}\n"
2435
2565
  },
2436
- "117": {
2566
+ "116": {
2437
2567
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
2438
2568
  "source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::{\n messages::encryption::log_encryption::PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS, utils::array,\n};\n\npub global MAX_MESSAGE_LEN: u32 = PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS;\n\nglobal MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n// - an initial field called the 'expanded metadata'\n// - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n// - the upper 64 bits are the message type id\n// - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [ msg_type_id | msg_metadata ]\n// <--- 64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MAX_MESSAGE_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values into\n/// this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n std::static_assert(\n msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n // the message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n message[0] = to_expanded_metadata(msg_type, msg_metadata);\n for i in 0..msg_content.len() {\n message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n }\n\n message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n message: BoundedVec<Field, MAX_MESSAGE_LEN>,\n) -> (u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>) {\n assert(\n message.len() >= MESSAGE_EXPANDED_METADATA_LEN,\n f\"Invalid message: it must have at least {MESSAGE_EXPANDED_METADATA_LEN} fields\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of\n // the message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n\n let msg_expanded_metadata = message.get(0);\n let (msg_type_id, msg_metadata) = from_expanded_metadata(msg_expanded_metadata);\n let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n\n (msg_type_id, msg_metadata, msg_content)\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n // expensive in circuits.\n let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n let msg_metadata_field = msg_metadata as Field;\n\n type_field + msg_metadata_field\n}\n\nfn from_expanded_metadata(input: Field) -> (u64, u64) {\n input.assert_max_bit_size::<128>();\n let msg_metadata = (input as u64);\n let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n // Use division instead of bit shift since bit shifts are expensive in circuits\n (msg_type, msg_metadata)\n}\n\nmod tests {\n use crate::utils::array::subarray::subarray;\n use super::{\n decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN,\n to_expanded_metadata,\n };\n\n global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n global U128_MAX: Field = (2.pow_32(128) - 1);\n\n #[test]\n unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n let encoded = encode_message(msg_type, msg_metadata, []);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), 0);\n }\n\n #[test]\n unconstrained fn encode_decode_short_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn encode_decode_full_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn to_expanded_metadata_packing() {\n // Test case 1: All bits set\n let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let packed = to_expanded_metadata(U64_MAX, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let packed = to_expanded_metadata(0, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let packed = to_expanded_metadata(0, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn from_expanded_metadata_packing() {\n // Test case 1: All bits set\n let input = U128_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let input = (U128_MAX - U64_MAX as Field);\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let input = U64_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let input = 0;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed);\n\n assert_eq(original_msg_type, unpacked_msg_type);\n assert_eq(original_msg_metadata, unpacked_msg_metadata);\n }\n}\n"
2439
2569
  },
2440
- "118": {
2570
+ "117": {
2441
2571
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
2442
- "source": "use dep::protocol_types::{\n constants::{\n GENERATOR_INDEX__SYMMETRIC_KEY, GENERATOR_INDEX__SYMMETRIC_KEY_2,\n PRIVATE_LOG_CIPHERTEXT_LEN,\n },\n hash::poseidon2_hash_with_separator,\n point::Point,\n};\n\nuse crate::{\n keys::{\n ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n ephemeral::generate_ephemeral_key_pair,\n },\n messages::{\n encryption::log_encryption::{\n EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS,\n HEADER_CIPHERTEXT_SIZE_IN_BYTES, LogEncryption, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS,\n },\n logs::arithmetic_generics_utils::{\n get_arr_of_size__log_bytes__from_PT, get_arr_of_size__log_bytes_padding__from_PT,\n },\n },\n oracle::{aes128_decrypt::aes128_decrypt_oracle, shared_secret::get_shared_secret},\n prelude::AztecAddress,\n utils::{\n array,\n conversion::{\n bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n },\n point::{get_sign_of_point, point_from_x_coord_and_sign, point_to_bytes},\n random::get_random_bytes,\n },\n};\n\nuse std::aes128::aes128_encrypt;\n\nfn extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2(\n shared_secret: Point,\n) -> [u8; 32] {\n let rand1: Field = poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n GENERATOR_INDEX__SYMMETRIC_KEY,\n );\n let rand2: Field = poseidon2_hash_with_separator(\n [shared_secret.x, shared_secret.y],\n GENERATOR_INDEX__SYMMETRIC_KEY_2,\n );\n let rand1_bytes: [u8; 16] = rand1.to_le_bytes();\n let rand2_bytes: [u8; 16] = rand2.to_le_bytes();\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n bytes[i] = rand1_bytes[i];\n bytes[i + 1] = rand2_bytes[i];\n }\n bytes\n}\n\n// TODO(#10537): Consider nuking this function.\nfn extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_sha256(\n shared_secret: Point,\n) -> [u8; 32] {\n let shared_secret_bytes: [u8; 32] = point_to_bytes(shared_secret);\n\n let mut shared_secret_bytes_with_separator: [u8; 33] = std::mem::zeroed();\n for i in 0..shared_secret_bytes.len() {\n shared_secret_bytes_with_separator[i] = shared_secret_bytes[i];\n }\n shared_secret_bytes_with_separator[32] = GENERATOR_INDEX__SYMMETRIC_KEY;\n\n sha256::digest(shared_secret_bytes_with_separator)\n}\n\nfn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret: Point,\n randomness_extraction_fn: fn(Point) -> [u8; 32],\n) -> ([u8; 16], [u8; 16]) {\n let random_256_bits = randomness_extraction_fn(shared_secret);\n let mut sym_key = [0; 16];\n let mut iv = [0; 16];\n for i in 0..16 {\n sym_key[i] = random_256_bits[i];\n iv[i] = random_256_bits[i + 16];\n }\n (sym_key, iv)\n}\n\n// TODO(#10537): Consider nuking this function.\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n shared_secret: Point,\n) -> ([u8; 16], [u8; 16]) {\n derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret,\n extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_sha256,\n )\n}\n\n// TODO(#10537): This function is currently unused. Consider using it instead of the sha256 one.\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2(\n shared_secret: Point,\n) -> ([u8; 16], [u8; 16]) {\n derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret(\n shared_secret,\n extract_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2,\n )\n}\n\npub struct AES128 {}\n\nimpl LogEncryption for AES128 {\n fn encrypt_log<let PLAINTEXT_LEN: u32>(\n plaintext: [Field; PLAINTEXT_LEN],\n recipient: AztecAddress,\n ) -> [Field; PRIVATE_LOG_CIPHERTEXT_LEN] {\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes.\n // (This process is then reversed when processing the log in `do_process_log`)\n let plaintext_bytes = fields_to_bytes(plaintext);\n\n // *****************************************************************************\n // Compute the shared secret\n // *****************************************************************************\n\n let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n // (not to be confused with the tagging shared secret)\n let ciphertext_shared_secret =\n derive_ecdh_shared_secret_using_aztec_address(eph_sk, recipient);\n\n // TODO: also use this shared secret for deriving note randomness.\n\n // *****************************************************************************\n // Convert the plaintext into whatever format the encryption function expects\n // *****************************************************************************\n\n // Already done for this strategy: AES expects bytes.\n\n // *****************************************************************************\n // Encrypt the plaintext\n // *****************************************************************************\n\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, iv, sym_key);\n\n // |full_pt| = |pt_length| + |pt|\n // |pt_aes_padding| = 16 - (|full_pt| % 16)\n // or... since a % b is the same as a - b * (a // b) (integer division), so:\n // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // |ct| = |full_pt| + |pt_aes_padding|\n // = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // = 16 + 16 * (|full_pt| // 16)\n // = 16 * (1 + |full_pt| // 16)\n assert(ciphertext_bytes.len() == 16 * (1 + (PLAINTEXT_LEN * 32) / 16));\n\n // *****************************************************************************\n // Compute the header ciphertext\n // *****************************************************************************\n\n // Header contains only the length of the ciphertext stored in 2 bytes.\n // TODO: consider nuking the header altogether and just have a fixed-size ciphertext by padding the plaintext.\n // This would be more costly constraint-wise but cheaper DA-wise.\n let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n let ciphertext_bytes_length = ciphertext_bytes.len();\n header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n header_plaintext[1] = ciphertext_bytes_length as u8;\n\n // TODO: this is insecure and wasteful:\n // \"Insecure\", because the esk shouldn't be used twice (once for the header,\n // and again for the proper ciphertext) (at least, I never got the\n // \"go ahead\" that this would be safe, unfortunately).\n // \"Wasteful\", because the exact same computation is happening further down.\n // I'm leaving that 2nd computation where it is, because this 1st computation\n // will be imminently deleted, when the header logic is deleted.\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the\n // input, according to pkcs#7; hence why the output `header_ciphertext_bytes` is 16\n // bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, iv, sym_key);\n // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n assert(header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES);\n\n // *****************************************************************************\n // Prepend / append more bytes of data to the ciphertext, before converting back\n // to fields.\n // *****************************************************************************\n\n let mut log_bytes_padding_to_mult_31 =\n get_arr_of_size__log_bytes_padding__from_PT::<PLAINTEXT_LEN * 32>();\n // Safety: this randomness won't be constrained to be random. It's in the\n // interest of the executor of this fn to encrypt with random bytes.\n log_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n let mut log_bytes = get_arr_of_size__log_bytes__from_PT::<PLAINTEXT_LEN * 32>();\n\n assert(\n log_bytes.len() % 31 == 0,\n \"Unexpected error: log_bytes.len() should be divisible by 31, by construction.\",\n );\n\n log_bytes[0] = eph_pk_sign_byte;\n let mut offset = 1;\n for i in 0..header_ciphertext_bytes.len() {\n log_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n log_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..log_bytes_padding_to_mult_31.len() {\n log_bytes[offset + i] = log_bytes_padding_to_mult_31[i];\n }\n\n assert(\n offset + log_bytes_padding_to_mult_31.len() == log_bytes.len(),\n \"Something has gone wrong\",\n );\n\n // *****************************************************************************\n // Convert bytes back to fields\n // *****************************************************************************\n\n // TODO(#12749): As Mike pointed out, we need to make logs produced by different encryption schemes\n // indistinguishable from each other and for this reason the output here and in the last for-loop of this function\n // should cover a full field.\n let log_bytes_as_fields = bytes_to_fields(log_bytes);\n\n // *****************************************************************************\n // Prepend / append fields, to create the final log\n // *****************************************************************************\n\n let mut ciphertext: [Field; PRIVATE_LOG_CIPHERTEXT_LEN] = [0; PRIVATE_LOG_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n let mut offset = 1;\n for i in 0..log_bytes_as_fields.len() {\n ciphertext[offset + i] = log_bytes_as_fields[i];\n }\n offset += log_bytes_as_fields.len();\n\n for i in offset..PRIVATE_LOG_CIPHERTEXT_LEN {\n // We need to get a random value that fits in 31 bytes to not leak information about the size of the log\n // (all the \"real\" log fields contain at most 31 bytes because of the way we convert the bytes to fields).\n // TODO(#12749): Long term, this is not a good solution.\n\n // Safety: we assume that the sender wants for the log to be private - a malicious one could simply reveal its\n // contents publicly. It is therefore fine to trust the sender to provide random padding.\n let field_bytes = unsafe { get_random_bytes::<31>() };\n ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt_log(\n ciphertext: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> BoundedVec<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS> {\n let eph_pk_x = ciphertext.get(0);\n\n let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, PRIVATE_LOG_CIPHERTEXT_LEN, PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n ciphertext,\n EPH_PK_X_SIZE_IN_FIELDS,\n );\n\n // Convert the ciphertext represented as fields to a byte representation (its original format)\n let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n // First byte of the ciphertext represents the ephemeral public key sign\n let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) != 0;\n // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point\n let eph_pk = point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool);\n\n // Derive shared secret and symmetric key\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n let (sym_key, iv) = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_sha256(\n ciphertext_shared_secret,\n );\n\n // Extract the header ciphertext\n let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\n let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to work\n // with logs with unknown length at compile time. This would not be necessary here as the header ciphertext length\n // is fixed. But we do it anyway to not have to have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n // Decrypt header\n let header_plaintext = aes128_decrypt_oracle(header_ciphertext_bvec, iv, sym_key);\n\n // Extract ciphertext length from header (2 bytes, big-endian)\n let ciphertext_length =\n ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n // Decrypt main ciphertext and return it\n let plaintext_bytes = aes128_decrypt_oracle(ciphertext, iv, sym_key);\n\n // Each field of the original note log was serialized to 32 bytes so we convert the bytes back to fields.\n fields_from_bytes(plaintext_bytes)\n }\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n messages::encryption::log_encryption::{LogEncryption, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS},\n test::helpers::test_environment::TestEnvironment,\n };\n use super::AES128;\n use protocol_types::{\n address::AztecAddress,\n indexed_tagging_secret::IndexedTaggingSecret,\n traits::{Deserialize, FromField},\n };\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_log() {\n let mut env = TestEnvironment::new();\n // Advance 1 block so we can read historic state from private\n env.advance_block_by(1);\n\n let plaintext = [1, 2, 3];\n\n let recipient = AztecAddress::from_field(\n 0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n );\n\n // Mock random values for deterministic test\n let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n let _ = OracleMock::mock(\"getRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"getRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"getIndexedTaggingSecretAsSender\").returns(\n IndexedTaggingSecret::deserialize([69420, 1337]),\n );\n let _ = OracleMock::mock(\"incrementAppTaggingSecretIndexAsSender\").returns(());\n\n // Encrypt the log\n let encrypted_log = BoundedVec::from_array(AES128::encrypt_log(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret_using_aztec_address(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient,\n );\n let _ = OracleMock::mock(\"getSharedSecret\").returns(shared_secret);\n\n // Decrypt the log\n let decrypted = AES128::decrypt_log(encrypted_log, recipient);\n\n // The decryption function spits out a BoundedVec because it's designed to work with logs with unknown length\n // at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec =\n BoundedVec::<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS>::from_array(plaintext);\n\n // Verify decryption matches original plaintext\n assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n // static methods of the struct).\n let _ = AES128 {};\n }\n}\n"
2572
+ "source": "use dep::protocol_types::{\n address::AztecAddress,\n constants::{\n GENERATOR_INDEX__SYMMETRIC_KEY, GENERATOR_INDEX__SYMMETRIC_KEY_2,\n PRIVATE_LOG_CIPHERTEXT_LEN,\n },\n hash::poseidon2_hash_with_separator,\n point::Point,\n};\n\nuse crate::{\n keys::{\n ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n ephemeral::generate_ephemeral_key_pair,\n },\n messages::{\n encryption::log_encryption::{\n EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS,\n HEADER_CIPHERTEXT_SIZE_IN_BYTES, LogEncryption, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS,\n },\n logs::arithmetic_generics_utils::{\n get_arr_of_size__log_bytes__from_PT, get_arr_of_size__log_bytes_padding__from_PT,\n },\n },\n oracle::{aes128_decrypt::aes128_decrypt_oracle, shared_secret::get_shared_secret},\n utils::{\n array,\n conversion::{\n bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n },\n point::{get_sign_of_point, point_from_x_coord_and_sign},\n random::get_random_bytes,\n },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/**\n * Computes N close-to-uniformly-random 256 bits from a given ECDH shared_secret.\n *\n * NEVER re-use the same iv and sym_key.\n * DO NOT call this function more than once with the same shared_secret.\n *\n * This function is only known to be safe if shared_secret is computed by combining a \n * random ephemeral key with an address point. See big comment within the body of the function.\n * See big comment within the body of the function.\n */\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [[u8; 32]; N] {\n /*\n * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two paragraphs below it).\n *\n * If you call this function, you need to be careful and aware of how the arg\n * `shared_secret` has been derived.\n *\n * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two exponents x & y which multiply to the shared secret S:\n *\n * S = [x*y]*G.\n *\n * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K\n * which can be public and compute Hash(x) as poseidon(K,x)).\n * In that lemma, k would be 2*254=508, and m would be the number of points on the * grumpkin curve (which is close to r according to the Hasse bound).\n *\n * Our shared secret S is [esk * address_sk] * G, and the question is: * Can we compute hash(S) using poseidon2 instead of sha256?\n *\n * Well, esk is random and not generated with poseidon2, so that's good.\n * What about address_sk?\n * Well, address_sk = poseidon2(stuff) + ivsk, so there was some\n * discussion about whether address_sk is independent of poseidon2.\n * Given that ivsk is random and independent of poseidon2, the address_sk is also\n * independent of poseidon2.\n *\n * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2,\n * in order to derive a symmetric key.\n *\n * If you're calling this function for a differently-derived `shared_secret`, be\n * careful.\n *\n */\n\n /* The output of this function needs to be 32 random bytes.\n * A single field won't give us 32 bytes of entropy.\n * So we compute two \"random\" fields, by poseidon-hashing with two different\n * generators.\n * We then extract the last 16 (big endian) bytes of each \"random\" field.\n * Note: we use to_be_bytes because it's slightly more efficient. But we have to\n * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n * not uniformly random over the byte: it only has < 6 bits of randomness, because\n * it's the big end of a 254-bit field element.\n */\n\n let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n // We restrict N to be < 2^8, because of how we compute the domain separator\n // from k below (where k <= N must be 8 bits). In practice, it's extremely\n // unlikely that an app will want to compute >= 256 ciphertexts.\n std::static_assert(N < 256, \"N too large\");\n for k in 0..N {\n // We augment the domain separator with the loop index, so that we can\n // generate N lots of randomness.\n let k_shift = (k as u16 << 8);\n let separator_1 = k_shift + GENERATOR_INDEX__SYMMETRIC_KEY as u16;\n let separator_2 = k_shift + GENERATOR_INDEX__SYMMETRIC_KEY_2 as u16;\n\n let rand1: Field =\n poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n let rand2: Field =\n poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\n\n let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n // We take bytes from the \"little end\" of the be-bytes arrays:\n let j = 32 - i - 1;\n bytes[i] = rand1_bytes[j];\n bytes[16 + i] = rand2_bytes[j];\n }\n\n all_bytes[k] = bytes;\n }\n\n all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n // Many (sym_key, iv) pairs:\n let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n for k in 0..N {\n let random_256_bits = many_random_256_bits[k];\n let mut sym_key = [0; 16];\n let mut iv = [0; 16];\n for i in 0..16 {\n sym_key[i] = random_256_bits[i];\n iv[i] = random_256_bits[i + 16];\n }\n many_pairs[k] = (sym_key, iv);\n }\n\n many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n let many_random_256_bits: [[u8; 32]; N] = extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(\n shared_secret,\n );\n\n derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl LogEncryption for AES128 {\n fn encrypt_log<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n ) -> [Field; PRIVATE_LOG_CIPHERTEXT_LEN] {\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes.\n // (This process is then reversed when processing the log in `do_process_log`)\n let plaintext_bytes = fields_to_bytes(plaintext);\n\n // *****************************************************************************\n // Compute the shared secret\n // *****************************************************************************\n\n let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n // (not to be confused with the tagging shared secret)\n let ciphertext_shared_secret =\n derive_ecdh_shared_secret_using_aztec_address(eph_sk, recipient);\n // TODO: also use this shared secret for deriving note randomness.\n\n // *****************************************************************************\n // Convert the plaintext into whatever format the encryption function expects\n // *****************************************************************************\n\n // Already done for this strategy: AES expects bytes.\n\n // *****************************************************************************\n // Encrypt the plaintext\n // *****************************************************************************\n\n // It is safe to call the `unsafe` function here, because we know the `shared_secret`\n // was derived using an AztecAddress (the recipient). See the block comment\n // at the start of this unsafe target function for more info.\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n // |full_pt| = |pt_length| + |pt|\n // |pt_aes_padding| = 16 - (|full_pt| % 16)\n // or... since a % b is the same as a - b * (a // b) (integer division), so:\n // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // |ct| = |full_pt| + |pt_aes_padding|\n // = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // = 16 + 16 * (|full_pt| // 16)\n // = 16 * (1 + |full_pt| // 16)\n assert(ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16));\n\n // *****************************************************************************\n // Compute the header ciphertext\n // *****************************************************************************\n\n // Header contains only the length of the ciphertext stored in 2 bytes.\n let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n let ciphertext_bytes_length = ciphertext_bytes.len();\n header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n header_plaintext[1] = ciphertext_bytes_length as u8;\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the\n // input, according to pkcs#7; hence why the output `header_ciphertext_bytes` is 16\n // bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n assert(header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES);\n\n // *****************************************************************************\n // Prepend / append more bytes of data to the ciphertext, before converting back\n // to fields.\n // *****************************************************************************\n\n let mut log_bytes_padding_to_mult_31 =\n get_arr_of_size__log_bytes_padding__from_PT::<PlaintextLen * 32>();\n // Safety: this randomness won't be constrained to be random. It's in the\n // interest of the executor of this fn to encrypt with random bytes.\n log_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n let mut log_bytes = get_arr_of_size__log_bytes__from_PT::<PlaintextLen * 32>();\n\n assert(\n log_bytes.len() % 31 == 0,\n \"Unexpected error: log_bytes.len() should be divisible by 31, by construction.\",\n );\n\n log_bytes[0] = eph_pk_sign_byte;\n let mut offset = 1;\n for i in 0..header_ciphertext_bytes.len() {\n log_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n log_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..log_bytes_padding_to_mult_31.len() {\n log_bytes[offset + i] = log_bytes_padding_to_mult_31[i];\n }\n\n assert(\n offset + log_bytes_padding_to_mult_31.len() == log_bytes.len(),\n \"Something has gone wrong\",\n );\n\n // *****************************************************************************\n // Convert bytes back to fields\n // *****************************************************************************\n\n // TODO(#12749): As Mike pointed out, we need to make logs produced by different encryption schemes\n // indistinguishable from each other and for this reason the output here and in the last for-loop of this function\n // should cover a full field.\n let log_bytes_as_fields = bytes_to_fields(log_bytes);\n\n // *****************************************************************************\n // Prepend / append fields, to create the final log\n // *****************************************************************************\n\n let mut ciphertext: [Field; PRIVATE_LOG_CIPHERTEXT_LEN] = [0; PRIVATE_LOG_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n let mut offset = 1;\n for i in 0..log_bytes_as_fields.len() {\n ciphertext[offset + i] = log_bytes_as_fields[i];\n }\n offset += log_bytes_as_fields.len();\n\n for i in offset..PRIVATE_LOG_CIPHERTEXT_LEN {\n // We need to get a random value that fits in 31 bytes to not leak information about the size of the log\n // (all the \"real\" log fields contain at most 31 bytes because of the way we convert the bytes to fields).\n // TODO(#12749): Long term, this is not a good solution.\n\n // Safety: we assume that the sender wants for the log to be private - a malicious one could simply reveal its\n // contents publicly. It is therefore fine to trust the sender to provide random padding.\n let field_bytes = unsafe { get_random_bytes::<31>() };\n ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt_log(\n ciphertext: BoundedVec<Field, PRIVATE_LOG_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> BoundedVec<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS> {\n let eph_pk_x = ciphertext.get(0);\n\n let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, PRIVATE_LOG_CIPHERTEXT_LEN, PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n ciphertext,\n EPH_PK_X_SIZE_IN_FIELDS,\n );\n\n // Convert the ciphertext represented as fields to a byte representation (its original format)\n let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n // First byte of the ciphertext represents the ephemeral public key sign\n let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) != 0;\n // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point\n let eph_pk = point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool);\n\n // Derive shared secret\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n // Derive symmetric keys:\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n // Extract the header ciphertext\n let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\n let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to work\n // with logs with unknown length at compile time. This would not be necessary here as the header ciphertext length\n // is fixed. But we do it anyway to not have to have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n // Decrypt header\n let header_plaintext =\n aes128_decrypt_oracle(header_ciphertext_bvec, header_iv, header_sym_key);\n\n // Extract ciphertext length from header (2 bytes, big-endian)\n let ciphertext_length =\n ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, (PRIVATE_LOG_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n // Decrypt main ciphertext and return it\n let plaintext_bytes = aes128_decrypt_oracle(ciphertext, body_iv, body_sym_key);\n\n // Each field of the original note log was serialized to 32 bytes so we convert the bytes back to fields.\n fields_from_bytes(plaintext_bytes)\n }\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::derive_ecdh_shared_secret_using_aztec_address,\n messages::encryption::log_encryption::{LogEncryption, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS},\n test::helpers::test_environment::TestEnvironment,\n };\n use super::AES128;\n use protocol_types::{\n address::AztecAddress,\n indexed_tagging_secret::IndexedTaggingSecret,\n traits::{Deserialize, FromField},\n };\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_log() {\n let env = TestEnvironment::new();\n\n // Log decryption requires oracles that are only available during private execution\n env.private_context(|_| {\n let plaintext = [1, 2, 3];\n\n let recipient = AztecAddress::from_field(\n 0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n );\n\n // Mock random values for deterministic test\n let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"utilityGetIndexedTaggingSecretAsSender\").returns(\n IndexedTaggingSecret::deserialize([69420, 1337]),\n );\n let _ = OracleMock::mock(\"privateIncrementAppTaggingSecretIndexAsSender\").returns(());\n\n // Encrypt the log\n let encrypted_log = BoundedVec::from_array(AES128::encrypt_log(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret_using_aztec_address(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient,\n );\n let _ = OracleMock::mock(\"utilityGetSharedSecret\").returns(shared_secret);\n\n // Decrypt the log\n let decrypted = AES128::decrypt_log(encrypted_log, recipient);\n\n // The decryption function spits out a BoundedVec because it's designed to work with logs with unknown length\n // at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec =\n BoundedVec::<Field, PRIVATE_LOG_PLAINTEXT_SIZE_IN_FIELDS>::from_array(plaintext);\n\n // Verify decryption matches original plaintext\n assert_eq(\n decrypted,\n plaintext_bvec,\n \"Decrypted bytes should match original plaintext\",\n );\n\n // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n // static methods of the struct).\n let _ = AES128 {};\n });\n }\n}\n"
2443
2573
  },
2444
- "134": {
2574
+ "133": {
2445
2575
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
2446
2576
  "source": "pub(crate) mod event_validation_request;\npub mod message_context;\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n capsules::CapsuleArray,\n event::event_selector::EventSelector,\n messages::{\n discovery::{\n partial_notes::DeliveredPendingPartialNote, private_events::MAX_EVENT_SERIALIZED_LEN,\n private_notes::MAX_NOTE_PACKED_LEN,\n },\n processing::{\n log_retrieval_request::LogRetrievalRequest,\n log_retrieval_response::LogRetrievalResponse,\n note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n },\n },\n oracle,\n};\nuse event_validation_request::EventValidationRequest;\nuse protocol_types::{address::AztecAddress, hash::sha256_to_field};\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\nglobal PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for one of the local accounts,\n/// and stores them in a `CapsuleArray` which is then returned.\npub(crate) unconstrained fn get_private_logs(\n contract_address: AztecAddress,\n) -> CapsuleArray<PendingTaggedLog> {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\n}\n\n/// Enqueues a note for validation by PXE, so that it becomes aware of a note's existence allowing for later retrieval\n/// via `get_notes` oracle. The note will be scoped to `contract_address`, meaning other contracts will not be able to\n/// access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_enqueued_notes_and_events` must be later called.\n/// For optimal performance, accumulate as many note validation requests as possible and then validate them all at the\n/// end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value\n/// is typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are\n/// the inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and\n/// `NoteHash::compute_nullifier`. PXE will verify that the siloed unique note hash was inserted into the tree\n/// at `tx_hash`, and will store the nullifier to later check for nullification.\n///\n/// `recipient` is the account to which the note was sent to. Other accounts will not be able to access this note (e.g.\n/// other accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized.\npub(crate) unconstrained fn enqueue_note_for_validation(\n contract_address: AztecAddress,\n storage_slot: Field,\n note_nonce: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `NoteValidationRequest`\n CapsuleArray::at(contract_address, NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n NoteValidationRequest {\n contract_address,\n storage_slot,\n note_nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Enqueues an event for validation by PXE, so that it can be efficiently validated and then inserted into the event\n/// store.\n///\n/// In order for the event validation and insertion to occur, `validate_enqueued_notes_and_events` must be later\n/// called. For optimal performance, accumulate as many event validation requests as possible and then validate them\n/// all at the end (which results in PXE minimizing the number of network round-trips).\npub(crate) unconstrained fn enqueue_event_for_validation(\n contract_address: AztecAddress,\n event_type_id: EventSelector,\n serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n event_commitment: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `EventValidationRequest`\n CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n EventValidationRequest {\n contract_address,\n event_type_id,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Validates all note and event validation requests enqueued via `enqueue_note_for_validation` and\n/// `enqueue_event_for_validation`, inserting them into the note database and event store respectively, making them\n/// queryable via `get_notes` oracle and our TS API (PXE::getPrivateEvents).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub(crate) unconstrained fn validate_enqueued_notes_and_events(contract_address: AztecAddress) {\n oracle::message_processing::validate_enqueued_notes_and_events(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options for\n/// the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents\n/// `[some(p1_log), none(), some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n let log_retrieval_requests =\n CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n // the requests array, which we expect to be empty.\n let mut i = 0;\n let pending_partial_notes_count = pending_partial_notes.len();\n while i < pending_partial_notes_count {\n let pending_partial_note = pending_partial_notes.get(i);\n log_retrieval_requests.push(\n LogRetrievalRequest {\n contract_address,\n unsiloed_tag: pending_partial_note.note_completion_log_tag,\n },\n );\n i += 1;\n }\n\n oracle::message_processing::bulk_retrieve_logs(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n );\n\n CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
2447
2577
  },
2448
- "154": {
2578
+ "152": {
2449
2579
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/call_private_function.nr",
2450
- "source": "use dep::protocol_types::{\n abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader,\n};\n\n#[oracle(callPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args_hash: Field,\n _start_side_effect_counter: u32,\n _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n start_side_effect_counter: u32,\n is_static_call: bool,\n) -> (u32, Field) {\n let fields = call_private_function_oracle(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n );\n\n let mut reader = Reader::new(fields);\n let end_side_effect_counter = reader.read_u32();\n let returns_hash = reader.read();\n\n (end_side_effect_counter, returns_hash)\n}\n"
2580
+ "source": "use dep::protocol_types::{\n abis::function_selector::FunctionSelector, address::AztecAddress, utils::reader::Reader,\n};\n\n#[oracle(privateCallPrivateFunction)]\nunconstrained fn call_private_function_oracle(\n _contract_address: AztecAddress,\n _function_selector: FunctionSelector,\n _args_hash: Field,\n _start_side_effect_counter: u32,\n _is_static_call: bool,\n) -> [Field; 2] {}\n\npub unconstrained fn call_private_function_internal(\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n start_side_effect_counter: u32,\n is_static_call: bool,\n) -> (u32, Field) {\n let fields = call_private_function_oracle(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n );\n\n let mut reader = Reader::new(fields);\n let end_side_effect_counter = reader.read_u32();\n let returns_hash = reader.read();\n\n (end_side_effect_counter, returns_hash)\n}\n"
2451
2581
  },
2452
- "155": {
2582
+ "153": {
2453
2583
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
2454
- "source": "use protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T, let N: u32>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize<N>,\n{\n let serialized = value.serialize();\n store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none() if\n/// nothing was stored at the given slot.\npub unconstrained fn load<T, let N: u32>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize<N>,\n{\n let serialized_option = load_oracle::<N>(contract_address, slot, N);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`.\n/// Supports overlapping source and destination regions (which will result in the overlapped source values being\n/// overwritten). All copied slots must exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(storeCapsule)]\nunconstrained fn store_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n values: [Field; N],\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the expected\n/// shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(loadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(deleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(copyCapsule)]\nunconstrained fn copy_oracle(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::mock_struct::MockStruct},\n };\n use protocol_types::{address::AztecAddress, traits::{FromField, ToField}};\n\n unconstrained fn setup() -> AztecAddress {\n let env = TestEnvironment::new();\n env.contract_address()\n }\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), value);\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let contract_address = setup();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let contract_address = setup();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n delete(contract_address, SLOT);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let contract_address = setup();\n\n delete(contract_address, SLOT);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let contract_address = setup();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 10;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let contract_address = setup();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 2;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let contract_address = setup();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 1;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let contract_address = setup();\n\n copy(contract_address, SLOT, SLOT, 1);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let contract_address = setup();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0);\n }\n}\n"
2584
+ "source": "use protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize,\n{\n let serialized = value.serialize();\n store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none() if\n/// nothing was stored at the given slot.\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize,\n{\n let serialized_option = load_oracle(contract_address, slot, <T as Deserialize>::N);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`.\n/// Supports overlapping source and destination regions (which will result in the overlapped source values being\n/// overwritten). All copied slots must exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(utilityStoreCapsule)]\nunconstrained fn store_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n values: [Field; N],\n) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the expected\n/// shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(utilityLoadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(utilityDeleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(utilityCopyCapsule)]\nunconstrained fn copy_oracle(\n contract_address: AztecAddress,\n src_slot: Field,\n dst_slot: Field,\n num_entries: u32,\n) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::mock_struct::MockStruct},\n };\n use protocol_types::{address::AztecAddress, traits::{FromField, ToField}};\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), value);\n });\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n });\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n delete(contract_address, SLOT);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n delete(contract_address, SLOT);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 10;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 2;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 1;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n });\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n copy(contract_address, SLOT, SLOT, 1);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let env = TestEnvironment::_new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0);\n });\n }\n}\n"
2455
2585
  },
2456
- "156": {
2586
+ "154": {
2457
2587
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
2458
- "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(notifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_enqueued_public_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\n#[oracle(notifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_set_public_teardown_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(notifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n"
2588
+ "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(privateNotifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_enqueued_public_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\n#[oracle(privateNotifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to process this call.\n unsafe {\n notify_set_public_teardown_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(privateNotifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n"
2459
2589
  },
2460
- "157": {
2590
+ "155": {
2461
2591
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
2462
- "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(getContractAddress)]\nunconstrained fn get_contract_address_oracle() -> AztecAddress {}\n\n#[oracle(getBlockNumber)]\nunconstrained fn get_block_number_oracle() -> u32 {}\n\n#[oracle(getTimestamp)]\nunconstrained fn get_timestamp_oracle() -> u64 {}\n\n#[oracle(getChainId)]\nunconstrained fn get_chain_id_oracle() -> Field {}\n\n#[oracle(getVersion)]\nunconstrained fn get_version_oracle() -> Field {}\n\npub unconstrained fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\npub unconstrained fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\npub unconstrained fn get_timestamp() -> u64 {\n get_timestamp_oracle()\n}\n\npub unconstrained fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\npub unconstrained fn get_version() -> Field {\n get_version_oracle()\n}\n"
2592
+ "source": "use dep::protocol_types::address::AztecAddress;\n\n#[oracle(utilityGetContractAddress)]\nunconstrained fn get_contract_address_oracle() -> AztecAddress {}\n\n#[oracle(utilityGetBlockNumber)]\nunconstrained fn get_block_number_oracle() -> u32 {}\n\n#[oracle(utilityGetTimestamp)]\nunconstrained fn get_timestamp_oracle() -> u64 {}\n\n#[oracle(utilityGetChainId)]\nunconstrained fn get_chain_id_oracle() -> Field {}\n\n#[oracle(utilityGetVersion)]\nunconstrained fn get_version_oracle() -> Field {}\n\npub unconstrained fn get_contract_address() -> AztecAddress {\n get_contract_address_oracle()\n}\n\npub unconstrained fn get_block_number() -> u32 {\n get_block_number_oracle()\n}\n\npub unconstrained fn get_timestamp() -> u64 {\n get_timestamp_oracle()\n}\n\npub unconstrained fn get_chain_id() -> Field {\n get_chain_id_oracle()\n}\n\npub unconstrained fn get_version() -> Field {\n get_version_oracle()\n}\n"
2463
2593
  },
2464
- "167": {
2594
+ "165": {
2465
2595
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
2466
- "source": "use protocol_types::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(fetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate\n// all notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {\n validate_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n );\n}\n\n#[oracle(validateEnqueuedNotesAndEvents)]\nunconstrained fn validate_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {\n bulk_retrieve_logs_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n );\n}\n\n#[oracle(bulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {}\n"
2596
+ "source": "use protocol_types::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(utilityFetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate\n// all notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {\n validate_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n );\n}\n\n#[oracle(utilityValidateEnqueuedNotesAndEvents)]\nunconstrained fn validate_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {\n bulk_retrieve_logs_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n );\n}\n\n#[oracle(utilityBulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {}\n"
2467
2597
  },
2468
2598
  "17": {
2469
2599
  "path": "std/field/bn254.nr",
2470
2600
  "source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\nglobal PLO: Field = 53438638232309528389504892708671455233;\nglobal PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 128 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low = (x as u128) as Field;\n let high = (x - low) / TWO_POW_128;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lte_hint, PHI, PLO, TWO_POW_128};\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_decompose_unconstrained() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n fn check_assert_gt() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n unconstrained fn check_assert_gt_unconstrained() {\n assert_gt(1, 0);\n assert_gt(0x100, 0);\n assert_gt((0 - 1), (0 - 2));\n assert_gt(TWO_POW_128, 0);\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n unconstrained fn check_gt_unconstrained() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n}\n"
2471
2601
  },
2472
- "172": {
2602
+ "170": {
2473
2603
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
2474
- "source": "use protocol_types::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(getSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an\n/// ephemeral public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to\n/// other contracts, and therefore cannot e.g. decrypt their messages. This is an important security consideration\n/// given that both the `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as:\n/// `let S = (ivsk + h) * ephPk`\n/// where `ivsk + h` is the 'preaddress' i.e. the preimage of the address, also called the address secret.\n/// TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n get_shared_secret_oracle(address, ephPk)\n}\n"
2604
+ "source": "use protocol_types::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(utilityGetSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an\n/// ephemeral public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to\n/// other contracts, and therefore cannot e.g. decrypt their messages. This is an important security consideration\n/// given that both the `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as:\n/// `let S = (ivsk + h) * ephPk`\n/// where `ivsk + h` is the 'preaddress' i.e. the preimage of the address, also called the address secret.\n/// TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n get_shared_secret_oracle(address, ephPk)\n}\n"
2475
2605
  },
2476
2606
  "18": {
2477
2607
  "path": "std/field/mod.nr",
2478
- "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n /// Asserts that `self` can be represented in `bit_size` bits.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n // docs:start:assert_max_bit_size\n pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n // docs:end:assert_max_bit_size\n static_assert(\n BIT_SIZE < modulus_num_bits() as u32,\n \"BIT_SIZE must be less than modulus_num_bits\",\n );\n __assert_max_bit_size(self, BIT_SIZE);\n }\n\n /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n /// This slice will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_le_bits\n pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_le_bits\n let bits = __to_le_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[N - 1 - i] != p[N - 1 - i]) {\n assert(p[N - 1 - i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_be_bits\n pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_be_bits\n let bits = __to_be_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the decomposition does not overflow the modulus\n let p = modulus_be_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[i] != p[i]) {\n assert(p[i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_le_bytes\n pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_le_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_le_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[N - 1 - i] != p[N - 1 - i]) {\n assert(bytes[N - 1 - i] < p[N - 1 - i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_be_bytes\n pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_be_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_be_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_be_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[i] != p[i]) {\n assert(bytes[i] < p[i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_le_radix(self, radix)\n }\n\n fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_be_radix(self, radix)\n }\n\n // Returns self to the power of the given exponent value.\n // Caution: we assume the exponent fits into 32 bits\n // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n pub fn pow_32(self, exponent: Field) -> Field {\n let mut r: Field = 1;\n let b: [u1; 32] = exponent.to_le_bits();\n\n for i in 1..33 {\n r *= r;\n r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n }\n r\n }\n\n // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n pub fn sgn0(self) -> u1 {\n self as u1\n }\n\n pub fn lt(self, another: Field) -> bool {\n if crate::compat::is_bn254() {\n bn254_lt(self, another)\n } else {\n lt_fallback(self, another)\n }\n }\n\n /// Convert a little endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[i] as Field) * v;\n v = v * 256;\n }\n result\n }\n\n /// Convert a big endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[N - 1 - i] as Field) * v;\n v = v * 256;\n }\n result\n }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This slice will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..16 {\n high = high + (bytes32[15 - i] as Field) * v;\n low = low + (bytes32[16 + 15 - i] as Field) * v;\n v = v * 256;\n }\n // Abuse that a % p + b % p = (a + b) % p and that low < p\n low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n if is_unconstrained() {\n // Safety: unconstrained context\n unsafe {\n field_less_than(x, y)\n }\n } else {\n let x_bytes: [u8; 32] = x.to_le_bytes();\n let y_bytes: [u8; 32] = y.to_le_bytes();\n let mut x_is_lt = false;\n let mut done = false;\n for i in 0..32 {\n if (!done) {\n let x_byte = x_bytes[32 - 1 - i] as u8;\n let y_byte = y_bytes[32 - 1 - i] as u8;\n let bytes_match = x_byte == y_byte;\n if !bytes_match {\n x_is_lt = x_byte < y_byte;\n done = true;\n }\n }\n }\n x_is_lt\n }\n}\n\nmod tests {\n use crate::{panic::panic, runtime};\n use super::field_less_than;\n\n #[test]\n // docs:start:to_be_bits_example\n fn test_to_be_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_be_bits();\n assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n }\n // docs:end:to_be_bits_example\n\n #[test]\n // docs:start:to_le_bits_example\n fn test_to_le_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_le_bits();\n assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n }\n // docs:end:to_le_bits_example\n\n #[test]\n // docs:start:to_be_bytes_example\n fn test_to_be_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_be_bytes();\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_bytes_example\n\n #[test]\n // docs:start:to_le_bytes_example\n fn test_to_le_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_le_bytes();\n assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_bytes_example\n\n #[test]\n // docs:start:to_be_radix_example\n fn test_to_be_radix() {\n // 259, in base 256, big endian, is [1, 3].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_be_radix(256);\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_radix_example\n\n #[test]\n // docs:start:to_le_radix_example\n fn test_to_le_radix() {\n // 259, in base 256, little endian, is [3, 1].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_le_radix(256);\n assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_radix_example\n\n #[test(should_fail_with = \"radix must be greater than 1\")]\n fn test_to_le_radix_1() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(1);\n } else {\n panic(f\"radix must be greater than 1\");\n }\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be greater than 2\n //#[test]\n //fn test_to_le_radix_brillig_1() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(1);\n // crate::println(out);\n // let expected = [0; 8];\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test(should_fail_with = \"radix must be a power of 2\")]\n fn test_to_le_radix_3() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(3);\n } else {\n panic(f\"radix must be a power of 2\");\n }\n }\n\n #[test]\n fn test_to_le_radix_brillig_3() {\n // this test should only fail in constrained mode\n if runtime::is_unconstrained() {\n let field = 1;\n let out: [u8; 8] = field.to_le_radix(3);\n let mut expected = [0; 8];\n expected[0] = 1;\n assert(out == expected, \"unexpected result\");\n }\n }\n\n #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n fn test_to_le_radix_512() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(512);\n } else {\n panic(f\"radix must be less than or equal to 256\")\n }\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be less than 512\n //#[test]\n //fn test_to_le_radix_brillig_512() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(512);\n // let mut expected = [0; 8];\n // expected[0] = 1;\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test]\n unconstrained fn test_field_less_than() {\n assert(field_less_than(0, 1));\n assert(field_less_than(0, 0x100));\n assert(field_less_than(0x100, 0 - 1));\n assert(!field_less_than(0 - 1, 0));\n }\n}\n"
2608
+ "source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n /// Asserts that `self` can be represented in `bit_size` bits.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n // docs:start:assert_max_bit_size\n pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n // docs:end:assert_max_bit_size\n static_assert(\n BIT_SIZE < modulus_num_bits() as u32,\n \"BIT_SIZE must be less than modulus_num_bits\",\n );\n __assert_max_bit_size(self, BIT_SIZE);\n }\n\n /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n /// This slice will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_le_bits\n pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_le_bits\n let bits = __to_le_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[N - 1 - i] != p[N - 1 - i]) {\n assert(p[N - 1 - i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_be_bits\n pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_be_bits\n let bits = __to_be_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the decomposition does not overflow the modulus\n let p = modulus_be_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[i] != p[i]) {\n assert(p[i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_le_bytes\n pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_le_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_le_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[N - 1 - i] != p[N - 1 - i]) {\n assert(bytes[N - 1 - i] < p[N - 1 - i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_be_bytes\n pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_be_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_be_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_be_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[i] != p[i]) {\n assert(bytes[i] < p[i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_le_radix(self, radix)\n }\n\n fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_be_radix(self, radix)\n }\n\n // Returns self to the power of the given exponent value.\n // Caution: we assume the exponent fits into 32 bits\n // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n pub fn pow_32(self, exponent: Field) -> Field {\n let mut r: Field = 1;\n let b: [u1; 32] = exponent.to_le_bits();\n\n for i in 1..33 {\n r *= r;\n r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n }\n r\n }\n\n // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n pub fn sgn0(self) -> u1 {\n self as u1\n }\n\n pub fn lt(self, another: Field) -> bool {\n if crate::compat::is_bn254() {\n bn254_lt(self, another)\n } else {\n lt_fallback(self, another)\n }\n }\n\n /// Convert a little endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[i] as Field) * v;\n v = v * 256;\n }\n result\n }\n\n /// Convert a big endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[N - 1 - i] as Field) * v;\n v = v * 256;\n }\n result\n }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This slice will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting slice will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..16 {\n high = high + (bytes32[15 - i] as Field) * v;\n low = low + (bytes32[16 + 15 - i] as Field) * v;\n v = v * 256;\n }\n // Abuse that a % p + b % p = (a + b) % p and that low < p\n low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n if is_unconstrained() {\n // Safety: unconstrained context\n unsafe {\n field_less_than(x, y)\n }\n } else {\n let x_bytes: [u8; 32] = x.to_le_bytes();\n let y_bytes: [u8; 32] = y.to_le_bytes();\n let mut x_is_lt = false;\n let mut done = false;\n for i in 0..32 {\n if (!done) {\n let x_byte = x_bytes[32 - 1 - i] as u8;\n let y_byte = y_bytes[32 - 1 - i] as u8;\n let bytes_match = x_byte == y_byte;\n if !bytes_match {\n x_is_lt = x_byte < y_byte;\n done = true;\n }\n }\n }\n x_is_lt\n }\n}\n\nmod tests {\n use crate::{panic::panic, runtime};\n use super::field_less_than;\n\n #[test]\n // docs:start:to_be_bits_example\n fn test_to_be_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_be_bits();\n assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n }\n // docs:end:to_be_bits_example\n\n #[test]\n // docs:start:to_le_bits_example\n fn test_to_le_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_le_bits();\n assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n }\n // docs:end:to_le_bits_example\n\n #[test]\n // docs:start:to_be_bytes_example\n fn test_to_be_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_be_bytes();\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_bytes_example\n\n #[test]\n // docs:start:to_le_bytes_example\n fn test_to_le_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_le_bytes();\n assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_bytes_example\n\n #[test]\n // docs:start:to_be_radix_example\n fn test_to_be_radix() {\n // 259, in base 256, big endian, is [1, 3].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_be_radix(256);\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_radix_example\n\n #[test]\n // docs:start:to_le_radix_example\n fn test_to_le_radix() {\n // 259, in base 256, little endian, is [3, 1].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_le_radix(256);\n assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_radix_example\n\n #[test(should_fail_with = \"radix must be greater than 1\")]\n fn test_to_le_radix_1() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(1);\n } else {\n panic(f\"radix must be greater than 1\");\n }\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be greater than 2\n //#[test]\n //fn test_to_le_radix_brillig_1() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(1);\n // crate::println(out);\n // let expected = [0; 8];\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test(should_fail_with = \"radix must be a power of 2\")]\n fn test_to_le_radix_3() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(3);\n } else {\n panic(f\"radix must be a power of 2\");\n }\n }\n\n #[test]\n fn test_to_le_radix_brillig_3() {\n // this test should only fail in constrained mode\n if runtime::is_unconstrained() {\n let field = 1;\n let out: [u8; 8] = field.to_le_radix(3);\n let mut expected = [0; 8];\n expected[0] = 1;\n assert(out == expected, \"unexpected result\");\n }\n }\n\n #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n fn test_to_le_radix_512() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(512);\n } else {\n panic(f\"radix must be less than or equal to 256\")\n }\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n unconstrained fn not_enough_limbs_brillig() {\n let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n fn not_enough_limbs() {\n let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n }\n\n // TODO: Update this test to account for the Brillig restriction that the radix must be less than 512\n //#[test]\n //fn test_to_le_radix_brillig_512() {\n // // this test should only fail in constrained mode\n // if runtime::is_unconstrained() {\n // let field = 1;\n // let out: [u8; 8] = field.to_le_radix(512);\n // let mut expected = [0; 8];\n // expected[0] = 1;\n // assert(out == expected, \"unexpected result\");\n // }\n //}\n\n #[test]\n unconstrained fn test_field_less_than() {\n assert(field_less_than(0, 1));\n assert(field_less_than(0, 0x100));\n assert(field_less_than(0x100, 0 - 1));\n assert(!field_less_than(0 - 1, 0));\n }\n}\n"
2479
2609
  },
2480
- "199": {
2610
+ "202": {
2481
2611
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
2482
- "source": "/// Appends two `BoundedVec`s together, returning one that contains all of the elements of the first one followed by all\n/// of the elements of the second one. The resulting `BoundedVec` can have any arbitrary maximum length, but it must be\n/// large enough to fit all of the elements of both the first and second vectors.\npub fn append<T, let A_LEN: u32, let B_LEN: u32, let DST_LEN: u32>(\n a: BoundedVec<T, A_LEN>,\n b: BoundedVec<T, B_LEN>,\n) -> BoundedVec<T, DST_LEN> {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec<Field, 5> = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec<Field, 8> = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec<Field, 5> = append(a, b);\n }\n}\n"
2612
+ "source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have any arbitrary maximum length, but it must be\n/// large enough to fit all of the elements of both the first and second vectors.\npub fn append<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n a: BoundedVec<T, ALen>,\n b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec<Field, 5> = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec<Field, 8> = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec<Field, 5> = append(a, b);\n }\n}\n"
2483
2613
  },
2484
- "202": {
2614
+ "205": {
2485
2615
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
2486
- "source": "/// Returns `DST_LEN` elements from a source array, starting at `offset`. `DST_LEN` must not be larger than the number\n/// of elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SRC_LEN: u32, let DST_LEN: u32>(\n src: [T; SRC_LEN],\n offset: u32,\n) -> [T; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"DST_LEN too large for offset\");\n\n let mut dst: [T; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\nmod test {\n use super::subarray;\n\n #[test]\n unconstrained fn subarray_into_empty() {\n // In all of these cases we're setting DST_LEN to be 0, so we always get back an emtpy array.\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n }\n\n #[test]\n unconstrained fn subarray_complete() {\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n }\n\n #[test]\n unconstrained fn subarray_different_end_sizes() {\n // We implicitly select how many values to read in the size of the return array\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subarray_offset_too_large() {\n // With an offset of 1 we can only request up to 4 elements\n let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n }\n\n #[test(should_fail)]\n unconstrained fn subarray_bad_return_value() {\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n }\n}\n"
2616
+ "source": "/// Returns `DstLen` elements from a source array, starting at `offset`. `DstLen` must not be larger than the number\n/// of elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SrcLen: u32, let DstLen: u32>(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n let mut dst: [T; DstLen] = std::mem::zeroed();\n for i in 0..DstLen {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\nmod test {\n use super::subarray;\n\n #[test]\n unconstrained fn subarray_into_empty() {\n // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n }\n\n #[test]\n unconstrained fn subarray_complete() {\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n }\n\n #[test]\n unconstrained fn subarray_different_end_sizes() {\n // We implicitly select how many values to read in the size of the return array\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subarray_offset_too_large() {\n // With an offset of 1 we can only request up to 4 elements\n let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n }\n\n #[test(should_fail)]\n unconstrained fn subarray_bad_return_value() {\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n }\n}\n"
2487
2617
  },
2488
- "203": {
2618
+ "206": {
2489
2619
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
2490
- "source": "use crate::utils::array;\n\n/// Returns `DST_MAX_LEN` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DST_LEN` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DST_LEN` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SRC_MAX_LEN: u32, let DST_MAX_LEN: u32>(\n bvec: BoundedVec<T, SRC_MAX_LEN>,\n offset: u32,\n) -> BoundedVec<T, DST_MAX_LEN> {\n // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n // their original length.\n BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n use super::subbvec;\n\n #[test]\n unconstrained fn subbvec_empty() {\n let bvec = BoundedVec::<Field, 0>::from_array([]);\n assert_eq(subbvec(bvec, 0), bvec);\n }\n\n #[test]\n unconstrained fn subbvec_complete() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), bvec);\n\n let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), smaller_capacity);\n }\n\n #[test]\n unconstrained fn subbvec_partial() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n }\n\n #[test]\n unconstrained fn subbvec_into_empty() {\n let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_offset_past_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_insufficient_dst_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n // for the capacity to reduce, but not the length (other than by len - offset).\n let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subbvec_dst_len_causes_enlarge() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // subbvec does not supprt capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DST_LEN too large for offset\")]\n unconstrained fn subbvec_dst_len_too_large_for_offset() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n // which is less than 7.\n let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n }\n}\n"
2620
+ "source": "use crate::utils::array;\n\n/// Returns `DstMaxLen` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DstLen` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DstLen` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SrcMaxLen: u32, let DstMaxLen: u32>(\n bvec: BoundedVec<T, SrcMaxLen>,\n offset: u32,\n) -> BoundedVec<T, DstMaxLen> {\n // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n // their original length.\n BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n use super::subbvec;\n\n #[test]\n unconstrained fn subbvec_empty() {\n let bvec = BoundedVec::<Field, 0>::from_array([]);\n assert_eq(subbvec(bvec, 0), bvec);\n }\n\n #[test]\n unconstrained fn subbvec_complete() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), bvec);\n\n let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), smaller_capacity);\n }\n\n #[test]\n unconstrained fn subbvec_partial() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n }\n\n #[test]\n unconstrained fn subbvec_into_empty() {\n let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_offset_past_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_insufficient_dst_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n // for the capacity to reduce, but not the length (other than by len - offset).\n let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_causes_enlarge() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // subbvec does not supprt capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_too_large_for_offset() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n // which is less than 7.\n let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n }\n}\n"
2491
2621
  },
2492
- "205": {
2622
+ "208": {
2493
2623
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
2494
2624
  "source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field.\n/// For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ... + 0]\n/// Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n // Assert that N is a multiple of 31\n static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n let mut fields = [0; N / 31];\n\n // Since N is a multiple of 31, we can simply process all chunks fully\n for i in 0..N / 31 {\n let mut field = 0;\n for j in 0..31 {\n // Shift the existing value left by 8 bits and add the new byte\n field = field * 256 + bytes[i * 31 + j] as Field;\n }\n fields[i] = field;\n }\n\n fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays\n/// are not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so).\n/// Each field is converted into 31 big-endian bytes, and the resulting 31-byte chunks are concatenated\n/// back together in the order of the original fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n let mut bytes = BoundedVec::new();\n\n for i in 0..fields.len() {\n let field = fields.get(i);\n\n // We expect that the field contains at most 31 bytes of information.\n field.assert_max_bit_size::<248>();\n\n // Now we can safely convert the field to 31 bytes.\n let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n for j in 0..31 {\n bytes.push(field_as_bytes[j]);\n }\n }\n\n bytes\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{bytes_from_fields, bytes_to_fields};\n\n #[test]\n unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n let fields = bytes_to_fields(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end.\n // So we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n // function.\n let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\n assert_eq(bytes_back.len(), input.len());\n assert_eq(subarray(bytes_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"N must be a multiple of 31\")]\n unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n // Try to convert 32 bytes (not a multiple of 31) to fields\n let _fields = bytes_to_fields([0; 32]);\n }\n\n}\n"
2495
2625
  },
2496
- "206": {
2626
+ "209": {
2497
2627
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
2498
2628
  "source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array.\n/// Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123, // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200] // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful\n/// that such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n let mut bytes = [0; 32 * N];\n\n for i in 0..N {\n let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n for j in 0..32 {\n bytes[i * 32 + j] = field_as_bytes[j];\n }\n }\n\n bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this\n/// is assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert\n/// a byte array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field.\n/// For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ... + 0]\n/// Note 1: N must be a multiple of 32 bytes\n/// Note 2: The max value check code was taken from std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n // Assert that input length is a multiple of 32\n assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n let mut fields = BoundedVec::new();\n\n let p = std::field::modulus_be_bytes();\n\n // Since input length is a multiple of 32, we can simply process all chunks fully\n for i in 0..bytes.len() / 32 {\n let mut field = 0;\n\n // Process each byte in the 32-byte chunk\n let mut ok = false;\n\n for j in 0..32 {\n let next_byte = bytes.get(i * 32 + j);\n field = field * 256 + next_byte as Field;\n\n if !ok {\n if next_byte != p[j] {\n assert(next_byte < p[j], \"Value does not fit in field\");\n ok = true;\n }\n }\n }\n assert(ok, \"Value does not fit in field\");\n\n fields.push(field);\n }\n\n fields\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{fields_from_bytes, fields_to_bytes};\n\n #[test]\n unconstrained fn random_fields_to_bytes_and_back(input: [Field; 3]) {\n // Convert to bytes\n let bytes = fields_to_bytes(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end.\n // So we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n // function.\n // 113 is an arbitrary max length that is larger than the input length of 96.\n let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n // Convert back to fields\n let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\n assert_eq(fields_back.len(), input.len());\n assert_eq(subarray(fields_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n unconstrained fn to_fields_assert() {\n // 143 is an arbitrary max length that is larger than 33\n let input = BoundedVec::<_, 143>::from_array([\n 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33,\n ]);\n\n // This should fail since 33 is not a multiple of 32\n let _fields = fields_from_bytes(input);\n }\n\n #[test]\n unconstrained fn fields_from_bytes_max_value() {\n let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n let fields = fields_from_bytes(input);\n\n // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n assert_eq(fields.get(0), -1);\n }\n\n // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte\n // and then feeding it to `fields_from_bytes` as input.\n #[test(should_fail_with = \"Value does not fit in field\")]\n unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n let index_of_byte_to_bump = random_value % 32;\n\n // Obtain the byte representation of the maximum field value\n let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n // Skip test execution if the selected byte is already at maximum value (255).\n // This is acceptable since we are using fuzz testing to generate many test cases.\n if byte_to_bump != 255 {\n let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n // Increment the selected byte to exceed the field's maximum value\n input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n let _fields = fields_from_bytes(input);\n }\n }\n\n}\n"
2499
2629
  },
2500
- "208": {
2630
+ "211": {
2501
2631
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/field.nr",
2502
2632
  "source": "use std::option::Option;\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\n\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// Power function of two Field arguments of arbitrary size.\n// Adapted from std::field::pow_32.\npub fn pow(x: Field, y: Field) -> Field {\n let mut r = 1 as Field;\n let b: [u1; 254] = y.to_le_bits();\n\n for i in 0..254 {\n r *= r;\n r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n }\n\n r\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n let v = pow(x, -1 / 2);\n v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n let mut z = pow(x, C3);\n let mut t = z * z * x;\n z *= x;\n let mut b = t;\n let mut c = C5;\n\n for i in 0..(C1 - 1) {\n for _j in 1..(C1 - i - 1) {\n b *= b;\n }\n\n z *= if b == 1 { 1 } else { c };\n\n c *= c;\n\n t *= if b == 1 { 1 } else { c };\n\n b = t;\n }\n\n z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\npub unconstrained fn __sqrt(x: Field) -> (bool, Field) {\n let is_sq = is_square(x);\n if is_sq {\n let sqrt = tonelli_shanks_sqrt(x);\n (true, sqrt)\n } else {\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // sq * sq = sq // 1 * 1 = 1\n // non-sq * non-sq = sq // -1 * -1 = 1\n // sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n (false, not_sqrt)\n }\n}\n\n// Returns (false, 0) if there is no square root.\n// Returns (true, sqrt) if there is a square root.\npub fn sqrt(x: Field) -> Option<Field> {\n // Safety: if the hint returns the square root of x, then we simply square it\n // check the result equals x. If x is not square, we return a value that\n // enables us to prove that fact (see the `else` clause below).\n let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n if is_sq {\n let sqrt = maybe_sqrt;\n validate_sqrt_hint(x, sqrt);\n Option::some(sqrt)\n } else {\n let not_sqrt_hint = maybe_sqrt;\n validate_not_sqrt_hint(x, not_sqrt_hint);\n Option::none()\n }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n // We need this assertion, because x = 0 would pass the other assertions in this\n // function, and we don't want people to be able to prove that 0 is not square!\n assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n //\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // 1. sq * sq = sq // 1 * 1 = 1\n // 2. non-sq * non-sq = sq // -1 * -1 = 1\n // 3. sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n //\n // We want to demonstrate that this below multiplication falls under bullet-point (2):\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n // (i.e. that it is a square), so we prove that it is square below.\n // Why do we want to prove that it has LS 1?\n // Well, since it was computed with a known-non-residue, its squareness implies we're\n // in case 2 (something multiplied by a known-non-residue yielding a result which\n // has a LS of 1), which implies that x must be a non-square. The unconstrained\n // function gave us the sqrt of demo_x_not_square, so all we need to do is\n // assert its squareness:\n assert(\n hint * hint == demo_x_not_square,\n f\"The hint {hint} does not demonstrate that {x} is not a square\",\n );\n}\n\n#[test]\nfn test_sqrt() {\n let x = 9;\n let maybe_sqrt = sqrt(x);\n assert(maybe_sqrt.is_some());\n let sqrt = maybe_sqrt.unwrap_unchecked();\n assert((sqrt == 3) | (sqrt == -3));\n}\n\n#[test]\nfn test_non_square() {\n let x = 5;\n let maybe_sqrt = sqrt(x);\n assert(maybe_sqrt.is_none());\n}\n\n#[test]\nunconstrained fn test_known_non_residue_is_actually_a_non_residue_in_the_field() {\n assert(!is_square(KNOWN_NON_RESIDUE));\n}\n\n#[test]\nfn test_sqrt_0() {\n let x = 0;\n let sqrt = sqrt(x).unwrap();\n assert(sqrt == 0);\n}\n\n#[test]\nfn test_sqrt_1() {\n let x = 1;\n let sqrt = sqrt(x).unwrap();\n assert((sqrt == 1) | (sqrt == -1));\n}\n\n#[test(should_fail_with = \"The claimed_sqrt 0x04 is not the sqrt of x 0x09\")]\nfn test_bad_sqrt_hint_fails() {\n validate_sqrt_hint(9, 4);\n}\n\n#[test(should_fail_with = \"The hint 0x04 does not demonstrate that 0x0a is not a square\")]\nfn test_bad_not_sqrt_hint_fails() {\n validate_not_sqrt_hint(10, 4);\n}\n\n#[test(should_fail_with = \"0 has a square root; you cannot claim it is not square\")]\nfn test_0_not_sqrt_hint_fails() {\n validate_not_sqrt_hint(0, 0);\n}\n\n#[test]\nunconstrained fn test_is_square() {\n assert(is_square(25));\n}\n\n#[test]\nunconstrained fn test_is_not_square() {\n assert(!is_square(10));\n}\n"
2503
2633
  },
2504
- "210": {
2634
+ "213": {
2505
2635
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
2506
2636
  "source": "use crate::utils::field::sqrt;\nuse dep::protocol_types::point::Point;\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field =\n 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Converts a point to a byte array.\n///\n/// We don't serialize the point at infinity flag because this function is used in situations where we do not want\n/// to waste the extra byte (encrypted log).\npub fn point_to_bytes(p: Point) -> [u8; 32] {\n // Note that there is 1 more free bit in the 32 bytes (254 bits currently occupied by the x coordinate, 1 bit for\n // the \"sign\") so it's possible to use that last bit as an \"is_infinite\" flag if desired in the future.\n assert(!p.is_infinite, \"Cannot serialize point at infinity as bytes.\");\n\n let mut result: [u8; 32] = p.x.to_be_bytes();\n\n if get_sign_of_point(p) {\n // y is <= (modulus - 1) / 2 so we set the sign bit to 1\n // Here we leverage that field fits into 254 bits (log2(Fr.MODULUS) < 254) and given that we serialize Fr to 32\n // bytes and we use big-endian the 2 most significant bits are never populated. Hence we can use one of\n // the bits as a sign bit.\n result[0] += 128;\n }\n\n result\n}\n\n/**\n * Returns: true if p.y <= MOD_DIV_2, else false.\n */\npub fn get_sign_of_point(p: Point) -> bool {\n // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get\n // the sign we check if the y coordinate is less or equal than the curve's order minus 1 divided by 2.\n // Ideally we'd do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is\n // equivalent, and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\npub fn point_from_x_coord(x: Field) -> Point {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n let y = sqrt(rhs).unwrap();\n Point { x, y, is_infinite: false }\n}\n\n/// Uses the x coordinate and sign flag (+/-) to reconstruct the point.\n/// The y coordinate can be derived from the x coordinate and the \"sign\" flag by solving the grumpkin curve\n/// equation for y.\n/// @param x - The x coordinate of the point\n/// @param sign - The \"sign\" of the y coordinate - determines whether y <= (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Point {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n let y = sqrt(rhs).unwrap();\n\n // If y > MOD_DIV_2 and we want positive sign (or vice versa), negate y\n let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n let final_y = if y_is_positive == sign { y } else { -y };\n\n Point { x, y: final_y, is_infinite: false }\n}\n\nmod test {\n use crate::utils::point::{point_from_x_coord_and_sign, point_to_bytes};\n use dep::protocol_types::point::Point;\n\n #[test]\n unconstrained fn test_point_to_bytes_positive_sign() {\n let p = Point {\n x: 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73,\n y: 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a,\n is_infinite: false,\n };\n\n let compressed_point = point_to_bytes(p);\n\n let expected_compressed_point_positive_sign = [\n 154, 244, 31, 93, 233, 100, 70, 220, 55, 118, 161, 235, 45, 152, 187, 149, 107, 122,\n 205, 153, 121, 166, 120, 84, 190, 198, 250, 124, 41, 115, 189, 115,\n ];\n assert_eq(expected_compressed_point_positive_sign, compressed_point);\n }\n\n #[test]\n unconstrained fn test_point_to_bytes_negative_sign() {\n let p = Point {\n x: 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5,\n y: 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0,\n is_infinite: false,\n };\n\n let compressed_point = point_to_bytes(p);\n\n let expected_compressed_point_negative_sign = [\n 36, 115, 113, 101, 46, 85, 221, 116, 201, 175, 141, 190, 159, 180, 73, 49, 186, 41, 169,\n 34, 153, 148, 56, 75, 215, 7, 119, 150, 193, 78, 226, 181,\n ];\n\n assert_eq(expected_compressed_point_negative_sign, compressed_point);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_and_sign() {\n // Test positive y coordinate\n let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n let sign = true;\n let p = point_from_x_coord_and_sign(x, sign);\n\n assert_eq(p.x, x);\n assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n assert_eq(p.is_infinite, false);\n\n // Test negative y coordinate\n let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n let sign2 = false;\n let p2 = point_from_x_coord_and_sign(x2, sign2);\n\n assert_eq(p2.x, x2);\n assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n assert_eq(p2.is_infinite, false);\n }\n}\n"
2507
2637
  },
2508
- "222": {
2638
+ "225": {
2509
2639
  "path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.1.1/src/poseidon2.nr",
2510
2640
  "source": "use std::default::Default;\nuse std::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = crate::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut sponge = Poseidon2::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
2511
2641
  },
2512
- "283": {
2642
+ "290": {
2513
2643
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
2514
- "source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{\n AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE,\n MAX_PROTOCOL_CONTRACTS,\n },\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::{pow, sqrt},\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\n\n// Aztec address\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Eq for AztecAddress {\n fn eq(self, other: Self) -> bool {\n self.to_field() == other.to_field()\n }\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl Serialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn serialize(self: Self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n [self.to_field()]\n }\n}\n\nimpl Deserialize<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn deserialize(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n FromField::from_field(fields[0])\n }\n}\n\n/// We implement the Packable trait for AztecAddress because it can be stored in contract's storage (and there\n/// the implementation of Packable is required).\nimpl Packable<AZTEC_ADDRESS_LENGTH> for AztecAddress {\n fn pack(self) -> [Field; AZTEC_ADDRESS_LENGTH] {\n self.serialize()\n }\n\n fn unpack(fields: [Field; AZTEC_ADDRESS_LENGTH]) -> Self {\n Self::deserialize(fields)\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n pub fn to_address_point(self) -> AddressPoint {\n // We compute the address point by taking our address, setting it to x, and then solving for y in the\n // equation which defines our bn curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = pow(x, 3) - 17;\n\n // TODO (#8970): Handle cases where we cannot recover a point from an address\n let mut y = sqrt(y_squared);\n\n // If we get a negative y coordinate (any y where y > MAX_FIELD_VALUE / 2), we pin it to the\n // positive one (any value where y <= MAX_FIELD_VALUE / 2) by subtracting it from the Field modulus\n // note: The field modulus is MAX_FIELD_VALUE + 1\n if (!(y.lt(MAX_FIELD_VALUE / 2) | y.eq(MAX_FIELD_VALUE / 2))) {\n y = (MAX_FIELD_VALUE + 1) - y;\n }\n\n AddressPoint { inner: Point { x: self.inner, y, is_infinite: false } }\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n GENERATOR_INDEX__CONTRACT_ADDRESS_V1,\n );\n\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_protocol_contract(self) -> bool {\n self.inner.lt(MAX_PROTOCOL_CONTRACTS as Field)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let public_keys = PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n is_infinite: false,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n is_infinite: false,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n is_infinite: false,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n is_infinite: false,\n },\n },\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // The following value was generated by `derivation.test.ts`.\n // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n let expected_computed_address_from_partial_and_pubkeys =\n 0x24e4646f58b9fbe7d38e317db8d5636c423fbbdfbe119fc190fe9c64747e0c62;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], GENERATOR_INDEX__CONTRACT_ADDRESS_V1);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n assert_eq(Deserialize::deserialize(address.serialize()), address);\n}\n"
2644
+ "source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{\n AZTEC_ADDRESS_LENGTH, GENERATOR_INDEX__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE,\n MAX_PROTOCOL_CONTRACTS,\n },\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::{pow, sqrt},\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n pub fn to_address_point(self) -> AddressPoint {\n // We compute the address point by taking our address, setting it to x, and then solving for y in the\n // equation which defines our bn curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = pow(x, 3) - 17;\n\n // TODO (#8970): Handle cases where we cannot recover a point from an address\n let mut y = sqrt(y_squared);\n\n // If we get a negative y coordinate (any y where y > MAX_FIELD_VALUE / 2), we pin it to the\n // positive one (any value where y <= MAX_FIELD_VALUE / 2) by subtracting it from the Field modulus\n // note: The field modulus is MAX_FIELD_VALUE + 1\n if (!(y.lt(MAX_FIELD_VALUE / 2) | y.eq(MAX_FIELD_VALUE / 2))) {\n y = (MAX_FIELD_VALUE + 1) - y;\n }\n\n AddressPoint { inner: Point { x: self.inner, y, is_infinite: false } }\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n GENERATOR_INDEX__CONTRACT_ADDRESS_V1,\n );\n\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_protocol_contract(self) -> bool {\n self.inner.lt(MAX_PROTOCOL_CONTRACTS as Field)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let public_keys = PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n is_infinite: false,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n is_infinite: false,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n is_infinite: false,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n is_infinite: false,\n },\n },\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // The following value was generated by `derivation.test.ts`.\n // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n let expected_computed_address_from_partial_and_pubkeys =\n 0x24e4646f58b9fbe7d38e317db8d5636c423fbbdfbe119fc190fe9c64747e0c62;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], GENERATOR_INDEX__CONTRACT_ADDRESS_V1);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n // implementation and the constant.\n let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n let deserialized = AztecAddress::deserialize(serialized);\n assert_eq(address, deserialized);\n}\n"
2645
+ },
2646
+ "3": {
2647
+ "path": "std/array/mod.nr",
2648
+ "source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n /// Returns the length of this array.\n ///\n /// ```noir\n /// fn len(self) -> Field\n /// ```\n ///\n /// example\n ///\n /// ```noir\n /// fn main() {\n /// let array = [42, 42];\n /// assert(array.len() == 2);\n /// }\n /// ```\n #[builtin(array_len)]\n pub fn len(self) -> u32 {}\n\n /// Returns this array as a slice.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let slice = array.as_slice();\n /// assert_eq(slice, &[1, 2]);\n /// ```\n #[builtin(as_slice)]\n pub fn as_slice(self) -> [T] {}\n\n /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.map(|a| a * 2);\n /// assert_eq(b, [2, 4, 6]);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array along with its index,\n /// returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.mapi(|i, a| i + a * 2);\n /// assert_eq(b, [2, 5, 8]);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(i, self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// let mut i = 0;\n /// a.for_each(|x| {\n /// b[i] = x;\n /// i += 1;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n for i in 0..self.len() {\n f(self[i]);\n }\n }\n\n /// Applies a function to each element of this array along with its index.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// a.for_eachi(|i, x| {\n /// b[i] = x;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n for i in 0..self.len() {\n f(i, self[i]);\n }\n }\n\n /// Applies a function to each element of the array, returning the final accumulated value. The first\n /// parameter is the initial value.\n ///\n /// This is a left fold, so the given function will be applied to the accumulator and first element of\n /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n ///\n /// ```rust\n /// let a1 = [1];\n /// let a2 = [1, 2];\n /// let a3 = [1, 2, 3];\n ///\n /// let f = |a, b| a - b;\n /// a1.fold(10, f); //=> f(10, 1)\n /// a2.fold(10, f); //=> f(f(10, 1), 2)\n /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n ///\n /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n /// ```\n pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n for elem in self {\n accumulator = f(accumulator, elem);\n }\n accumulator\n }\n\n /// Same as fold, but uses the first element as the starting element.\n ///\n /// Requires the input array to be non-empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [1, 2, 3, 4];\n /// let reduced = arr.reduce(|a, b| a + b);\n /// assert(reduced == 10);\n /// }\n /// ```\n pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n let mut accumulator = self[0];\n for i in 1..self.len() {\n accumulator = f(accumulator, self[i]);\n }\n accumulator\n }\n\n /// Returns true if all the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 2];\n /// let all = arr.all(|a| a == 2);\n /// assert(all);\n /// }\n /// ```\n pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = true;\n for elem in self {\n ret &= predicate(elem);\n }\n ret\n }\n\n /// Returns true if any of the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 5];\n /// let any = arr.any(|a| a == 5);\n /// assert(any);\n /// }\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n for elem in self {\n ret |= predicate(elem);\n }\n ret\n }\n\n /// Concatenates this array with another array.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr1 = [1, 2, 3, 4];\n /// let arr2 = [6, 7, 8, 9, 10, 11];\n /// let concatenated_arr = arr1.concat(arr2);\n /// assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n /// }\n /// ```\n pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n let mut result = [crate::mem::zeroed(); N + M];\n for i in 0..N {\n result[i] = self[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Ord + Eq,\n{\n /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n /// sort any type, you should use the `sort_via` function.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32];\n /// let sorted = arr.sort();\n /// assert(sorted == [32, 42]);\n /// }\n /// ```\n pub fn sort(self) -> Self {\n self.sort_via(|a, b| a <= b)\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Eq,\n{\n /// Returns a new sorted array by sorting it with a custom comparison function.\n /// The original array remains untouched.\n /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n ///\n /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32]\n /// let sorted_ascending = arr.sort_via(|a, b| a <= b);\n /// assert(sorted_ascending == [32, 42]); // verifies\n ///\n /// let sorted_descending = arr.sort_via(|a, b| a >= b);\n /// assert(sorted_descending == [32, 42]); // does not verify\n /// }\n /// ```\n pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n // Safety: `sorted` array is checked to be:\n // a. a permutation of `input`'s elements\n // b. satisfying the predicate `ordering`\n let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n if !is_unconstrained() {\n for i in 0..N - 1 {\n assert(\n ordering(sorted[i], sorted[i + 1]),\n \"Array has not been sorted correctly according to `ordering`.\",\n );\n }\n check_shuffle::check_shuffle(self, sorted);\n }\n sorted\n }\n}\n\nimpl<let N: u32> [u8; N] {\n /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n /// the given array is interpreted as-is as a string.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let hi = [104, 105].as_str_unchecked();\n /// assert_eq(hi, \"hi\");\n /// }\n /// ```\n #[builtin(array_as_str_unchecked)]\n pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n /// Returns an array of the string bytes.\n fn from(s: str<N>) -> Self {\n s.as_bytes()\n }\n}\n\nmod test {\n #[test]\n fn map_empty() {\n assert_eq([].map(|x| x + 1), []);\n }\n\n global arr_with_100_values: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n global expected_with_100_values: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n fn sort_u32(a: u32, b: u32) -> bool {\n a <= b\n }\n\n #[test]\n fn test_sort() {\n let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort();\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values() {\n let mut arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort();\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values_comptime() {\n let sorted = arr_with_100_values.sort();\n assert(sorted == expected_with_100_values);\n }\n\n #[test]\n fn test_sort_via() {\n let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_via_100_values() {\n let mut arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn mapi_empty() {\n assert_eq([].mapi(|i, x| i * x + 1), []);\n }\n\n #[test]\n fn for_each_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_each(|_x| assert(false));\n }\n\n #[test]\n fn for_eachi_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_eachi(|_i, _x| assert(false));\n }\n\n #[test]\n fn map_example() {\n let a = [1, 2, 3];\n let b = a.map(|a| a * 2);\n assert_eq(b, [2, 4, 6]);\n }\n\n #[test]\n fn mapi_example() {\n let a = [1, 2, 3];\n let b = a.mapi(|i, a| i + a * 2);\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn for_each_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n let mut i = 0;\n let i_ref = &mut i;\n a.for_each(|x| {\n b_ref[*i_ref] = x * 2;\n *i_ref += 1;\n });\n assert_eq(b, [2, 4, 6]);\n assert_eq(i, 3);\n }\n\n #[test]\n fn for_eachi_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn concat() {\n let arr1 = [1, 2, 3, 4];\n let arr2 = [6, 7, 8, 9, 10, 11];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n }\n\n #[test]\n fn concat_zero_length_with_something() {\n let arr1 = [];\n let arr2 = [1];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_something_with_zero_length() {\n let arr1 = [1];\n let arr2 = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_zero_lengths() {\n let arr1: [Field; 0] = [];\n let arr2: [Field; 0] = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, []);\n }\n}\n"
2515
2649
  },
2516
- "300": {
2650
+ "306": {
2517
2651
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
2518
- "source": "/// Utility function to console.log data in the acir simulator.\n/// Example:\n/// debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_oracle_wrapper(msg, args) };\n}\n\npub unconstrained fn debug_log_oracle_wrapper<let M: u32, let N: u32>(\n msg: str<M>,\n args: [Field; N],\n) {\n debug_log_oracle(msg, args.as_slice());\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(debugLog)]\nunconstrained fn debug_log_oracle<let M: u32>(_msg: str<M>, args: [Field]) {}\n"
2652
+ "source": "/// Utility function to console.log data in the acir simulator.\n/// Example:\n/// debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_oracle_wrapper(msg, args) };\n}\n\npub unconstrained fn debug_log_oracle_wrapper<let M: u32, let N: u32>(\n msg: str<M>,\n args: [Field; N],\n) {\n debug_log_oracle(msg, args.as_slice());\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(utilityDebugLog)]\nunconstrained fn debug_log_oracle<let M: u32>(_msg: str<M>, args: [Field]) {}\n"
2519
2653
  },
2520
- "301": {
2654
+ "315": {
2521
2655
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
2522
- "source": "use crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector,\n note_hash::ScopedNoteHash,\n nullifier::ScopedNullifier,\n private_log::{PrivateLog, PrivateLogData},\n side_effect::{OrderedValue, scoped::Scoped},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n GENERATOR_INDEX__UNIQUE_NOTE_HASH, TWO_POW_64,\n },\n merkle_tree::root::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n traits::{FromField, Hash, ToField},\n utils::{arrays::array_concat, field::{field_from_bytes, field_from_bytes_32_trunc}},\n};\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n GENERATOR_INDEX__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), note_hash],\n GENERATOR_INDEX__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique note hashes from siloed note hashes\npub fn compute_unique_siloed_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n if siloed_note_hash == 0 {\n 0\n } else {\n compute_nonce_and_unique_note_hash(siloed_note_hash, first_nullifier, note_index_in_tx)\n }\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn silo_note_hash(note_hash: ScopedNoteHash) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_note_hash(note_hash.contract_address, note_hash.value())\n }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), nullifier],\n GENERATOR_INDEX__OUTER_NULLIFIER,\n )\n}\n\npub fn silo_nullifier(nullifier: ScopedNullifier) -> Field {\n if nullifier.contract_address.is_zero() {\n nullifier.value() // Return value instead of 0 because the first nullifier's contract address is zero.\n } else {\n compute_siloed_nullifier(nullifier.contract_address, nullifier.value())\n }\n}\n\npub fn compute_siloed_private_log_field(contract_address: AztecAddress, field: Field) -> Field {\n poseidon2_hash([contract_address.to_field(), field])\n}\n\npub fn silo_private_log(private_log: Scoped<PrivateLogData>) -> PrivateLog {\n if private_log.contract_address.is_zero() {\n private_log.inner.log\n } else {\n let mut fields = private_log.inner.log.fields;\n fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n PrivateLog::new(fields, private_log.inner.log.length)\n }\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n app_secret_generator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n app_secret_generator,\n )\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n contract_address: AztecAddress,\n recipient: EthAddress,\n content: Field,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = recipient.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n msg: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n if msg.contract_address.is_zero() {\n 0\n } else {\n compute_l2_to_l1_hash(\n msg.contract_address,\n msg.inner.recipient,\n msg.inner.content,\n rollup_version_id,\n chain_id,\n )\n }\n}\n\n// Computes sha256 hash of 2 input hashes.\n//\n// NB: This method now takes in two 31 byte fields - it assumes that any input\n// is the result of a sha_to_field hash and => is truncated\n//\n// TODO(Jan and David): This is used for the encrypted_log hashes.\n// Can we check to see if we can just use hash_to_field or pedersen_compress here?\n//\npub fn accumulate_sha256(input: [Field; 2]) -> Field {\n // This is a note about the cpp code, since it takes an array of Fields\n // instead of a u128.\n // 4 Field elements when converted to bytes will usually\n // occupy 4 * 32 = 128 bytes.\n // However, this function is making the assumption that each Field\n // only occupies 128 bits.\n //\n // TODO(David): This does not seem to be getting guaranteed anywhere in the code?\n // Concatentate two fields into 32x2 = 64 bytes\n // accumulate_sha256 assumes that the inputs are pre-truncated 31 byte numbers\n let mut hash_input_flattened = [0; 64];\n for offset in 0..input.len() {\n let input_as_bytes: [u8; 32] = input[offset].to_be_bytes();\n for byte_index in 0..32 {\n hash_input_flattened[offset * 32 + byte_index] = input_as_bytes[byte_index];\n }\n }\n\n sha256_to_field(hash_input_flattened)\n}\n\n#[inline_always]\npub fn pedersen_hash<let N: u32>(inputs: [Field; N], hash_index: u32) -> Field {\n std::hash::pedersen_hash_with_separator(inputs, hash_index)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = array_concat([separator.to_field()], inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n// Performs a fixed length hash with a subarray of the given input.\n// Useful for SpongeBlob in which we aborb M things and want to check it vs a hash of M elts of an N-len array.\n// Using stdlib poseidon, this will always absorb an extra 1 as a 'variable' hash, and not match spongeblob.squeeze()\n// or any ts implementation. Also checks that any remaining elts not hashed are empty.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, false);\n sponge.squeeze()\n}\n\n// NB the below is the same as poseidon::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, true);\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if in_len != N {\n sponge.absorb(1);\n }\n sponge.squeeze()\n}\n\n// The below fn reduces gates of a conditional poseidon2 hash by approx 3x (thank you ~* Giant Brain Dev @IlyasRidhuan *~ for the idea)\n// Why? Because when we call stdlib poseidon, we call absorb for each item. When absorbing is conditional, it seems the compiler does not know\n// what cache_size will be when calling absorb, so it assigns the permutation gates for /each i/ rather than /every 3rd i/, which is actually required.\n// The below code forces the compiler to:\n// - absorb normally up to 2 times to set cache_size to 1\n// - absorb in chunks of 3 to ensure perm. only happens every 3rd absorb\n// - absorb normally up to 2 times to add any remaining values to the hash\n// In fixed len hashes, the compiler is able to tell that it will only need to perform the permutation every 3 absorbs.\n// NB: it also replaces unnecessary range checks (i < thing) with a bit check (&= i != thing), which alone reduces the gates of a var. hash by half.\n\n#[no_predicates]\nfn poseidon2_absorb_chunks<let N: u32>(\n input: [Field; N],\n in_len: u32,\n variable: bool,\n) -> Poseidon2Sponge {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n // Even though shift is always 1 here, if we input in_len = 0 we get an underflow\n // since we cannot isolate computation branches. The below is just to avoid that.\n let shift = if in_len == 0 { 0 } else { 1 };\n if in_len != 0 {\n // cache_size = 0, init absorb\n sponge.cache[0] = input[0];\n sponge.cache_size = 1;\n // shift = num elts already added to make cache_size 1 = 1 for a fresh sponge\n // M = max_chunks = (N - 1 - (N - 1) % 3) / 3: (must be written as a fn of N to compile)\n // max_remainder = (N - 1) % 3;\n // max_chunks = (N - 1 - max_remainder) / 3;\n sponge = poseidon2_absorb_chunks_loop::<N, (N - 1 - (N - 1) % 3) / 3>(\n sponge,\n input,\n in_len,\n variable,\n shift,\n );\n }\n sponge\n}\n\n// NB: If it's not required to check that the non-absorbed elts of 'input' are 0s, set skip_0_check=true\n#[no_predicates]\npub fn poseidon2_absorb_chunks_existing_sponge<let N: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n skip_0_check: bool,\n) -> Poseidon2Sponge {\n let mut sponge = in_sponge;\n // 'shift' is to account for already added inputs\n let mut shift = 0;\n // 'stop' is to avoid an underflow when inputting in_len = 0\n let mut stop = false;\n for i in 0..3 {\n if shift == in_len {\n stop = true;\n }\n if (sponge.cache_size != 1) & (!stop) {\n sponge.absorb(input[i]);\n shift += 1;\n }\n }\n sponge = if stop {\n sponge\n } else {\n // max_chunks = (N - (N % 3)) / 3;\n poseidon2_absorb_chunks_loop::<N, (N - (N % 3)) / 3>(\n sponge,\n input,\n in_len,\n skip_0_check,\n shift,\n )\n };\n sponge\n}\n\n// The below is the loop to absorb elts into a poseidon sponge in chunks of 3\n// shift - the num of elts already absorbed to ensure the sponge's cache_size = 1\n// M - the max number of chunks required to absorb N things (must be comptime to compile)\n// NB: The 0 checks ('Found non-zero field...') are messy, but having a separate loop over N to check\n// for 0s costs 3N gates. Current approach is approx 2N gates.\n#[no_predicates]\nfn poseidon2_absorb_chunks_loop<let N: u32, let M: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n variable: bool,\n shift: u32,\n) -> Poseidon2Sponge {\n assert(in_len <= N, \"Given in_len to absorb is larger than the input array len\");\n // When we have an existing sponge, we may have a shift of 0, and the final 'k+2' below = N\n // The below avoids an overflow\n let skip_last = 3 * M == N;\n // Writing in_sponge: &mut does not compile\n let mut sponge = in_sponge;\n let mut should_add = true;\n // The num of things left over after absorbing in 3s\n let remainder = (in_len - shift) % 3;\n // The num of chunks of 3 to absorb (maximum M)\n let chunks = (in_len - shift - remainder) / 3;\n for i in 0..M {\n // Now we loop through cache size = 1 -> 3\n should_add &= i != chunks;\n // This is the index at the start of the chunk (for readability)\n let k = 3 * i + shift;\n if should_add {\n // cache_size = 1, 2 => just assign\n sponge.cache[1] = input[k];\n sponge.cache[2] = input[k + 1];\n // cache_size = 3 => duplex + perm\n for j in 0..3 {\n sponge.state[j] += sponge.cache[j];\n }\n sponge.state = std::hash::poseidon2_permutation(sponge.state, 4);\n sponge.cache[0] = input[k + 2];\n // cache_size is now 1 again, repeat loop\n } else if (!variable) & (i != chunks) {\n // if we are hashing a fixed len array which is a subarray, we check the remaining elts are 0\n // NB: we don't check at i == chunks, because that chunk contains elts to be absorbed or checked below\n let last_0 = if (i == M - 1) & (skip_last) {\n 0\n } else {\n input[k + 2]\n };\n let all_0 = (input[k] == 0) & (input[k + 1] == 0) & (last_0 == 0);\n assert(all_0, \"Found non-zero field after breakpoint\");\n }\n }\n // we have 'remainder' num of items left to absorb\n should_add = true;\n // below is to avoid overflows (i.e. if inlen is close to N)\n let mut should_check = !variable;\n for i in 0..3 {\n should_add &= i != remainder;\n should_check &= in_len - remainder + i != N;\n if should_add {\n // we want to absorb the final 'remainder' items\n sponge.absorb(input[in_len - remainder + i]);\n } else if should_check {\n assert(input[in_len - remainder + i] == 0, \"Found non-zero field after breakpoint\");\n }\n }\n sponge\n}\n\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs[i]);\n }\n\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n for i in 0..in_len {\n input[i] = 3;\n }\n let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(input, in_len);\n assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn existing_sponge_poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n // absorb 250 of the 501 things\n let empty_sponge = Poseidon2Sponge::new((in_len as Field) * TWO_POW_64);\n let first_sponge = poseidon2_absorb_chunks_existing_sponge(empty_sponge, input, 250, true);\n // now absorb the final 251 (since they are all 3s, im being lazy and not making a new array)\n let mut final_sponge = poseidon2_absorb_chunks_existing_sponge(first_sponge, input, 251, true);\n let fixed_len_hash = Poseidon2Sponge::hash(fixed_input, fixed_input.len());\n assert(final_sponge.squeeze() == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_empty_inputs() {\n let in_len = 0;\n let mut input: [Field; 4096] = [0; 4096];\n let mut constructed_empty_sponge = poseidon2_absorb_chunks(input, in_len, true);\n let mut first_sponge =\n poseidon2_absorb_chunks_existing_sponge(constructed_empty_sponge, input, in_len, true);\n assert(first_sponge.squeeze() == constructed_empty_sponge.squeeze());\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn compute_l2_l1_hash() {\n // All zeroes\n let hash_result =\n compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n assert(hash_result == 0x3b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992);\n\n // Non-zero case\n let hash_result = compute_l2_to_l1_hash(\n AztecAddress::from_field(1),\n EthAddress::from_field(3),\n 5,\n 2,\n 4,\n );\n assert(hash_result == 0xaab2a5828156782b12a1dc6f336e2bc627eb1b9514b02d511f66296990c050);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n let version = 4;\n let chainId = 5;\n\n let hash = silo_l2_to_l1_message(\n L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n ),\n version,\n chainId,\n );\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let hash_from_typescript = 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, hash_from_typescript);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
2656
+ "source": "use crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector,\n note_hash::ScopedNoteHash,\n nullifier::ScopedNullifier,\n private_log::{PrivateLog, PrivateLogData},\n side_effect::{OrderedValue, scoped::Scoped},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, FUNCTION_TREE_HEIGHT, GENERATOR_INDEX__NOTE_HASH_NONCE,\n GENERATOR_INDEX__OUTER_NULLIFIER, GENERATOR_INDEX__SILOED_NOTE_HASH,\n GENERATOR_INDEX__UNIQUE_NOTE_HASH, TWO_POW_64,\n },\n merkle_tree::root::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n GENERATOR_INDEX__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, GENERATOR_INDEX__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_note_hash(app: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), note_hash],\n GENERATOR_INDEX__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique note hashes from siloed note hashes\npub fn compute_unique_siloed_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n if siloed_note_hash == 0 {\n 0\n } else {\n compute_nonce_and_unique_note_hash(siloed_note_hash, first_nullifier, note_index_in_tx)\n }\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn silo_note_hash(note_hash: ScopedNoteHash) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_note_hash(note_hash.contract_address, note_hash.value())\n }\n}\n\npub fn compute_siloed_nullifier(app: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [app.to_field(), nullifier],\n GENERATOR_INDEX__OUTER_NULLIFIER,\n )\n}\n\npub fn silo_nullifier(nullifier: ScopedNullifier) -> Field {\n // Q: shouldn't we be checking whether the _whole_ nullifier is empty?\n // A: We don't have to. The init and inner circuits add contract address to non-empty nullifiers.\n // So we know we should silo it if the contract address is not empty.\n if nullifier.contract_address.is_zero() {\n // Q: I don't understand this comment. We could still compute a siloed nullifier from a zero contract address.\n nullifier.value() // Return value instead of 0 because the first nullifier's contract address is zero.\n } else {\n compute_siloed_nullifier(nullifier.contract_address, nullifier.value())\n }\n}\n\npub fn compute_siloed_private_log_field(contract_address: AztecAddress, field: Field) -> Field {\n poseidon2_hash([contract_address.to_field(), field])\n}\n\npub fn silo_private_log(private_log: Scoped<PrivateLogData>) -> PrivateLog {\n if private_log.contract_address.is_zero() {\n private_log.inner.log\n } else {\n let mut fields = private_log.inner.log.fields;\n fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n PrivateLog::new(fields, private_log.inner.log.length)\n }\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n app_secret_generator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n app_secret_generator,\n )\n}\n\npub fn merkle_hash(left: Field, right: Field) -> Field {\n poseidon2_hash([left, right])\n}\n\npub fn compute_l2_to_l1_hash(\n contract_address: AztecAddress,\n recipient: EthAddress,\n content: Field,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = recipient.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n msg: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n if msg.contract_address.is_zero() {\n 0\n } else {\n compute_l2_to_l1_hash(\n msg.contract_address,\n msg.inner.recipient,\n msg.inner.content,\n rollup_version_id,\n chain_id,\n )\n }\n}\n\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\n#[inline_always]\npub fn pedersen_hash<let N: u32>(inputs: [Field; N], hash_index: u32) -> Field {\n std::hash::pedersen_hash_with_separator(inputs, hash_index)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n// Performs a fixed length hash with a subarray of the given input.\n// Useful for SpongeBlob in which we aborb M things and want to check it vs a hash of M elts of an N-len array.\n// Using stdlib poseidon, this will always absorb an extra 1 as a 'variable' hash, and not match spongeblob.squeeze()\n// or any ts implementation. Also checks that any remaining elts not hashed are empty.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, false);\n sponge.squeeze()\n}\n\n// NB the below is the same as poseidon::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_chunks(input, in_len, true);\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if in_len != N {\n sponge.absorb(1);\n }\n sponge.squeeze()\n}\n\n// The below fn reduces gates of a conditional poseidon2 hash by approx 3x (thank you ~* Giant Brain Dev @IlyasRidhuan *~ for the idea)\n// Why? Because when we call stdlib poseidon, we call absorb for each item. When absorbing is conditional, it seems the compiler does not know\n// what cache_size will be when calling absorb, so it assigns the permutation gates for /each i/ rather than /every 3rd i/, which is actually required.\n// The below code forces the compiler to:\n// - absorb normally up to 2 times to set cache_size to 1\n// - absorb in chunks of 3 to ensure perm. only happens every 3rd absorb\n// - absorb normally up to 2 times to add any remaining values to the hash\n// In fixed len hashes, the compiler is able to tell that it will only need to perform the permutation every 3 absorbs.\n// NB: it also replaces unnecessary range checks (i < thing) with a bit check (&= i != thing), which alone reduces the gates of a var. hash by half.\n\n#[no_predicates]\nfn poseidon2_absorb_chunks<let N: u32>(\n input: [Field; N],\n in_len: u32,\n variable: bool,\n) -> Poseidon2Sponge {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n // Even though shift is always 1 here, if we input in_len = 0 we get an underflow\n // since we cannot isolate computation branches. The below is just to avoid that.\n let shift = if in_len == 0 { 0 } else { 1 };\n if in_len != 0 {\n // cache_size = 0, init absorb\n sponge.cache[0] = input[0];\n sponge.cache_size = 1;\n // shift = num elts already added to make cache_size 1 = 1 for a fresh sponge\n // M = max_chunks = (N - 1 - (N - 1) % 3) / 3: (must be written as a fn of N to compile)\n // max_remainder = (N - 1) % 3;\n // max_chunks = (N - 1 - max_remainder) / 3;\n sponge = poseidon2_absorb_chunks_loop::<N, (N - 1 - (N - 1) % 3) / 3>(\n sponge,\n input,\n in_len,\n variable,\n shift,\n );\n }\n sponge\n}\n\n// NB: If it's not required to check that the non-absorbed elts of 'input' are 0s, set skip_0_check=true\n#[no_predicates]\npub fn poseidon2_absorb_chunks_existing_sponge<let N: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n skip_0_check: bool,\n) -> Poseidon2Sponge {\n let mut sponge = in_sponge;\n // 'shift' is to account for already added inputs\n let mut shift = 0;\n // 'stop' is to avoid an underflow when inputting in_len = 0\n let mut stop = false;\n for i in 0..3 {\n if shift == in_len {\n stop = true;\n }\n if (sponge.cache_size != 1) & (!stop) {\n sponge.absorb(input[i]);\n shift += 1;\n }\n }\n sponge = if stop {\n sponge\n } else {\n // max_chunks = (N - (N % 3)) / 3;\n poseidon2_absorb_chunks_loop::<N, (N - (N % 3)) / 3>(\n sponge,\n input,\n in_len,\n skip_0_check,\n shift,\n )\n };\n sponge\n}\n\n// The below is the loop to absorb elts into a poseidon sponge in chunks of 3\n// shift - the num of elts already absorbed to ensure the sponge's cache_size = 1\n// M - the max number of chunks required to absorb N things (must be comptime to compile)\n// NB: The 0 checks ('Found non-zero field...') are messy, but having a separate loop over N to check\n// for 0s costs 3N gates. Current approach is approx 2N gates.\n#[no_predicates]\nfn poseidon2_absorb_chunks_loop<let N: u32, let M: u32>(\n in_sponge: Poseidon2Sponge,\n input: [Field; N],\n in_len: u32,\n variable: bool,\n shift: u32,\n) -> Poseidon2Sponge {\n assert(in_len <= N, \"Given in_len to absorb is larger than the input array len\");\n // When we have an existing sponge, we may have a shift of 0, and the final 'k+2' below = N\n // The below avoids an overflow\n let skip_last = 3 * M == N;\n // Writing in_sponge: &mut does not compile\n let mut sponge = in_sponge;\n let mut should_add = true;\n // The num of things left over after absorbing in 3s\n let remainder = (in_len - shift) % 3;\n // The num of chunks of 3 to absorb (maximum M)\n let chunks = (in_len - shift - remainder) / 3;\n for i in 0..M {\n // Now we loop through cache size = 1 -> 3\n should_add &= i != chunks;\n // This is the index at the start of the chunk (for readability)\n let k = 3 * i + shift;\n if should_add {\n // cache_size = 1, 2 => just assign\n sponge.cache[1] = input[k];\n sponge.cache[2] = input[k + 1];\n // cache_size = 3 => duplex + perm\n for j in 0..3 {\n sponge.state[j] += sponge.cache[j];\n }\n sponge.state = std::hash::poseidon2_permutation(sponge.state, 4);\n sponge.cache[0] = input[k + 2];\n // cache_size is now 1 again, repeat loop\n } else if (!variable) & (i != chunks) {\n // if we are hashing a fixed len array which is a subarray, we check the remaining elts are 0\n // NB: we don't check at i == chunks, because that chunk contains elts to be absorbed or checked below\n let last_0 = if (i == M - 1) & (skip_last) {\n 0\n } else {\n input[k + 2]\n };\n let all_0 = (input[k] == 0) & (input[k + 1] == 0) & (last_0 == 0);\n assert(all_0, \"Found non-zero field after breakpoint\");\n }\n }\n // we have 'remainder' num of items left to absorb\n should_add = true;\n // below is to avoid overflows (i.e. if inlen is close to N)\n let mut should_check = !variable;\n for i in 0..3 {\n should_add &= i != remainder;\n should_check &= in_len - remainder + i != N;\n if should_add {\n // we want to absorb the final 'remainder' items\n sponge.absorb(input[in_len - remainder + i]);\n } else if should_check {\n assert_eq(input[in_len - remainder + i], 0, \"Found non-zero field after breakpoint\");\n }\n }\n sponge\n}\n\npub fn poseidon2_hash_with_separator_slice<T>(inputs: [Field], separator: T) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs[i]);\n }\n\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n for i in 0..in_len {\n input[i] = 3;\n }\n let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(input, in_len);\n assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn existing_sponge_poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n // absorb 250 of the 501 things\n let empty_sponge = Poseidon2Sponge::new((in_len as Field) * TWO_POW_64);\n let first_sponge = poseidon2_absorb_chunks_existing_sponge(empty_sponge, input, 250, true);\n // now absorb the final 251 (since they are all 3s, im being lazy and not making a new array)\n let mut final_sponge = poseidon2_absorb_chunks_existing_sponge(first_sponge, input, 251, true);\n let fixed_len_hash = Poseidon2Sponge::hash(fixed_input, fixed_input.len());\n assert(final_sponge.squeeze() == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_empty_inputs() {\n let in_len = 0;\n let mut input: [Field; 4096] = [0; 4096];\n let mut constructed_empty_sponge = poseidon2_absorb_chunks(input, in_len, true);\n let mut first_sponge =\n poseidon2_absorb_chunks_existing_sponge(constructed_empty_sponge, input, in_len, true);\n assert(first_sponge.squeeze() == constructed_empty_sponge.squeeze());\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn compute_l2_l1_hash() {\n // All zeroes\n let hash_result =\n compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n assert(hash_result == 0x3b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992);\n\n // Non-zero case\n let hash_result = compute_l2_to_l1_hash(\n AztecAddress::from_field(1),\n EthAddress::from_field(3),\n 5,\n 2,\n 4,\n );\n assert(hash_result == 0xaab2a5828156782b12a1dc6f336e2bc627eb1b9514b02d511f66296990c050);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n let version = 4;\n let chainId = 5;\n\n let hash = silo_l2_to_l1_message(\n L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n ),\n version,\n chainId,\n );\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let hash_from_typescript = 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, hash_from_typescript);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
2523
2657
  },
2524
- "315": {
2658
+ "329": {
2525
2659
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/mod.nr",
2526
- "source": "use super::traits::{Deserialize, Packable, Serialize};\n\n/// Returns the typed expression of a trait method implementation.\n///\n/// This helper function is preferred over directly inlining with `$typ::target_method()` in a quote,\n/// as direct inlining would result in missing import warnings in the generated code (specifically,\n/// warnings that the trait implementation is not in scope).\n///\n/// # Note\n/// A copy of this function exists in `aztec-nr/aztec/src/macros/utils.nr`. We maintain separate copies\n/// because importing it there from here would cause the `target_trait` to be interpreted in the context\n/// of this crate, making it impossible to compile code for traits from that crate (e.g. NoteType).\ncomptime fn get_trait_impl_method(\n typ: Type,\n target_trait: Quoted,\n target_method: Quoted,\n) -> TypedExpr {\n let trait_constraint = target_trait.as_trait_constraint();\n typ\n .get_trait_impl(trait_constraint)\n .expect(f\"Could not find impl for {target_trait} for type {typ}\")\n .methods()\n .filter(|m| m.name() == target_method)[0]\n .as_typed_expr()\n}\n\n/// Generates code that deserializes a struct, primitive type, array or string from a field array.\n///\n/// # Parameters\n/// - `name`: The name of the current field being processed, used to identify fields for replacement.\n/// - `typ`: The type of the struct or field being deserialized (e.g., a custom struct, array, or primitive).\n/// - `field_array_name`: The name of the field array containing serialized field data (e.g., `\"values\"`).\n/// - `num_already_consumed`: The number of fields already processed in previous recursion calls.\n/// - `should_unpack`: A boolean indicating whether the type should be unpacked (see description of `Packable`\n/// and `Serialize` trait for more information about the difference between packing and serialization).\n///\n/// # Returns\n/// A tuple containing:\n/// - `Quoted`: A code that deserializes a given struct, primitive type, array, or string from the field array.\n/// - `u32`: The total number of fields consumed during deserialization (used for recursion).\n///\n/// # Nested Struct Example\n/// Given the following setup:\n/// ```\n/// struct UintNote {\n/// value: u128,\n/// owner: AztecAddress,\n/// randomness: Field,\n/// }\n///\n/// struct AztecAddress {\n/// inner: Field,\n/// }\n/// ```\n///\n/// If `UintNote` is the input type, the function will generate the following deserialization code:\n/// ```\n/// UintNote {\n/// value: fields[0] as u128,\n/// owner: AztecAddress {\n/// inner: fields[1],\n/// },\n/// randomness: fields[2],\n/// }\n/// ```\n/// # Nested Struct Example with Unpacking\n/// - given the same setup as above and given that u128, AztecAddress and Field implement the `Packable` trait\n/// the result we get is:\n/// ```\n/// UintNote {\n/// value: aztec::protocol_types::traits::Packable::unpack([fields[0]]),\n/// owner: aztec::protocol_types::traits::Packable::unpack([fields[1]]),\n/// randomness: aztec::protocol_types::traits::Packable::unpack([fields[2]]),\n/// }\n/// ```\n///\n/// # Panics\n/// - If the deserialization logic encounters a type it does not support.\n/// - If an incorrect number of fields are consumed when deserializing a string.\npub comptime fn generate_deserialize_from_fields(\n name: Quoted,\n typ: Type,\n field_array_name: Quoted,\n num_already_consumed: u32,\n should_unpack: bool,\n) -> (Quoted, u32) {\n let mut result = quote {};\n // Counter for the number of fields consumed\n let mut consumed_counter: u32 = 0;\n\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint = quote { Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_unpack & typ.implements(packable_constraint)) {\n // Unpacking is enabled and the given type implements the `Packable` trait so we call the `unpack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We copy the packed fields into a new array and pass that to the unpack function in a quote\n let mut packed_fields_quotes = &[];\n for i in 0..packed_len {\n let index_in_field_array = i + num_already_consumed;\n packed_fields_quotes =\n packed_fields_quotes.push_back(quote { $field_array_name[$index_in_field_array] });\n }\n let packed_fields = packed_fields_quotes.join(quote {,});\n\n // Now we call unpack on the type\n let unpack_method = get_trait_impl_method(typ, quote { Packable<_> }, quote { unpack });\n result = quote { $unpack_method([ $packed_fields ]) };\n\n consumed_counter = packed_len;\n } else if typ.is_bool() {\n // The field is a primitive so we just reference it in the field array\n result = quote { $field_array_name[$num_already_consumed] != 0 };\n consumed_counter = 1;\n } else if typ.is_field() | typ.as_integer().is_some() {\n // The field is a primitive so we just reference it in the field array\n result = quote { $field_array_name[$num_already_consumed] as $typ };\n consumed_counter = 1;\n } else if typ.as_data_type().is_some() {\n // The field is a struct so we iterate over each struct field and recursively call\n // `generate_deserialize_from_fields`\n let (nested_def, generics) = typ.as_data_type().unwrap();\n let nested_name = nested_def.name();\n let mut deserialized_fields_list = &[];\n\n // Iterate over each field in the struct\n for field in nested_def.fields(generics) {\n let (field_name, field_type, _) = field;\n // Recursively call `generate_deserialize_from_fields` for each field in the struct\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n field_name,\n field_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `value: u128 { lo: fields[0], hi: fields[1] }`\n deserialized_fields_list =\n deserialized_fields_list.push_back(quote { $field_name: $deserialized_field });\n }\n\n // We can construct the struct from the deserialized fields\n let deserialized_fields = deserialized_fields_list.join(quote {,});\n result = quote {\n $nested_name {\n $deserialized_fields\n }\n };\n } else if typ.as_array().is_some() {\n // The field is an array so we iterate over each element and recursively call\n // `generate_deserialize_from_fields`\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n let mut array_fields_list = &[];\n\n // Iterate over each element in the array\n for _ in 0..array_len {\n // Recursively call `generate_deserialize_from_fields` for each element in the array\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n element_type,\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n // We increment the consumed counter by the number of fields consumed in the recursion\n consumed_counter += num_consumed_in_recursion;\n // We add the deserialized field to the list of deserialized fields.\n array_fields_list = array_fields_list.push_back(deserialized_field);\n }\n\n // We can construct the array from the deserialized fields\n let array_fields = array_fields_list.join(quote {,});\n result = quote { [ $array_fields ] };\n } else if typ.as_str().is_some() {\n // The field is a string and we expect each byte of the string to be represented as 1 field in the field\n // array. So we iterate over the string length and deserialize each character as u8 in the recursive call\n // to `generate_deserialize_from_fields`.\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let mut byte_list = &[];\n\n // Iterate over each character in the string\n for _ in 0..str_len {\n // Recursively call `generate_deserialize_from_fields` for each character in the string\n let (deserialized_field, num_consumed_in_recursion) = generate_deserialize_from_fields(\n name,\n quote {u8}.as_type(),\n field_array_name,\n consumed_counter + num_already_consumed,\n should_unpack,\n );\n\n // We should consume just one field in the recursion so we sanity check that\n assert_eq(\n num_consumed_in_recursion,\n 1,\n \"Incorrect number of fields consumed in string deserialization\",\n );\n\n // We increment the consumed counter by 1 as we have consumed one field\n consumed_counter += 1;\n\n // We add the deserialized field to the list of deserialized fields.\n // E.g. `fields[6] as u8`\n byte_list = byte_list.push_back(deserialized_field);\n }\n\n // We construct the string from the deserialized fields\n let bytes = byte_list.join(quote {,});\n result = quote { [ $bytes ].as_str_unchecked() };\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n\n (result, consumed_counter)\n}\n\n/// Generates code that serializes a type into an array of fields. Also generates auxiliary variables if necessary\n/// for serialization. If `should_pack` is true, we check if the type implements the `Packable` trait and pack it\n/// if it does.\n///\n/// # Parameters\n/// - `name`: The base identifier (e.g., `self`, `some_var`).\n/// - `typ`: The type being serialized (e.g., a custom struct, array, or primitive type).\n/// - `should_pack`: A boolean indicating whether the type should be packed.\n///\n/// # Returns\n/// A tuple containing:\n/// - A flattened array of `Quoted` field references representing the serialized fields.\n/// - An array of `Quoted` auxiliary variables needed for serialization, such as byte arrays for strings.\n///\n/// # Examples\n///\n/// ## Struct\n/// Given the following struct:\n/// ```rust\n/// struct MockStruct {\n/// a: Field,\n/// b: Field,\n/// }\n/// ```\n///\n/// Serializing the struct:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_mock_struct }, MockStruct, false)\n/// // Returns:\n/// // ([`my_mock_struct.a`, `my_mock_struct.b`], [])\n/// ```\n///\n/// ## Nested Struct\n/// For a more complex struct:\n/// ```rust\n/// struct NestedStruct {\n/// m1: MockStruct,\n/// m2: MockStruct,\n/// }\n/// ```\n///\n/// Serialization output:\n/// ```rust\n/// generate_serialize_to_fields(quote { self }, NestedStruct, false)\n/// // Returns:\n/// // ([`self.m1.a`, `self.m1.b`, `self.m2.a`, `self.m2.b`], [])\n/// ```\n///\n/// ## Array\n/// For an array type:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_array }, [Field; 3], false)\n/// // Returns:\n/// // ([`my_array[0]`, `my_array[1]`, `my_array[2]`], [])\n/// ```\n///\n/// ## String\n/// For a string field, where each character is serialized as a `Field`:\n/// ```rust\n/// generate_serialize_to_fields(quote { my_string }, StringType, false)\n/// // Returns:\n/// // ([`my_string_as_bytes[0] as Field`, `my_string_as_bytes[1] as Field`, ...],\n/// // [`let my_string_as_bytes = my_string.as_bytes()`])\n/// ```\n///\n/// ## Nested Struct with packing enabled\n/// - u128 has a `Packable` implementation hence it will be packed.\n///\n/// For a more complex struct:\n/// ```rust\n/// struct MyStruct {\n/// value: u128,\n/// value2: Field,\n/// }\n/// ```\n///\n/// # Panics\n/// - If the type is unsupported for serialization.\n/// - If the provided `typ` contains invalid constants or incompatible structures.\npub comptime fn generate_serialize_to_fields(\n name: Quoted,\n typ: Type,\n should_pack: bool,\n) -> ([Quoted], [Quoted]) {\n let mut fields = &[];\n let mut aux_vars = &[];\n\n // If the type implements `Packable`, its length will be assigned to the `maybe_packed_len_typ` variable.\n let maybe_packed_len_typ = std::meta::typ::fresh_type_variable();\n let packable_constraint =\n quote { crate::traits::Packable<$maybe_packed_len_typ> }.as_trait_constraint();\n\n if (should_pack & typ.implements(packable_constraint)) {\n // Packing is enabled and the given type implements the `Packable` trait so we call the `pack()`\n // method, add the resulting field array to `aux_vars` and each field to `fields`.\n let packed_len = maybe_packed_len_typ.as_constant().unwrap();\n\n // We collapse the name to a one that gets tokenized as a single token (e.g. \"self.value\" -> \"self_value\").\n let name_at_one_token = collapse_to_one_token(name);\n let packed_struct_name = f\"{name_at_one_token}_aux_var\".quoted_contents();\n\n // We add the individual fields to the fields array\n let pack_method = get_trait_impl_method(\n typ,\n quote { crate::traits::Packable<$packed_len> },\n quote { pack },\n );\n let packed_struct = quote { let $packed_struct_name = $pack_method($name) };\n for i in 0..packed_len {\n fields = fields.push_back(quote { $packed_struct_name[$i] });\n }\n\n // We add the new auxiliary variable to the aux_vars array\n aux_vars = aux_vars.push_back(packed_struct);\n } else if typ.is_field() {\n // For field we just add the value to fields\n fields = fields.push_back(name);\n } else if typ.as_integer().is_some() | typ.is_bool() {\n // For integer and bool we just cast to Field and add the value to fields\n fields = fields.push_back(quote { $name as Field });\n } else if typ.as_data_type().is_some() {\n // For struct we pref\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n let struct_flattened = params.map(|(param_name, param_type, _)| {\n let maybe_prefixed_name = if name == quote {} {\n // Triggered when the param name is of a value available in the current scope (e.g. a function\n // argument) --> then we don't prefix the name with anything.\n param_name\n } else {\n // Triggered when we want to prefix the param name with the `name` from function input. This\n // can typically be `self` when implementing a method on a struct.\n quote { $name.$param_name }\n };\n generate_serialize_to_fields(quote {$maybe_prefixed_name}, param_type, should_pack)\n });\n let struct_flattened_fields = struct_flattened.fold(\n &[],\n |acc: [Quoted], (fields, _): (_, [Quoted])| acc.append(fields),\n );\n let struct_flattened_aux_vars = struct_flattened.fold(\n &[],\n |acc: [Quoted], (_, aux_vars): ([Quoted], _)| acc.append(aux_vars),\n );\n fields = fields.append(struct_flattened_fields);\n aux_vars = aux_vars.append(struct_flattened_aux_vars);\n } else if typ.as_array().is_some() {\n // For array we recursively call `generate_serialize_to_fields(...)` for each element\n let (element_type, array_len) = typ.as_array().unwrap();\n let array_len = array_len.as_constant().unwrap();\n for i in 0..array_len {\n let (element_fields, element_aux_vars) =\n generate_serialize_to_fields(quote { $name[$i] }, element_type, should_pack);\n fields = fields.append(element_fields);\n aux_vars = aux_vars.append(element_aux_vars);\n }\n } else if typ.as_str().is_some() {\n // For string we convert the value to bytes, we store the `as_bytes` in an auxiliary variables and\n // then we add each byte to fields as a Field\n let length_type = typ.as_str().unwrap();\n let str_len = length_type.as_constant().unwrap();\n let as_member = name.as_expr().unwrap().as_member_access();\n let var_name = if as_member.is_some() {\n as_member.unwrap().1\n } else {\n name\n };\n let as_bytes_name = f\"{var_name}_as_bytes\".quoted_contents();\n let as_bytes = quote { let $as_bytes_name = $name.as_bytes() };\n for i in 0..str_len {\n fields = fields.push_back(quote { $as_bytes_name[$i] as Field });\n }\n aux_vars = aux_vars.push_back(as_bytes);\n } else {\n panic(\n f\"Unsupported type for serialization of argument {name} and type {typ}\",\n )\n }\n\n (fields, aux_vars)\n}\n\n/// From a quote that gets tokenized to a multiple tokens we collapse it to a single token by replacing all `.` with `_`.\n/// E.g. \"self.values[0]\" -> \"self_values_0_\"\ncomptime fn collapse_to_one_token(q: Quoted) -> Quoted {\n let tokens = q.tokens();\n\n let mut single_token = quote {};\n for token in tokens {\n let new_token = if ((token == quote {.}) | (token == quote {[}) | (token == quote {]})) {\n quote {_}\n } else {\n token\n };\n single_token = f\"{single_token}{new_token}\".quoted_contents();\n }\n single_token\n}\n\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, aux_vars) = generate_serialize_to_fields(quote { self }, typ, false);\n let aux_vars_for_serialization = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let field_serializations = fields.join(quote {,});\n let serialized_len = fields.len();\n let serialize_trait: TraitConstraint =\n quote { Serialize<$serialized_len> }.as_trait_constraint();\n quote {\n impl $serialize_trait for $typ {\n #[inline_always]\n fn serialize(self) -> [Field; $serialized_len] {\n $aux_vars_for_serialization\n [ $field_serializations ]\n }\n }\n }\n}\n\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let (fields, _) = generate_serialize_to_fields(quote { self }, typ, false);\n let serialized_len = fields.len();\n let (deserialized, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { serialized }, 0, false);\n quote {\n impl Deserialize<$serialized_len> for $typ {\n #[inline_always]\n fn deserialize(serialized: [Field; $serialized_len]) -> Self {\n $deserialized\n }\n }\n }\n}\n\n/// Generates `Packable` implementation for a given struct and returns the packed length.\n///\n/// Note: We are having this function separate from `derive_packable` because we use this in the note macros to get\n/// the packed length of a note as well as the `Packable` implementation. We need the length to be able to register\n/// the note in the global `NOTES` map. There the length is used to generate partial note helper functions.\npub comptime fn derive_packable_and_get_packed_len(s: TypeDefinition) -> (Quoted, u32) {\n let packing_enabled = true;\n\n let typ = s.as_type();\n let (fields, aux_vars) = generate_serialize_to_fields(quote { self }, typ, packing_enabled);\n let aux_vars_for_packing = if aux_vars.len() > 0 {\n let joint = aux_vars.join(quote {;});\n quote { $joint; }\n } else {\n quote {}\n };\n\n let (unpacked, _) =\n generate_deserialize_from_fields(quote { self }, typ, quote { packed }, 0, packing_enabled);\n\n let field_packings = fields.join(quote {,});\n let packed_len = fields.len();\n let packable_trait: TraitConstraint = quote { Packable<$packed_len> }.as_trait_constraint();\n (\n quote {\n impl $packable_trait for $typ {\n fn pack(self) -> [Field; $packed_len] {\n $aux_vars_for_packing\n [ $field_packings ]\n }\n\n fn unpack(packed: [Field; $packed_len]) -> Self {\n $unpacked\n }\n }\n },\n packed_len,\n )\n}\n\npub(crate) comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n let (packable_impl, _) = derive_packable_and_get_packed_len(s);\n packable_impl\n}\n\n#[derive(Packable, Serialize, Deserialize, Eq)]\npub struct Smol {\n a: Field,\n b: Field,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct HasArray {\n a: [Field; 2],\n b: bool,\n}\n\n#[derive(Serialize, Deserialize, Eq)]\npub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n}\n\nfn main() {\n assert(false);\n}\n\n#[test]\nfn smol_test() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n let deserialized = Smol::deserialize(serialized);\n assert(deserialized == smol);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n}\n\n#[test]\nfn has_array_test() {\n let has_array = HasArray { a: [1, 2], b: true };\n let serialized = has_array.serialize();\n assert(serialized == [1, 2, 1], serialized);\n let deserialized = HasArray::deserialize(serialized);\n assert(deserialized == has_array);\n}\n\n#[test]\nfn fancier_test() {\n let fancier =\n Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n let serialized = fancier.serialize();\n assert(\n serialized\n == [\n 1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n 0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n ],\n serialized,\n );\n let deserialized = Fancier::deserialize(serialized);\n assert(deserialized == fancier);\n}\n"
2660
+ "source": "/// Generates the generic parameter declarations for a struct's trait implementation.\n///\n/// This function takes a struct type definition and generates the generic parameter declarations\n/// that go after the `impl` keyword. For example, given a struct with generics `N: u32` and `T`,\n/// it generates `<let N: u32, T>`.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate generic declarations for\n///\n/// # Returns\n/// A quoted code block containing the generic parameter declarations, or an empty quote if the struct\n/// has no generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// This function generates:\n/// ```\n/// <let N: u32, T>\n/// ```\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|(name, maybe_integer_typ)| {\n // The second item in the generics tuple is an Option of an integer type that is Some only if\n // the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote {$name}\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\n/// Generates the `where` clause for a trait implementation that constrains non-numeric generic type parameters.\n///\n/// This function takes a struct type definition and a trait name, and generates a `where` clause that\n/// requires all non-numeric generic type parameters to implement the specified trait.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the where clause for\n/// - `trait_name`: The name of the trait that non-numeric generic parameters must implement\n///\n/// # Returns\n/// A quoted code block containing the where clause, or an empty quote if the struct has no non-numeric\n/// generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// And trait name \"Serialize\", this function generates:\n/// ```\n/// where T: Serialize\n/// ```\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n // numeric.\n let non_numeric_generics =\n generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations =\n non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// #[inline_always]\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut result = [0; _];\n/// let mut offset = 0;\n///\n/// let serialized_member = Serialize::serialize(self.fields);\n/// let serialized_member_len = <[Field; N] as Serialize>::N;\n/// for i in 0..serialized_member_len {\n/// result[i + offset] = serialized_member[i];\n/// }\n/// offset += serialized_member_len;\n///\n/// let serialized_member = Serialize::serialize(self.length);\n/// let serialized_member_len = <u32 as Serialize>::N;\n/// for i in 0..serialized_member_len {\n/// result[i + offset] = serialized_member[i];\n/// }\n/// offset += serialized_member_len;\n///\n/// result\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as Serialize>::N + ...\n let right_hand_side_of_definition_of_n = params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::traits::Serialize>::N\n }\n })\n .join(quote {+});\n\n // For structs containing a single member, we can enhance performance by directly returning the serialized member,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // For multiple struct members, generate serialization code that:\n // 1. Serializes each member\n // 2. Copies the serialized fields into the result array at the correct offset\n // 3. Updates the offset for the next member\n let serialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let serialized_member = $crate::traits::Serialize::serialize(self.$param_name);\n let serialized_member_len = <$param_type as $crate::traits::Serialize>::N;\n for i in 0..serialized_member_len {\n result[i + offset] = serialized_member[i];\n }\n offset += serialized_member_len;\n }\n })\n .join(quote {});\n\n quote {\n let mut result = [0; _];\n let mut offset = 0;\n\n $serialization_of_struct_members\n\n result\n }\n } else {\n let param_name = params[0].0;\n quote {\n $crate::traits::Serialize::serialize(self.$param_name)\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n $function_body\n }\n }\n }\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(serialized: [Field; Self::N]) -> Self {\n/// let mut offset = 0;\n/// let mut member_fields = [0; <AztecAddress as Deserialize>::N];\n/// for i in 0..<AztecAddress as Deserialize>::N {\n/// member_fields[i] = serialized[i + offset];\n/// }\n/// let x = <AztecAddress as Deserialize>::deserialize(member_fields);\n/// offset += <AztecAddress as Deserialize>::N;\n///\n/// let mut member_fields = [0; <Field as Deserialize>::N];\n/// for i in 0..<Field as Deserialize>::N {\n/// member_fields[i] = serialized[i + offset];\n/// }\n/// let y = <Field as Deserialize>::deserialize(member_fields);\n/// offset += <Field as Deserialize>::N;\n///\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n // The following will give us <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n let right_hand_side_of_definition_of_n = params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::traits::Deserialize>::N\n }\n })\n .join(quote {+});\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let mut member_fields = [0; <$param_type as Deserialize>::N];\n for i in 0..<$param_type as Deserialize>::N {\n member_fields[i] = serialized[i + offset];\n }\n let $param_name = <$param_type as Deserialize>::deserialize(member_fields);\n offset += <$param_type as Deserialize>::N;\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n let mut offset = 0;\n\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::traits::Deserialize::deserialize(serialized) }\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn deserialize(serialized: [Field; Self::N]) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a `Packable` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Packable` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Packable for MyStruct {\n/// let N: u32 = 2;\n///\n/// fn pack(self) -> [Field; 2] {\n/// let mut result: [Field; 2] = [0_Field; 2];\n/// let mut offset: u32 = 0_u32;\n/// let packed_member: [Field; 1] = self.x.pack();\n/// let packed_member_len: u32 = <Field as Packable>::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// let packed_member: [Field; 1] = self.y.pack();\n/// let packed_member_len: u32 = <Field as Packable>::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// result\n/// }\n///\n/// fn unpack(packed: [Field; 2]) -> Self {\n/// let mut offset: u32 = 0_u32;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..<AztecAddress as Packable>::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let x: AztecAddress = <AztecAddress as Packable>::unpack(member_fields);\n/// offset = offset + <AztecAddress as Packable>::N;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..<Field as Packable>::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let y: Field = <Field as Packable>::unpack(member_fields);\n/// offset = offset + <Field as Packable>::N;\n/// Self { x: x, y: y }\n/// }\n/// }\n/// ```\npub comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Packable` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_packable_clause = get_where_trait_clause(s, quote {Packable});\n\n // The following will give us <type_of_struct_member_1 as Packable>::N + <type_of_struct_member_2 as Packable>::N + ...\n let right_hand_side_of_definition_of_n = params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::traits::Packable>::N\n }\n })\n .join(quote {+});\n\n // For structs containing a single member, we can enhance performance by directly returning the packed member,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let pack_function_body = if params.len() > 1 {\n // For multiple struct members, generate packing code that:\n // 1. Packs each member\n // 2. Copies the packed fields into the result array at the correct offset\n // 3. Updates the offset for the next member\n let packing_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let packed_member = $crate::traits::Packable::pack(self.$param_name);\n let packed_member_len = <$param_type as $crate::traits::Packable>::N;\n for i in 0..packed_member_len {\n result[i + offset] = packed_member[i];\n }\n offset += packed_member_len;\n }\n })\n .join(quote {});\n\n quote {\n let mut result = [0; Self::N];\n let mut offset = 0;\n\n $packing_of_struct_members\n\n result\n }\n } else {\n let param_name = params[0].0;\n quote {\n $crate::traits::Packable::pack(self.$param_name)\n }\n };\n\n // For structs containing a single member, we can enhance performance by directly unpacking the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let unpack_function_body = if params.len() > 1 {\n // For multiple struct members, generate unpacking code that:\n // 1. Unpacks each member\n // 2. Copies packed fields into member array at correct offset\n // 3. Updates offset for next member\n let unpacking_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let mut member_fields = [0; <$param_type as $crate::traits::Packable>::N];\n for i in 0..<$param_type as $crate::traits::Packable>::N {\n member_fields[i] = packed[i + offset];\n }\n let $param_name = <$param_type as $crate::traits::Packable>::unpack(member_fields);\n offset += <$param_type as $crate::traits::Packable>::N;\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n let mut offset = 0;\n $unpacking_of_struct_members\n Self { $struct_members }\n }\n } else {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::traits::Packable::unpack(packed) }\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Packable for $typ\n $where_packable_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n $pack_function_body\n }\n\n #[inline_always]\n fn unpack(packed: [Field; Self::N]) -> Self {\n $unpack_function_body\n }\n }\n }\n}\n\nmod test {\n use crate::traits::{Deserialize, Packable, Serialize};\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct Smol {\n a: Field,\n b: Field,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct HasArray {\n a: [Field; 2],\n b: bool,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n }\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct HasArrayWithGenerics<T, let N: u32> {\n pub fields: [T; N],\n pub length: u32,\n }\n\n #[test]\n fn serde_on_smol() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n let deserialized = Smol::deserialize(serialized);\n assert(deserialized == smol);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n }\n\n #[test]\n fn serde_on_has_array() {\n let has_array = HasArray { a: [1, 2], b: true };\n let serialized = has_array.serialize();\n assert(serialized == [1, 2, 1], serialized);\n let deserialized = HasArray::deserialize(serialized);\n assert(deserialized == has_array);\n }\n\n #[test]\n fn serde_on_fancier() {\n let fancier =\n Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n let serialized = fancier.serialize();\n assert(\n serialized\n == [\n 1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n 0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n ],\n serialized,\n );\n let deserialized = Fancier::deserialize(serialized);\n assert(deserialized == fancier);\n }\n\n #[test]\n fn serde_on_contains_array_with_generics() {\n let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n let serialized = struct_with_array_of_generics.serialize();\n assert(serialized == [1, 2, 3, 3], serialized);\n let deserialized = HasArrayWithGenerics::deserialize(serialized);\n assert(deserialized == struct_with_array_of_generics);\n }\n\n #[test]\n fn packable_on_contains_array_with_generics() {\n let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n let packed = struct_with_array_of_generics.pack();\n assert(packed == [1, 2, 3, 3], packed);\n\n let unpacked = HasArrayWithGenerics::unpack(packed);\n assert(unpacked == struct_with_array_of_generics);\n }\n\n}\n"
2527
2661
  },
2528
- "318": {
2662
+ "331": {
2529
2663
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/poseidon2.nr",
2530
- "source": "use crate::constants::TWO_POW_64;\n\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2Sponge {\n pub cache: [Field; 3],\n pub state: [Field; 4],\n pub cache_size: u32,\n pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n let mut result =\n Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = std::hash::poseidon2_permutation(self.state, 4);\n }\n\n pub fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n pub fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n"
2664
+ "source": "use crate::constants::TWO_POW_64;\nuse crate::traits::{Deserialize, Serialize};\nuse std::meta::derive;\n// NB: This is a clone of noir/noir-repo/noir_stdlib/src/hash/poseidon2.nr\n// It exists as we sometimes need to perform custom absorption, but the stdlib version\n// has a private absorb() method (it's also designed to just be a hasher)\n// Can be removed when standalone noir poseidon lib exists: See noir#6679\n\ncomptime global RATE: u32 = 3;\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct Poseidon2Sponge {\n pub cache: [Field; 3],\n pub state: [Field; 4],\n pub cache_size: u32,\n pub squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2Sponge {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2Sponge::hash_internal(input, message_size, message_size != N)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2Sponge {\n let mut result =\n Poseidon2Sponge { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n for i in 0..RATE {\n // We effectively zero-pad the cache by only adding to the state\n // cache that is less than the specified `cache_size`\n if i < self.cache_size {\n self.state[i] += self.cache[i];\n }\n }\n self.state = std::hash::poseidon2_permutation(self.state, 4);\n }\n\n pub fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n pub fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(\n input: [Field; N],\n in_len: u32,\n is_variable_length: bool,\n ) -> Field {\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n for i in 0..input.len() {\n if i < in_len {\n sponge.absorb(input[i]);\n }\n }\n\n // In the case where the hash preimage is variable-length, we append `1` to the end of the input, to distinguish\n // from fixed-length hashes. (the combination of this additional field element + the hash IV ensures\n // fixed-length and variable-length hashes do not collide)\n if is_variable_length {\n sponge.absorb(1);\n }\n sponge.squeeze()\n }\n}\n"
2531
2665
  },
2532
- "353": {
2666
+ "356": {
2533
2667
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/traits.nr",
2534
- "source": "use crate::meta::{derive_deserialize, derive_packable, derive_serialize};\nuse crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic\n// if a value can actually be zero. In a future refactor, we can\n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\npub trait Empty {\n fn empty() -> Self;\n}\n\nimpl Empty for Field {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for u1 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u128 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl<T, let N: u32> Empty for [T; N]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty(); N]\n }\n}\n\nimpl<T> Empty for Option<T> {\n #[inline_always]\n fn empty() -> Self {\n Option::none()\n }\n}\n\npub fn is_empty<T>(item: T) -> bool\nwhere\n T: Empty + Eq,\n{\n item.eq(T::empty())\n}\n\npub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool\nwhere\n T: Empty + Eq,\n{\n array.all(|elem| is_empty(elem))\n}\n\npub trait Hash {\n fn hash(self) -> Field;\n}\n\npub trait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n #[inline_always]\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u128 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl<let N: u32> ToField for str<N> {\n #[inline_always]\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\npub trait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value != 0\n }\n}\nimpl FromField for u1 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u32 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for u128 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u128\n }\n}\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Type Parameters\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize<N> for str<N> {\n/// fn serialize(self) -> [Field; N] {\n/// let bytes = self.as_bytes();\n/// let mut fields = [0; N];\n/// for i in 0..bytes.len() {\n/// fields[i] = bytes[i] as Field; // Each byte gets its own Field\n/// }\n/// fields\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize<let N: u32> {\n fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let N: u32> Serialize<N> for str<N> {\n #[inline_always]\n fn serialize(self) -> [Field; N] {\n let bytes = self.as_bytes();\n let mut fields = [0; N];\n for i in 0..bytes.len() {\n fields[i] = bytes[i] as Field;\n }\n fields\n }\n}\n\n// T = type of item in BoundedVec\n// M = max length of BoundedVec\n// O = field length of T\n// O * M + 1 = total serialized length of BoundedVec<T, M> (the +1 is for length of the BoundedVec)\nimpl<T, let M: u32, let O: u32> Deserialize<O * M + 1> for BoundedVec<T, M>\nwhere\n T: Deserialize<O>,\n{\n #[inline_always]\n fn deserialize(fields: [Field; O * M + 1]) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = fields[O * M] as u32;\n\n for i in 0..len {\n let mut nested_fields = [0; O];\n for j in 0..O {\n nested_fields[j] = fields[i * O + j];\n }\n\n let item = T::deserialize(nested_fields);\n new_bounded_vec.push(item);\n }\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl<let N: u32> Deserialize<0> for () {\n fn deserialize(_fields: [Field; 0]) -> Self {\n ()\n }\n}\n\nimpl<T, let M: u32, let O: u32> Serialize<O * M + 1> for BoundedVec<T, M>\nwhere\n T: Serialize<O>,\n{\n #[inline_always]\n fn serialize(self) -> [Field; O * M + 1] {\n let mut fields = [0; O * M + 1];\n\n let storage = self.storage();\n\n for i in 0..M {\n let serialized_item = storage[i].serialize();\n\n for j in 0..O {\n fields[i * O + j] = serialized_item[j];\n }\n }\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n fields[O * M] = self.len() as Field;\n\n fields\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Type Parameters\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Deserialize<N> for str<N> {\n/// fn deserialize(fields: [Field; N]) -> Self {\n/// str<N>::from(fields.map(|value| value as u8))\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize<let N: u32> {\n fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let N: u32> Deserialize<N> for str<N> {\n #[inline_always]\n fn deserialize(fields: [Field; N]) -> Self {\n str::<N>::from(fields.map(|value| value as u8))\n }\n}\n\n/// Trait for efficiently packing and unpacking Noir types into and from arrays of Fields.\n///\n/// The `Packable` trait allows types to be serialized and deserialized with a focus on minimizing the size of\n/// the resulting Field array. This trait is used when storage efficiency is critical (e.g. when storing data\n/// in the contract's public storage).\n///\n/// # Type Parameters\n/// * `N` - The length of the Field array, known at compile time.\n#[derive_via(derive_packable)]\npub trait Packable<let N: u32> {\n /// Packs the current value into a compact array of `Field` elements.\n fn pack(self) -> [Field; N];\n\n /// Unpacks a compact array of `Field` elements into the original value.\n fn unpack(fields: [Field; N]) -> Self;\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
2668
+ "source": "use crate::meta::{derive_deserialize, derive_packable, derive_serialize};\nuse crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic\n// if a value can actually be zero. In a future refactor, we can\n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\npub trait Empty: Eq {\n fn empty() -> Self;\n\n fn is_empty(self) -> bool {\n self.eq(Self::empty())\n }\n\n // Requires this Noir fix: https://github.com/noir-lang/noir/issues/9002\n // fn assert_not_empty<let U: u32>(self, msg: str<U>) { // This msg version was failing with weird compiler errors.\n // // We provide a default impl but it's likely inefficient.\n // // The reason we include this function is because there's a lot of\n // // opportunity for optimisation on a per-struct basis.\n // // You only need to show one element is not empty to know that the whole thing\n // // is not empty.\n // // If you know an element of your struct which should always be nonempty,\n // // you can write an impl that solely checks that that element is nonempty.\n // assert(!self.is_empty(), msg);\n // }\n\n // This default impl is overwritten by types like arrays, because there's a much\n // more efficient approach.\n fn assert_empty<let S: u32>(self, msg: str<S>) {\n assert(self.is_empty(), msg);\n }\n}\n\nimpl Empty for Field {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for u1 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u16 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u128 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl<T, let N: u32> Empty for [T; N]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty(); N]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\n\nimpl<T> Empty for [T]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty()]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\nimpl<A, B> Empty for (A, B)\nwhere\n A: Empty,\n B: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n (A::empty(), B::empty())\n }\n}\n\nimpl<T> Empty for Option<T>\nwhere\n T: Eq,\n{\n #[inline_always]\n fn empty() -> Self {\n Option::none()\n }\n}\n\n// pub fn is_empty<T>(item: T) -> bool\n// where\n// T: Empty,\n// {\n// item.eq(T::empty())\n// }\n\n// pub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool\n// where\n// T: Empty,\n// {\n// array.all(|elem| is_empty(elem))\n// }\n\n// pub fn assert_empty<T>(item: T) -> ()\n// where\n// T: Empty,\n// {\n// assert(item.eq(T::empty()))\n// }\n\n// pub fn assert_empty_array<T, let N: u32>(array: [T; N]) -> ()\n// where\n// T: Empty,\n// {\n// // A cheaper option than `is_empty_array` for if you don't need to gracefully\n// // handle a bool result.\n// // Avoids the `&` operator of `is_empty_array`'s `.all()` call.\n// for i in 0..N {\n// assert(is_empty(array[i]));\n// }\n// }\n\npub trait Hash {\n fn hash(self) -> Field;\n}\n\npub trait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n #[inline_always]\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u16 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u128 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl<let N: u32> ToField for str<N> {\n #[inline_always]\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\npub trait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value != 0\n }\n}\nimpl FromField for u1 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u16 {\n fn from_field(value: Field) -> Self {\n value as u16\n }\n}\nimpl FromField for u32 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for u128 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u128\n }\n}\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let bytes = self.as_bytes();\n/// let mut fields = [0; Self::N];\n/// for i in 0..bytes.len() {\n/// fields[i] = bytes[i] as Field; // Each byte gets its own Field\n/// }\n/// fields\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let bytes = self.as_bytes();\n let mut fields = [0; Self::N];\n for i in 0..bytes.len() {\n fields[i] = bytes[i] as Field;\n }\n fields\n }\n}\n\n/// Implementation of Deserialize for BoundedVec.\n///\n/// This implementation deserializes a BoundedVec from an array of Fields. The array contains:\n/// 1. The serialized items, each taking up T::N Fields\n/// 2. The length of the BoundedVec as the last Field\n///\n/// # Type Parameters\n/// * `T` - The type of items stored in the BoundedVec, must implement Deserialize\n/// * `M` - The maximum length of the BoundedVec\n///\n/// # Fields Array Layout\n/// [item1_field1, item1_field2, ..., item2_field1, item2_field2, ..., length]\n/// Where:\n/// - itemN_fieldM: The M-th Field of the N-th item (T::N Fields per item)\n/// - length: The number of items in the BoundedVec (1 Field)\n///\n/// Total length N = T::N * M + 1, where:\n/// - T::N is the number of Fields needed to deserialize one item\n/// - M is the maximum length of the BoundedVec\n/// - +1 is for storing the length\n///\n/// # Note\n/// Not deriving this because it's not supported to call derive_deserialize on a \"remote\" struct (and it will never\n/// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = fields[<T as Deserialize>::N * M] as u32;\n\n for i in 0..len {\n let mut nested_fields = [0; <T as Deserialize>::N];\n for j in 0..<T as Deserialize>::N {\n nested_fields[j] = fields[i * <T as Deserialize>::N + j];\n }\n\n let item = T::deserialize(nested_fields);\n new_bounded_vec.push(item);\n }\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(_fields: [Field; Self::N]) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let mut fields = [0; Self::N];\n\n let storage = self.storage();\n\n for i in 0..M {\n let serialized_item = storage[i].serialize();\n\n for j in 0..<T as Serialize>::N {\n fields[i * <T as Serialize>::N + j] = serialized_item[j];\n }\n }\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n fields[<T as Serialize>::N * M] = self.len() as Field;\n\n fields\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// #[inline_always]\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// str::<Self::N>::from(fields.map(|value| value as u8))\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n str::<Self::N>::from(fields.map(|value| value as u8))\n }\n}\n\n/// Trait for efficiently packing and unpacking Noir types into and from arrays of Fields.\n///\n/// The `Packable` trait allows types to be serialized and deserialized with a focus on minimizing the size of\n/// the resulting Field array. This trait is used when storage efficiency is critical (e.g. when storing data\n/// in the contract's public storage).\n///\n/// # Associated Constants\n/// * `N` - The length of the Field array, known at compile time\n#[derive_via(derive_packable)]\npub trait Packable {\n let N: u32;\n\n /// Packs the current value into a compact array of `Field` elements.\n fn pack(self) -> [Field; N];\n\n /// Unpacks a compact array of `Field` elements into the original value.\n fn unpack(fields: [Field; N]) -> Self;\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
2535
2669
  },
2536
2670
  "359": {
2537
2671
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_serialization.nr",
2538
- "source": "use crate::traits::{Deserialize, Serialize};\n\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize<BOOL_SERIALIZED_LEN> for bool {\n fn serialize(self) -> [Field; BOOL_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<BOOL_SERIALIZED_LEN> for bool {\n fn deserialize(fields: [Field; BOOL_SERIALIZED_LEN]) -> bool {\n fields[0] != 0\n }\n}\n\nimpl Serialize<U8_SERIALIZED_LEN> for u8 {\n fn serialize(self) -> [Field; U8_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U8_SERIALIZED_LEN> for u8 {\n fn deserialize(fields: [Field; U8_SERIALIZED_LEN]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Serialize<U16_SERIALIZED_LEN> for u16 {\n fn serialize(self) -> [Field; U16_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U16_SERIALIZED_LEN> for u16 {\n fn deserialize(fields: [Field; U16_SERIALIZED_LEN]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Serialize<U32_SERIALIZED_LEN> for u32 {\n fn serialize(self) -> [Field; U32_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U32_SERIALIZED_LEN> for u32 {\n fn deserialize(fields: [Field; U32_SERIALIZED_LEN]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Serialize<U64_SERIALIZED_LEN> for u64 {\n fn serialize(self) -> [Field; U64_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U64_SERIALIZED_LEN> for u64 {\n fn deserialize(fields: [Field; U64_SERIALIZED_LEN]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Serialize<U128_SERIALIZED_LEN> for u128 {\n fn serialize(self) -> [Field; U128_SERIALIZED_LEN] {\n [self as Field]\n }\n}\n\nimpl Deserialize<U128_SERIALIZED_LEN> for u128 {\n fn deserialize(fields: [Field; U128_SERIALIZED_LEN]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Serialize<FIELD_SERIALIZED_LEN> for Field {\n fn serialize(self) -> [Field; FIELD_SERIALIZED_LEN] {\n [self]\n }\n}\n\nimpl Deserialize<FIELD_SERIALIZED_LEN> for Field {\n fn deserialize(fields: [Field; FIELD_SERIALIZED_LEN]) -> Self {\n fields[0]\n }\n}\n\nimpl Serialize<I8_SERIALIZED_LEN> for i8 {\n fn serialize(self) -> [Field; I8_SERIALIZED_LEN] {\n [self as u8 as Field]\n }\n}\n\nimpl Deserialize<I8_SERIALIZED_LEN> for i8 {\n fn deserialize(fields: [Field; I8_SERIALIZED_LEN]) -> Self {\n fields[0] as u8 as i8\n }\n}\n\nimpl Serialize<I16_SERIALIZED_LEN> for i16 {\n fn serialize(self) -> [Field; I16_SERIALIZED_LEN] {\n [self as u16 as Field]\n }\n}\n\nimpl Deserialize<I16_SERIALIZED_LEN> for i16 {\n fn deserialize(fields: [Field; I16_SERIALIZED_LEN]) -> Self {\n fields[0] as u16 as i16\n }\n}\n\nimpl Serialize<I32_SERIALIZED_LEN> for i32 {\n fn serialize(self) -> [Field; I32_SERIALIZED_LEN] {\n [self as u32 as Field]\n }\n}\n\nimpl Deserialize<I32_SERIALIZED_LEN> for i32 {\n fn deserialize(fields: [Field; I32_SERIALIZED_LEN]) -> Self {\n fields[0] as u32 as i32\n }\n}\n\nimpl Serialize<I64_SERIALIZED_LEN> for i64 {\n fn serialize(self) -> [Field; I64_SERIALIZED_LEN] {\n [self as u64 as Field]\n }\n}\n\nimpl Deserialize<I64_SERIALIZED_LEN> for i64 {\n fn deserialize(fields: [Field; I64_SERIALIZED_LEN]) -> Self {\n fields[0] as u64 as i64\n }\n}\n\nimpl<T, let N: u32, let M: u32> Serialize<N * M> for [T; N]\nwhere\n T: Serialize<M>,\n{\n fn serialize(self) -> [Field; N * M] {\n let mut result: [Field; N * M] = std::mem::zeroed();\n let mut serialized: [Field; M] = std::mem::zeroed();\n for i in 0..N {\n serialized = self[i].serialize();\n for j in 0..M {\n result[i * M + j] = serialized[j];\n }\n }\n result\n }\n}\n\nimpl<T, let N: u32, let M: u32> Deserialize<N * M> for [T; N]\nwhere\n T: Deserialize<M>,\n{\n fn deserialize(fields: [Field; N * M]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let mut result: [T; N] = std::mem::zeroed();\n reader.read_struct_array::<T, M, N>(Deserialize::deserialize, result)\n }\n}\n\nimpl<T, let N: u32> Serialize<N + 1> for Option<T>\nwhere\n T: Serialize<N>,\n{\n fn serialize(self) -> [Field; N + 1] {\n let mut result: [Field; N + 1] = std::mem::zeroed();\n\n result[0] = if self.is_some() { 1 } else { 0 };\n\n let value_serialized = self.unwrap_unchecked().serialize();\n for i in 0..N {\n result[1 + i] = value_serialized[i];\n }\n\n result\n }\n}\n\nimpl<T, let N: u32> Deserialize<N + 1> for Option<T>\nwhere\n T: Deserialize<N>,\n{\n fn deserialize(fields: [Field; N + 1]) -> Self {\n if fields[0] == 1 {\n let mut value_serialized: [Field; N] = std::mem::zeroed();\n for i in 0..N {\n value_serialized[i] = fields[1 + i];\n }\n\n Option::some(T::deserialize(value_serialized))\n } else {\n Option::none()\n }\n }\n}\n\nmod test {\n use crate::traits::{Deserialize, Serialize};\n\n #[test]\n fn u16_serialization() {\n let a: u16 = 10;\n assert_eq(a, u16::deserialize(a.serialize()));\n }\n\n #[test]\n fn i8_serialization() {\n let a: i8 = -10;\n assert_eq(a, i8::deserialize(a.serialize()));\n }\n\n #[test]\n fn i16_serialization() {\n let a: i16 = -10;\n assert_eq(a, i16::deserialize(a.serialize()));\n }\n\n #[test]\n fn i32_serialization() {\n let a: i32 = -10;\n assert_eq(a, i32::deserialize(a.serialize()));\n }\n\n #[test]\n fn i64_serialization() {\n let a: i64 = -10;\n assert_eq(a, i64::deserialize(a.serialize()));\n }\n\n #[test]\n fn option_field_serialization() {\n let opt_some = Option::some(5);\n assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n let opt_none = Option::none();\n assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n }\n\n #[test]\n fn option_array_serialization() {\n let opt_some = Option::some([2, 5]);\n assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n let opt_none = Option::none();\n assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n }\n}\n"
2672
+ "source": "use crate::traits::{Deserialize, Serialize};\n\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> bool {\n fields[0] != 0\n }\n}\n\nimpl Serialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Serialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Serialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Serialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Serialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as Field]\n }\n}\n\nimpl Deserialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Serialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self]\n }\n}\n\nimpl Deserialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0]\n }\n}\n\nimpl Serialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as u8 as Field]\n }\n}\n\nimpl Deserialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u8 as i8\n }\n}\n\nimpl Serialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as u16 as Field]\n }\n}\n\nimpl Deserialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u16 as i16\n }\n}\n\nimpl Serialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as u32 as Field]\n }\n}\n\nimpl Deserialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u32 as i32\n }\n}\n\nimpl Serialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n [self as u64 as Field]\n }\n}\n\nimpl Deserialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n fields[0] as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let mut result: [Field; _] = std::mem::zeroed();\n for i in 0..M {\n let serialized_t = self[i].serialize();\n for j in 0..<T as Serialize>::N {\n result[i * <T as Serialize>::N + j] = serialized_t[j];\n }\n }\n result\n }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let mut result: [T; M] = std::mem::zeroed();\n reader.read_struct_array::<T, <T as Deserialize>::N, M>(Deserialize::deserialize, result)\n }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N + 1;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n\n result[0] = if self.is_some() { 1 } else { 0 };\n\n let value_serialized = self.unwrap_unchecked().serialize();\n for i in 0..<T as Serialize>::N {\n result[1 + i] = value_serialized[i];\n }\n\n result\n }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N + 1;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n if fields[0] == 1 {\n let mut value_fields = [0; <T as Deserialize>::N];\n for i in 0..<T as Deserialize>::N {\n value_fields[i] = fields[1 + i];\n }\n\n Option::some(T::deserialize(value_fields))\n } else {\n Option::none()\n }\n }\n}\n\nmod test {\n use crate::traits::{Deserialize, Serialize};\n\n #[test]\n fn u16_serialization() {\n let a: u16 = 10;\n assert_eq(a, u16::deserialize(a.serialize()));\n }\n\n #[test]\n fn i8_serialization() {\n let a: i8 = -10;\n assert_eq(a, i8::deserialize(a.serialize()));\n }\n\n #[test]\n fn i16_serialization() {\n let a: i16 = -10;\n assert_eq(a, i16::deserialize(a.serialize()));\n }\n\n #[test]\n fn i32_serialization() {\n let a: i32 = -10;\n assert_eq(a, i32::deserialize(a.serialize()));\n }\n\n #[test]\n fn i64_serialization() {\n let a: i64 = -10;\n assert_eq(a, i64::deserialize(a.serialize()));\n }\n\n #[test]\n fn option_field_serialization() {\n let opt_some = Option::some(5);\n assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n let opt_none = Option::none();\n assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n }\n\n #[test]\n fn option_array_serialization() {\n let opt_some = Option::some([2, 5]);\n assert_eq(Option::<_>::deserialize(opt_some.serialize()), opt_some);\n\n let opt_none = Option::none();\n assert_eq(Option::<Field>::deserialize(opt_none.serialize()), opt_none);\n }\n}\n"
2539
2673
  },
2540
- "377": {
2541
- "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/arrays.nr",
2542
- "source": "pub mod assert_array_appended;\npub mod assert_array_prepended;\npub mod assert_combined_array;\npub mod assert_combined_transformed_array;\npub mod assert_exposed_sorted_transformed_value_array;\npub mod assert_sorted_array;\npub mod assert_sorted_transformed_padded_array;\npub mod assert_sorted_transformed_value_array;\npub mod assert_split_sorted_transformed_value_arrays;\npub mod assert_split_transformed_padded_arrays;\npub mod assert_split_transformed_value_arrays;\npub mod get_sorted_result;\npub mod get_sorted_tuple;\npub mod sort_by;\npub mod sort_by_counter;\n\n// Re-exports.\npub use assert_array_appended::{\n assert_array_appended, assert_array_appended_and_scoped, assert_array_appended_reversed,\n assert_array_appended_scoped,\n};\npub use assert_array_prepended::assert_array_prepended;\npub use assert_combined_array::{assert_combined_array, combine_arrays};\npub use assert_combined_transformed_array::{\n assert_combined_transformed_array, combine_and_transform_arrays,\n};\npub use assert_exposed_sorted_transformed_value_array::{\n assert_exposed_sorted_transformed_value_array,\n get_order_hints::{get_order_hints_asc, OrderHint},\n};\npub use assert_sorted_array::assert_sorted_array;\npub use assert_sorted_transformed_padded_array::{\n assert_sorted_transformed_i_padded_array_capped_size,\n assert_sorted_transformed_padded_array_capped_size, validate_padded_items,\n};\npub use assert_split_sorted_transformed_value_arrays::{\n assert_split_sorted_transformed_value_arrays_asc,\n get_split_order_hints::{get_split_order_hints_asc, SplitOrderHints},\n};\npub use assert_split_transformed_padded_arrays::assert_split_transformed_padded_arrays;\npub use get_sorted_result::{get_sorted_result, SortedResult};\npub use sort_by_counter::sort_by_counter_asc;\n\nuse crate::traits::{Empty, is_empty};\n\npub fn subarray<let SRC_LEN: u32, let DST_LEN: u32>(\n src: [Field; SRC_LEN],\n offset: u32,\n) -> [Field; DST_LEN] {\n assert(offset + DST_LEN <= SRC_LEN, \"offset too large\");\n\n let mut dst: [Field; DST_LEN] = std::mem::zeroed();\n for i in 0..DST_LEN {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\n// Helper function to convert a validated array to BoundedVec.\n// Important: Only use it for validated arrays: validate_array(array) should be true.\npub unconstrained fn array_to_bounded_vec<T, let N: u32>(array: [T; N]) -> BoundedVec<T, N>\nwhere\n T: Empty + Eq,\n{\n let len = array_length(array);\n BoundedVec::from_parts_unchecked(array, len)\n}\n\n// Helper function to find the index of the first element in an array that satisfies a given predicate. If the element\n// is not found, the function returns N as the index.\npub unconstrained fn find_index_hint<T, let N: u32, Env>(\n array: [T; N],\n find: fn[Env](T) -> bool,\n) -> u32 {\n let mut index = N;\n for i in 0..N {\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & find(array[i]) {\n index = i;\n }\n }\n index\n}\n\n// Routine which validates that all zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where any * is non-zero. Note that a full array of non-zero values is\n// valid.\npub fn validate_array<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut seen_empty = false;\n let mut length = 0;\n for i in 0..N {\n if is_empty(array[i]) {\n seen_empty = true;\n } else {\n assert(seen_empty == false, \"invalid array\");\n length += 1;\n }\n }\n length\n}\n\n// Helper function to count the number of non-empty elements in a validated array.\n// Important: Only use it for validated arrays where validate_array(array) returns true,\n// which ensures that:\n// 1. All elements before the first empty element are non-empty\n// 2. All elements after and including the first empty element are empty\n// 3. The array forms a contiguous sequence of non-empty elements followed by empty elements\npub fn array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // We get the length by checking the index of the first empty element.\n\n // Safety: This is safe because we have validated the array (see function doc above) and the emptiness\n // of the element and non-emptiness of the previous element is checked below.\n let length = unsafe { find_index_hint(array, |elem: T| is_empty(elem)) };\n if length != 0 {\n assert(!is_empty(array[length - 1]));\n }\n if length != N {\n assert(is_empty(array[length]));\n }\n length\n}\n\n// Returns the number of consecutive elements at the start of the array for which the predicate returns false.\n// This function ensures that any element after the first matching element (predicate returns true) also matches the predicate.\npub fn array_length_until<T, let N: u32, Env>(array: [T; N], predicate: fn[Env](T) -> bool) -> u32 {\n let mut length = 0;\n let mut stop = false;\n for i in 0..N {\n if predicate(array[i]) {\n stop = true;\n } else {\n assert(\n stop == false,\n \"matching element found after already encountering a non-matching element\",\n );\n length += 1;\n }\n }\n length\n}\n\npub fn array_concat<T, let N: u32, let M: u32>(array1: [T; N], array2: [T; M]) -> [T; N + M] {\n let mut result = [array1[0]; N + M];\n for i in 1..N {\n result[i] = array1[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n}\n\n/// This function assumes that `array1` and `array2` contain no more than N non-empty elements between them,\n/// if this is not the case then elements from the end of `array2` will be dropped.\npub fn array_merge<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n // Safety: we constrain this array below\n let result = unsafe { array_merge_helper(array1, array2) };\n // We assume arrays have been validated. The only use cases so far are with previously validated arrays.\n let array1_len = array_length(array1);\n let mut add_from_left = true;\n for i in 0..N {\n add_from_left &= i != array1_len;\n if add_from_left {\n assert_eq(result[i], array1[i]);\n } else {\n assert_eq(result[i], array2[i - array1_len]);\n }\n }\n result\n}\n\nunconstrained fn array_merge_helper<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty + Eq,\n{\n let mut result: [T; N] = [T::empty(); N];\n let mut i = 0;\n for elem in array1 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n for elem in array2 {\n if !is_empty(elem) {\n result[i] = elem;\n i += 1;\n }\n }\n result\n}\n\n// Helper fn to create a subarray from a given array\npub fn array_splice<T, let N: u32, let M: u32>(array: [T; N], offset: u32) -> [T; M]\nwhere\n T: Empty,\n{\n assert(M + offset <= N, \"Subarray length larger than array length\");\n let mut result: [T; M] = [T::empty(); M];\n for i in 0..M {\n result[i] = array[offset + i];\n }\n result\n}\n\npub fn check_permutation<T, let N: u32>(\n original_array: [T; N],\n permuted_array: [T; N],\n original_indexes: [u32; N],\n)\nwhere\n T: Eq + Empty,\n{\n let mut seen_value = [false; N];\n for i in 0..N {\n let index = original_indexes[i];\n let original_value = original_array[index];\n assert(permuted_array[i].eq(original_value), \"Invalid index\");\n assert(!seen_value[index], \"Duplicated index\");\n seen_value[index] = true;\n }\n}\n\n// Helper function to find the index of the last element in an array, allowing empty elements.\n// e.g. useful for removing trailing 0s from [1, 0, 2, 0, 0, 0] -> [1, 0, 2]\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn find_last_value_index<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let mut index = N;\n for i in 0..N {\n let j = N - i - 1;\n // We check `index == N` to ensure that we only update the index if we haven't found a match yet.\n if (index == N) & !is_empty(array[j]) {\n index = j;\n }\n }\n index\n}\n\n// Routine which returns the length of an array right padded by empty elements\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\n// See smoke_validate_array_trailing for examples.\n// Nothing to do with validated arrays. Correctness constrained by padded_array_length.\npub unconstrained fn unsafe_padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n let index = find_last_value_index(array);\n if index == N {\n 0\n } else {\n index + 1\n }\n}\n\n// Routine which validates that zero values of an array form a contiguous region at the end, i.e.,\n// of the form: [*,*,*...,0,0,0,0] where * is any value (zeroes allowed).\npub fn padded_array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty + Eq,\n{\n // Safety: this value is constrained in the below loop.\n let length = unsafe { unsafe_padded_array_length(array) };\n // Check the elt just before length is non-zero:\n if length != 0 {\n assert(!is_empty(array[length - 1]), \"invalid right padded array\");\n }\n // Check all beyond length are zero:\n let mut check_zero = false;\n for i in 0..N {\n check_zero |= i == length;\n if check_zero {\n assert(is_empty(array[i]), \"invalid right padded array\");\n }\n }\n length\n}\n\n// Helper function to check if an array is padded with a given value from a given index.\n// Different to padded_array_length in that it allows the elements before the given index to be the same as the padded value.\npub fn array_padded_with<T, let N: u32>(array: [T; N], from_index: u32, padded_with: T) -> bool\nwhere\n T: Eq,\n{\n let mut is_valid = true;\n let mut should_check = false;\n for i in 0..N {\n should_check |= i == from_index;\n is_valid &= !should_check | (array[i] == padded_with);\n }\n is_valid\n}\n\n#[test]\nfn smoke_validate_array() {\n let valid_array: [Field; 0] = [];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [0];\n assert(validate_array(valid_array) == 0);\n\n let valid_array = [3];\n assert(validate_array(valid_array) == 1);\n\n let valid_array = [1, 2, 3];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0];\n assert(validate_array(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(validate_array(valid_array) == 3);\n}\n\n#[test]\nfn smoke_validate_array_trailing() {\n let valid_array: [Field; 0] = [];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [0];\n assert(padded_array_length(valid_array) == 0);\n\n let valid_array = [3];\n assert(padded_array_length(valid_array) == 1);\n\n let valid_array = [1, 0, 3];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 0, 3, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [1, 2, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n\n let valid_array = [0, 0, 3, 0, 0];\n assert(padded_array_length(valid_array) == 3);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case0() {\n let invalid_array = [0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case1() {\n let invalid_array = [1, 0, 0, 1, 0];\n let _ = validate_array(invalid_array);\n}\n\n#[test(should_fail_with = \"invalid array\")]\nfn smoke_validate_array_invalid_case2() {\n let invalid_array = [0, 0, 0, 0, 1];\n let _ = validate_array(invalid_array);\n}\n\n#[test]\nfn test_empty_array_length() {\n assert_eq(array_length([0]), 0);\n assert_eq(array_length([0, 0, 0]), 0);\n}\n\n#[test]\nfn test_array_length() {\n assert_eq(array_length([123]), 1);\n assert_eq(array_length([123, 0, 0]), 1);\n assert_eq(array_length([123, 456]), 2);\n assert_eq(array_length([123, 456, 0]), 2);\n}\n\n#[test]\nfn test_array_length_invalid_arrays() {\n // Result can be misleading (but correct) for invalid arrays.\n assert_eq(array_length([0, 0, 123]), 0);\n assert_eq(array_length([0, 123, 0]), 0);\n assert_eq(array_length([0, 123, 456]), 0);\n assert_eq(array_length([123, 0, 456]), 1);\n}\n\n#[test]\nfn test_array_length_until() {\n let array = [11, 22, 33, 44, 55];\n assert_eq(array_length_until(array, |x| x == 55), 4);\n assert_eq(array_length_until(array, |x| x == 56), 5);\n assert_eq(array_length_until(array, |x| x > 40), 3);\n assert_eq(array_length_until(array, |x| x > 10), 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_non_consecutive_fails() {\n let array = [1, 1, 0, 1, 0];\n let _ = array_length_until(array, |x| x == 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_first_non_matching_fails() {\n let array = [1, 0, 0, 0, 0];\n let _ = array_length_until(array, |x| x == 1);\n}\n\n#[test]\nunconstrained fn find_index_greater_than_min() {\n let values = [10, 20, 30, 40];\n let min = 22;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 2);\n}\n\n#[test]\nunconstrained fn find_index_not_found() {\n let values = [10, 20, 30, 40];\n let min = 100;\n let index = find_index_hint(values, |v: Field| min.lt(v));\n assert_eq(index, 4);\n}\n\n#[test]\nfn test_array_concat() {\n let array0 = [1, 2, 3];\n let array1 = [4, 5];\n let concatenated = array_concat(array0, array1);\n assert_eq(concatenated, [1, 2, 3, 4, 5]);\n}\n\n#[test]\nfn check_permutation_basic_test() {\n let original_array = [1, 2, 3];\n let permuted_array = [3, 1, 2];\n let indexes = [2, 0, 1];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Duplicated index\")]\nfn check_permutation_duplicated_index() {\n let original_array = [0, 1, 0];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 0];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Invalid index\")]\nfn check_permutation_invalid_index() {\n let original_array = [0, 1, 2];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 2];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test]\nfn test_array_padded_with() {\n let array = [11, 22, 33, 44, 44];\n assert_eq(array_padded_with(array, 0, 44), false);\n assert_eq(array_padded_with(array, 1, 44), false);\n assert_eq(array_padded_with(array, 2, 44), false);\n assert_eq(array_padded_with(array, 3, 44), true);\n assert_eq(array_padded_with(array, 4, 44), true);\n assert_eq(array_padded_with(array, 4, 33), false);\n assert_eq(array_padded_with(array, 5, 44), true); // Index out of bounds.\n assert_eq(array_padded_with(array, 0, 11), false);\n}\n"
2543
- },
2544
- "380": {
2674
+ "379": {
2545
2675
  "path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
2546
- "source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn finish(self) {\n assert(self.offset == self.data.len(), \"Reader did not read all data\");\n }\n}\n"
2547
- },
2548
- "390": {
2549
- "path": "/home/aztec-dev/nargo/github.com/noir-lang/sha256/v0.1.2/src/sha256.nr",
2550
- "source": "use std::hash::sha256_compression;\nuse std::runtime::is_unconstrained;\n\nuse constants::{\n BLOCK_BYTE_PTR, BLOCK_SIZE, HASH, INITIAL_STATE, INT_BLOCK, INT_BLOCK_SIZE, INT_SIZE,\n INT_SIZE_PTR, MSG_BLOCK, MSG_SIZE_PTR, STATE, TWO_POW_16, TWO_POW_24, TWO_POW_32, TWO_POW_8,\n};\n\nmod constants;\nmod tests;\n\n// Implementation of SHA-256 mapping a byte array of variable length to\n// 32 bytes.\n\n// Deprecated in favour of `sha256_var`\n// docs:start:sha256\npub fn sha256<let N: u32>(input: [u8; N]) -> HASH\n// docs:end:sha256\n{\n digest(input)\n}\n\n// SHA-256 hash function\n#[no_predicates]\npub fn digest<let N: u32>(msg: [u8; N]) -> HASH {\n sha256_var(msg, N as u64)\n}\n\n// Variable size SHA-256 hash\npub fn sha256_var<let N: u32>(msg: [u8; N], message_size: u64) -> HASH {\n let message_size = message_size as u32;\n assert(message_size <= N);\n\n if std::runtime::is_unconstrained() {\n // Safety: SHA256 is running as an unconstrained function.\n unsafe {\n __sha256_var(msg, message_size)\n }\n } else {\n let mut msg_block: MSG_BLOCK = [0; INT_BLOCK_SIZE];\n // Intermediate hash, starting with the canonical initial value\n let mut h: STATE = INITIAL_STATE;\n // Pointer into msg_block on a 64 byte scale\n let mut msg_byte_ptr = 0;\n let num_blocks = N / BLOCK_SIZE;\n for i in 0..num_blocks {\n let msg_start = BLOCK_SIZE * i;\n let (new_msg_block, new_msg_byte_ptr) =\n unsafe { build_msg_block(msg, message_size, msg_start) };\n\n if msg_start < message_size {\n msg_block = new_msg_block;\n }\n\n // Verify the block we are compressing was appropriately constructed\n let new_msg_byte_ptr = verify_msg_block(msg, message_size, msg_block, msg_start);\n if msg_start < message_size {\n msg_byte_ptr = new_msg_byte_ptr;\n }\n\n // If the block is filled, compress it.\n // An un-filled block is handled after this loop.\n if (msg_start < message_size) & (msg_byte_ptr == BLOCK_SIZE) {\n h = sha256_compression(msg_block, h);\n }\n }\n\n let modulo = N % BLOCK_SIZE;\n // Handle setup of the final msg block.\n // This case is only hit if the msg is less than the block size,\n // or our message cannot be evenly split into blocks.\n if modulo != 0 {\n let msg_start = BLOCK_SIZE * num_blocks;\n let (new_msg_block, new_msg_byte_ptr) =\n unsafe { build_msg_block(msg, message_size, msg_start) };\n\n if msg_start < message_size {\n msg_block = new_msg_block;\n }\n\n let new_msg_byte_ptr = verify_msg_block(msg, message_size, msg_block, msg_start);\n if msg_start < message_size {\n msg_byte_ptr = new_msg_byte_ptr;\n verify_msg_block_padding(msg_block, msg_byte_ptr);\n }\n }\n\n // If we had modulo == 0 then it means the last block was full,\n // and we can reset the pointer to zero to overwrite it.\n if msg_byte_ptr == BLOCK_SIZE {\n msg_byte_ptr = 0;\n }\n\n // Pad the rest such that we have a [u32; 2] block at the end representing the length\n // of the message, and a block of 1 0 ... 0 following the message (i.e. [1 << 7, 0, ..., 0]).\n // Here we rely on the fact that everything beyond the available input is set to 0.\n let index = msg_byte_ptr / INT_SIZE;\n msg_block[index] = set_item_byte_then_zeros(msg_block[index], msg_byte_ptr, 1 << 7);\n\n msg_byte_ptr = msg_byte_ptr + 1;\n let last_block = msg_block;\n\n // If we don't have room to write the size, compress the block and reset it.\n if msg_byte_ptr > MSG_SIZE_PTR {\n h = sha256_compression(msg_block, h);\n // `attach_len_to_msg_block` will zero out everything after the `msg_byte_ptr`.\n msg_byte_ptr = 0;\n }\n\n msg_block = unsafe { attach_len_to_msg_block(msg_block, msg_byte_ptr, message_size) };\n\n verify_msg_len(msg_block, last_block, msg_byte_ptr, message_size);\n\n hash_final_block(msg_block, h)\n }\n}\n\n// Variable size SHA-256 hash\nunconstrained fn __sha256_var<let N: u32>(msg: [u8; N], message_size: u32) -> HASH {\n let num_full_blocks = message_size / BLOCK_SIZE;\n // Intermediate hash, starting with the canonical initial value\n let mut h: STATE = INITIAL_STATE;\n // Pointer into msg_block on a 64 byte scale\n for i in 0..num_full_blocks {\n let (msg_block, _) = build_msg_block(msg, message_size, BLOCK_SIZE * i);\n h = sha256_compression(msg_block, h);\n }\n\n // Handle setup of the final msg block.\n // This case is only hit if the msg is less than the block size,\n // or our message cannot be evenly split into blocks.\n let modulo = message_size % BLOCK_SIZE;\n let (mut msg_block, mut msg_byte_ptr): (INT_BLOCK, u32) = if modulo != 0 {\n let msg_start = BLOCK_SIZE * num_full_blocks;\n let (new_msg_block, new_msg_byte_ptr) = build_msg_block(msg, message_size, msg_start);\n\n (new_msg_block, new_msg_byte_ptr)\n } else {\n // If we had modulo == 0 then it means the last block was full,\n // and we can reset the pointer to zero to overwrite it.\n ([0; INT_BLOCK_SIZE], 0)\n };\n\n // Pad the rest such that we have a [u32; 2] block at the end representing the length\n // of the message, and a block of 1 0 ... 0 following the message (i.e. [1 << 7, 0, ..., 0]).\n // Here we rely on the fact that everything beyond the available input is set to 0.\n let index = msg_byte_ptr / INT_SIZE;\n msg_block[index] = set_item_byte_then_zeros(msg_block[index], msg_byte_ptr, 1 << 7);\n\n // If we don't have room to write the size, compress the block and reset it.\n let (h, mut msg_byte_ptr): (STATE, u32) = if msg_byte_ptr >= MSG_SIZE_PTR {\n // `attach_len_to_msg_block` will zero out everything after the `msg_byte_ptr`.\n (sha256_compression(msg_block, h), 0)\n } else {\n (h, msg_byte_ptr + 1)\n };\n msg_block = attach_len_to_msg_block(msg_block, msg_byte_ptr, message_size);\n\n hash_final_block(msg_block, h)\n}\n\n// Take `BLOCK_SIZE` number of bytes from `msg` starting at `msg_start`.\n// Returns the block and the length that has been copied rather than padded with zeros.\nunconstrained fn build_msg_block<let N: u32>(\n msg: [u8; N],\n message_size: u32,\n msg_start: u32,\n) -> (MSG_BLOCK, BLOCK_BYTE_PTR) {\n let mut msg_block: MSG_BLOCK = [0; INT_BLOCK_SIZE];\n\n // We insert `BLOCK_SIZE` bytes (or up to the end of the message)\n let block_input = if message_size < msg_start {\n // This function is sometimes called with `msg_start` past the end of the message.\n // In this case we return an empty block and zero pointer to signal that the result should be ignored.\n 0\n } else if message_size < msg_start + BLOCK_SIZE {\n message_size - msg_start\n } else {\n BLOCK_SIZE\n };\n\n // Figure out the number of items in the int array that we have to pack.\n // e.g. if the input is [0,1,2,3,4,5] then we need to pack it as 2 items: [0123, 4500]\n let mut int_input = block_input / INT_SIZE;\n if block_input % INT_SIZE != 0 {\n int_input = int_input + 1;\n };\n\n for i in 0..int_input {\n let mut msg_item: u32 = 0;\n // Always construct the integer as 4 bytes, even if it means going beyond the input.\n for j in 0..INT_SIZE {\n let k = i * INT_SIZE + j;\n let msg_byte = if k < block_input {\n msg[msg_start + k]\n } else {\n 0\n };\n msg_item = lshift8(msg_item, 1) + msg_byte as u32;\n }\n msg_block[i] = msg_item;\n }\n\n // Returning the index as if it was a 64 byte array.\n // We have to project it down to 16 items and bit shifting to get a byte back if we need it.\n (msg_block, block_input)\n}\n\n// Verify the block we are compressing was appropriately constructed by `build_msg_block`\n// and matches the input data. Returns the index of the first unset item.\n// If `message_size` is less than `msg_start` then this is called with the old non-empty block;\n// in that case we can skip verification, ie. no need to check that everything is zero.\nfn verify_msg_block<let N: u32>(\n msg: [u8; N],\n message_size: u32,\n msg_block: MSG_BLOCK,\n msg_start: u32,\n) -> BLOCK_BYTE_PTR {\n let mut msg_byte_ptr = 0;\n let mut msg_end = msg_start + BLOCK_SIZE;\n if msg_end > N {\n msg_end = N;\n }\n // We might have to go beyond the input to pad the fields.\n if msg_end % INT_SIZE != 0 {\n msg_end = msg_end + INT_SIZE - msg_end % INT_SIZE;\n }\n\n // Reconstructed packed item.\n let mut msg_item: u32 = 0;\n\n // Inclusive at the end so that we can compare the last item.\n let mut i: u32 = 0;\n for k in msg_start..=msg_end {\n if k % INT_SIZE == 0 {\n // If we consumed some input we can compare against the block.\n if (msg_start < message_size) & (k > msg_start) {\n assert_eq(msg_block[i], msg_item as u32);\n i = i + 1;\n msg_item = 0;\n }\n }\n // Shift the accumulator\n msg_item = lshift8(msg_item, 1);\n // If we have input to consume, add it at the rightmost position.\n if k < message_size & k < msg_end {\n msg_item = msg_item + msg[k] as u32;\n msg_byte_ptr = msg_byte_ptr + 1;\n }\n }\n\n msg_byte_ptr\n}\n\n// Verify the block we are compressing was appropriately padded with zeros by `build_msg_block`.\n// This is only relevant for the last, potentially partially filled block.\nfn verify_msg_block_padding(msg_block: MSG_BLOCK, msg_byte_ptr: BLOCK_BYTE_PTR) {\n // Check all the way to the end of the block.\n verify_msg_block_zeros(msg_block, msg_byte_ptr, INT_BLOCK_SIZE);\n}\n\n// Verify that a region of ints in the message block are (partially) zeroed,\n// up to an (exclusive) maximum which can either be the end of the block\n// or just where the size is to be written.\nfn verify_msg_block_zeros(\n msg_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n max_int_byte_ptr: u32,\n) {\n // This variable is used to get around the compiler under-constrained check giving a warning.\n // We want to check against a constant zero, but if it does not come from the circuit inputs\n // or return values the compiler check will issue a warning.\n let zero = msg_block[0] - msg_block[0];\n\n // First integer which is supposed to be (partially) zero.\n let mut int_byte_ptr = msg_byte_ptr / INT_SIZE;\n\n // Check partial zeros.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n let zeros = INT_SIZE - modulo;\n let mask = if zeros == 3 {\n TWO_POW_24\n } else if zeros == 2 {\n TWO_POW_16\n } else {\n TWO_POW_8\n };\n assert_eq(msg_block[int_byte_ptr] % mask, zero);\n int_byte_ptr = int_byte_ptr + 1;\n }\n\n // Check the rest of the items.\n for i in 0..max_int_byte_ptr {\n if i >= int_byte_ptr {\n assert_eq(msg_block[i], zero);\n }\n }\n}\n\n// Verify that up to the byte pointer the two blocks are equal.\n// At the byte pointer the new block can be partially zeroed.\nfn verify_msg_block_equals_last(\n msg_block: MSG_BLOCK,\n last_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n) {\n // msg_byte_ptr is the position at which they are no longer have to be the same.\n // First integer which is supposed to be (partially) zero contains that pointer.\n let mut int_byte_ptr = msg_byte_ptr / INT_SIZE;\n\n // Check partial zeros.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n // Reconstruct the partially zero item from the last block.\n let last_field = last_block[int_byte_ptr];\n let mut msg_item: u32 = 0;\n // Reset to where they are still equal.\n msg_byte_ptr = msg_byte_ptr - modulo;\n for i in 0..INT_SIZE {\n msg_item = lshift8(msg_item, 1);\n if i < modulo {\n msg_item = msg_item + get_item_byte(last_field, msg_byte_ptr) as u32;\n msg_byte_ptr = msg_byte_ptr + 1;\n }\n }\n assert_eq(msg_block[int_byte_ptr], msg_item);\n }\n\n for i in 0..INT_SIZE_PTR {\n if i < int_byte_ptr {\n assert_eq(msg_block[i], last_block[i]);\n }\n }\n}\n\n// Set the rightmost `zeros` number of bytes to 0.\n#[inline_always]\nfn set_item_zeros(item: u32, zeros: u8) -> u32 {\n lshift8(rshift8(item, zeros), zeros)\n}\n\n// Replace one byte in the item with a value, and set everything after it to zero.\nfn set_item_byte_then_zeros(msg_item: u32, msg_byte_ptr: BLOCK_BYTE_PTR, msg_byte: u8) -> u32 {\n let zeros = INT_SIZE - msg_byte_ptr % INT_SIZE;\n let zeroed_item = set_item_zeros(msg_item, zeros as u8);\n let new_item = byte_into_item(msg_byte, msg_byte_ptr);\n zeroed_item + new_item\n}\n\n// Get a byte of a message item according to its overall position in the `BLOCK_SIZE` space.\nfn get_item_byte(mut msg_item: u32, msg_byte_ptr: BLOCK_BYTE_PTR) -> u8 {\n // How many times do we have to shift to the right to get to the position we want?\n let max_shifts = INT_SIZE - 1;\n let shifts = max_shifts - msg_byte_ptr % INT_SIZE;\n msg_item = rshift8(msg_item, shifts as u8);\n // At this point the byte we want is in the rightmost position.\n msg_item as u8\n}\n\n// Project a byte into a position in a field based on the overall block pointer.\n// For example putting 1 into pointer 5 would be 100, because overall we would\n// have [____, 0100] with indexes [0123,4567].\n#[inline_always]\nfn byte_into_item(msg_byte: u8, msg_byte_ptr: BLOCK_BYTE_PTR) -> u32 {\n let mut msg_item = msg_byte as u32;\n // How many times do we have to shift to the left to get to the position we want?\n let max_shifts = INT_SIZE - 1;\n let shifts = max_shifts - msg_byte_ptr % INT_SIZE;\n lshift8(msg_item, shifts as u8)\n}\n\n// Construct a field out of 4 bytes.\n#[inline_always]\nfn make_item(b0: u8, b1: u8, b2: u8, b3: u8) -> u32 {\n let mut item = b0 as u32;\n item = lshift8(item, 1) + b1 as u32;\n item = lshift8(item, 1) + b2 as u32;\n item = lshift8(item, 1) + b3 as u32;\n item\n}\n\n// Shift by 8 bits to the left between 0 and 4 times.\n// Checks `is_unconstrained()` to just use a bitshift if we're running in an unconstrained context,\n// otherwise multiplies by 256.\n#[inline_always]\nfn lshift8(item: u32, shifts: u8) -> u32 {\n if is_unconstrained() {\n // Brillig wouldn't shift 0<<4 without overflow.\n if shifts >= 4 {\n 0\n } else {\n item << (8 * shifts)\n }\n } else {\n // We can do a for loop up to INT_SIZE or an if-else.\n if shifts == 0 {\n item\n } else if shifts == 1 {\n item * TWO_POW_8\n } else if shifts == 2 {\n item * TWO_POW_16\n } else if shifts == 3 {\n item * TWO_POW_24\n } else {\n // Doesn't make sense, but it's most likely called on 0 anyway.\n 0\n }\n }\n}\n\n// Shift by 8 bits to the right between 0 and 4 times.\n// Checks `is_unconstrained()` to just use a bitshift if we're running in an unconstrained context,\n// otherwise divides by 256.\nfn rshift8(item: u32, shifts: u8) -> u32 {\n if is_unconstrained() {\n item >> (8 * shifts)\n } else {\n // Division wouldn't work on `Field`.\n if shifts == 0 {\n item\n } else if shifts == 1 {\n item / TWO_POW_8\n } else if shifts == 2 {\n item / TWO_POW_16\n } else if shifts == 3 {\n item / TWO_POW_24\n } else {\n 0\n }\n }\n}\n\n// Zero out all bytes between the end of the message and where the length is appended,\n// then write the length into the last 8 bytes of the block.\nunconstrained fn attach_len_to_msg_block(\n mut msg_block: MSG_BLOCK,\n mut msg_byte_ptr: BLOCK_BYTE_PTR,\n message_size: u32,\n) -> MSG_BLOCK {\n // We assume that `msg_byte_ptr` is less than 57 because if not then it is reset to zero before calling this function.\n // In any case, fill blocks up with zeros until the last 64 bits (i.e. until msg_byte_ptr = 56).\n // There can be one item which has to be partially zeroed.\n let modulo = msg_byte_ptr % INT_SIZE;\n if modulo != 0 {\n // Index of the block in which we find the item we need to partially zero.\n let i = msg_byte_ptr / INT_SIZE;\n let zeros = INT_SIZE - modulo;\n msg_block[i] = set_item_zeros(msg_block[i], zeros as u8);\n msg_byte_ptr = msg_byte_ptr + zeros;\n }\n\n // The rest can be zeroed without bit shifting anything.\n for i in (msg_byte_ptr / INT_SIZE)..INT_SIZE_PTR {\n msg_block[i] = 0;\n }\n\n // Set the last two 4 byte ints as the first/second half of the 8 bytes of the length.\n let len = 8 * message_size;\n let len_bytes: [u8; 8] = (len as Field).to_be_bytes();\n for i in 0..=1 {\n let shift = i * 4;\n msg_block[INT_SIZE_PTR + i] = make_item(\n len_bytes[shift],\n len_bytes[shift + 1],\n len_bytes[shift + 2],\n len_bytes[shift + 3],\n );\n }\n msg_block\n}\n\n// Verify that the message length was correctly written by `attach_len_to_msg_block`,\n// and that everything between the byte pointer and the size pointer was zeroed,\n// and that everything before the byte pointer was untouched.\nfn verify_msg_len(\n msg_block: MSG_BLOCK,\n last_block: MSG_BLOCK,\n msg_byte_ptr: BLOCK_BYTE_PTR,\n message_size: u32,\n) {\n // Check zeros up to the size pointer.\n verify_msg_block_zeros(msg_block, msg_byte_ptr, INT_SIZE_PTR);\n\n // Check that up to the pointer we match the last block.\n verify_msg_block_equals_last(msg_block, last_block, msg_byte_ptr);\n\n // We verify the message length was inserted correctly by reversing the byte decomposition.\n let mut reconstructed_len: u64 = 0;\n for i in INT_SIZE_PTR..INT_BLOCK_SIZE {\n reconstructed_len = reconstructed_len * TWO_POW_32;\n reconstructed_len = reconstructed_len + msg_block[i] as u64;\n }\n let len = 8 * message_size as u64;\n assert_eq(reconstructed_len, len);\n}\n\n// Perform the final compression, then transform the `STATE` into `HASH`.\nfn hash_final_block(msg_block: MSG_BLOCK, mut state: STATE) -> HASH {\n let mut out_h: HASH = [0; 32]; // Digest as sequence of bytes\n // Hash final padded block\n state = sha256_compression(msg_block, state);\n\n // Return final hash as byte array\n for j in 0..8 {\n let h_bytes: [u8; 4] = (state[j] as Field).to_be_bytes();\n for k in 0..4 {\n out_h[4 * j + k] = h_bytes[k];\n }\n }\n\n out_h\n}\n\nmod equivalence_test {\n\n #[test]\n fn test_implementations_agree(msg: [u8; 100], message_size: u64) {\n let message_size = message_size % 100;\n let unconstrained_sha = unsafe { super::__sha256_var(msg, message_size as u32) };\n let sha = super::sha256_var(msg, message_size);\n assert_eq(sha, unconstrained_sha);\n }\n}\n"
2676
+ "source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_u64(&mut self) -> u64 {\n self.read() as u64\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn finish(self) {\n assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n }\n}\n"
2551
2677
  },
2552
2678
  "42": {
2553
2679
  "path": "std/option.nr",
@@ -2563,7 +2689,7 @@
2563
2689
  },
2564
2690
  "55": {
2565
2691
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/authwit/entrypoint/app.nr",
2566
- "source": "use crate::prelude::PrivateContext;\nuse dep::protocol_types::{\n constants::GENERATOR_INDEX__SIGNATURE_PAYLOAD,\n hash::poseidon2_hash_with_separator,\n traits::{Hash, Serialize},\n};\nuse std::meta::derive;\n\nuse crate::authwit::entrypoint::function_call::FunctionCall;\n\n// FUNCTION_CALL_SIZE_IN_BYTES * ACCOUNT_MAX_CALLS + 32\nglobal APP_PAYLOAD_SIZE_IN_BYTES: u32 = 424;\n\nglobal ACCOUNT_MAX_CALLS: u32 = 4;\n\n// Note: If you change the following struct you have to update default_entrypoint.ts\n// docs:start:app-payload-struct\n#[derive(Serialize)]\npub struct AppPayload {\n function_calls: [FunctionCall; ACCOUNT_MAX_CALLS],\n // A nonce that enables transaction cancellation. When the cancellable flag is enabled, this nonce is used to\n // compute a nullifier that is then emitted. This guarantees that we can cancel the transaction by using the same\n // nonce.\n pub tx_nonce: Field,\n}\n// docs:end:app-payload-struct\n\nimpl Hash for AppPayload {\n fn hash(self) -> Field {\n poseidon2_hash_with_separator(self.serialize(), GENERATOR_INDEX__SIGNATURE_PAYLOAD)\n }\n}\n\nimpl AppPayload {\n // Serializes the payload as an array of bytes. Useful for hashing with sha256.\n fn to_be_bytes(self) -> [u8; APP_PAYLOAD_SIZE_IN_BYTES] {\n let mut bytes: BoundedVec<u8, APP_PAYLOAD_SIZE_IN_BYTES> = BoundedVec::new();\n\n for i in 0..ACCOUNT_MAX_CALLS {\n bytes.extend_from_array(self.function_calls[i].to_be_bytes());\n }\n bytes.extend_from_array(self.tx_nonce.to_be_bytes::<32>());\n\n bytes.storage()\n }\n\n // Executes all private and public calls\n // docs:start:entrypoint-execute-calls\n pub fn execute_calls(self, context: &mut PrivateContext) {\n for call in self.function_calls {\n if !call.target_address.is_zero() {\n if call.is_public {\n context.call_public_function_with_calldata_hash(\n call.target_address,\n call.args_hash,\n call.is_static,\n );\n } else {\n let _result = context.call_private_function_with_args_hash(\n call.target_address,\n call.function_selector,\n call.args_hash,\n call.is_static,\n );\n }\n }\n }\n }\n // docs:end:entrypoint-execute-calls\n}\n"
2692
+ "source": "use crate::{authwit::entrypoint::function_call::FunctionCall, context::PrivateContext};\nuse dep::protocol_types::{\n constants::GENERATOR_INDEX__SIGNATURE_PAYLOAD,\n hash::poseidon2_hash_with_separator,\n traits::{Hash, Serialize},\n};\nuse std::meta::derive;\n\n// FUNCTION_CALL_SIZE_IN_BYTES * ACCOUNT_MAX_CALLS + 32\nglobal APP_PAYLOAD_SIZE_IN_BYTES: u32 = 424;\n\nglobal ACCOUNT_MAX_CALLS: u32 = 4;\n\n// Note: If you change the following struct you have to update default_entrypoint.ts\n// docs:start:app-payload-struct\n#[derive(Serialize)]\npub struct AppPayload {\n function_calls: [FunctionCall; ACCOUNT_MAX_CALLS],\n // A nonce that enables transaction cancellation. When the cancellable flag is enabled, this nonce is used to\n // compute a nullifier that is then emitted. This guarantees that we can cancel the transaction by using the same\n // nonce.\n pub tx_nonce: Field,\n}\n// docs:end:app-payload-struct\n\nimpl Hash for AppPayload {\n fn hash(self) -> Field {\n poseidon2_hash_with_separator(self.serialize(), GENERATOR_INDEX__SIGNATURE_PAYLOAD)\n }\n}\n\nimpl AppPayload {\n // Serializes the payload as an array of bytes. Useful for hashing with sha256.\n fn to_be_bytes(self) -> [u8; APP_PAYLOAD_SIZE_IN_BYTES] {\n let mut bytes: BoundedVec<u8, APP_PAYLOAD_SIZE_IN_BYTES> = BoundedVec::new();\n\n for i in 0..ACCOUNT_MAX_CALLS {\n bytes.extend_from_array(self.function_calls[i].to_be_bytes());\n }\n bytes.extend_from_array(self.tx_nonce.to_be_bytes::<32>());\n\n bytes.storage()\n }\n\n // Executes all private and public calls\n // docs:start:entrypoint-execute-calls\n pub fn execute_calls(self, context: &mut PrivateContext) {\n for call in self.function_calls {\n if !call.target_address.is_zero() {\n if call.is_public {\n context.call_public_function_with_calldata_hash(\n call.target_address,\n call.args_hash,\n call.is_static,\n );\n } else {\n let _result = context.call_private_function_with_args_hash(\n call.target_address,\n call.function_selector,\n call.args_hash,\n call.is_static,\n );\n }\n }\n }\n }\n // docs:end:entrypoint-execute-calls\n}\n"
2567
2693
  },
2568
2694
  "6": {
2569
2695
  "path": "std/collections/bounded_vec.nr",
@@ -2571,27 +2697,27 @@
2571
2697
  },
2572
2698
  "60": {
2573
2699
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/capsules/mod.nr",
2574
- "source": "use crate::oracle::capsules;\nuse protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n}\n\nimpl<T> CapsuleArray<T> {\n /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n Self { contract_address, base_slot }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\n }\n\n /// Stores a value at the end of the array.\n pub unconstrained fn push<let N: u32>(self, value: T)\n where\n T: Serialize<N>,\n {\n let current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(self.contract_address, self.base_slot, new_length);\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get<let N: u32>(self, index: u32) -> T\n where\n T: Deserialize<N>,\n {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n capsules::store(self.contract_address, self.base_slot, current_length - 1);\n }\n\n /// Iterates over the entire array, calling the callback with all values and their array index. The order in which\n /// values are processed is arbitrary.\n ///\n /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n /// ```noir\n /// array.for_each(|index, value| {\n /// if some_condition(value) {\n /// array.remove(index); // safe only for this index\n /// }\n /// }\n /// ```\n ///\n /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n /// efficiency.\n ///\n /// It is **not** safe to push new elements into the array from inside the callback.\n pub unconstrained fn for_each<Env, let N: u32>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize<N>,\n {\n // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n // unconditionally, resulting in a full clear) is a very common access pattern.\n //\n // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n // to shift any elements past the deleted one (because there will be none).\n let mut i = self.len();\n while i > 0 {\n i -= 1;\n f(i, self.get(i));\n }\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n use protocol_types::address::AztecAddress;\n\n global SLOT: Field = 1230;\n\n unconstrained fn setup() -> AztecAddress {\n TestEnvironment::new().utility().this_address()\n }\n\n #[test]\n unconstrained fn empty_array() {\n let contract_address = setup();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n }\n\n #[test]\n unconstrained fn array_push() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let contract_address = setup();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n }\n\n #[test]\n unconstrained fn for_each_called_with_all_elements() {\n let contract_address = setup();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We store all values that we were called with and check that all (value, index) tuples are present. Note that\n // we do not care about the order in which each tuple was passed to the closure.\n let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n array.for_each(|index, value| { called_with.push((index, value)); });\n\n assert_eq(called_with.len(), 3);\n assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n }\n\n #[test]\n unconstrained fn for_each_remove_some() {\n let contract_address = setup();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| {\n if index == 1 {\n array.remove(index);\n }\n });\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 4);\n assert_eq(array.get(1), 6);\n }\n\n #[test]\n unconstrained fn for_each_remove_all() {\n let contract_address = setup();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(array.len(), 0);\n }\n\n // TODO: uncomment this test once OracleMock::count is implemented in the stdlib.\n // #[test]\n // unconstrained fn for_each_remove_all_no_copy() {\n // let contract_address = setup();\n // let array = CapsuleArray::at(contract_address, SLOT);\n\n // array.push(4);\n // array.push(5);\n // array.push(6);\n\n // // We test that the copyCapsule was never called, which is the expensive operation we want to avoid.\n // let mock = OracleMock::mock(\"copyCapsule\");\n\n // array.for_each(|index, _| {\n // array.remove(index);\n // });\n\n // assert_eq(mock.count(), 0);\n // }\n}\n"
2700
+ "source": "use crate::oracle::capsules;\nuse protocol_types::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n}\n\nimpl<T> CapsuleArray<T> {\n /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n Self { contract_address, base_slot }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\n }\n\n /// Stores a value at the end of the array.\n pub unconstrained fn push(self, value: T)\n where\n T: Serialize,\n {\n let current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(self.contract_address, self.base_slot, new_length);\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T\n where\n T: Deserialize,\n {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n capsules::store(self.contract_address, self.base_slot, current_length - 1);\n }\n\n /// Iterates over the entire array, calling the callback with all values and their array index. The order in which\n /// values are processed is arbitrary.\n ///\n /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n /// ```noir\n /// array.for_each(|index, value| {\n /// if some_condition(value) {\n /// array.remove(index); // safe only for this index\n /// }\n /// }\n /// ```\n ///\n /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n /// efficiency.\n ///\n /// It is **not** safe to push new elements into the array from inside the callback.\n pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize,\n {\n // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n // unconditionally, resulting in a full clear) is a very common access pattern.\n //\n // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n // to shift any elements past the deleted one (because there will be none).\n let mut i = self.len();\n while i > 0 {\n i -= 1;\n f(i, self.get(i));\n }\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n\n global SLOT: Field = 1230;\n\n #[test]\n unconstrained fn empty_array() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n });\n }\n\n #[test]\n unconstrained fn array_push() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n });\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n });\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_called_with_all_elements() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We store all values that we were called with and check that all (value, index) tuples are present. Note that\n // we do not care about the order in which each tuple was passed to the closure.\n let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n array.for_each(|index, value| { called_with.push((index, value)); });\n\n assert_eq(called_with.len(), 3);\n assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| {\n if index == 1 {\n array.remove(index);\n }\n });\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 4);\n assert_eq(array.get(1), 6);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all_no_copy() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We test that the utilityCopyCapsule was never called, which is the expensive operation we want to avoid.\n let mock = std::test::OracleMock::mock(\"utilityCopyCapsule\");\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(mock.times_called(), 0);\n });\n }\n}\n"
2575
2701
  },
2576
2702
  "68": {
2577
2703
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/private_context.nr",
2578
- "source": "use crate::{\n context::{inputs::PrivateContextInputs, returns_hash::ReturnsHash},\n hash::{ArgsHasher, hash_args_array, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n notify_enqueued_public_function_call, notify_set_min_revertible_side_effect_counter,\n notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n notes::{notify_created_nullifier, notify_nullified_note},\n },\n};\nuse dep::protocol_types::{\n abis::{\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n include_by_timestamp::IncludeByTimestamp,\n log_hash::LogHash,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n read_request::ReadRequest,\n side_effect::Counted,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n block_header::BlockHeader,\n constants::{\n MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n messaging::l2_to_l1_message::L2ToL1Message,\n traits::{Empty, Hash, ToField},\n utils::arrays::array_concat,\n};\n\n// When finished, one can call .finish() to convert back to the abi\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub include_by_timestamp: IncludeByTimestamp,\n\n pub note_hash_read_requests: BoundedVec<ReadRequest, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub nullifier_read_requests: BoundedVec<ReadRequest, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<NoteHash, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Nullifier, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub historical_header: BlockHeader,\n\n pub private_logs: BoundedVec<PrivateLogData, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times.\n // The index of the array corresponds to the key type (0 nullifier, 1 incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n include_by_timestamp: IncludeByTimestamp::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n historical_header: inputs.historical_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n\n pub fn msg_sender(self) -> AztecAddress {\n self.inputs.call_context.msg_sender\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(NoteHash { value: note_hash, counter: self.next_counter() });\n }\n\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(\n Nullifier { value: nullifier, note_hash: 0, counter: self.next_counter() },\n );\n }\n\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(\n Nullifier {\n value: nullifier,\n note_hash: nullified_note_hash,\n counter: nullifier_counter,\n },\n );\n }\n\n // Returns the header of a block whose state is used during private execution (not the block the transaction is\n // included in).\n pub fn get_block_header(self) -> BlockHeader {\n self.historical_header\n }\n\n // Returns the header of an arbitrary block whose block number is less than or equal to the block number\n // of historical header.\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n pub fn set_return_hash(&mut self, returns_hasher: ArgsHasher) {\n self.return_hash = returns_hasher.hash();\n execution_cache::store(returns_hasher.fields, self.return_hash);\n }\n\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n include_by_timestamp: self.include_by_timestamp,\n note_hash_read_requests: self.note_hash_read_requests.storage(),\n nullifier_read_requests: self.nullifier_read_requests.storage(),\n key_validation_requests_and_generators: self\n .key_validation_requests_and_generators\n .storage(),\n note_hashes: self.note_hashes.storage(),\n nullifiers: self.nullifiers.storage(),\n private_call_requests: self.private_call_requests.storage(),\n public_call_requests: self.public_call_requests.storage(),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: self.l2_to_l1_msgs.storage(),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: self.private_logs.storage(),\n contract_class_logs_hashes: self.contract_class_logs_hashes.storage(),\n historical_header: self.historical_header,\n tx_context: self.inputs.tx_context,\n }\n }\n\n pub fn set_as_fee_payer(&mut self) {\n dep::protocol_types::debug_log::debug_log_format(\n \"Setting {0} as fee payer\",\n [self.this_address().to_field()],\n );\n self.is_fee_payer = true;\n }\n\n pub fn end_setup(&mut self) {\n // dep::protocol_types::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n // docs:start:include-by-timestamp\n pub fn set_include_by_timestamp(&mut self, include_by_timestamp: u64) {\n // docs:end:include-by-timestamp\n self.include_by_timestamp =\n IncludeByTimestamp::min_with_u64(self.include_by_timestamp, include_by_timestamp);\n }\n\n pub fn push_note_hash_read_request(&mut self, note_hash: Field) {\n let side_effect = ReadRequest { value: note_hash, counter: self.next_counter() };\n self.note_hash_read_requests.push(side_effect);\n }\n\n pub fn push_nullifier_read_request(&mut self, nullifier: Field) {\n let request = ReadRequest { value: nullifier, counter: self.next_counter() };\n self.nullifier_read_requests.push(request);\n }\n\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request = self.last_key_validation_requests[key_index as u32].unwrap_or(\n KeyValidationRequest::empty(),\n );\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale\n // Typically we'd validate keys by showing that they are the preimage of `pk_m_hash`, but that'd require\n // the oracle returning the master secret keys, which could cause malicious contracts to leak it or learn\n // about secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to\n // validate that we siloed secret key corresponds to correct siloing of the master secret key that hashes\n // to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request\n // for the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator {\n request,\n sk_app_generator: sk_generators[key_index as u32],\n },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n // docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n // docs:end:context_message_portal\n let message = L2ToL1Message { recipient, content };\n self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n }\n\n // docs:start:context_consume_l1_to_l2_message\n // docs:start:consume_l1_to_l2_message\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n // docs:end:context_consume_l1_to_l2_message\n let nullifier = process_l1_to_l2_message(\n self.historical_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n // docs:end:consume_l1_to_l2_message\n\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32) {\n let counter = self.next_counter();\n let private_log =\n PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter: 0, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn emit_raw_note_log(\n &mut self,\n log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS],\n length: u32,\n note_hash_counter: u32,\n ) {\n let counter = self.next_counter();\n let private_log =\n PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n false,\n )\n }\n\n pub fn static_call_private_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is\n // the number of side effects that took place), along with the hash of the return values. We validate these\n // by requesting a private kernel iteration in which the return values are constrained to hash\n // to `returns_hash` and the side effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it\n // we need this in order to pay fees inside child call contexts\n // assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // );\n // if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter {\n // self.min_revertible_side_effect_counter = item.public_inputs.min_revertible_side_effect_counter;\n // }\n self.side_effect_counter = end_side_effect_counter + 1;\n ReturnsHash::new(returns_hash)\n }\n\n pub fn call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n pub fn set_public_teardown_function<let ARGS_COUNT: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ARGS_COUNT],\n ) {\n let calldata = array_concat([function_selector.to_field()], args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n self.public_teardown_call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n }\n\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n include_by_timestamp: IncludeByTimestamp::empty(),\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n historical_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n}\n"
2704
+ "source": "use crate::{\n context::{inputs::PrivateContextInputs, returns_hash::ReturnsHash},\n hash::{ArgsHasher, hash_args_array, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n notify_enqueued_public_function_call, notify_set_min_revertible_side_effect_counter,\n notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n logs::notify_created_contract_class_log,\n notes::{notify_created_nullifier, notify_nullified_note},\n },\n};\nuse dep::protocol_types::{\n abis::{\n block_header::BlockHeader,\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log_hash::LogHash,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n read_request::ReadRequest,\n side_effect::Counted,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL,\n MAX_ENQUEUED_CALLS_PER_CALL, MAX_INCLUDE_BY_TIMESTAMP_DURATION,\n MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n hash::poseidon2_hash,\n messaging::l2_to_l1_message::L2ToL1Message,\n traits::{Empty, Hash, ToField},\n utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between a #[private] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset\n/// of every private function, within the #[private] macro, so you'll never\n/// need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within\n/// the body of every #[private] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to\n/// > `context` without seeing a declaration `let context = PrivateContext::new(...)`\n/// > within the body of your function. This is just a consequence of using\n/// > macros to tidy-up verbose boilerplate. You can use `nargo expand` to\n/// > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter\n/// methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within\n/// aztec-nr's own functions, so typically a smart contract developer won't\n/// need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context\n/// > directly for lower-level control. If you find yourself doing this, please\n/// > open an issue on GitHub to describe your use case: it might be that\n/// > new functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being\n/// executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is\n/// being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header.\n/// Recall, a private function cannot read from the \"current\" block header,\n/// but must read from some historical block header, because as soon as\n/// private function execution begins (asynchronously, on a user's device),\n/// the public state of the chain (the \"current state\") will have progressed\n/// forward. We call this reference the \"Anchor block\".\n/// See `BlockHeader`.\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests\n/// (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n/// - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[private] macro).\n/// - Returns the return values of this private function (handled by the\n/// #[private] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we\n/// do not trust them. They are instead given \"app-siloed\" secret keys with\n/// a claim that they relate to a master public key. They can then request\n/// validation of this claim, by making a \"key validation request\" to the\n/// protocol's kernel circuits (which _are_ allowed to see certain master\n/// secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the\n/// PrivateCircuitPublicInputs of the private function being executed.\n/// All private functions on Aztec must have public inputs which adhere\n/// to the rigid layout of the PrivateCircuitPublicInputs, in order to be\n/// compatible with the protocol's kernel circuits.\n/// A well-known misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the\n/// \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak\n/// to the outside world, because they are 'swallowed' by the protocol's\n/// kernel circuits before the tx is sent to the network. Only the\n/// following are exposed to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n/// - New L2->L1 messages\n/// - New enqueued public function call requests\n/// All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the\n/// PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to\n/// the PrivateContext instance to read/write data. This is why you'll see the\n/// arguably-ugly pervasiveness of the \"context\" throughout your smart contract\n/// and the aztec-nr library.\n/// For example, `&mut context` is prevalent. In some languages, you can access\n/// and mutate a global variable (such as a PrivateContext instance) from a\n/// function without polluting the function's parameters. With Noir, a function\n/// must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data\n/// to the PrivateContext, they need to be handed a mutable reference _to_ the\n/// context as a parameter.\n/// For example, `Context` is prevalent as a generic parameter, to give better\n/// type safety at compile time. Many `aztec-nr` functions don't make sense if\n/// they're called in a particular runtime (private, public or utility), and so\n/// are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract\n/// developers a much faster feedback loop if they're making a mistake, as an\n/// error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub include_by_timestamp: u64,\n\n pub note_hash_read_requests: BoundedVec<ReadRequest, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub nullifier_read_requests: BoundedVec<ReadRequest, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<NoteHash, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Nullifier, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub historical_header: BlockHeader,\n\n pub private_logs: BoundedVec<PrivateLogData, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times.\n // The index of the array corresponds to the key type (0 nullifier, 1 incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n let max_allowed_include_by_timestamp =\n inputs.historical_header.global_variables.timestamp + MAX_INCLUDE_BY_TIMESTAMP_DURATION;\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n include_by_timestamp: max_allowed_include_by_timestamp,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n historical_header: inputs.historical_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n\n /// Returns the contract address that initiated this function call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name).\n ///\n /// Important Note: Since Aztec doesn't have a concept of an EoA (\n /// Externally-owned Account), the msg_sender is \"undefined\" for the first\n /// function call of every transaction. A value of `-1` is returned in such\n /// cases.\n /// The first function call of a tx is likely to be a call to the user's\n /// account contract, so this quirk will most often be handled by account\n /// contract developers.\n ///\n /// TODO(https://github.com/AztecProtocol/aztec-packages/issues/14025) - we\n /// are considering making msg_sender: Option<AztecAddress>, since\n /// a returned value of `Option:none` will be clearer to developers.\n ///\n /// # Returns\n /// * `AztecAddress` - The address of the smart contract that called\n /// this function (be it an app contract or a user's account contract).\n /// Returns `-1` for the first function call of the tx.\n ///\n pub fn msg_sender(self) -> AztecAddress {\n self.inputs.call_context.msg_sender\n }\n\n /// Returns the contract address of the current function being executed.\n ///\n /// This is equivalent to `address(this)` in Solidity (hence the name).\n /// Use this to identify the current contract's address, commonly needed for\n /// access control or when interacting with other contracts.\n ///\n /// # Returns\n /// * `AztecAddress` - The contract address of the current function being\n /// executed.\n ///\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n /// Returns the chain ID of the current network.\n ///\n /// This is similar to `block.chainid` in Solidity. Returns the unique\n /// identifier for the blockchain network this transaction is executing on.\n ///\n /// Helps prevent cross-chain replay attacks. Useful if implementing\n /// multi-chain contract logic.\n ///\n /// # Returns\n /// * `Field` - The chain ID as a field element\n ///\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n /// Returns the Aztec protocol version that this transaction is executing\n /// under. Different versions may have different rules, opcodes, or\n /// cryptographic primitives.\n ///\n /// This is similar to how Ethereum has different EVM versions.\n ///\n /// Useful for forward/backward compatibility checks\n ///\n /// Not to be confused with contract versions; this is the protocol version.\n ///\n /// # Returns\n /// * `Field` - The protocol version as a field element\n ///\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n /// Returns the gas settings for the current transaction.\n ///\n /// This provides information about gas limits and pricing for the\n /// transaction, similar to `tx.gasprice` and gas limits in Ethereum.\n /// However, Aztec has a more sophisticated gas model with separate\n /// accounting for L2 computation and data availability (DA) costs.\n ///\n /// # Returns\n /// * `GasSettings` - Struct containing gas limits and fee information\n ///\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n /// Returns the function selector of the currently executing function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need\n /// to access this.\n ///\n /// This is similar to `msg.sig` in Solidity, which returns the first 4\n /// bytes of the function signature. In Aztec, the selector uniquely\n /// identifies which function within the contract is being called.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// Only #[private] functions have a function selector as a protocol-\n /// enshrined concept. The function selectors of private functions are\n /// baked into the preimage of the contract address, and are used by the\n /// protocol's kernel circuits to identify each private function and ensure\n /// the correct one is being executed.\n ///\n /// Used internally for function dispatch and call verification.\n ///\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: You shouldn't need to call this. The #[private]\n /// macro calls this, and it makes the arguments neatly available to the\n /// body of your private function.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n /// # Advanced\n /// * Arguments are hashed to reduce proof size and verification time\n /// * Enables efficient argument passing in recursive function calls\n /// * The hash can be used to retrieve the original arguments from the PXE.\n ///\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree\n /// (a state tree).\n ///\n /// A note_hash is a commitment to a piece of private state.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need\n /// to manually call this. Aztec-nr's state variables (see `../state_vars/`)\n /// are designed to understand when to create and push new note hashes.\n ///\n /// # Arguments\n /// * `note_hash` - The new note_hash.\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the\n /// note_hash into the protocol's \"note hash tree\" (in the Base Rollup\n /// circuit).\n /// Before insertion, the protocol will:\n /// - \"Silo\" the `note_hash` with the contract address of this function,\n /// to yield a `siloed_note_hash`. This prevents state collisions\n /// between different smart contracts.\n /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold\n /// attacks, by hashing the `siloed_note_hash` with a unique value, to\n /// yield a `unique_siloed_note_hash` (see the protocol spec for more).\n ///\n /// In addition to calling this function, aztec-nr provides the contents\n /// of the newly-created note to the PXE, via the `notify_created_note`\n /// oracle.\n ///\n /// > Advanced users might occasionally wish to push data to the context\n /// > directly for lower-level control. If you find yourself doing this,\n /// > please open an issue on GitHub to describe your use case: it might be\n /// > that new functionality should be added to aztec-nr.\n ///\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(NoteHash { value: note_hash, counter: self.next_counter() });\n }\n\n /// Pushes a new nullifier to the Aztec blockchain's global Nullifier Tree\n /// (a state tree).\n ///\n /// See also: `push_nullifier_for_note_hash`.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need\n /// to manually call this. Aztec-nr's state variables (see `../state_vars/`)\n /// are designed to understand when to create and push new nullifiers.\n ///\n /// A nullifier can only be emitted once. Duplicate nullifier insertions are\n /// rejected by the protocol.\n ///\n /// Generally, a nullifier is emitted to prevent an action from happening\n /// more than once, in such a way that the action cannot be linked (by an\n /// observer of the blockchain) to any earlier transactions.\n ///\n /// I.e. a nullifier is a random-looking, but deterministic record of a\n /// private, one-time action, which does not leak what action has been\n /// taken, and which preserves the property of \"tx unlinkability\".\n ///\n /// Usually, a nullifier will be emitted to \"spend\" a note (a piece of\n /// private state), without revealing which specific note is being spent.\n ///\n /// (Important: in such cases, use the below `push_nullifier_for_note_hash`).\n ///\n /// Sometimes, a nullifier might be emitted completely unrelated to any\n /// notes. Examples include initialization of a new contract; initialization\n /// of a PrivateMutable, or signalling in Semaphore-like applications.\n /// This `push_nullifier` function serves such use cases.\n ///\n /// # Arguments\n /// * `nullifier`\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the\n /// nullifier into the protocol's \"nullifier tree\" (in the Base Rollup\n /// circuit).\n /// Before insertion, the protocol will:\n /// - \"Silo\" the `nullifier` with the contract address of this function,\n /// to yield a `siloed_nullifier`. This prevents state collisions\n /// between different smart contracts.\n /// - Ensure the `siloed_nullifier` is unique (the nullifier tree is an\n /// indexed merkle tree which supports efficient non-membership proofs).\n ///\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(\n Nullifier { value: nullifier, note_hash: 0, counter: self.next_counter() },\n );\n }\n\n /// Pushes a nullifier that corresponds to a specific note hash.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need\n /// to manually call this. Aztec-nr's state variables (see `../state_vars/`)\n /// are designed to understand when to create and push new nullifiers.\n ///\n /// This is a specialized version of `push_nullifier` that links a nullifier\n /// to the specific note hash it's nullifying. This is the most common\n /// usage pattern for nullifiers.\n /// See `push_nullifier` for more explanation on nullifiers.\n ///\n /// # Arguments\n /// * `nullifier`\n /// * `nullified_note_hash` - The note hash of the note being nullified\n ///\n /// # Advanced\n /// Important: usage of this function doesn't mean that the world will _see_\n /// that this nullifier relates to the given nullified_note_hash (as that\n /// would violate \"tx unlinkability\"); it simply informs the user's PXE\n /// about the relationship (via `notify_nullified_note`). The PXE can then\n /// use this information to feed hints to the kernel circuits for\n /// \"squashing\" purposes: If a note is nullified during the same tx which\n /// created it, we can \"squash\" (delete) the note and nullifier (and any\n /// private logs associated with the note), to save on data emission costs.\n ///\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(\n Nullifier {\n value: nullifier,\n note_hash: nullified_note_hash,\n counter: nullifier_counter,\n },\n );\n }\n\n /// Returns the anchor block header - the historical block header that this\n /// private function is reading from.\n ///\n /// A private function CANNOT read from the \"current\" block header,\n /// but must read from some historical block header, because as soon as\n /// private function execution begins (asynchronously, on a user's device),\n /// the public state of the chain (the \"current state\") will have progressed\n /// forward.\n ///\n /// # Returns\n /// * `BlockHeader` - The anchor block header.\n ///\n /// # Advanced\n /// * All private functions of a tx read from the same anchor block header.\n /// * The protocol asserts that the `include_by_timestamp` of every tx\n /// is at most 24 hours beyond the timestamp of the tx's chosen anchor\n /// block header. This enables the network's nodes to safely prune old txs\n /// from the mempool. Therefore, the chosen block header _must_ be one\n /// from within the last 24 hours.\n ///\n pub fn get_block_header(self) -> BlockHeader {\n self.historical_header\n }\n\n /// Returns the header of any historical block at or before the anchor\n /// block.\n ///\n /// This enables private contracts to access information from even older\n /// blocks than the anchor block header.\n ///\n /// Useful for time-based contract logic that needs to compare against\n /// multiple historical points.\n ///\n /// # Arguments\n /// * `block_number` - The block number to retrieve (must be <= anchor\n /// block number)\n ///\n /// # Returns\n /// * `BlockHeader` - The header of the requested historical block\n ///\n /// # Advanced\n /// This function uses an oracle to fetch block header data from the user's\n /// PXE. Depending on how much blockchain data the user's PXE has been set\n /// up to store, this might require a query from the PXE to another Aztec\n /// node to get the data.\n /// > This is generally true of all oracle getters (see `../oracle`).\n ///\n /// Each block header gets hashed and stored as a leaf in the protocol's\n /// Archive Tree. In fact, the i-th block header gets stored at the i-th\n /// leaf index of the Archive Tree. Behind the scenes, this\n /// `get_block_header_at` function will add Archive Tree merkle-membership\n /// constraints (~3k) to your smart contract function's circuit, to prove\n /// existence of the block header in the Archive Tree.\n ///\n /// Note: we don't do any caching, so avoid making duplicate calls for the\n /// same block header, because each call will add duplicate constraints.\n ///\n /// Calling this function is more expensive (constraint-wise) than getting\n /// the anchor block header (via `get_block_header`). This is because the\n /// anchor block's merkle membership proof is handled by Aztec's protocol\n /// circuits, and is only performed once for the entire tx because all\n /// private functions of a tx share a common anchor block header. Therefore,\n /// the cost (constraint-wise) of calling `get_block_header` is effectively\n /// free.\n ///\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n /// Sets the hash of the return values for this private function.\n ///\n /// Very low-level function: this is called by the #[private] macro.\n ///\n /// # Arguments\n /// * `returns_hasher` - A hasher containing the return values to hash\n ///\n pub fn set_return_hash(&mut self, returns_hasher: ArgsHasher) {\n self.return_hash = returns_hasher.hash();\n execution_cache::store(returns_hasher.fields, self.return_hash);\n }\n\n /// Builds the PrivateCircuitPublicInputs for this private function, to\n /// ensure compatibility with the protocol's kernel circuits.\n ///\n /// Very low-level function: This function is automatically called by the\n /// #[private] macro.\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n include_by_timestamp: self.include_by_timestamp,\n note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(\n self.note_hash_read_requests,\n ),\n nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(\n self.nullifier_read_requests,\n ),\n key_validation_requests_and_generators: ClaimedLengthArray::from_bounded_vec(\n self.key_validation_requests_and_generators,\n ),\n note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(\n self.contract_class_logs_hashes,\n ),\n historical_header: self.historical_header,\n tx_context: self.inputs.tx_context,\n }\n }\n\n /// Designates this contract as the fee payer for the transaction.\n ///\n /// Unlike Ethereum, where the transaction sender always pays fees, Aztec\n /// allows any contract to voluntarily pay transaction fees. This enables\n /// patterns like sponsored transactions or fee abstraction where users\n /// don't need to hold fee-juice themselves. (Fee juice is a fee-paying\n /// asset for Aztec).\n ///\n /// Only one contract per transaction can declare itself as the fee payer,\n /// and it must have sufficient fee-juice balance (>= the gas limits\n /// specified in the TxContext) by the time we reach the public setup phase\n /// of the tx.\n ///\n pub fn set_as_fee_payer(&mut self) {\n dep::protocol_types::debug_log::debug_log_format(\n \"Setting {0} as fee payer\",\n [self.this_address().to_field()],\n );\n self.is_fee_payer = true;\n }\n\n /// Declares the end of the \"setup phase\" of this tx.\n ///\n /// Only one function per tx can declare the end of the setup phase.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers\n /// (aka Fee-payment contracts) will need to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown.\n /// The phases exist to enable a fee payer to take on the risk of paying\n /// a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether\n /// the app logic will succeed. The \"setup\" phase enables such a payment to\n /// be made, because the setup phase _cannot revert_: a reverting function\n /// within the setup phase would result in an invalid block which cannot\n /// be proven. Any side-effects generated during that phase are guaranteed\n /// to be inserted into Aztec's state trees (except for squashed notes &\n /// nullifiers, of course).\n ///\n /// Even though the end of the setup phase is declared within a private\n /// function, you might have noticed that _public_ functions can also\n /// execute within the setup phase. This is because any public function\n /// calls which were enqueued _within the setup phase_ by a private\n /// function are considered part of the setup phase.\n ///\n /// # Advanced\n /// * Sets the minimum revertible side effect counter of this tx to be the\n /// PrivateContext's _current_ side effect counter.\n ///\n pub fn end_setup(&mut self) {\n // dep::protocol_types::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.side_effect_counter;\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n /// Sets a deadline (an \"include-by timestamp\") for when this transaction\n /// must be included in a block.\n ///\n /// Other functions in this tx might call this setter with differing\n /// values for the include-by timestamp. To ensure that all functions'\n /// deadlines are met, the _minimum_ of all these include-by timestamps will\n /// be exposed when this tx is submitted to the network.\n ///\n /// If the transaction is not included in a block by its include-by\n /// timestamp, it becomes invalid and it will never be included.\n ///\n /// This expiry timestamp is publicly visible. See the \"Advanced\" section\n /// for privacy concerns.\n ///\n /// # Arguments\n /// * `include_by_timestamp` - Unix timestamp (seconds) deadline for inclusion.\n /// The include-by timestamp of this tx will be\n /// _at most_ the timestamp specified.\n ///\n /// # Advanced\n /// * If multiple functions set differing `include_by_timestamp`s, the\n /// kernel circuits will set it to be the _minimum_ of the two. This\n /// ensures the tx expiry requirements of all functions in the tx are met.\n /// * Rollup circuits will reject expired txs.\n /// * The protocol enforces that all transactions must be included within\n /// 24 hours of their chosen anchor block's timestamp, to enable safe\n /// mempool pruning.\n /// * The DelayedPublicMutable design makes heavy use of this functionality,\n /// to enable private functions to read public state.\n /// * A sophisticated Wallet should cleverly set an include-by timestamp\n /// to improve the privacy of the user and the network as a whole.\n /// For example, if a contract interaction sets include-by to some\n /// publicly-known value (e.g. the time when a contract upgrades), then\n /// the wallet might wish to set an even lower one to avoid revealing that\n /// this tx is interacting with said contract.\n /// Ideally, all wallets should standardise on an approach in order to\n /// provide users with a large anonymity set -- although the exact apprach\n /// will need to be discussed. Wallets that deviate from a standard might\n /// accidentally reveal which wallet each transaction originates from.\n ///\n // docs:start:include-by-timestamp\n pub fn set_include_by_timestamp(&mut self, include_by_timestamp: u64) {\n // docs:end:include-by-timestamp\n self.include_by_timestamp = std::cmp::min(self.include_by_timestamp, include_by_timestamp);\n }\n\n /// Makes a request to the protocol's kernel circuit to ensure a note_hash\n /// actually exists.\n ///\n /// \"Read requests\" are used to prove that a note hash exists without\n /// revealing which specific note was read.\n ///\n /// This can be used to prove existence of both settled notes (created in\n /// prior transactions) and transient notes (created in the current\n /// transaction).\n /// If you need to prove existence of a settled note _at a specific block\n /// number_, use `note_inclusion::prove_note_inclusion`.\n ///\n /// Low-level function. Ordinarily, smart contract developers will not need\n /// to call this directly. Aztec-nr's state variables (see `../state_vars/`)\n /// are designed to understand when to create and push new note_hash read\n /// requests.\n ///\n /// # Arguments\n /// * `note_hash` - The note hash to read and verify\n ///\n /// # Advanced\n /// In \"traditional\" circuits for non-Aztec privacy applications, the merkle\n /// membership proofs to check existence of a note are performed _within_\n /// the application circuit.\n ///\n /// All Aztec private functions have access to the following constraint\n /// optimisation:\n /// In cases where the note being read was created earlier in the same tx,\n /// the note wouldn't yet exist in the Note Hash Tree, so a hard-coded\n /// merkle membership check which then gets ignored would be a waste of\n /// constraints.\n /// Instead, we can send read requests for all notes to the protocol's\n /// kernel circuits, where we can conditionally assess which notes actually\n /// need merkle membership proofs, and select an appropriately-sized\n /// kernel circuit.\n ///\n /// For \"settled notes\" (which already existed in the Note Hash Tree of the\n /// anchor block (i.e. before the tx began)), the kernel does a merkle\n /// membership check.\n ///\n /// For \"pending notes\" (which were created earlier in _this_ tx), the\n /// kernel will check that the note existed _before_ this read request was\n /// made, by checking the side-effect counters of the note_hash and this\n /// read request.\n ///\n /// This approach improves latency between writes and reads:\n /// a function can read a note which was created earlier in the tx (rather\n /// than performing the read in a later tx, after waiting for the earlier tx\n /// to be included, to ensure the note is included in the tree).\n ///\n pub fn push_note_hash_read_request(&mut self, note_hash: Field) {\n let side_effect = ReadRequest { value: note_hash, counter: self.next_counter() };\n self.note_hash_read_requests.push(side_effect);\n }\n\n /// Requests to read a specific nullifier from the nullifier tree.\n ///\n /// Nullifier read requests are used to prove that a nullifier exists without\n /// revealing which specific nullifier preimage was read.\n ///\n /// This can be used to prove existence of both settled nullifiers (created in\n /// prior transactions) and transient nullifiers (created in the current\n /// transaction).\n /// If you need to prove existence of a settled nullifier _at a specific block\n /// number_, use `nullifier_inclusion::prove_nullifier_inclusion`.\n ///\n /// Low-level function. Ordinarily, smart contract developers will not need\n /// to call this directly. Aztec-nr's state variables (see `../state_vars/`)\n /// are designed to understand when to create and push new nullifier read\n /// requests.\n ///\n /// # Arguments\n /// * `nullifier` - The nullifier to read and verify\n ///\n /// # Advanced\n /// This approach improves latency between writes and reads:\n /// a function can read a nullifier which was created earlier in the tx\n /// (rather than performing the read in a later tx, after waiting for the\n /// earlier tx to be included, to ensure the note is included in the tree).\n ///\n pub fn push_nullifier_read_request(&mut self, nullifier: Field) {\n let request = ReadRequest { value: nullifier, counter: self.next_counter() };\n self.nullifier_read_requests.push(request);\n }\n\n /// Requests the app-siloed nullifier secret key (nsk_app) for the given\n /// (hashed) master nullifier public key (npk_m), from the user's PXE.\n ///\n /// Advanced function: Only needed if you're designing your own notes and/or\n /// nullifiers.\n ///\n /// Contracts are not allowed to compute nullifiers for other contracts, as\n /// that would let them read parts of their private state. Because of this,\n /// a contract is only given an \"app-siloed secret key\", which is\n /// constructed by hashing the user's master nullifier secret key with the\n /// contract's address.\n /// However, because contracts cannot be trusted with a user's master\n /// nullifier secret key (because we don't know which contracts are honest\n /// or malicious), the PXE refuses to provide any master secret keys to\n /// any app smart contract function. This means app functions are unable to\n /// prove that the derivation of an app-siloed nullifier secret key has been\n /// computed correctly. Instead, an app function can request to the kernel\n /// (via `request_nsk_app`) that it validates the siloed derivation, since\n /// the kernel has been vetted to not leak any master secret keys.\n ///\n /// A common nullification scheme is to inject a nullifier secret key into\n /// the preimage of a nullifier, to make the nullifier deterministic but\n /// random-looking. This function enables that flow.\n ///\n /// # Arguments\n /// * `npk_m_hash` - A hash of the master nullifier public key of the user\n /// whose PXE is executing this function.\n ///\n /// # Returns\n /// * The app-siloed nullifier secret key that corresponds to the given\n /// `npk_m_hash`.\n ///\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n /// Requests the app-siloed nullifier secret key (nsk_app) for the given\n /// (hashed) master nullifier public key (npk_m), from the user's PXE.\n ///\n /// See `request_nsk_app` and `request_sk_app` for more info.\n ///\n /// The intention of the \"outgoing\" keypair is to provide a second secret\n /// key for all of a user's outgoing activity (i.e. for notes that a user\n /// creates, as opposed to notes that a user receives from others). The\n /// separation of incoming and outgoing data was a distinction made by\n /// zcash, with the intention of enabling a user to optionally share with a\n /// 3rd party a controlled view of only incoming or outgoing notes.\n /// Similar functionality of sharing select data can be achieved with\n /// offchain zero-knowledge proofs. It is up to an app developer whether\n /// they choose to make use of a user's outgoing keypair within their\n /// application logic, or instead simply use the same keypair (the address\n /// keypair (which is effectively the same as the \"incooming\" keypair)) for\n /// all incoming & outgoing messages to a user.\n ///\n /// Currently, all of the exposed encryption functions in aztec-nr ignore\n /// the outgoing viewing keys, and instead encrypt all note logs and event\n /// logs to a user's address public key.\n ///\n /// # Arguments\n /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n ///\n /// # Returns\n /// * The application-specific outgoing viewing secret key\n ///\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n /// Pushes a Key Validation Request to the kernel.\n ///\n /// Private functions are not allowed to see a user's master secret keys,\n /// because we do not trust them. They are instead given \"app-siloed\" secret\n /// keys with a claim that they relate to a master public key.\n /// They can then request validation of this claim, by making a \"key\n /// validation request\" to the protocol's kernel circuits (which _are_\n /// allowed to see certain master secret keys).\n ///\n /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is\n /// submitted to the kernel, it will perform the following derivations\n /// to validate the relationship between the claimed sk_app and the user's\n /// Pk_m:\n ///\n /// (sk_m) ----> * G ----> Pk_m\n /// | |\n /// v We use the kernel to prove this\n /// h(sk_m, app_address) | sk_app-Pk_m relationship, because app\n /// | circuits must not be trusted to see sk_m.\n /// v |\n /// sk_app - - - - - - - - -\n ///\n /// The function is named \"request_\" instead of \"get_\" to remind the user\n /// that a Key Validation Request will be emitted to the kernel.\n ///\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request = self.last_key_validation_requests[key_index as u32].unwrap_or(\n KeyValidationRequest::empty(),\n );\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale\n // Typically we'd validate keys by showing that they are the preimage of `pk_m_hash`, but that'd require\n // the oracle returning the master secret keys, which could cause malicious contracts to leak it or learn\n // about secrets from other contracts. We therefore silo secret keys, and rely on the private kernel to\n // validate that we siloed secret key corresponds to correct siloing of the master secret key that hashes\n // to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request\n // for the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator {\n request,\n sk_app_generator: sk_generators[key_index as u32],\n },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart\n /// contract on Ethereum (L1). L1 contracts which are designed to\n /// send/receive messages to/from Aztec are called \"Portal Contracts\".\n ///\n /// Common use cases include withdrawals, cross-chain asset transfers, and\n /// triggering L1 actions based on L2 state changes.\n ///\n /// The message will be inserted into an Aztec \"Outbox\" contract on L1,\n /// when this transaction's block is proposed to L1.\n /// Sending the message will not result in any immediate state changes in\n /// the target portal contract. The message will need to be manually\n /// consumed from the Outbox through a separate Ethereum transaction: a user\n /// will need to call a function of the portal contract -- a function\n /// specifically designed to make a call to the Outbox to consume the\n /// message.\n /// The message will only be available for consumption once the _epoch_\n /// proof has been submitted. Given that there are multiple Aztec blocks\n /// within an epoch, it might take some time for this epoch proof to be\n /// submitted -- especially if the block was near the start of an epoch.\n ///\n /// # Arguments\n /// * `recipient` - Ethereum address that will receive the message\n /// * `content` - Message content (32 bytes as a Field element).\n /// This content has a very specific layout.\n /// docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n // docs:end:context_message_portal\n let message = L2ToL1Message { recipient, content };\n self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n ///\n /// Common use cases include token bridging, cross-chain governance, and\n /// triggering L2 actions based on L1 events.\n ///\n /// Use this function if you only want the message to ever be \"referred to\"\n /// once. Once consumed using this method, the message cannot be consumed\n /// again, because a nullifier is emitted.\n /// If your use case wants for the message to be read unlimited times, then\n /// you can always read any historic message from the L1-to-L2 messages tree;\n /// messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract\n /// on L1.\n /// Sending the message will not result in any immediate state changes in\n /// the target L2 contract. The message will need to be manually\n /// consumed by the target contract through a separate Aztec transaction.\n /// The message will not be available for consumption immediately. Messages\n /// get copied over from the L1 Inbox to L2 by the next Proposer in batches.\n /// So you will need to wait until the messages are copied before you can\n /// consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret value used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// Validates message existence in the L1-to-L2 message tree and nullifies\n /// the message to prevent double-consumption.\n ///\n // docs:start:context_consume_l1_to_l2_message\n // docs:start:consume_l1_to_l2_message\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n // docs:end:context_consume_l1_to_l2_message\n let nullifier = process_l1_to_l2_message(\n self.historical_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n // docs:end:consume_l1_to_l2_message\n\n /// Emits a private log (an array of Fields) that will be published to an\n /// Ethereum blob.\n ///\n /// Private logs are intended for the broadcasting of ciphertexts: that is,\n /// encrypted events or encrypted note contents.\n /// Since the data in the logs is meant to be _encrypted_, private_logs are\n /// broadcast to publicly-visible Ethereum blobs.\n /// The intended recipients of such encrypted messages can then discover and\n /// decrypt these encrypted logs using their viewing secret key.\n /// (See `../messages/discovery` for more details).\n ///\n /// Important note: This function DOES NOT _do_ any encryption of the input\n /// `log` fields. This function blindly publishes whatever input `log` data\n /// is fed into it, so the caller of this function should have already\n /// performed the encryption, and the `log` should be the result of that\n /// encryption.\n ///\n /// The protocol does not dictate what encryption scheme should be used:\n /// a smart contract developer can choose whatever encryption scheme they\n /// like.\n /// Aztec-nr includes some off-the-shelf encryption libraries that\n /// developers might wish to use, for convenience. These libraries not only\n /// encrypt a plaintext (to produce a ciphertext); they also prepend the\n /// ciphertext with a `tag` and `ephemeral public key` for easier message\n /// discovery. This is a very dense topic, and we will be writing more\n /// libraries and docs soon.\n ///\n /// > Currently, AES128 CBC encryption is the main scheme included in\n /// > aztec.nr.\n /// > We are currently making significant changes to the interfaces of the\n /// > encryption library.\n ///\n /// In some niche use cases, an app might be tempted to publish\n /// _un-encrypted_ data via a private log, because _public logs_ are not\n /// available to private functions. Be warned that emitting public data via\n /// private logs is strongly discouraged, and is considered a \"privacy\n /// anti-pattern\", because it reveals identifiable information about _which_\n /// function has been executed. A tx which leaks such information does not\n /// contribute to the privacy set of the network.\n ///\n /// * Unlike `emit_raw_note_log`, this log is not tied to any specific note\n ///\n /// # Arguments\n /// * `log` - The log data that will be publicly broadcast (so make sure\n /// it's already been encrypted before you call this function).\n /// Private logs are bounded in size (PRIVATE_LOG_SIZE_IN_FIELDS), to\n /// encourage all logs from all smart contracts look identical.\n /// * `length` - The actual length of the `log` (measured in number of\n /// Fields). Although the input log has a max size of\n /// PRIVATE_LOG_SIZE_IN_FIELDS, the latter values of the array might all\n /// be 0's for small logs. This `length` should reflect the trimmed length\n /// of the array. The protocol's kernel circuits can then append random\n /// fields as \"padding\" after the `length`, so that the logs of this\n /// smart contract look indistinguishable from (the same length as) the\n /// logs of all other applications. It's up to wallets how much padding\n /// to apply, so ideally all wallets should agree on standards for this.\n ///\n /// # Advanced\n ///\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32) {\n let counter = self.next_counter();\n let private_log =\n PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter: 0, counter };\n self.private_logs.push(private_log);\n }\n\n // TODO: rename.\n /// Emits a private log that is explicitly tied to a newly-emitted note_hash,\n /// to convey to the kernel: \"this log relates to this note\".\n ///\n /// This linkage is important in case the note gets squashed (due to being\n /// read later in this same tx), since we can then squash the log as well.\n ///\n /// See `emit_private_log` for more info about private log emission.\n ///\n /// # Arguments\n /// * `log` - The log data as an array of Field elements\n /// * `length` - The actual length of the `log` (measured in number of\n /// Fields).\n /// * `note_hash_counter` - The side-effect counter that was assigned to the\n /// new note_hash when it was pushed to this\n // `PrivateContext`.\n ///\n /// Important: If your application logic requires the log to always be\n /// emitted regardless of note squashing, consider using `emit_private_log`\n /// instead, or emitting additional events.\n ///\n pub fn emit_raw_note_log(\n &mut self,\n log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS],\n length: u32,\n note_hash_counter: u32,\n ) {\n let counter = self.next_counter();\n let private_log =\n PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter, counter };\n self.private_logs.push(private_log);\n }\n\n pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n let contract_address = self.this_address();\n let counter = self.next_counter();\n\n let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros to save blob space.\n // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond length are zero.\n let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter bytecode.\n let log_hash = poseidon2_hash(log_to_emit);\n // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be constrained.\n unsafe {\n notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n }\n\n self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(\n counter,\n ));\n }\n\n /// Calls a private function on another contract (or the same contract).\n ///\n /// Very low-level function.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use\n /// `.get_preimage()` to extract the actual return values.\n ///\n /// This enables contracts to interact with each other while maintaining\n /// privacy. This \"composability\" of private contract functions is a key\n /// feature of the Aztec network.\n ///\n /// If a user's transaction includes multiple private function calls, then\n /// by the design of Aztec, the following information will remain private[1]:\n /// - The function selectors and contract addresses of all private function\n /// calls will remain private, so an observer of the public mempool will\n /// not be able to look at a tx and deduce which private functions have\n /// been executed.\n /// - The arguments and return values of all private function calls will\n /// remain private.\n /// - The person who initiated the tx will remain private.\n /// - The notes and nullifiers and private logs that are emitted by all\n /// private function calls will (if designed well) not leak any user\n /// secrets, nor leak which functions have been executed.\n ///\n /// [1] Caveats: Some of these privacy guarantees depend on how app\n /// developers design their smart contracts. Some actions _can_ leak\n /// information, such as:\n /// - Calling an internal public function.\n /// - Calling a public function and not setting msg_sender to Option::none\n /// (feature not built yet - see github).\n /// - Calling any public function will always leak details about the nature\n /// of the transaction, so devs should be careful in their contract\n /// designs. If it can be done in a private function, then that will give\n /// the best privacy.\n /// - Not padding the side-effects of a tx to some standardised, uniform\n /// size. The kernel circuits can take hints to pad side-effects, so a\n /// wallet should be able to request for a particular amount of padding.\n /// Wallets should ideally agree on some standard.\n /// - Padding should include:\n /// - Padding the lengths of note & nullifier arrays\n /// - Padding private logs with random fields, up to some standardised\n /// size.\n /// See also: https://docs.aztec.network/developers/reference/considerations/privacy_considerations\n ///\n /// # Advanced\n /// * The call is added to the private call stack and executed by kernel\n /// circuits after this function completes\n /// * The called function can modify its own contract's private state\n /// * Side effects from the called function are included in this transaction\n /// * The call inherits the current transaction's context and gas limits\n ///\n pub fn call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n false,\n )\n }\n\n /// Makes a read-only call to a private function on another contract.\n ///\n /// This is similar to Solidity's `staticcall`. The called function\n /// cannot modify state or emit events. Any nested calls are constrained to\n /// also be staticcalls.\n ///\n /// See `call_private_function` for more general info on private function\n /// calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use\n /// `.get_preimage()` to extract the actual return values.\n ///\n pub fn static_call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args_array(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n /// Calls a private function that takes no arguments.\n ///\n /// This is a convenience function for calling private functions that don't\n /// require any input parameters. It's equivalent to `call_private_function`\n /// but slightly more efficient to use when no arguments are needed.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use\n /// `.get_preimage()` to extract the actual return values.\n ///\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n /// Makes a read-only call to a private function which takes no arguments.\n ///\n /// This combines the optimisation of `call_private_function_no_args` with\n /// the safety of `static_call_private_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use\n /// `.get_preimage()` to extract the actual return values.\n ///\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n /// Low-level private function call.\n ///\n /// This is the underlying implementation used by all other private function\n /// call methods. Instead of taking raw arguments, it accepts a\n /// hash of the arguments.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args_hash` - Pre-computed hash of the function arguments\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values\n ///\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is\n // the number of side effects that took place), along with the hash of the return values. We validate these\n // by requesting a private kernel iteration in which the return values are constrained to hash\n // to `returns_hash` and the side effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it\n // we need this in order to pay fees inside child call contexts\n // assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // );\n // if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter {\n // self.min_revertible_side_effect_counter = item.public_inputs.min_revertible_side_effect_counter;\n // }\n self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter` instead, for consistency\n ReturnsHash::new(returns_hash)\n }\n\n /// Enqueues a call to a public function to be executed later.\n ///\n /// Unlike private functions which execute immediately on the user's device,\n /// public function calls are \"enqueued\" and executed some time later by a\n /// block proposer.\n ///\n /// This means a public function cannot return any values back to a private\n /// function, because by the time the public function is being executed,\n /// the private function which called it has already completed execution.\n /// (In fact, the private function has been executed and proven, along with\n /// all other private function calls of the user's tx. A single proof of the\n /// tx has been submitted to the Aztec network, and some time later a\n /// proposer has picked the tx up from the mempool and begun executing all\n /// of the enqueued public functions).\n ///\n /// # Privacy warning\n /// Enqueueing a public function call is an inherently leaky action.\n /// Many interesting applications will require some interaction with public\n /// state, but smart contract developers should try to use public function\n /// calls sparingly, and carefully.\n /// _Internal_ public function calls are especially leaky, because they\n /// completely leak which private contract made the call.\n /// See also: https://docs.aztec.network/developers/reference/considerations/privacy_considerations\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n ///\n pub fn call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n /// Enqueues a read-only call to a public function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function\n /// cannot modify state or emit events. Any nested calls are constrained to\n /// also be staticcalls.\n ///\n /// See also `call_public_function` for more important information about\n /// making private -> public function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n ///\n pub fn static_call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n /// Enqueues a call to a public function that takes no arguments.\n ///\n /// This is an optimisation for calling public functions that don't\n /// take any input parameters. It's otherwise equivalent to\n /// `call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n /// Enqueues a read-only call to a public function with no arguments.\n ///\n /// This combines the optimisation of `call_public_function_no_args` with\n /// the safety of `static_call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true)\n }\n\n /// Low-level public function call.\n ///\n /// This is the underlying implementation used by all other public function\n /// call methods. Instead of taking raw arguments, it accepts a\n /// hash of the arguments.\n ///\n /// Advanced function: Most developers should use `call_public_function`\n /// or `static_call_public_function` instead. This function is exposed for\n /// performance optimization and advanced use cases.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n /// Enqueues a public function call, and designates it to be the teardown\n /// function for this tx. Only one teardown function call can be made by a\n /// tx.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers\n /// (aka Fee-payment contracts) will need to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown.\n /// The phases exist to enable a fee payer to take on the risk of paying\n /// a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether\n /// the app logic will succeed. The \"setup\" phase ensures the fee payer\n /// has sufficient balance to pay the proposer their fees.\n /// The teardown phase is primarily intended to: calculate exactly\n /// how much the user owes, based on gas consumption, and refund the user\n /// any change.\n ///\n /// Note: in some cases, the cost of refunding the user (i.e. DA costs of\n /// tx side-effects) might exceed the refund amount. For app logic with\n /// fairly stable and predictable gas consumption, a material refund amount\n /// is unlikely. For app logic with unpredictable gas consumption, a\n /// refund might be important to the user (e.g. if a heft function reverts\n /// very early). Wallet/FPC/Paymaster developers should be mindful of this.\n ///\n pub fn set_public_teardown_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false)\n }\n\n /// Low-level function to set the public teardown function.\n ///\n /// This is the underlying implementation for setting the teardown function\n /// call that will execute at the end of the transaction. Instead of taking\n /// raw arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use\n /// `set_public_teardown_function` instead.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown\n /// function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n self.public_teardown_call_request = PublicCallRequest {\n msg_sender: self.this_address(),\n contract_address,\n is_static_call,\n calldata_hash,\n };\n }\n\n /// Increments the side-effect counter.\n ///\n /// Very low-level function.\n ///\n /// # Advanced\n ///\n /// Every side-effect of a private function is given a \"side-effect counter\",\n /// based on when it is created. This PrivateContext is in charge of\n /// assigning the counters.\n ///\n /// The reason we have side-effect counters is complicated. Consider this\n /// illustrative pseudocode of inter-contract function calls:\n /// ```\n /// contract A {\n /// let x = 5; // pseudocode for storage var x.\n /// fn a1 {\n /// read x; // value: 5, counter: 1.\n /// x = x + 1;\n /// write x; // value: 6, counter: 2.\n ///\n /// B.b(); // start_counter: 2, end_counter: 4\n ///\n /// read x; // value: 36, counter: 5.\n /// x = x + 1;\n /// write x; // value: 37, counter: 6.\n /// }\n ///\n /// fn a2 {\n /// read x; // value: 6, counter: 3.\n /// x = x * x;\n /// write x; // value: 36, counter: 4.\n /// }\n /// }\n ///\n /// contract B {\n /// fn b() {\n /// A.a2();\n /// }\n /// }\n /// ```\n ///\n /// Suppose a1 is the first function called. The comments show the execution\n /// counter of each side-effect, and what the new value of `x` is.\n ///\n /// These (private) functions are processed by Aztec's kernel circuits in an\n /// order that is different from execution order:\n /// All of A.a1 is proven before B.b is proven, before A.a2 is proven.\n /// So when we're in the 2nd execution frame of A.a1 (after the call to\n /// B.b), the circuit needs to justify why x went from being `6` to `36`.\n /// But the circuit doesn't know why, and given the order of proving, the\n /// kernel hasn't _seen_ a value of 36 get written yet.\n /// The kernel needs to track big arrays of all side-effects of all\n /// private functions in a tx. Then, as it recurses and processes B.b(), it\n /// will eventually see a value of 36 get written.\n ///\n /// Suppose side-effect counters weren't exposed:\n /// The kernel would only see this ordering (in order of proof verification):\n /// [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n /// [ 5, 6, 36, 37, 6, 36 ]\n /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because\n /// it can't see what's going on within an app circuit. So the kernel\n /// wouldn't know that the ordering of reads and writes should actually be:\n /// [ A.a1.read, A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n /// [ 5, 6, 6, 36, 36, 37 ]\n ///\n /// And so, we introduced side-effect counters: every private function must\n /// assign side-effect counters alongside every side-effect that it emits,\n /// and also expose to the kernel the counters that it started and ended\n /// with.\n /// This gives the kernel enough information to arrange all side-effects in\n /// the correct order.\n /// It can then catch (for example) if a function tries to read state\n /// before it has been written (e.g. if A.a2() maliciously tried to read\n /// a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n ///\n /// If a malicious app contract _lies_ and does not count correctly:\n /// - It cannot lie about its start and end counters because the kernel\n /// will catch this.\n /// - It _could_ lie about its intermediate counters:\n /// - 1. It could not increment its side-effects correctly\n /// - 2. It could label its side-effects with counters outside of its\n /// start and end counters' range.\n /// The kernel will catch 2.\n /// The kernel will not catch 1., but this would only cause corruption\n /// to the private state of the malicious contract, and not any other\n /// contracts (because a contract can only modify its own state). If\n /// a \"good\" contract is given _read access_ to a maliciously-counting\n /// contract (via an external getter function, or by reading historic\n /// state from the archive tree directly), and they then make state\n /// changes to their _own_ state accordingly, that could be dangerous.\n /// Developers should be mindful not to trust the claimed innards of\n /// external contracts unless they have audited/vetted the contracts\n /// including vetting the side-effect counter incrementation.\n /// This is a similar paradigm to Ethereum smart contract development:\n /// you must vet external contracts that your contract relies upon, and\n /// you must not make any presumptions about their claimed behaviour.\n /// (Hopefully if a contract imports a version of aztec-nr, we will get\n /// contract verification tooling that can validate the authenticity\n /// of the imported aztec-nr package, and hence infer that the side-\n /// effect counting will be correct, without having to re-audit such logic\n /// for every contract).\n ///\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n include_by_timestamp: 0,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n historical_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n }\n }\n}\n"
2579
2705
  },
2580
2706
  "71": {
2581
2707
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
2582
- "source": "use crate::oracle::{\n execution::{get_block_number, get_chain_id, get_contract_address, get_timestamp, get_version},\n storage::storage_read,\n};\nuse dep::protocol_types::{address::AztecAddress, traits::Packable};\n\npub struct UtilityContext {\n block_number: u32,\n timestamp: u64,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n // We could call these oracles on the getters instead of at creation, which makes sense given that they might\n // not even be accessed. However any performance gains are minimal, and we'd rather fail early if a user\n // incorrectly attempts to create a UtilityContext in an environment in which these oracles are not\n // available.\n let block_number = get_block_number();\n let timestamp = get_timestamp();\n let contract_address = get_contract_address();\n let version = get_version();\n let chain_id = get_chain_id();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n let block_number = get_block_number();\n let timestamp = get_timestamp();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at_historical(contract_address: AztecAddress, block_number: u32) -> Self {\n let timestamp = get_timestamp();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub fn block_number(self) -> u32 {\n self.block_number\n }\n\n pub fn timestamp(self) -> u64 {\n self.timestamp\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.version\n }\n\n pub fn chain_id(self) -> Field {\n self.chain_id\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(\n self: Self,\n storage_slot: Field,\n ) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n pub unconstrained fn storage_read<T, let N: u32>(self, storage_slot: Field) -> T\n where\n T: Packable<N>,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
2708
+ "source": "use crate::oracle::{\n execution::{get_block_number, get_chain_id, get_contract_address, get_timestamp, get_version},\n storage::storage_read,\n};\nuse dep::protocol_types::{address::AztecAddress, traits::Packable};\n\npub struct UtilityContext {\n block_number: u32,\n timestamp: u64,\n contract_address: AztecAddress,\n version: Field,\n chain_id: Field,\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n // We could call these oracles on the getters instead of at creation, which makes sense given that they might\n // not even be accessed. However any performance gains are minimal, and we'd rather fail early if a user\n // incorrectly attempts to create a UtilityContext in an environment in which these oracles are not\n // available.\n let block_number = get_block_number();\n let timestamp = get_timestamp();\n let contract_address = get_contract_address();\n let version = get_version();\n let chain_id = get_chain_id();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n let block_number = get_block_number();\n let timestamp = get_timestamp();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub unconstrained fn at_historical(contract_address: AztecAddress, block_number: u32) -> Self {\n let timestamp = get_timestamp();\n let chain_id = get_chain_id();\n let version = get_version();\n Self { block_number, timestamp, contract_address, version, chain_id }\n }\n\n pub fn block_number(self) -> u32 {\n self.block_number\n }\n\n pub fn timestamp(self) -> u64 {\n self.timestamp\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.version\n }\n\n pub fn chain_id(self) -> Field {\n self.chain_id\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(\n self: Self,\n storage_slot: Field,\n ) -> [Field; N] {\n storage_read(self.this_address(), storage_slot, self.block_number())\n }\n\n pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
2583
2709
  },
2584
- "74": {
2710
+ "73": {
2585
2711
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_selector.nr",
2586
- "source": "use dep::protocol_types::{\n hash::poseidon2_hash_bytes,\n traits::{Deserialize, Empty, FromField, Serialize, ToField},\n};\n\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n // TODO(#2707): Consider making this a u64 as we already cast this to that when encoding the message. This would decrease\n // the likelihood of collisions without any extra cost.\n inner: u32,\n}\n\nimpl Eq for EventSelector {\n fn eq(self, other: EventSelector) -> bool {\n other.inner == self.inner\n }\n}\n\nimpl Serialize<1> for EventSelector {\n fn serialize(self: Self) -> [Field; 1] {\n [self.inner as Field]\n }\n}\n\nimpl Deserialize<1> for EventSelector {\n fn deserialize(fields: [Field; 1]) -> Self {\n Self { inner: fields[0] as u32 }\n }\n}\n\nimpl FromField for EventSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for EventSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for EventSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl EventSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = poseidon2_hash_bytes(bytes);\n\n // `hash` is automatically truncated to fit within 32 bits.\n EventSelector::from_field(hash)\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n"
2712
+ "source": "use dep::protocol_types::{\n hash::poseidon2_hash_bytes,\n traits::{Deserialize, Empty, FromField, Serialize, ToField},\n};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n inner: u32,\n}\n\nimpl FromField for EventSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for EventSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for EventSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl EventSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = poseidon2_hash_bytes(bytes);\n\n // `hash` is automatically truncated to fit within 32 bits.\n EventSelector::from_field(hash)\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n"
2587
2713
  },
2588
- "76": {
2714
+ "75": {
2589
2715
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/hash.nr",
2590
2716
  "source": "use dep::protocol_types::{\n address::{AztecAddress, EthAddress},\n constants::{\n GENERATOR_INDEX__FUNCTION_ARGS, GENERATOR_INDEX__MESSAGE_NULLIFIER,\n GENERATOR_INDEX__PUBLIC_BYTECODE, GENERATOR_INDEX__PUBLIC_CALLDATA,\n GENERATOR_INDEX__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n },\n hash::{\n poseidon2_hash_subarray, poseidon2_hash_with_separator, poseidon2_hash_with_separator_slice,\n sha256_to_field,\n },\n point::Point,\n traits::{Hash, ToField},\n};\n\npub use dep::protocol_types::hash::{compute_siloed_nullifier, pedersen_hash};\n\npub fn pedersen_commitment<let N: u32>(inputs: [Field; N], hash_index: u32) -> Point {\n std::hash::pedersen_commitment_with_separator(inputs, hash_index)\n}\n\npub fn compute_secret_hash(secret: Field) -> Field {\n poseidon2_hash_with_separator([secret], GENERATOR_INDEX__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n poseidon2_hash_with_separator([message_hash, secret], GENERATOR_INDEX__MESSAGE_NULLIFIER)\n}\n\npub struct ArgsHasher {\n pub fields: [Field],\n}\n\nimpl Hash for ArgsHasher {\n fn hash(self) -> Field {\n hash_args(self.fields)\n }\n}\n\nimpl ArgsHasher {\n pub fn new() -> Self {\n Self { fields: [] }\n }\n\n pub fn add(&mut self, field: Field) {\n self.fields = self.fields.push_back(field);\n }\n\n pub fn add_multiple<let N: u32>(&mut self, fields: [Field; N]) {\n for i in 0..N {\n self.fields = self.fields.push_back(fields[i]);\n }\n }\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args_array<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Same as `hash_args_array`, but takes a slice instead of an array.\npub fn hash_args(args: [Field]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(args, GENERATOR_INDEX__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n// Same as `hash_calldata_array`, but takes a slice instead of an array.\npub fn hash_calldata(calldata: [Field]) -> Field {\n if calldata.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator_slice(calldata, GENERATOR_INDEX__PUBLIC_CALLDATA)\n }\n}\n\n/**\n * Computes the public bytecode commitment for a contract class.\n * The commitment is `hash([separator, ...bytecode])` where bytecode omits the length prefix present\n * in `packed_bytecode`.\n *\n * @param packed_bytecode - The packed bytecode of the contract class. 0th word is the length in bytes.\n * packed_bytecode is mutable so that we can avoid copying the array to construct one starting with\n * separator instead of length.\n * @returns The public bytecode commitment.\n */\npub fn compute_public_bytecode_commitment(\n mut packed_public_bytecode: [Field; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS],\n) -> Field {\n // First field element contains the length of the bytecode\n let bytecode_length_in_bytes: u32 = packed_public_bytecode[0] as u32;\n let bytecode_length_in_fields: u32 =\n (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n // Don't allow empty public bytecode.\n // AVM doesn't handle execution of contracts that exist with empty bytecode.\n assert(bytecode_length_in_fields != 0);\n assert(bytecode_length_in_fields < MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS);\n\n // Packed_bytecode's 0th entry is the length. Replace it with separator before hashing.\n let separator = GENERATOR_INDEX__PUBLIC_BYTECODE.to_field();\n packed_public_bytecode[0] = separator;\n // +1 to length to account for the separator\n let nonzero_length = bytecode_length_in_fields + 1;\n\n poseidon2_hash_subarray(packed_public_bytecode, nonzero_length)\n // NOTE: we use poseidon2_hash_subarray here because we want to hash the bytecode only up to\n // its nonzero length. We do NOT want to include a `1` at the end to indicate \"variable length\",\n // and we want to enforce that all trailing elements are zero.\n}\n\n#[test]\nunconstrained fn compute_var_args_hash() {\n let mut input = ArgsHasher::new();\n for i in 0..100 {\n input.add(i as Field);\n }\n let hash = input.hash();\n dep::std::println(hash);\n assert(hash == 0x19b0d74feb06ebde19edd85a28986c97063e84b3b351a8b666c7cac963ce655f);\n}\n"
2591
2717
  },
2592
- "98": {
2718
+ "96": {
2593
2719
  "path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/aztec.nr",
2594
- "source": "use crate::{\n macros::{\n authwits::AUTHWIT_TYPES,\n dispatch::generate_public_dispatch,\n functions::{stub_registry, utils::check_each_fn_macroified},\n notes::{generate_note_export, NOTES},\n storage::STORAGE_LAYOUT_NAME,\n utils::{get_trait_impl_method, module_has_storage},\n },\n messages::discovery::private_notes::MAX_NOTE_PACKED_LEN,\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_private_state` utility function.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n let interface = generate_contract_interface(m);\n\n // Functions that don't have #[private], #[public], #[utility], #[contract_library_method], or #[test] are not\n // allowed in contracts.\n check_each_fn_macroified(m);\n\n let contract_library_method_compute_note_hash_and_nullifier =\n generate_contract_library_method_compute_note_hash_and_nullifier();\n let note_exports = generate_note_exports();\n let public_dispatch = generate_public_dispatch(m);\n let sync_private_state = generate_sync_private_state();\n let process_message = generate_process_message();\n generate_authwit_exports();\n\n quote {\n $note_exports\n $interface\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_private_state\n $process_message\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let module_name = m.name();\n let contract_stubs = stub_registry::get(m);\n let fn_stubs_quote = if contract_stubs.is_some() {\n contract_stubs.unwrap().join(quote {})\n } else {\n quote {}\n };\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: dep::aztec::protocol_types::address::AztecAddress\n }\n\n impl $module_name {\n $fn_stubs_quote\n\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n let notes = NOTES.entries();\n\n if notes.len() > 0 {\n let max_note_packed_len = notes.fold(\n 0,\n |acc, (_, (_, len, _, _)): (Type, (TypeDefinition, u32, Field, [(Quoted, u32, bool)]))| {\n if len > acc {\n len\n } else {\n acc\n }\n },\n );\n\n if max_note_packed_len > MAX_NOTE_PACKED_LEN {\n panic(\n f\"One of the notes has packed len {max_note_packed_len} but the maximum is {MAX_NOTE_PACKED_LEN}\",\n );\n }\n\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = &[];\n for i in 0..notes.len() {\n let (typ, (_, packed_note_length, _, _)) = notes[i];\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol_types::traits::Packable<_> },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret it's raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = $packed_note_length;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, storage_slot);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior\n // transactions and are therefore already part of the note hash tree. We therefore compute the\n // nullification note hash by treating the note as a settled note with the provided note nonce.\n let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n aztec::note::retrieved_note::RetrievedNote{ \n note, \n contract_address, \n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n }, \n storage_slot,\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, note_hash_for_nullify);\n\n Option::some(\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n /// tree with `note_nonce`.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type,\n /// and so it can be used to call functions from that module such as `discover_new_messages`, \n /// `do_process_log` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol_types::address::AztecAddress,\n note_nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will\n /// unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol_types::address::AztecAddress,\n _nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_authwit_exports() {\n let authwits = AUTHWIT_TYPES.values();\n authwits.for_each(|(s): TypeDefinition| { s.add_attribute(\"abi(authwits)\"); });\n}\n\ncomptime fn generate_note_exports() -> Quoted {\n let notes = NOTES.values();\n // Second value in each tuple is `note_packed_len` and that is ignored here because it's only used when\n // generating partial note helper functions.\n notes\n .map(|(s, _, note_type_id, fields): (TypeDefinition, u32, Field, [(Quoted, u32, bool)])| {\n generate_note_export(s, note_type_id, fields)\n })\n .join(quote {})\n}\n\ncomptime fn generate_sync_private_state() -> Quoted {\n // We obtain the `utility` function on the next line instead of directly doing\n // `#[aztec::macros::functions::utility]` in the returned quote because the latter would result in the function\n // attribute having the full path in the ABI. This is undesirable because we use the information in the ABI only\n // to determine whether a function is `private`, `public`, or `utility`.\n let utility = crate::macros::functions::utility;\n\n // All we need to do here is trigger message discovery, but this is already done by the #[utility] macro - we don't\n // need to do anything extra.\n quote {\n #[$utility]\n unconstrained fn sync_private_state() {\n }\n }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n // We obtain the `utility` function on the next line instead of directly doing\n // `#[aztec::macros::functions::utility]` in the returned quote because the latter would result in the function\n // attribute having the full path in the ABI. This is undesirable because we use the information in the ABI only\n // to determine whether a function is `private`, `public`, or `utility`.\n let utility = crate::macros::functions::utility;\n\n // TODO(#15012): Here we use PRIVATE_LOG_CIPHERTEXT_LEN for message ciphertext length. Fix message vs log naming.\n quote {\n #[$utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::protocol_types::constants::PRIVATE_LOG_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::message_context::MessageContext,\n ) {\n aztec::messages::discovery::process_message::do_process_message(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n message_ciphertext,\n message_context,\n );\n }\n }\n}\n"
2720
+ "source": "use crate::macros::{\n dispatch::generate_public_dispatch,\n functions::{stub_registry, utils::check_each_fn_macroified},\n notes::NOTES,\n storage::STORAGE_LAYOUT_NAME,\n utils::{get_trait_impl_method, module_has_storage},\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_private_state` utility function.\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n let interface = generate_contract_interface(m);\n\n // Functions that don't have #[private], #[public], #[utility], #[contract_library_method], or #[test] are not\n // allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate `_compute_note_hash_and_nullifier`, `sync_private_state` and `process_message`\n // functions only if they are not already implemented. If they are implemented we just insert empty\n // quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_method_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let sync_private_state = if !m.functions().any(|f| f.name() == quote { sync_private_state }) {\n generate_sync_private_state()\n } else {\n quote {}\n };\n let process_message = if !m.functions().any(|f| f.name() == quote { process_message }) {\n generate_process_message()\n } else {\n quote {}\n };\n let public_dispatch = generate_public_dispatch(m);\n\n quote {\n $interface\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_private_state\n $process_message\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let module_name = m.name();\n let contract_stubs = stub_registry::get(m);\n let fn_stubs_quote = if contract_stubs.is_some() {\n contract_stubs.unwrap().join(quote {})\n } else {\n quote {}\n };\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: dep::aztec::protocol_types::address::AztecAddress\n }\n\n impl $module_name {\n $fn_stubs_quote\n\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol_types::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol_types::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note\n/// discovery (to create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n if NOTES.len() > 0 {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = &[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol_types::traits::Packable },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol_types::traits::Packable>::N;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, storage_slot);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior\n // transactions and are therefore already part of the note hash tree. We therefore compute the\n // nullification note hash by treating the note as a settled note with the provided note nonce.\n let note_hash_for_nullify = aztec::note::utils::compute_note_hash_for_nullify(\n aztec::note::retrieved_note::RetrievedNote{ \n note, \n contract_address, \n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n }, \n storage_slot,\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, note_hash_for_nullify);\n\n Option::some(\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash\n /// (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash\n /// tree with `note_nonce`.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type,\n /// and so it can be used to call functions from that module such as `discover_new_messages`, \n /// `do_process_log` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol_types::address::AztecAddress,\n note_nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will\n /// unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::messages::discovery::private_notes::MAX_NOTE_PACKED_LEN>,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol_types::address::AztecAddress,\n _nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_sync_private_state() -> Quoted {\n // We obtain the `utility` function on the next line instead of directly doing\n // `#[aztec::macros::functions::utility]` in the returned quote because the latter would result in the function\n // attribute having the full path in the ABI. This is undesirable because we use the information in the ABI only\n // to determine whether a function is `private`, `public`, or `utility`.\n let utility = crate::macros::functions::utility;\n\n // All we need to do here is trigger message discovery, but this is already done by the #[utility] macro - we don't\n // need to do anything extra.\n quote {\n #[$utility]\n unconstrained fn sync_private_state() {\n }\n }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n // We obtain the `utility` function on the next line instead of directly doing\n // `#[aztec::macros::functions::utility]` in the returned quote because the latter would result in the function\n // attribute having the full path in the ABI. This is undesirable because we use the information in the ABI only\n // to determine whether a function is `private`, `public`, or `utility`.\n let utility = crate::macros::functions::utility;\n\n // TODO(#15012): Here we use PRIVATE_LOG_CIPHERTEXT_LEN for message ciphertext length. Fix message vs log naming.\n quote {\n #[$utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::protocol_types::constants::PRIVATE_LOG_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::message_context::MessageContext,\n ) {\n aztec::messages::discovery::process_message::do_process_message(\n context.this_address(),\n _compute_note_hash_and_nullifier,\n message_ciphertext,\n message_context,\n );\n }\n }\n}\n"
2595
2721
  }
2596
2722
  }
2597
2723
  }