{"matchId":"39882593","creationMatch":"exact_match","runtimeMatch":"exact_match","verifiedAt":"2026-07-07T19:00:48Z","creationBytecode":{"onchainBytecode":"0x60a03461012357601f613e5638819003918201601f19168301916001600160401b0383118484101761012757808492602094604052833981010312610123575160ff81168103610123577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16610114576002600160401b03196001600160401b038216016100ab575b50608052604051613d1a908161013c823960805181611ad90152f35b6001600160401b0319166001600160401b039081177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f61008f565b63f92ee8a960e01b5f5260045ffd5b5f80fd5b634e487b7160e01b5f52604160045260245ffdfe6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a00330000000000000000000000000000000000000000000000000000000000000006","recompiledBytecode":"0x60a03461012357601f613e5638819003918201601f19168301916001600160401b0383118484101761012757808492602094604052833981010312610123575160ff81168103610123577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16610114576002600160401b03196001600160401b038216016100ab575b50608052604051613d1a908161013c823960805181611ad90152f35b6001600160401b0319166001600160401b039081177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f61008f565b63f92ee8a960e01b5f5260045ffd5b5f80fd5b634e487b7160e01b5f52604160045260245ffdfe6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","sourceMap":"1413:3876:0:-:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3147:66:26;1413:3876:0;;;;;;7894:76:26;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;7983:34:26;7979:146;;-1:-1:-1;2002:20:0;;;1413:3876;;;;;;;;2002:20;1413:3876;;;;;;7979:146:26;-1:-1:-1;;;;;;1413:3876:0;-1:-1:-1;;;;;1413:3876:0;;;3147:66:26;1413:3876:0;;;;;;8085:29:26;;1413:3876:0;;8085:29:26;7979:146;;;7894:76;7936:23;;;-1:-1:-1;7936:23:26;;-1:-1:-1;7936:23:26;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","offset":15905}},"transformations":[{"type":"insert","offset":15958,"reason":"constructorArguments"}],"transformationValues":{"constructorArguments":"0x0000000000000000000000000000000000000000000000000000000000000006"}},"runtimeBytecode":{"onchainBytecode":"0x6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000006168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","recompiledBytecode":"0x6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","sourceMap":"1413:3876:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;2998:168:8;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;882:26:12;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;883:29:9;1413:3876:0;;;;;;;;4396:63:8;1413:3876:0;;;:::i;:::-;4396:63:8;;:::i;:::-;1413:3876:0;;;;;;;:::i;:::-;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;762:24:12;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;-1:-1:-1;;;;;4789:20:16;1413:3876:0;;:::i;:::-;4789:20:16;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;4789:20:16;:29;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;:::i;:::-;;;;;;;;-1:-1:-1;;1413:3876:0;;;;5765:26:13;1413:3876:0;;;;:::i;:::-;5735:18:13;3223:4;5735:18;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;5735:18;3223:4;:::i;:::-;5765:26;:::i;:::-;1413:3876:0;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1689:24;1413:3876;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;:::i;:::-;;;;;;;;;;;;;;;;2301:15:17;;:26;2297:97;;9031:8:37;8977:25;-1:-1:-1;;;;;1413:3876:0;;;;;;;;993:64:19;1413:3876:0;;;;;;;;;;;;;;;;2435:78:17;1413:3876:0;2435:78:17;;1413:3876:0;1294:95:17;1413:3876:0;;1294:95:17;1413:3876:0;1294:95:17;;1413:3876:0;;;;;1294:95:17;;1413:3876:0;1294:95:17;1413:3876:0;1294:95:17;;1413:3876:0;;1294:95:17;;1413:3876:0;;1294:95:17;;1413:3876:0;;2435:78:17;;;1413:3876:0;2435:78:17;;:::i;:::-;1413:3876:0;2425:89:17;;3785:23:20;;:::i;:::-;4037:249:38;1413:3876:0;4037:249:38;;-1:-1:-1;;;4037:249:38;;;;;;;;;;1413:3876:0;;;4037:249:38;1413:3876:0;;4037:249:38;;8977:25:37;:::i;:::-;9031:8;;;;;:::i;:::-;1413:3876:0;2638:15:17;;;2634:88;;10039:4:16;;;;;:::i;2634:88:17:-;2676:35;;;;;1413:3876:0;2676:35:17;1413:3876:0;;;;;;2676:35:17;2297:97;2350:33;;;;1413:3876:0;2350:33:17;1413:3876:0;;;;2350:33:17;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;2081:81:7;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;2081:81:7;1413:3876:0;;987:10:18;4214:28:7;;4210:101;;4505:37;1413:3876:0;-1:-1:-1;;;;;4411:22:7;1413:3876:0;;4711:32:14;;;:::i;:::-;4753:74;;1413:3876:0;4259:31:14;;;;:::i;:::-;4300:71;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;4505:37:7;2081:81;1413:3876:0;;-1:-1:-1;;;;;;1413:3876:0;;;;4300:71:14;1413:3876:0;;;1469:81:14;1413:3876:0;;15182:50:43;1413:3876:0;;15182:50:43;:::i;:::-;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;4753:74:14;1413:3876:0;;;1469:81:14;1413:3876:0;;15503:53:43;;1413:3876:0;15503:53:43;:::i;:::-;;4753:74:14;;;4210:101:7;4265:35;;;1413:3876:0;4265:35:7;1413:3876:0;;;;4265:35:7;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;1274:65:11;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;4088:10:0;2684:20:8;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;4563:5:16;1413:3876:0;;;4088:10;;4563:5:16;:::i;:::-;1413:3876:0;;;;;;;2679:72:8;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;:::i;:::-;;;2713:38:8;2679:72;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;4088:10:0;1413:3876;;;;;;;:::i;1892:33:11:-;1917:8;;;1413:3876:0;1917:8:11;1413:3876:0;;1917:8:11;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;;;:::i;:::-;2683:21;2679:72;;-1:-1:-1;;;;;1413:3876:0;9251:21:16;;9247:89;;1413:3876:0;;;2049:63:16;1413:3876:0;;;;;;7531:19:16;;;7527:115;;1413:3876:0;;;;8280:25:16;1413:3876:0;;;;2049:63:16;1413:3876:0;;;;;;;;8003:14:16;1413:3876:0;;8003:14:16;1413:3876:0;;;;;;8280:25:16;1413:3876:0;;;;;;;7527:115:16;7577:50;;;;1413:3876:0;7577:50:16;1413:3876:0;;;;;;;;7577:50:16;9247:89;9295:30;;;1413:3876:0;9295:30:16;1413:3876:0;;;;;9295:30:16;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1799:24;1413:3876;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;3223:4:13;;:::i;:::-;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;5096:15:8;;5092:49;;1413:3876:0;;;;5180:27:8;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;:::i;:::-;5180:27:8;1413:3876:0;;;;;;;;;;;;;5092:49:8;-1:-1:-1;;;1413:3876:0;5120:21:8;1413:3876:0;;;;;;;5120:21:8;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;3104:9:16;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;:::i;:::-;3104:9:16;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;5595:18:8;;;;;;1413:3876:0;5615:3:8;5669:10;;;;;:::i;:::-;1413:3876:0;5730:15:8;;;;;;:::i;:::-;;;;15182:50:43;-1:-1:-1;;;;;5803:10:8;;;:::i;:::-;1413:3876:0;15182:50:43;:::i;:::-;5937:15:8;5933:81;;6050:10;6033:45;1413:3876:0;-1:-1:-1;;;;;6062:15:8;6050:10;1413:3876:0;6050:10:8;;;:::i;:::-;6062:15;;:::i;:::-;1413:3876:0;;;;;;;;;6033:45:8;;1413:3876:0;5580:13:8;;5933:81;5998:15;5986:10;-1:-1:-1;;;;;5986:10:8;;:::i;:::-;5998:15;;:::i;:::-;6842:53;;;;1413:3876:0;5961:53:8;1413:3876:0;;;;;;;;;5961:53:8;5726:194;15503:53:43;-1:-1:-1;;;;;5894:10:8;;;:::i;:::-;1413:3876:0;15503:53:43;:::i;:::-;5726:194:8;;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1026:29:9;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;;;3899:31:13;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;-1:-1:-1;;;;;5894:18:43;1413:3876:0;;;;;5894:18:43;;:::i;:::-;1413:3876:0;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;6476:18:8;;;;;;1413:3876:0;6496:3:8;6550:10;;;;;:::i;:::-;1413:3876:0;6611:15:8;;;;;;:::i;:::-;;;;15182:50:43;-1:-1:-1;;;;;6684:10:8;;;:::i;:::-;1413:3876:0;15182:50:43;:::i;:::-;6818:15:8;6814:81;;6931:10;6914:45;1413:3876:0;-1:-1:-1;;;;;6943:15:8;6931:10;1413:3876:0;6931:10:8;;;:::i;6943:15::-;1413:3876:0;;;;;;;;;6914:45:8;;1413:3876:0;6461:13:8;;6607:194;15503:53:43;-1:-1:-1;;;;;6775:10:8;;;:::i;:::-;1413:3876:0;15503:53:43;:::i;:::-;6607:194:8;;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;883:29:9;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;3275:52:7;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;:::i;:::-;5294:13:20;1413:3876:0;;;;5329:4:20;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1274:65:11;1413:3876:0;3224:4:11;1413:3876:0;;;;;2828:19:11;2824:61;;3224:4;1413:3876:0;;;;;1274:65:11;1413:3876:0;2928:17:11;1413:3876:0;;;3224:4:11;1413:3876:0;;2928:17:11;1413:3876:0;2824:61:11;2856:29;;;1413:3876:0;2856:29:11;3224:4;1413:3876:0;;;;2856:29:11;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;762:24:12;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;;;;993:64:19;1413:3876:0;;;;;;;;;;;;;;;;;;4647:63:8;1413:3876:0;;;:::i;:::-;4647:63:8;;:::i;1413:3876:0:-;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;;;;2049:63:16;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;3223:4:13;;:::i;:::-;1413:3876:0;;-1:-1:-1;;;;;;2081:81:7;1413:3876:0;;;2081:81:7;1413:3876:0;3906:38:7;1413:3876:0;3906:38:7;;1413:3876:0;;;;;;;;:::i;:::-;3223:4:13;;;:::i;:::-;5170:20:0;;;:::i;:::-;5166:68;;5272:7;;;:::i;5166:68::-;-1:-1:-1;;;;;5199:35:0;;;;1413:3876;5199:35;1413:3876;;;;;5199:35;1413:3876;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1026:29:9;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;;;;;4466:23:13;4462:108;;-1:-1:-1;;;;;1413:3876:0;8725:21:16;;;8721:91;;8280:25;1413:3876:0;;7420:23:16;1413:3876:0;;7420:14:16;1413:3876:0;7420:23:16;:::i;:::-;:14;1413:3876:0;;;;2049:63:16;1413:3876:0;;;;;;;;;;;;;;;;8280:25:16;1413:3876:0;;;;;;;8721:91:16;8769:32;;;1413:3876:0;8769:32:16;1413:3876:0;;;;;8769:32:16;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1689:24;1413:3876;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1274:65:11;1413:3876:0;;;;;2824:61:11;;1413:3876:0;;;1274:65:11;1413:3876:0;2928:17:11;1413:3876:0;;;;;;2928:17:11;1413:3876:0;2824:61:11;2856:29;;;1413:3876:0;2856:29:11;1413:3876:0;;;;;2856:29:11;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;882:26:12;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;3218:168:8;;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;-1:-1:-1;;;;;1413:3876:0;;6439:34:13;6435:102;;6547:37;1413:3876:0;;;6547:37:13;:::i;6435:102::-;6496:30;;;1413:3876:0;6496:30:13;1413:3876:0;;6496:30:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;3785:23:20;;:::i;:::-;1413:3876:0;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;3801:8;1413:3876;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;3223:4:13;5318:18;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;3223:4;4877:26:7;;4873:104;;4993:31;;;:::i;4873:104::-;4926:40;;;1413:3876:0;4926:40:7;1413:3876:0;;4926:40:7;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1799:24;1413:3876;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;1413:3876:0;;;;;;;:::i;:::-;;;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;4507:10:0;2684:20:8;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;4789:20:16;;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;4789:20:16;-1:-1:-1;;;;;4507:10:0;1413:3876;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;11834:36:16;;11830:309;;1413:3876:0;6120:5:16;;;;:::i;11830:309::-;11890:24;;;11886:130;;-1:-1:-1;;;;;1413:3876:0;;11065:19:16;11061:89;;4507:10:0;11163:21:16;11159:90;;6120:5;11258:20;;;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;11258:20:16;-1:-1:-1;;;;;4507:10:0;1413:3876;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;11830:309:16;;11159:90;11207:31;;;1413:3876:0;11207:31:16;1413:3876:0;;;;;11207:31:16;11061:89;11107:32;;;1413:3876:0;11107:32:16;1413:3876:0;;;;;11107:32:16;11886:130;11941:60;;;;;1413:3876:0;11941:60:16;4507:10:0;1413:3876;;;;;;;;11941:60:16;2679:72:8;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;:::i;:::-;;;;;;-1:-1:-1;;1413:3876:0;;;;;3999:14:16;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;10039:4:16;1413:3876:0;;:::i;:::-;;;987:10:18;;10039:4:16;:::i;1413:3876:0:-;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;:::i;:::-;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;3147:66:26;1413:3876:0;;;;;;4301:16:26;1413:3876:0;;;;4724:16:26;;:34;;;;1413:3876:0;4803:1:26;4788:16;:50;;;;1413:3876:0;4853:13:26;:30;;;;1413:3876:0;4849:91:26;;;-1:-1:-1;;1413:3876:0;;4803:1:26;1413:3876:0;3147:66:26;1413:3876:0;;;;4977:67:26;;1413:3876:0;;;;;;;:::i;:::-;;;;;:::i;:::-;6891:76:26;;;:::i;:::-;;;:::i;:::-;1413:3876:0;;;;;;;;;;;2599:7:16;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;2624:9:16;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;2624:9:16;1413:3876:0;;;;;:::i;:::-;6891:76:26;;;:::i;:::-;1413:3876:0;;;;;;;;;:::i;:::-;4803:1:26;1413:3876:0;;-1:-1:-1;;;1413:3876:0;;;;6891:76:26;;:::i;:::-;1413:3876:0;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;6891:76:26;;:::i;:::-;;;:::i;:::-;2714:34:7;;2710:103;;2901:45;;4259:31:14;2901:45:7;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;2901:45:7;4259:31:14;:::i;:::-;4300:71;;1413:3876:0;6891:76:26;;;:::i;:::-;;;:::i;:::-;4803:1;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;2471:27:8;1413:3876:0;;;4803:1:26;1413:3876:0;;2471:27:8;5064:101:26;;1413:3876:0;5064:101:26;1413:3876:0;5140:14:26;1413:3876:0;;;3147:66:26;1413:3876:0;;3147:66:26;1413:3876:0;;4803:1:26;1413:3876:0;;5140:14:26;1413:3876:0;4300:71:14;15182:50:43;1413:3876:0;;;;1469:81:14;1413:3876:0;;;;;15182:50:43;:::i;:::-;;4300:71:14;;;2710:103:7;2771:31;;;1413:3876:0;2771:31:7;1413:3876:0;;;;;2771:31:7;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;2599:7:16;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;4977:67:26;-1:-1:-1;;1413:3876:0;;;3147:66:26;1413:3876:0;4977:67:26;;;4849:91;4906:23;;;1413:3876:0;4906:23:26;1413:3876:0;;4906:23:26;4853:30;4870:13;;;4853:30;;;4788:50;4816:4;4808:25;:30;;-1:-1:-1;4788:50:26;;4724:34;;;-1:-1:-1;4724:34:26;;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;2845:7:16;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;2845:7:16;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;1869:57:14;;;:97;;;;1413:3876:0;;;;;;;1869:97:14;-1:-1:-1;;;3549:47:13;;;-1:-1:-1;3549:87:13;;;;1869:97:14;;;;;3549:87:13;-1:-1:-1;;;1119:40:21;;-1:-1:-1;3549:87:13;;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;:::o;:::-;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;;1413:3876:0;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;:::o;:::-;;;;;;;;;:::o;3438:389:8:-;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;3596:33:8;;3592:50;;1413:3876:0;3656:38:8;3652:72;;3800:20;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;3218:168:8;;3800:20;3438:389;:::o;3652:72::-;3704:20;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;2998:168:8;;3704:20;3703:21;3696:28;:::o;3592:50::-;3631:11;;1413:3876:0;3631:11:8;:::o;1413:3876:0:-;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;:::o;:::-;;;;;;;;;;;:::o;4146:103:13:-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;4146:103::o;4462:108::-;4512:47;;;1413:3876:0;4512:47:13;987:10:18;4512:47:13;1413:3876:0;;;;;;4512:47:13;4146:103;1413:3876:0;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;987:10:18;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;4466:23:13;4462:108;;4146:103;:::o;4462:108::-;4512:47;;;-1:-1:-1;4512:47:13;987:10:18;4512:47:13;1413:3876:0;;;;-1:-1:-1;4512:47:13;5170:262:7;5277:26;;5273:104;;4711:32:14;;;;:::i;:::-;4753:74;;;;4836:14;;5170:262:7;:::o;4753:74:14:-;15503:53:43;1413:3876:0;2383:4:13;1413:3876:0;1469:81:14;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;2383:4:13;1413:3876:0;;;15503:53:43;;:::i;:::-;;5170:262:7;:::o;6527:300:16:-;-1:-1:-1;;;;;1413:3876:0;6610:18:16;;;6606:86;;-1:-1:-1;;;;;1413:3876:0;6705:16:16;;;6701:86;;1413:3876:0;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;6626:1:16;1413:3876:0;;7531:19:16;;;7527:115;;1413:3876:0;8280:25:16;1413:3876:0;;;;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;;6626:1:16;1413:3876:0;;;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;6626:1:16;1413:3876:0;;;;;;;;;;;;8280:25:16;6527:300::o;7527:115::-;7577:50;;;;6626:1;7577:50;;1413:3876:0;;;;;;6626:1:16;7577:50;1413:3876:0;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;;;;:::i;:::-;;;;;;;;:::o;:::-;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;:::o;824:609:10:-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;1049:16:10;;;;;1045:70;;1251:13;1139:16;;;;;;:::i;:::-;1169:11;;;;1165:53;;824:609;1251:13;;:::i;:::-;1286:27;;;:::i;:::-;1329:13;-1:-1:-1;1344:16:10;;;;;;824:609;;;:::o;1362:3::-;-1:-1:-1;;;;;5894:18:43;1404:11:10;;;;:::i;:::-;-1:-1:-1;;;;;;;;;;;5894:18:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;1329:13:10;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;1165:53:10;1196:11;;1165:53;;;1045:70;1413:3876:0;;;;;;;;;;:::i;:::-;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;1081:23:10;:::o;824:609::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;1049:16:10;;;;;1045:70;;1251:13;1139:16;;;;;;:::i;1251:13::-;1286:27;;;:::i;:::-;1329:13;-1:-1:-1;1344:16:10;;;;;;824:609;;;:::o;1362:3::-;-1:-1:-1;;;;;5894:18:43;1404:11:10;;;;:::i;:::-;-1:-1:-1;;;;;;;;;;;5894:18:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;1329:13:10;;1413:3876:0;;;;;;;;;;;;:::o;:::-;;;;;;;;;;:::o;:::-;;-1:-1:-1;;;;;1413:3876:0;;;;;;;:::o;4053:348:14:-;4259:31;;;;:::i;:::-;4300:71;;;;4380:14;;4053:348;:::o;4300:71::-;15182:50:43;1413:3876:0;-1:-1:-1;1413:3876:0;1469:81:14;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;;;15182:50:43;;:::i;7082:141:26:-;1413:3876:0;3147:66:26;1413:3876:0;;;;7148:18:26;7144:73;;7082:141::o;7144:73::-;7189:17;;;-1:-1:-1;7189:17:26;;-1:-1:-1;7189:17:26;10900:487:16;;-1:-1:-1;;;;;1413:3876:0;;11065:19:16;;;11061:89;;-1:-1:-1;;;;;1413:3876:0;11163:21:16;;;11159:90;;11339:31;11258:20;;1413:3876:0;11258:20:16;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;11258:20:16;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;;;11339:31:16;10900:487::o;3821:191:20:-;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;6463:31:20;;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;6801:34:20;;1413:3876:0;;3912:92:20;1413:3876:0;3912:92:20;;1413:3876:0;1977:95:20;1413:3876:0;;;1977:95:20;;1413:3876:0;1977:95:20;;;1413:3876:0;3975:13:20;1977:95;;;1413:3876:0;3998:4:20;1977:95;;;1413:3876:0;1977:95:20;3912:92;;;;;;:::i;:::-;1413:3876:0;3902:103:20;;3821:191;:::o;1413:3876:0:-;-1:-1:-1;;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;-1:-1:-1;1413:3876:0;:::o;7892:388:13:-;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;987:10:18;;1413:3876:0;8155:40:13;1413:3876:0;;8155:40:13;1413:3876:0;8209:11:13;:::o;8055:219::-;8251:12;1413:3876:0;8251:12:13;:::o;7892:388::-;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;8055:219:13;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;;;;;987:10:18;1413:3876:0;;8155:40:13;;1413:3876:0;8155:40:13;;1413:3876:0;8209:11:13;:::o;8055:219::-;8251:12;;1413:3876:0;8251:12:13;:::o;7268:387::-;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;7507:4:13;1413:3876:0;;;987:10:18;;1413:3876:0;7530:40:13;1413:3876:0;;7530:40:13;7507:4;7584:11;:::o;7268:387::-;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;7434:23:13;7430:219;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;7507:4:13;1413:3876:0;;;;;;;;-1:-1:-1;;;;;987:10:18;1413:3876:0;;7530:40:13;;1413:3876:0;7530:40:13;;7507:4;7584:11;:::o;7129:1551:37:-;;;8209:66;8196:79;;8192:164;;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;8467:24:37;;;;;;;;;-1:-1:-1;8467:24:37;-1:-1:-1;;;;;1413:3876:0;;8505:20:37;8501:113;;8624:49;-1:-1:-1;8624:49:37;-1:-1:-1;7129:1551:37;:::o;8501:113::-;8541:62;-1:-1:-1;8541:62:37;8467:24;8541:62;-1:-1:-1;8541:62:37;:::o;8467:24::-;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;8192:164:37;8291:54;;;8307:1;8291:54;8311:30;8291:54;;:::o;11617:532::-;1413:3876:0;;;;;;11703:29:37;;;11748:7;;:::o;11699:444::-;1413:3876:0;11799:38:37;;1413:3876:0;;11860:23:37;;;11712:20;11860:23;1413:3876:0;11712:20:37;11860:23;11795:348;11913:35;11904:44;;11913:35;;11971:46;;;;11712:20;11971:46;1413:3876:0;;;11712:20:37;11971:46;11900:243;12047:30;12038:39;12034:109;;11900:243;11617:532::o;12034:109::-;12100:32;;;11712:20;12100:32;1413:3876:0;;;11712:20:37;12100:32;3112:1368:43;1413:3876:0;;;;3307:14:43;1413:3876:0;;;;;;3343:13:43;;;;-1:-1:-1;;1413:3876:0;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;3307:14:43;1413:3876:0;;;;;;;3307:14:43;4409:11;:::o;1413:3876:0:-;;;;;;;;;;;;3814:378:43;1413:3876:0;3881:22:43;4002:23;3881:22;-1:-1:-1;;;;;;;;;;;3881:22:43;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;-1:-1:-1;;;;;;;;;;;4002:23:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;3307:14:43;1413:3876:0;;;;;;3814:378:43;;;;;3112:1368;1413:3876:0;;;;3307:14:43;1413:3876:0;;;;;;3343:13:43;;;;-1:-1:-1;;1413:3876:0;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;3307:14:43;1413:3876:0;;;;;;;3307:14:43;4409:11;:::o;3814:378::-;1413:3876:0;3881:22:43;4002:23;3881:22;-1:-1:-1;;;;;;;;;;;3881:22:43;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;-1:-1:-1;;;;;;;;;;;4002:23:43;:::i;1413:3876:0:-;;;;;3307:14:43;1413:3876:0;;;;;;3814:378:43;;;;;3112:1368;;3307:14;;;1413:3876:0;;;;;;;;;;;3343:13:43;;;3339:1135;3343:13;;;-1:-1:-1;;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;3307:14:43;4409:11;:::o;3814:378::-;1413:3876:0;3881:22:43;4002:23;3881:22;;;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;;;:::i;1413:3876:0:-;;;;;;;;;;;;3814:378:43;;;;;3339:1135;4451:12;;;;1413:3876:0;4451:12:43;:::o;2538:406::-;1413:3876:0;;;5238:14:43;1413:3876:0;;;;;;5238:26:43;2617:321;2621:22;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;5238:14:43;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;5238:14:43;1413:3876:0;;;;;;5238:14:43;2873:11;:::o;2538:406::-;1413:3876:0;;;5238:14:43;1413:3876:0;;;;;;5238:26:43;2617:321;2621:22;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;5238:14:43;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;5238:14:43;1413:3876:0;;;;;;5238:14:43;2873:11;:::o;2538:406::-;-1:-1:-1;1413:3876:0;;;5238:14:43;;;1413:3876:0;;;;;;2622:21:43;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;2817:14:43;1413:3876:0;;;;;;;2873:11:43;:::o","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","offset":15589}},"immutableReferences":{"31":[{"start":6873,"length":32}]},"transformations":[{"id":"31","type":"replace","offset":6873,"reason":"immutable"}],"transformationValues":{"immutables":{"31":"0x0000000000000000000000000000000000000000000000000000000000000006"}}},"deployment":{"transactionHash":"0xe8c2908487382533ea1939e80372ab4b9c6f33662993fd3cb06f2d3eaa6731a4","blockNumber":"86249097","transactionIndex":"9","deployer":"0x59Ebb7143dDDd7b045dE7B0bd0F99446143F1624"},"sources":{"contracts/evm/SaturnOFT.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.26;\n\nimport {IFundRecovery} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol\";\nimport {\n    AllowlistRBACUpgradeable\n} from \"@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol\";\nimport {\n    PauseRBACUpgradeable\n} from \"@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol\";\nimport {ERC20Upgradeable} from \"@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol\";\nimport {\n    ERC20PermitUpgradeable\n} from \"@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {IERC20Plus} from \"./interfaces/IERC20Plus.sol\";\n\n/**\n * @title SaturnOFT\n * @author LayerZero Labs (@TRileySchwarz, tinom.eth)\n * @custom:version 1.0.0\n * @notice Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.\n *         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.\n * @dev Roles are handled through `AccessControl2StepUpgradeable`.\n */\ncontract SaturnOFT is IERC20Plus, ERC20PermitUpgradeable, AllowlistRBACUpgradeable, PauseRBACUpgradeable {\n    /// @dev Immutable decimals of the token.\n    uint8 internal immutable DECIMALS;\n\n    /// @notice Role for minting tokens.\n    bytes32 public constant MINTER_ROLE = keccak256(\"MINTER_ROLE\");\n\n    /// @notice Role for burning tokens.\n    bytes32 public constant BURNER_ROLE = keccak256(\"BURNER_ROLE\");\n\n    /**\n     * @dev Sets immutable variables.\n     * @param _decimals Decimals of the token\n     */\n    constructor(uint8 _decimals) {\n        _disableInitializers();\n\n        DECIMALS = _decimals;\n    }\n\n    /**\n     * @notice Initializes the contract with a name, symbol, and default admin.\n     * @param _name Name of the token\n     * @param _symbol Symbol of the token\n     * @param _initialAdmin Address to be granted `DEFAULT_ADMIN_ROLE`\n     */\n    function initialize(string calldata _name, string calldata _symbol, address _initialAdmin) public initializer {\n        __ERC20_init(_name, _symbol);\n        __ERC20Permit_init(_name);\n        __AccessControl2Step_init(_initialAdmin);\n        __AllowlistBase_init(AllowlistMode.Blacklist);\n    }\n\n    /**\n     * @notice Mints tokens to address.\n     * @dev It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.\n     * @param _to Address to mint tokens to\n     * @param _amount Amount of tokens to mint\n     * @return success Always returns true\n     */\n    function mint(address _to, uint256 _amount) public virtual onlyRole(MINTER_ROLE) returns (bool success) {\n        _mint(_to, _amount);\n        return true;\n    }\n\n    /**\n     * @notice Burns tokens from address without approval.\n     * @param _from Address to burn tokens from\n     * @param _amount Amount of tokens to burn\n     * @return success Always returns true\n     */\n    function burn(address _from, uint256 _amount)\n        public\n        virtual\n        onlyRole(BURNER_ROLE)\n        whenNotPaused\n        onlyAllowlisted(_from)\n        returns (bool success)\n    {\n        _burn(_from, _amount);\n        return true;\n    }\n\n    // ============ ERC20 Overrides ============\n\n    /**\n     * @dev Override to set immutable decimals.\n     * @inheritdoc IERC20Metadata\n     */\n    function decimals() public view virtual override(ERC20Upgradeable, IERC20Metadata) returns (uint8 tokenDecimals) {\n        return DECIMALS;\n    }\n\n    /**\n     * @dev Override to add allowlist checks.\n     * @inheritdoc ERC20Upgradeable\n     */\n    function transfer(address _to, uint256 _amount)\n        public\n        virtual\n        override(ERC20Upgradeable, IERC20)\n        whenNotPaused\n        onlyAllowlisted(msg.sender)\n        onlyAllowlisted(_to)\n        returns (bool success)\n    {\n        return super.transfer(_to, _amount);\n    }\n\n    /**\n     * @dev Override to add allowlist checks.\n     * @inheritdoc ERC20Upgradeable\n     */\n    function transferFrom(address _from, address _to, uint256 _amount)\n        public\n        virtual\n        override(ERC20Upgradeable, IERC20)\n        whenNotPaused\n        onlyAllowlisted(msg.sender)\n        onlyAllowlisted(_from)\n        onlyAllowlisted(_to)\n        returns (bool success)\n    {\n        return super.transferFrom(_from, _to, _amount);\n    }\n\n    /**\n     * @inheritdoc IERC20Permit\n     */\n    function nonces(address _owner)\n        public\n        view\n        virtual\n        override(ERC20PermitUpgradeable, IERC20Permit)\n        returns (uint256 nonce)\n    {\n        return super.nonces(_owner);\n    }\n\n    // ============ Fund Recovery ============\n\n    /**\n     * @inheritdoc IFundRecovery\n     */\n    function recoverFunds(address _from, address _to, uint256 _amount) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        if (isAllowlisted(_from)) revert CannotRecoverFromAllowlisted(_from);\n        super._transfer(_from, _to, _amount);\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IFundRecovery\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for ERC20 contracts implementing fund recovery functionality.\n */\ninterface IFundRecovery {\n    /**\n     * @notice Recovers funds from a non-allowlisted address.\n     * @dev Only recovers from non-allowlisted `_from` address.\n     * @param _from Address to recover funds from\n     * @param _to Address to send the recovered funds to\n     * @param _amount Amount of funds to recover\n     */\n    function recoverFunds(address _from, address _to, uint256 _amount) external;\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAllowlist } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport { AccessControl2StepUpgradeable } from \"./../access/AccessControl2StepUpgradeable.sol\";\nimport { AllowlistBaseUpgradeable } from \"./AllowlistBaseUpgradeable.sol\";\n\n/**\n * @title AllowlistRBACUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides toggleable allowlist functionality between open, blacklist, and\n *         whitelist modes.\n * @dev Exposes public management functions through `AccessControl2StepUpgradeable`.\n */\nabstract contract AllowlistRBACUpgradeable is AllowlistBaseUpgradeable, AccessControl2StepUpgradeable {\n    /// @notice Role for setting the blacklist state for users.\n    bytes32 public constant BLACKLISTER_ROLE = keccak256(\"BLACKLISTER_ROLE\");\n\n    /// @notice Role for setting the whitelist state for users.\n    bytes32 public constant WHITELISTER_ROLE = keccak256(\"WHITELISTER_ROLE\");\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __AllowlistRBAC_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __AllowlistRBAC_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setAllowlistMode(AllowlistMode _mode) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        _setAllowlistMode(_mode);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setBlacklisted(SetAllowlistParam[] calldata _params) public virtual onlyRole(BLACKLISTER_ROLE) {\n        _setBlacklisted(_params);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setWhitelisted(SetAllowlistParam[] calldata _params) public virtual onlyRole(WHITELISTER_ROLE) {\n        _setWhitelisted(_params);\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IPause } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport { AccessControl2StepUpgradeable } from \"./../access/AccessControl2StepUpgradeable.sol\";\nimport { PauseBaseUpgradeable } from \"./PauseBaseUpgradeable.sol\";\n\n/**\n * @title PauseRBACUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides pause functionality.\n * @dev Exposes public management functions through `AccessControl2StepUpgradeable`.\n */\nabstract contract PauseRBACUpgradeable is PauseBaseUpgradeable, AccessControl2StepUpgradeable {\n    /// @notice Role for pausing the contract.\n    bytes32 public constant PAUSER_ROLE = keccak256(\"PAUSER_ROLE\");\n\n    /// @notice Role for unpausing the contract.\n    bytes32 public constant UNPAUSER_ROLE = keccak256(\"UNPAUSER_ROLE\");\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseRBAC_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseRBAC_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @inheritdoc IPause\n     */\n    function pause() public virtual onlyRole(PAUSER_ROLE) {\n        _pause();\n    }\n\n    /**\n     * @inheritdoc IPause\n     */\n    function unpause() public virtual onlyRole(UNPAUSER_ROLE) {\n        _unpause();\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/ERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {ContextUpgradeable} from \"../../utils/ContextUpgradeable.sol\";\nimport {IERC20Errors} from \"@openzeppelin/contracts/interfaces/draft-IERC6093.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the {IERC20} interface.\n *\n * This implementation is agnostic to the way tokens are created. This means\n * that a supply mechanism has to be added in a derived contract using {_mint}.\n *\n * TIP: For a detailed writeup see our guide\n * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How\n * to implement supply mechanisms].\n *\n * The default value of {decimals} is 18. To change this, you should override\n * this function so it returns a different value.\n *\n * We have followed general OpenZeppelin Contracts guidelines: functions revert\n * instead returning `false` on failure. This behavior is nonetheless\n * conventional and does not conflict with the expectations of ERC-20\n * applications.\n */\nabstract contract ERC20Upgradeable is Initializable, ContextUpgradeable, IERC20, IERC20Metadata, IERC20Errors {\n    /// @custom:storage-location erc7201:openzeppelin.storage.ERC20\n    struct ERC20Storage {\n        mapping(address account => uint256) _balances;\n\n        mapping(address account => mapping(address spender => uint256)) _allowances;\n\n        uint256 _totalSupply;\n\n        string _name;\n        string _symbol;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.ERC20\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ERC20StorageLocation = 0x52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00;\n\n    function _getERC20Storage() private pure returns (ERC20Storage storage $) {\n        assembly {\n            $.slot := ERC20StorageLocation\n        }\n    }\n\n    /**\n     * @dev Sets the values for {name} and {symbol}.\n     *\n     * Both values are immutable: they can only be set once during construction.\n     */\n    function __ERC20_init(string memory name_, string memory symbol_) internal onlyInitializing {\n        __ERC20_init_unchained(name_, symbol_);\n    }\n\n    function __ERC20_init_unchained(string memory name_, string memory symbol_) internal onlyInitializing {\n        ERC20Storage storage $ = _getERC20Storage();\n        $._name = name_;\n        $._symbol = symbol_;\n    }\n\n    /**\n     * @dev Returns the name of the token.\n     */\n    function name() public view virtual returns (string memory) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._name;\n    }\n\n    /**\n     * @dev Returns the symbol of the token, usually a shorter version of the\n     * name.\n     */\n    function symbol() public view virtual returns (string memory) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._symbol;\n    }\n\n    /**\n     * @dev Returns the number of decimals used to get its user representation.\n     * For example, if `decimals` equals `2`, a balance of `505` tokens should\n     * be displayed to a user as `5.05` (`505 / 10 ** 2`).\n     *\n     * Tokens usually opt for a value of 18, imitating the relationship between\n     * Ether and Wei. This is the default value returned by this function, unless\n     * it's overridden.\n     *\n     * NOTE: This information is only used for _display_ purposes: it in\n     * no way affects any of the arithmetic of the contract, including\n     * {IERC20-balanceOf} and {IERC20-transfer}.\n     */\n    function decimals() public view virtual returns (uint8) {\n        return 18;\n    }\n\n    /// @inheritdoc IERC20\n    function totalSupply() public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._totalSupply;\n    }\n\n    /// @inheritdoc IERC20\n    function balanceOf(address account) public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._balances[account];\n    }\n\n    /**\n     * @dev See {IERC20-transfer}.\n     *\n     * Requirements:\n     *\n     * - `to` cannot be the zero address.\n     * - the caller must have a balance of at least `value`.\n     */\n    function transfer(address to, uint256 value) public virtual returns (bool) {\n        address owner = _msgSender();\n        _transfer(owner, to, value);\n        return true;\n    }\n\n    /// @inheritdoc IERC20\n    function allowance(address owner, address spender) public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._allowances[owner][spender];\n    }\n\n    /**\n     * @dev See {IERC20-approve}.\n     *\n     * NOTE: If `value` is the maximum `uint256`, the allowance is not updated on\n     * `transferFrom`. This is semantically equivalent to an infinite approval.\n     *\n     * Requirements:\n     *\n     * - `spender` cannot be the zero address.\n     */\n    function approve(address spender, uint256 value) public virtual returns (bool) {\n        address owner = _msgSender();\n        _approve(owner, spender, value);\n        return true;\n    }\n\n    /**\n     * @dev See {IERC20-transferFrom}.\n     *\n     * Skips emitting an {Approval} event indicating an allowance update. This is not\n     * required by the ERC. See {xref-ERC20-_approve-address-address-uint256-bool-}[_approve].\n     *\n     * NOTE: Does not update the allowance if the current allowance\n     * is the maximum `uint256`.\n     *\n     * Requirements:\n     *\n     * - `from` and `to` cannot be the zero address.\n     * - `from` must have a balance of at least `value`.\n     * - the caller must have allowance for ``from``'s tokens of at least\n     * `value`.\n     */\n    function transferFrom(address from, address to, uint256 value) public virtual returns (bool) {\n        address spender = _msgSender();\n        _spendAllowance(from, spender, value);\n        _transfer(from, to, value);\n        return true;\n    }\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to`.\n     *\n     * This internal function is equivalent to {transfer}, and can be used to\n     * e.g. implement automatic token fees, slashing mechanisms, etc.\n     *\n     * Emits a {Transfer} event.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead.\n     */\n    function _transfer(address from, address to, uint256 value) internal {\n        if (from == address(0)) {\n            revert ERC20InvalidSender(address(0));\n        }\n        if (to == address(0)) {\n            revert ERC20InvalidReceiver(address(0));\n        }\n        _update(from, to, value);\n    }\n\n    /**\n     * @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`\n     * (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding\n     * this function.\n     *\n     * Emits a {Transfer} event.\n     */\n    function _update(address from, address to, uint256 value) internal virtual {\n        ERC20Storage storage $ = _getERC20Storage();\n        if (from == address(0)) {\n            // Overflow check required: The rest of the code assumes that totalSupply never overflows\n            $._totalSupply += value;\n        } else {\n            uint256 fromBalance = $._balances[from];\n            if (fromBalance < value) {\n                revert ERC20InsufficientBalance(from, fromBalance, value);\n            }\n            unchecked {\n                // Overflow not possible: value <= fromBalance <= totalSupply.\n                $._balances[from] = fromBalance - value;\n            }\n        }\n\n        if (to == address(0)) {\n            unchecked {\n                // Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.\n                $._totalSupply -= value;\n            }\n        } else {\n            unchecked {\n                // Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.\n                $._balances[to] += value;\n            }\n        }\n\n        emit Transfer(from, to, value);\n    }\n\n    /**\n     * @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).\n     * Relies on the `_update` mechanism\n     *\n     * Emits a {Transfer} event with `from` set to the zero address.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead.\n     */\n    function _mint(address account, uint256 value) internal {\n        if (account == address(0)) {\n            revert ERC20InvalidReceiver(address(0));\n        }\n        _update(address(0), account, value);\n    }\n\n    /**\n     * @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.\n     * Relies on the `_update` mechanism.\n     *\n     * Emits a {Transfer} event with `to` set to the zero address.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead\n     */\n    function _burn(address account, uint256 value) internal {\n        if (account == address(0)) {\n            revert ERC20InvalidSender(address(0));\n        }\n        _update(account, address(0), value);\n    }\n\n    /**\n     * @dev Sets `value` as the allowance of `spender` over the `owner`'s tokens.\n     *\n     * This internal function is equivalent to `approve`, and can be used to\n     * e.g. set automatic allowances for certain subsystems, etc.\n     *\n     * Emits an {Approval} event.\n     *\n     * Requirements:\n     *\n     * - `owner` cannot be the zero address.\n     * - `spender` cannot be the zero address.\n     *\n     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.\n     */\n    function _approve(address owner, address spender, uint256 value) internal {\n        _approve(owner, spender, value, true);\n    }\n\n    /**\n     * @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.\n     *\n     * By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by\n     * `_spendAllowance` during the `transferFrom` operation sets the flag to false. This saves gas by not emitting any\n     * `Approval` event during `transferFrom` operations.\n     *\n     * Anyone who wishes to continue emitting `Approval` events on the `transferFrom` operation can force the flag to\n     * true using the following override:\n     *\n     * ```solidity\n     * function _approve(address owner, address spender, uint256 value, bool) internal virtual override {\n     *     super._approve(owner, spender, value, true);\n     * }\n     * ```\n     *\n     * Requirements are the same as {_approve}.\n     */\n    function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {\n        ERC20Storage storage $ = _getERC20Storage();\n        if (owner == address(0)) {\n            revert ERC20InvalidApprover(address(0));\n        }\n        if (spender == address(0)) {\n            revert ERC20InvalidSpender(address(0));\n        }\n        $._allowances[owner][spender] = value;\n        if (emitEvent) {\n            emit Approval(owner, spender, value);\n        }\n    }\n\n    /**\n     * @dev Updates `owner`'s allowance for `spender` based on spent `value`.\n     *\n     * Does not update the allowance value in case of infinite allowance.\n     * Revert if not enough allowance is available.\n     *\n     * Does not emit an {Approval} event.\n     */\n    function _spendAllowance(address owner, address spender, uint256 value) internal virtual {\n        uint256 currentAllowance = allowance(owner, spender);\n        if (currentAllowance < type(uint256).max) {\n            if (currentAllowance < value) {\n                revert ERC20InsufficientAllowance(spender, currentAllowance, value);\n            }\n            unchecked {\n                _approve(owner, spender, currentAllowance - value, false);\n            }\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/extensions/ERC20Permit.sol)\n\npragma solidity ^0.8.24;\n\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\nimport {ERC20Upgradeable} from \"../ERC20Upgradeable.sol\";\nimport {ECDSA} from \"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\";\nimport {EIP712Upgradeable} from \"../../../utils/cryptography/EIP712Upgradeable.sol\";\nimport {NoncesUpgradeable} from \"../../../utils/NoncesUpgradeable.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].\n *\n * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n */\nabstract contract ERC20PermitUpgradeable is Initializable, ERC20Upgradeable, IERC20Permit, EIP712Upgradeable, NoncesUpgradeable {\n    bytes32 private constant PERMIT_TYPEHASH =\n        keccak256(\"Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)\");\n\n    /**\n     * @dev Permit deadline has expired.\n     */\n    error ERC2612ExpiredSignature(uint256 deadline);\n\n    /**\n     * @dev Mismatched signature.\n     */\n    error ERC2612InvalidSigner(address signer, address owner);\n\n    /**\n     * @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `\"1\"`.\n     *\n     * It's a good idea to use the same `name` that is defined as the ERC-20 token name.\n     */\n    function __ERC20Permit_init(string memory name) internal onlyInitializing {\n        __EIP712_init_unchained(name, \"1\");\n    }\n\n    function __ERC20Permit_init_unchained(string memory) internal onlyInitializing {}\n\n    /// @inheritdoc IERC20Permit\n    function permit(\n        address owner,\n        address spender,\n        uint256 value,\n        uint256 deadline,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) public virtual {\n        if (block.timestamp > deadline) {\n            revert ERC2612ExpiredSignature(deadline);\n        }\n\n        bytes32 structHash = keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, _useNonce(owner), deadline));\n\n        bytes32 hash = _hashTypedDataV4(structHash);\n\n        address signer = ECDSA.recover(hash, v, r, s);\n        if (signer != owner) {\n            revert ERC2612InvalidSigner(signer, owner);\n        }\n\n        _approve(owner, spender, value);\n    }\n\n    /// @inheritdoc IERC20Permit\n    function nonces(address owner) public view virtual override(IERC20Permit, NoncesUpgradeable) returns (uint256) {\n        return super.nonces(owner);\n    }\n\n    /// @inheritdoc IERC20Permit\n    // solhint-disable-next-line func-name-mixedcase\n    function DOMAIN_SEPARATOR() external view returns (bytes32) {\n        return _domainSeparatorV4();\n    }\n}\n"},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/extensions/IERC20Metadata.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20} from \"../IERC20.sol\";\n\n/**\n * @dev Interface for the optional metadata functions from the ERC-20 standard.\n */\ninterface IERC20Metadata is IERC20 {\n    /**\n     * @dev Returns the name of the token.\n     */\n    function name() external view returns (string memory);\n\n    /**\n     * @dev Returns the symbol of the token.\n     */\n    function symbol() external view returns (string memory);\n\n    /**\n     * @dev Returns the decimals places of the token.\n     */\n    function decimals() external view returns (uint8);\n}\n"},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/extensions/IERC20Permit.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].\n *\n * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n *\n * ==== Security Considerations\n *\n * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature\n * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be\n * considered as an intention to spend the allowance in any specific way. The second is that because permits have\n * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should\n * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be\n * generally recommended is:\n *\n * ```solidity\n * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {\n *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}\n *     doThing(..., value);\n * }\n *\n * function doThing(..., uint256 value) public {\n *     token.safeTransferFrom(msg.sender, address(this), value);\n *     ...\n * }\n * ```\n *\n * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of\n * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also\n * {SafeERC20-safeTransferFrom}).\n *\n * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so\n * contracts should have entry points that don't rely on permit.\n */\ninterface IERC20Permit {\n    /**\n     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,\n     * given ``owner``'s signed approval.\n     *\n     * IMPORTANT: The same issues {IERC20-approve} has related to transaction\n     * ordering also applies here.\n     *\n     * Emits an {Approval} event.\n     *\n     * Requirements:\n     *\n     * - `spender` cannot be the zero address.\n     * - `deadline` must be a timestamp in the future.\n     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`\n     * over the EIP712-formatted function arguments.\n     * - the signature must use ``owner``'s current nonce (see {nonces}).\n     *\n     * For more information on the signature format, see the\n     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP\n     * section].\n     *\n     * CAUTION: See Security Considerations above.\n     */\n    function permit(\n        address owner,\n        address spender,\n        uint256 value,\n        uint256 deadline,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) external;\n\n    /**\n     * @dev Returns the current nonce for `owner`. This value must be\n     * included whenever a signature is generated for {permit}.\n     *\n     * Every successful call to {permit} increases ``owner``'s nonce by one. This\n     * prevents a signature from being used multiple times.\n     */\n    function nonces(address owner) external view returns (uint256);\n\n    /**\n     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function DOMAIN_SEPARATOR() external view returns (bytes32);\n}\n"},"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-20 standard as defined in the ERC.\n */\ninterface IERC20 {\n    /**\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\n     * another (`to`).\n     *\n     * Note that `value` may be zero.\n     */\n    event Transfer(address indexed from, address indexed to, uint256 value);\n\n    /**\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\n     * a call to {approve}. `value` is the new allowance.\n     */\n    event Approval(address indexed owner, address indexed spender, uint256 value);\n\n    /**\n     * @dev Returns the value of tokens in existence.\n     */\n    function totalSupply() external view returns (uint256);\n\n    /**\n     * @dev Returns the value of tokens owned by `account`.\n     */\n    function balanceOf(address account) external view returns (uint256);\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transfer(address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Returns the remaining number of tokens that `spender` will be\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\n     * zero by default.\n     *\n     * This value changes when {approve} or {transferFrom} are called.\n     */\n    function allowance(address owner, address spender) external view returns (uint256);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\n     * that someone may use both the old and the new allowance by unfortunate\n     * transaction ordering. One possible solution to mitigate this race\n     * condition is to first reduce the spender's allowance to 0 and set the\n     * desired value afterwards:\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\n     *\n     * Emits an {Approval} event.\n     */\n    function approve(address spender, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\n     * allowance mechanism. `value` is then deducted from the caller's\n     * allowance.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\n}\n"},"contracts/evm/interfaces/IERC20Plus.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.26;\n\nimport {IAllowlist} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport {IBurnableMintable} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol\";\nimport {IFundRecovery} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol\";\nimport {IPause} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\n\n/**\n * @title IERC20Plus\n * @author LayerZero Labs (@TRileySchwarz, tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `ERC20Plus` contract.\n */\ninterface IERC20Plus is IBurnableMintable, IAllowlist, IPause, IFundRecovery, IERC20Metadata, IERC20Permit {\n    /**\n     * @notice Thrown when trying to recover funds from an allowlisted address.\n     * @param user Address that is allowlisted\n     */\n    error CannotRecoverFromAllowlisted(address user);\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IAllowlist\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `Allowlist` contract.\n */\ninterface IAllowlist {\n    /**\n     * @notice Available allowlist modes.\n     *         - `Open`: No restrictions.\n     *         - `Blacklist`: Users in the blacklist are not allowed.\n     *         - `Whitelist`: Only users in the whitelist are allowed.\n     */\n    enum AllowlistMode {\n        Open,\n        Blacklist,\n        Whitelist\n    }\n\n    /**\n     * @notice Parameters for setting the allowlist state for a user.\n     * @param user User address\n     * @param isEnabled Whether the user is whitelisted or blacklisted, depends on function context\n     */\n    struct SetAllowlistParam {\n        address user;\n        bool isEnabled;\n    }\n\n    /**\n     * @notice Emitted when the allowlist mode is updated.\n     * @param newMode New mode\n     */\n    event AllowlistModeUpdated(AllowlistMode newMode);\n\n    /**\n     * @notice Emitted when a user's blacklist state is updated.\n     * @param user User address\n     * @param isBlacklisted Whether the user is now blacklisted\n     */\n    event BlacklistUpdated(address indexed user, bool isBlacklisted);\n\n    /**\n     * @notice Emitted when a user's whitelist state is updated.\n     * @param user User address\n     * @param isWhitelisted Whether the user is now whitelisted\n     */\n    event WhitelistUpdated(address indexed user, bool isWhitelisted);\n\n    /**\n     * @notice Thrown when the intended allowlist mode is already set.\n     * @param mode Current mode\n     */\n    error ModeAlreadySet(AllowlistMode mode);\n\n    /**\n     * @notice Thrown when a user is already in the desired state (blacklist or whitelist).\n     * @param user User address\n     * @param isEnabled The desired state that the user is already in\n     */\n    error AllowlistStateIdempotent(address user, bool isEnabled);\n\n    /**\n     * @notice Thrown when a user is not allowlisted.\n     * @param user User address\n     * @param mode Current mode\n     */\n    error NotAllowlisted(address user, AllowlistMode mode);\n\n    /**\n     * @notice Returns the current allowlist mode.\n     * @return mode Current mode\n     */\n    function allowlistMode() external view returns (AllowlistMode mode);\n\n    /**\n     * @notice Returns the blacklist state for a user.\n     * @param _user User address\n     * @return isUserBlacklisted Whether the user is blacklisted\n     */\n    function isBlacklisted(address _user) external view returns (bool isUserBlacklisted);\n\n    /**\n     * @notice Returns the whitelist state for a user.\n     * @param _user User address\n     * @return isUserWhitelisted Whether the user is whitelisted\n     */\n    function isWhitelisted(address _user) external view returns (bool isUserWhitelisted);\n\n    /**\n     * @notice Checks if a user is allowlisted under the current mode.\n     * @param _user User address\n     * @return isUserAllowlisted Whether the user is allowlisted\n     */\n    function isAllowlisted(address _user) external view returns (bool isUserAllowlisted);\n\n    /**\n     * @notice Returns the total count of blacklisted addresses.\n     * @return count Total number of blacklisted addresses\n     */\n    function blacklistedCount() external view returns (uint256 count);\n\n    /**\n     * @notice Returns the total count of whitelisted addresses.\n     * @return count Total number of whitelisted addresses\n     */\n    function whitelistedCount() external view returns (uint256 count);\n\n    /**\n     * @notice Returns a paginated list of blacklisted addresses.\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of blacklisted addresses\n     */\n    function getBlacklist(uint256 _offset, uint256 _limit) external view returns (address[] memory addresses);\n\n    /**\n     * @notice Returns a paginated list of whitelisted addresses.\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of whitelisted addresses\n     */\n    function getWhitelist(uint256 _offset, uint256 _limit) external view returns (address[] memory addresses);\n\n    /**\n     * @notice Sets the allowlist mode.\n     * @param _mode New allowlist mode\n     */\n    function setAllowlistMode(AllowlistMode _mode) external;\n\n    /**\n     * @notice Sets the blacklist state for an array of users.\n     * @param _params Array of users and blacklist states\n     */\n    function setBlacklisted(SetAllowlistParam[] calldata _params) external;\n\n    /**\n     * @notice Sets the whitelist state for an array of users.\n     * @param _params Array of users and whitelist states\n     */\n    function setWhitelisted(SetAllowlistParam[] calldata _params) external;\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAccessControl2Step } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol\";\nimport { AccessControlUpgradeable } from \"@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol\";\nimport { AccessControlEnumerableUpgradeable } from \"@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol\";\n\n/**\n * @title AccessControl2StepUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that extends `AccessControlEnumerable` with a two-step transfer mechanism for\n *         the `DEFAULT_ADMIN_ROLE`, similar to `AccessControlDefaultAdminRules`. It does not enforce delayed transfers.\n * @dev The `DEFAULT_ADMIN_ROLE` cannot be granted or revoked through the standard `grantRole` and `revokeRole`\n *      functions. Instead, a two-step process is enforced:\n *      1. The current admin calls `beginDefaultAdminTransfer(newAdmin)`.\n *      2. The pending admin calls `acceptDefaultAdminTransfer()`.\n *      The current default admin can cancel a pending transfer via `beginDefaultAdminTransfer(address(0))`.\n *      Renouncing the `DEFAULT_ADMIN_ROLE` is not permitted.\n */\nabstract contract AccessControl2StepUpgradeable is IAccessControl2Step, AccessControlEnumerableUpgradeable {\n    /// @custom:storage-location erc7201:layerzerov2.storage.accesscontrol2step\n    struct AccessControl2StepStorage {\n        address _pendingDefaultAdmin;\n        address _currentDefaultAdmin;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.accesscontrol2step\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ACCESS_CONTROL_2_STEP_STORAGE_LOCATION =\n        0x9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400;\n\n    /**\n     * @notice Internal function to get the contract storage.\n     * @return $ Storage pointer\n     */\n    function _getAccessControl2StepStorage() internal pure returns (AccessControl2StepStorage storage $) {\n        assembly {\n            $.slot := ACCESS_CONTROL_2_STEP_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @param _initialDefaultAdmin Default admin address\n     */\n    function __AccessControl2Step_init(address _initialDefaultAdmin) internal onlyInitializing {\n        __AccessControl2Step_init_unchained(_initialDefaultAdmin);\n    }\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @param _initialDefaultAdmin Default admin address\n     */\n    function __AccessControl2Step_init_unchained(address _initialDefaultAdmin) internal onlyInitializing {\n        if (_initialDefaultAdmin == address(0)) {\n            revert InvalidDefaultAdmin(address(0));\n        }\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n        $._currentDefaultAdmin = _initialDefaultAdmin;\n        /// @dev Bypass `DEFAULT_ADMIN_ROLE` check.\n        super._grantRole(DEFAULT_ADMIN_ROLE, _initialDefaultAdmin);\n    }\n\n    // ============ Getters ============\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function defaultAdmin() public view virtual returns (address defaultAdminAddress) {\n        return _getAccessControl2StepStorage()._currentDefaultAdmin;\n    }\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function pendingDefaultAdmin() public view virtual returns (address pendingDefaultAdminAddress) {\n        return _getAccessControl2StepStorage()._pendingDefaultAdmin;\n    }\n\n    // ============ Setters ============\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function beginDefaultAdminTransfer(address _newAdmin) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n        $._pendingDefaultAdmin = _newAdmin;\n        emit DefaultAdminTransferStarted(_newAdmin);\n    }\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function acceptDefaultAdminTransfer() public virtual {\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n\n        address pendingAdmin = $._pendingDefaultAdmin;\n        if (pendingAdmin != _msgSender()) {\n            revert CallerNotPendingAdmin(pendingAdmin);\n        }\n\n        /// @dev Bypass `DEFAULT_ADMIN_ROLE` check.\n        super._revokeRole(DEFAULT_ADMIN_ROLE, $._currentDefaultAdmin);\n        super._grantRole(DEFAULT_ADMIN_ROLE, pendingAdmin);\n\n        $._currentDefaultAdmin = pendingAdmin;\n        delete $._pendingDefaultAdmin;\n    }\n\n    // ============ Overrides ============\n\n    /**\n     * @dev Override to prevent granting `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlEnumerableUpgradeable\n     */\n    function _grantRole(bytes32 role, address account) internal virtual override returns (bool) {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        return super._grantRole(role, account);\n    }\n\n    /**\n     * @dev Override to prevent revoking `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlEnumerableUpgradeable\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual override returns (bool) {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        return super._revokeRole(role, account);\n    }\n\n    /**\n     * @dev Override to prevent updating the admin of the `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlUpgradeable\n     */\n    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual override {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        super._setRoleAdmin(role, adminRole);\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAllowlist } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport { Initializable } from \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\nimport { EnumerableSet } from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\nimport { EnumerableSetPagination } from \"./../libs/EnumerableSetPagination.sol\";\n\n/**\n * @title AllowlistBaseUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides toggleable allowlist functionality between open, blacklist, and\n *         whitelist modes.\n * @dev No public management functions are exposed by this contract, wrappers should be used with access control.\n *      Alternatively, refer to `AllowlistRBACUpgradeable` for a permissioned implementation.\n */\nabstract contract AllowlistBaseUpgradeable is IAllowlist, Initializable {\n    using EnumerableSet for EnumerableSet.AddressSet;\n    using EnumerableSetPagination for EnumerableSet.AddressSet;\n\n    /// @custom:storage-location erc7201:layerzerov2.storage.allowlist\n    struct AllowlistStorage {\n        AllowlistMode mode;\n        EnumerableSet.AddressSet blacklistedSet;\n        EnumerableSet.AddressSet whitelistedSet;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.allowlist\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ALLOWLIST_STORAGE_LOCATION =\n        0xa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00;\n\n    /**\n     * @notice Internal function to get the allowlist storage.\n     * @return $ Storage pointer\n     */\n    function _getAllowlistStorage() internal pure returns (AllowlistStorage storage $) {\n        assembly {\n            $.slot := ALLOWLIST_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @param _mode Initial mode\n     */\n    function __AllowlistBase_init(AllowlistMode _mode) internal onlyInitializing {\n        __AllowlistBase_init_unchained(_mode);\n    }\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @param _mode Initial mode\n     */\n    function __AllowlistBase_init_unchained(AllowlistMode _mode) internal onlyInitializing {\n        /// @dev Not using `_setAllowlistMode` to avoid reverting if the mode is open.\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        $.mode = _mode;\n        emit AllowlistModeUpdated(_mode);\n    }\n\n    /**\n     * @notice Modifier that reverts if the user is not allowlisted.\n     * @param _user User address\n     */\n    modifier onlyAllowlisted(address _user) {\n        if (!isAllowlisted(_user)) revert NotAllowlisted(_user, allowlistMode());\n        _;\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function allowlistMode() public view virtual returns (AllowlistMode mode) {\n        return _getAllowlistStorage().mode;\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isBlacklisted(address _user) public view virtual returns (bool isUserBlacklisted) {\n        return _getAllowlistStorage().blacklistedSet.contains(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isWhitelisted(address _user) public view virtual returns (bool isUserWhitelisted) {\n        return _getAllowlistStorage().whitelistedSet.contains(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isAllowlisted(address _user) public view virtual returns (bool isUserAllowlisted) {\n        AllowlistMode currentMode = allowlistMode();\n        if (currentMode == AllowlistMode.Open) return true;\n        if (currentMode == AllowlistMode.Blacklist) return !isBlacklisted(_user);\n        /// @dev `currentMode == AllowlistMode.Whitelist`.\n        return isWhitelisted(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function blacklistedCount() public view virtual returns (uint256 count) {\n        return _getAllowlistStorage().blacklistedSet.length();\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function whitelistedCount() public view virtual returns (uint256 count) {\n        return _getAllowlistStorage().whitelistedSet.length();\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function getBlacklist(uint256 _offset, uint256 _limit) public view virtual returns (address[] memory addresses) {\n        return _getAllowlistStorage().blacklistedSet.paginate(_offset, _limit);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function getWhitelist(uint256 _offset, uint256 _limit) public view virtual returns (address[] memory addresses) {\n        return _getAllowlistStorage().whitelistedSet.paginate(_offset, _limit);\n    }\n\n    // ============ Internal Functions to Wrap with Access Control ============\n\n    /**\n     * @notice Internal function to set the allowlist mode.\n     * @dev To be wrapped with access control.\n     * @param _mode New mode\n     */\n    function _setAllowlistMode(AllowlistMode _mode) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        if ($.mode == _mode) revert ModeAlreadySet(_mode);\n        $.mode = _mode;\n        emit AllowlistModeUpdated(_mode);\n    }\n\n    /**\n     * @notice Internal function to set the whitelist state for an array of users.\n     * @dev To be wrapped with access control.\n     * @param _params Array of users and whitelist states\n     */\n    function _setWhitelisted(SetAllowlistParam[] calldata _params) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        for (uint256 i = 0; i < _params.length; i++) {\n            SetAllowlistParam calldata param = _params[i];\n            bool addedOrRemoved;\n            if (param.isEnabled) {\n                addedOrRemoved = $.whitelistedSet.add(param.user);\n            } else {\n                addedOrRemoved = $.whitelistedSet.remove(param.user);\n            }\n            if (!addedOrRemoved) revert AllowlistStateIdempotent(param.user, param.isEnabled);\n            emit WhitelistUpdated(param.user, param.isEnabled);\n        }\n    }\n\n    /**\n     * @notice Internal function to set the blacklist state for an array of users.\n     * @dev To be wrapped with access control.\n     * @param _params Array of users and blacklist states\n     */\n    function _setBlacklisted(SetAllowlistParam[] calldata _params) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        for (uint256 i = 0; i < _params.length; i++) {\n            SetAllowlistParam calldata param = _params[i];\n            bool addedOrRemoved;\n            if (param.isEnabled) {\n                addedOrRemoved = $.blacklistedSet.add(param.user);\n            } else {\n                addedOrRemoved = $.blacklistedSet.remove(param.user);\n            }\n            if (!addedOrRemoved) revert AllowlistStateIdempotent(param.user, param.isEnabled);\n            emit BlacklistUpdated(param.user, param.isEnabled);\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IPause\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `Pause` contract.\n */\ninterface IPause {\n    /**\n     * @notice Emitted when the pause status is set.\n     * @param paused Pause status\n     */\n    event PauseSet(bool paused);\n\n    /**\n     * @notice Thrown when attempting to perform an action while paused.\n     */\n    error Paused();\n\n    /**\n     * @notice Thrown when setting pause state is idempotent (no change).\n     * @param isPaused Whether system is paused\n     */\n    error PauseStateIdempotent(bool isPaused);\n\n    /**\n     * @notice Checks if the system is paused.\n     * @return paused Whether the system is paused\n     */\n    function isPaused() external view returns (bool paused);\n\n    /**\n     * @notice Pauses the system.\n     */\n    function pause() external;\n\n    /**\n     * @notice Unpauses the system.\n     */\n    function unpause() external;\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/SafeCast.sol)\n// This file was procedurally generated from scripts/generate/templates/SafeCast.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow\n * checks.\n *\n * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can\n * easily result in undesired exploitation or bugs, since developers usually\n * assume that overflows raise errors. `SafeCast` restores this intuition by\n * reverting the transaction when such an operation overflows.\n *\n * Using this library instead of the unchecked operations eliminates an entire\n * class of bugs, so it's recommended to use it always.\n */\nlibrary SafeCast {\n    /**\n     * @dev Value doesn't fit in a uint of `bits` size.\n     */\n    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);\n\n    /**\n     * @dev An int value doesn't fit in a uint of `bits` size.\n     */\n    error SafeCastOverflowedIntToUint(int256 value);\n\n    /**\n     * @dev Value doesn't fit in an int of `bits` size.\n     */\n    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);\n\n    /**\n     * @dev A uint value doesn't fit in an int of `bits` size.\n     */\n    error SafeCastOverflowedUintToInt(uint256 value);\n\n    /**\n     * @dev Returns the downcasted uint248 from uint256, reverting on\n     * overflow (when the input is greater than largest uint248).\n     *\n     * Counterpart to Solidity's `uint248` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 248 bits\n     */\n    function toUint248(uint256 value) internal pure returns (uint248) {\n        if (value > type(uint248).max) {\n            revert SafeCastOverflowedUintDowncast(248, value);\n        }\n        return uint248(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint240 from uint256, reverting on\n     * overflow (when the input is greater than largest uint240).\n     *\n     * Counterpart to Solidity's `uint240` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 240 bits\n     */\n    function toUint240(uint256 value) internal pure returns (uint240) {\n        if (value > type(uint240).max) {\n            revert SafeCastOverflowedUintDowncast(240, value);\n        }\n        return uint240(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint232 from uint256, reverting on\n     * overflow (when the input is greater than largest uint232).\n     *\n     * Counterpart to Solidity's `uint232` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 232 bits\n     */\n    function toUint232(uint256 value) internal pure returns (uint232) {\n        if (value > type(uint232).max) {\n            revert SafeCastOverflowedUintDowncast(232, value);\n        }\n        return uint232(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint224 from uint256, reverting on\n     * overflow (when the input is greater than largest uint224).\n     *\n     * Counterpart to Solidity's `uint224` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 224 bits\n     */\n    function toUint224(uint256 value) internal pure returns (uint224) {\n        if (value > type(uint224).max) {\n            revert SafeCastOverflowedUintDowncast(224, value);\n        }\n        return uint224(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint216 from uint256, reverting on\n     * overflow (when the input is greater than largest uint216).\n     *\n     * Counterpart to Solidity's `uint216` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 216 bits\n     */\n    function toUint216(uint256 value) internal pure returns (uint216) {\n        if (value > type(uint216).max) {\n            revert SafeCastOverflowedUintDowncast(216, value);\n        }\n        return uint216(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint208 from uint256, reverting on\n     * overflow (when the input is greater than largest uint208).\n     *\n     * Counterpart to Solidity's `uint208` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 208 bits\n     */\n    function toUint208(uint256 value) internal pure returns (uint208) {\n        if (value > type(uint208).max) {\n            revert SafeCastOverflowedUintDowncast(208, value);\n        }\n        return uint208(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint200 from uint256, reverting on\n     * overflow (when the input is greater than largest uint200).\n     *\n     * Counterpart to Solidity's `uint200` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 200 bits\n     */\n    function toUint200(uint256 value) internal pure returns (uint200) {\n        if (value > type(uint200).max) {\n            revert SafeCastOverflowedUintDowncast(200, value);\n        }\n        return uint200(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint192 from uint256, reverting on\n     * overflow (when the input is greater than largest uint192).\n     *\n     * Counterpart to Solidity's `uint192` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 192 bits\n     */\n    function toUint192(uint256 value) internal pure returns (uint192) {\n        if (value > type(uint192).max) {\n            revert SafeCastOverflowedUintDowncast(192, value);\n        }\n        return uint192(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint184 from uint256, reverting on\n     * overflow (when the input is greater than largest uint184).\n     *\n     * Counterpart to Solidity's `uint184` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 184 bits\n     */\n    function toUint184(uint256 value) internal pure returns (uint184) {\n        if (value > type(uint184).max) {\n            revert SafeCastOverflowedUintDowncast(184, value);\n        }\n        return uint184(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint176 from uint256, reverting on\n     * overflow (when the input is greater than largest uint176).\n     *\n     * Counterpart to Solidity's `uint176` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 176 bits\n     */\n    function toUint176(uint256 value) internal pure returns (uint176) {\n        if (value > type(uint176).max) {\n            revert SafeCastOverflowedUintDowncast(176, value);\n        }\n        return uint176(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint168 from uint256, reverting on\n     * overflow (when the input is greater than largest uint168).\n     *\n     * Counterpart to Solidity's `uint168` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 168 bits\n     */\n    function toUint168(uint256 value) internal pure returns (uint168) {\n        if (value > type(uint168).max) {\n            revert SafeCastOverflowedUintDowncast(168, value);\n        }\n        return uint168(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint160 from uint256, reverting on\n     * overflow (when the input is greater than largest uint160).\n     *\n     * Counterpart to Solidity's `uint160` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 160 bits\n     */\n    function toUint160(uint256 value) internal pure returns (uint160) {\n        if (value > type(uint160).max) {\n            revert SafeCastOverflowedUintDowncast(160, value);\n        }\n        return uint160(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint152 from uint256, reverting on\n     * overflow (when the input is greater than largest uint152).\n     *\n     * Counterpart to Solidity's `uint152` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 152 bits\n     */\n    function toUint152(uint256 value) internal pure returns (uint152) {\n        if (value > type(uint152).max) {\n            revert SafeCastOverflowedUintDowncast(152, value);\n        }\n        return uint152(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint144 from uint256, reverting on\n     * overflow (when the input is greater than largest uint144).\n     *\n     * Counterpart to Solidity's `uint144` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 144 bits\n     */\n    function toUint144(uint256 value) internal pure returns (uint144) {\n        if (value > type(uint144).max) {\n            revert SafeCastOverflowedUintDowncast(144, value);\n        }\n        return uint144(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint136 from uint256, reverting on\n     * overflow (when the input is greater than largest uint136).\n     *\n     * Counterpart to Solidity's `uint136` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 136 bits\n     */\n    function toUint136(uint256 value) internal pure returns (uint136) {\n        if (value > type(uint136).max) {\n            revert SafeCastOverflowedUintDowncast(136, value);\n        }\n        return uint136(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint128 from uint256, reverting on\n     * overflow (when the input is greater than largest uint128).\n     *\n     * Counterpart to Solidity's `uint128` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 128 bits\n     */\n    function toUint128(uint256 value) internal pure returns (uint128) {\n        if (value > type(uint128).max) {\n            revert SafeCastOverflowedUintDowncast(128, value);\n        }\n        return uint128(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint120 from uint256, reverting on\n     * overflow (when the input is greater than largest uint120).\n     *\n     * Counterpart to Solidity's `uint120` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 120 bits\n     */\n    function toUint120(uint256 value) internal pure returns (uint120) {\n        if (value > type(uint120).max) {\n            revert SafeCastOverflowedUintDowncast(120, value);\n        }\n        return uint120(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint112 from uint256, reverting on\n     * overflow (when the input is greater than largest uint112).\n     *\n     * Counterpart to Solidity's `uint112` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 112 bits\n     */\n    function toUint112(uint256 value) internal pure returns (uint112) {\n        if (value > type(uint112).max) {\n            revert SafeCastOverflowedUintDowncast(112, value);\n        }\n        return uint112(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint104 from uint256, reverting on\n     * overflow (when the input is greater than largest uint104).\n     *\n     * Counterpart to Solidity's `uint104` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 104 bits\n     */\n    function toUint104(uint256 value) internal pure returns (uint104) {\n        if (value > type(uint104).max) {\n            revert SafeCastOverflowedUintDowncast(104, value);\n        }\n        return uint104(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint96 from uint256, reverting on\n     * overflow (when the input is greater than largest uint96).\n     *\n     * Counterpart to Solidity's `uint96` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 96 bits\n     */\n    function toUint96(uint256 value) internal pure returns (uint96) {\n        if (value > type(uint96).max) {\n            revert SafeCastOverflowedUintDowncast(96, value);\n        }\n        return uint96(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint88 from uint256, reverting on\n     * overflow (when the input is greater than largest uint88).\n     *\n     * Counterpart to Solidity's `uint88` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 88 bits\n     */\n    function toUint88(uint256 value) internal pure returns (uint88) {\n        if (value > type(uint88).max) {\n            revert SafeCastOverflowedUintDowncast(88, value);\n        }\n        return uint88(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint80 from uint256, reverting on\n     * overflow (when the input is greater than largest uint80).\n     *\n     * Counterpart to Solidity's `uint80` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 80 bits\n     */\n    function toUint80(uint256 value) internal pure returns (uint80) {\n        if (value > type(uint80).max) {\n            revert SafeCastOverflowedUintDowncast(80, value);\n        }\n        return uint80(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint72 from uint256, reverting on\n     * overflow (when the input is greater than largest uint72).\n     *\n     * Counterpart to Solidity's `uint72` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 72 bits\n     */\n    function toUint72(uint256 value) internal pure returns (uint72) {\n        if (value > type(uint72).max) {\n            revert SafeCastOverflowedUintDowncast(72, value);\n        }\n        return uint72(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint64 from uint256, reverting on\n     * overflow (when the input is greater than largest uint64).\n     *\n     * Counterpart to Solidity's `uint64` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 64 bits\n     */\n    function toUint64(uint256 value) internal pure returns (uint64) {\n        if (value > type(uint64).max) {\n            revert SafeCastOverflowedUintDowncast(64, value);\n        }\n        return uint64(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint56 from uint256, reverting on\n     * overflow (when the input is greater than largest uint56).\n     *\n     * Counterpart to Solidity's `uint56` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 56 bits\n     */\n    function toUint56(uint256 value) internal pure returns (uint56) {\n        if (value > type(uint56).max) {\n            revert SafeCastOverflowedUintDowncast(56, value);\n        }\n        return uint56(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint48 from uint256, reverting on\n     * overflow (when the input is greater than largest uint48).\n     *\n     * Counterpart to Solidity's `uint48` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 48 bits\n     */\n    function toUint48(uint256 value) internal pure returns (uint48) {\n        if (value > type(uint48).max) {\n            revert SafeCastOverflowedUintDowncast(48, value);\n        }\n        return uint48(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint40 from uint256, reverting on\n     * overflow (when the input is greater than largest uint40).\n     *\n     * Counterpart to Solidity's `uint40` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 40 bits\n     */\n    function toUint40(uint256 value) internal pure returns (uint40) {\n        if (value > type(uint40).max) {\n            revert SafeCastOverflowedUintDowncast(40, value);\n        }\n        return uint40(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint32 from uint256, reverting on\n     * overflow (when the input is greater than largest uint32).\n     *\n     * Counterpart to Solidity's `uint32` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 32 bits\n     */\n    function toUint32(uint256 value) internal pure returns (uint32) {\n        if (value > type(uint32).max) {\n            revert SafeCastOverflowedUintDowncast(32, value);\n        }\n        return uint32(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint24 from uint256, reverting on\n     * overflow (when the input is greater than largest uint24).\n     *\n     * Counterpart to Solidity's `uint24` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 24 bits\n     */\n    function toUint24(uint256 value) internal pure returns (uint24) {\n        if (value > type(uint24).max) {\n            revert SafeCastOverflowedUintDowncast(24, value);\n        }\n        return uint24(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint16 from uint256, reverting on\n     * overflow (when the input is greater than largest uint16).\n     *\n     * Counterpart to Solidity's `uint16` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 16 bits\n     */\n    function toUint16(uint256 value) internal pure returns (uint16) {\n        if (value > type(uint16).max) {\n            revert SafeCastOverflowedUintDowncast(16, value);\n        }\n        return uint16(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint8 from uint256, reverting on\n     * overflow (when the input is greater than largest uint8).\n     *\n     * Counterpart to Solidity's `uint8` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 8 bits\n     */\n    function toUint8(uint256 value) internal pure returns (uint8) {\n        if (value > type(uint8).max) {\n            revert SafeCastOverflowedUintDowncast(8, value);\n        }\n        return uint8(value);\n    }\n\n    /**\n     * @dev Converts a signed int256 into an unsigned uint256.\n     *\n     * Requirements:\n     *\n     * - input must be greater than or equal to 0.\n     */\n    function toUint256(int256 value) internal pure returns (uint256) {\n        if (value < 0) {\n            revert SafeCastOverflowedIntToUint(value);\n        }\n        return uint256(value);\n    }\n\n    /**\n     * @dev Returns the downcasted int248 from int256, reverting on\n     * overflow (when the input is less than smallest int248 or\n     * greater than largest int248).\n     *\n     * Counterpart to Solidity's `int248` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 248 bits\n     */\n    function toInt248(int256 value) internal pure returns (int248 downcasted) {\n        downcasted = int248(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(248, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int240 from int256, reverting on\n     * overflow (when the input is less than smallest int240 or\n     * greater than largest int240).\n     *\n     * Counterpart to Solidity's `int240` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 240 bits\n     */\n    function toInt240(int256 value) internal pure returns (int240 downcasted) {\n        downcasted = int240(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(240, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int232 from int256, reverting on\n     * overflow (when the input is less than smallest int232 or\n     * greater than largest int232).\n     *\n     * Counterpart to Solidity's `int232` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 232 bits\n     */\n    function toInt232(int256 value) internal pure returns (int232 downcasted) {\n        downcasted = int232(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(232, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int224 from int256, reverting on\n     * overflow (when the input is less than smallest int224 or\n     * greater than largest int224).\n     *\n     * Counterpart to Solidity's `int224` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 224 bits\n     */\n    function toInt224(int256 value) internal pure returns (int224 downcasted) {\n        downcasted = int224(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(224, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int216 from int256, reverting on\n     * overflow (when the input is less than smallest int216 or\n     * greater than largest int216).\n     *\n     * Counterpart to Solidity's `int216` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 216 bits\n     */\n    function toInt216(int256 value) internal pure returns (int216 downcasted) {\n        downcasted = int216(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(216, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int208 from int256, reverting on\n     * overflow (when the input is less than smallest int208 or\n     * greater than largest int208).\n     *\n     * Counterpart to Solidity's `int208` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 208 bits\n     */\n    function toInt208(int256 value) internal pure returns (int208 downcasted) {\n        downcasted = int208(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(208, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int200 from int256, reverting on\n     * overflow (when the input is less than smallest int200 or\n     * greater than largest int200).\n     *\n     * Counterpart to Solidity's `int200` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 200 bits\n     */\n    function toInt200(int256 value) internal pure returns (int200 downcasted) {\n        downcasted = int200(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(200, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int192 from int256, reverting on\n     * overflow (when the input is less than smallest int192 or\n     * greater than largest int192).\n     *\n     * Counterpart to Solidity's `int192` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 192 bits\n     */\n    function toInt192(int256 value) internal pure returns (int192 downcasted) {\n        downcasted = int192(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(192, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int184 from int256, reverting on\n     * overflow (when the input is less than smallest int184 or\n     * greater than largest int184).\n     *\n     * Counterpart to Solidity's `int184` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 184 bits\n     */\n    function toInt184(int256 value) internal pure returns (int184 downcasted) {\n        downcasted = int184(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(184, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int176 from int256, reverting on\n     * overflow (when the input is less than smallest int176 or\n     * greater than largest int176).\n     *\n     * Counterpart to Solidity's `int176` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 176 bits\n     */\n    function toInt176(int256 value) internal pure returns (int176 downcasted) {\n        downcasted = int176(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(176, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int168 from int256, reverting on\n     * overflow (when the input is less than smallest int168 or\n     * greater than largest int168).\n     *\n     * Counterpart to Solidity's `int168` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 168 bits\n     */\n    function toInt168(int256 value) internal pure returns (int168 downcasted) {\n        downcasted = int168(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(168, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int160 from int256, reverting on\n     * overflow (when the input is less than smallest int160 or\n     * greater than largest int160).\n     *\n     * Counterpart to Solidity's `int160` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 160 bits\n     */\n    function toInt160(int256 value) internal pure returns (int160 downcasted) {\n        downcasted = int160(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(160, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int152 from int256, reverting on\n     * overflow (when the input is less than smallest int152 or\n     * greater than largest int152).\n     *\n     * Counterpart to Solidity's `int152` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 152 bits\n     */\n    function toInt152(int256 value) internal pure returns (int152 downcasted) {\n        downcasted = int152(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(152, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int144 from int256, reverting on\n     * overflow (when the input is less than smallest int144 or\n     * greater than largest int144).\n     *\n     * Counterpart to Solidity's `int144` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 144 bits\n     */\n    function toInt144(int256 value) internal pure returns (int144 downcasted) {\n        downcasted = int144(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(144, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int136 from int256, reverting on\n     * overflow (when the input is less than smallest int136 or\n     * greater than largest int136).\n     *\n     * Counterpart to Solidity's `int136` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 136 bits\n     */\n    function toInt136(int256 value) internal pure returns (int136 downcasted) {\n        downcasted = int136(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(136, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int128 from int256, reverting on\n     * overflow (when the input is less than smallest int128 or\n     * greater than largest int128).\n     *\n     * Counterpart to Solidity's `int128` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 128 bits\n     */\n    function toInt128(int256 value) internal pure returns (int128 downcasted) {\n        downcasted = int128(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(128, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int120 from int256, reverting on\n     * overflow (when the input is less than smallest int120 or\n     * greater than largest int120).\n     *\n     * Counterpart to Solidity's `int120` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 120 bits\n     */\n    function toInt120(int256 value) internal pure returns (int120 downcasted) {\n        downcasted = int120(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(120, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int112 from int256, reverting on\n     * overflow (when the input is less than smallest int112 or\n     * greater than largest int112).\n     *\n     * Counterpart to Solidity's `int112` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 112 bits\n     */\n    function toInt112(int256 value) internal pure returns (int112 downcasted) {\n        downcasted = int112(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(112, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int104 from int256, reverting on\n     * overflow (when the input is less than smallest int104 or\n     * greater than largest int104).\n     *\n     * Counterpart to Solidity's `int104` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 104 bits\n     */\n    function toInt104(int256 value) internal pure returns (int104 downcasted) {\n        downcasted = int104(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(104, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int96 from int256, reverting on\n     * overflow (when the input is less than smallest int96 or\n     * greater than largest int96).\n     *\n     * Counterpart to Solidity's `int96` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 96 bits\n     */\n    function toInt96(int256 value) internal pure returns (int96 downcasted) {\n        downcasted = int96(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(96, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int88 from int256, reverting on\n     * overflow (when the input is less than smallest int88 or\n     * greater than largest int88).\n     *\n     * Counterpart to Solidity's `int88` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 88 bits\n     */\n    function toInt88(int256 value) internal pure returns (int88 downcasted) {\n        downcasted = int88(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(88, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int80 from int256, reverting on\n     * overflow (when the input is less than smallest int80 or\n     * greater than largest int80).\n     *\n     * Counterpart to Solidity's `int80` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 80 bits\n     */\n    function toInt80(int256 value) internal pure returns (int80 downcasted) {\n        downcasted = int80(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(80, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int72 from int256, reverting on\n     * overflow (when the input is less than smallest int72 or\n     * greater than largest int72).\n     *\n     * Counterpart to Solidity's `int72` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 72 bits\n     */\n    function toInt72(int256 value) internal pure returns (int72 downcasted) {\n        downcasted = int72(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(72, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int64 from int256, reverting on\n     * overflow (when the input is less than smallest int64 or\n     * greater than largest int64).\n     *\n     * Counterpart to Solidity's `int64` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 64 bits\n     */\n    function toInt64(int256 value) internal pure returns (int64 downcasted) {\n        downcasted = int64(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(64, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int56 from int256, reverting on\n     * overflow (when the input is less than smallest int56 or\n     * greater than largest int56).\n     *\n     * Counterpart to Solidity's `int56` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 56 bits\n     */\n    function toInt56(int256 value) internal pure returns (int56 downcasted) {\n        downcasted = int56(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(56, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int48 from int256, reverting on\n     * overflow (when the input is less than smallest int48 or\n     * greater than largest int48).\n     *\n     * Counterpart to Solidity's `int48` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 48 bits\n     */\n    function toInt48(int256 value) internal pure returns (int48 downcasted) {\n        downcasted = int48(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(48, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int40 from int256, reverting on\n     * overflow (when the input is less than smallest int40 or\n     * greater than largest int40).\n     *\n     * Counterpart to Solidity's `int40` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 40 bits\n     */\n    function toInt40(int256 value) internal pure returns (int40 downcasted) {\n        downcasted = int40(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(40, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int32 from int256, reverting on\n     * overflow (when the input is less than smallest int32 or\n     * greater than largest int32).\n     *\n     * Counterpart to Solidity's `int32` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 32 bits\n     */\n    function toInt32(int256 value) internal pure returns (int32 downcasted) {\n        downcasted = int32(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(32, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int24 from int256, reverting on\n     * overflow (when the input is less than smallest int24 or\n     * greater than largest int24).\n     *\n     * Counterpart to Solidity's `int24` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 24 bits\n     */\n    function toInt24(int256 value) internal pure returns (int24 downcasted) {\n        downcasted = int24(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(24, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int16 from int256, reverting on\n     * overflow (when the input is less than smallest int16 or\n     * greater than largest int16).\n     *\n     * Counterpart to Solidity's `int16` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 16 bits\n     */\n    function toInt16(int256 value) internal pure returns (int16 downcasted) {\n        downcasted = int16(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(16, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int8 from int256, reverting on\n     * overflow (when the input is less than smallest int8 or\n     * greater than largest int8).\n     *\n     * Counterpart to Solidity's `int8` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 8 bits\n     */\n    function toInt8(int256 value) internal pure returns (int8 downcasted) {\n        downcasted = int8(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(8, value);\n        }\n    }\n\n    /**\n     * @dev Converts an unsigned uint256 into a signed int256.\n     *\n     * Requirements:\n     *\n     * - input must be less than or equal to maxInt256.\n     */\n    function toInt256(uint256 value) internal pure returns (int256) {\n        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive\n        if (value > uint256(type(int256).max)) {\n            revert SafeCastOverflowedUintToInt(value);\n        }\n        return int256(value);\n    }\n\n    /**\n     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.\n     */\n    function toUint(bool b) internal pure returns (uint256 u) {\n        assembly (\"memory-safe\") {\n            u := iszero(iszero(b))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)\n\npragma solidity ^0.8.20;\n\nimport {SafeCast} from \"./SafeCast.sol\";\n\n/**\n * @dev Standard signed math utilities missing in the Solidity language.\n */\nlibrary SignedMath {\n    /**\n     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.\n     *\n     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.\n     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute\n     * one branch when needed, making this function more expensive.\n     */\n    function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {\n        unchecked {\n            // branchless ternary works because:\n            // b ^ (a ^ b) == a\n            // b ^ 0 == b\n            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));\n        }\n    }\n\n    /**\n     * @dev Returns the largest of two signed numbers.\n     */\n    function max(int256 a, int256 b) internal pure returns (int256) {\n        return ternary(a > b, a, b);\n    }\n\n    /**\n     * @dev Returns the smallest of two signed numbers.\n     */\n    function min(int256 a, int256 b) internal pure returns (int256) {\n        return ternary(a < b, a, b);\n    }\n\n    /**\n     * @dev Returns the average of two signed numbers without overflow.\n     * The result is rounded towards zero.\n     */\n    function average(int256 a, int256 b) internal pure returns (int256) {\n        // Formula from the book \"Hacker's Delight\"\n        int256 x = (a & b) + ((a ^ b) >> 1);\n        return x + (int256(uint256(x) >> 255) & (a ^ b));\n    }\n\n    /**\n     * @dev Returns the absolute unsigned value of a signed value.\n     */\n    function abs(int256 n) internal pure returns (uint256) {\n        unchecked {\n            // Formula from the \"Bit Twiddling Hacks\" by Sean Eron Anderson.\n            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,\n            // taking advantage of the most significant (or \"sign\" bit) in two's complement representation.\n            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,\n            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).\n            int256 mask = n >> 255;\n\n            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.\n            return uint256((n + mask) ^ mask);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Bytes.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Bytes.sol)\n\npragma solidity ^0.8.24;\n\nimport {Math} from \"./math/Math.sol\";\n\n/**\n * @dev Bytes operations.\n */\nlibrary Bytes {\n    /**\n     * @dev Forward search for `s` in `buffer`\n     * * If `s` is present in the buffer, returns the index of the first instance\n     * * If `s` is not present in the buffer, returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]\n     */\n    function indexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {\n        return indexOf(buffer, s, 0);\n    }\n\n    /**\n     * @dev Forward search for `s` in `buffer` starting at position `pos`\n     * * If `s` is present in the buffer (at or after `pos`), returns the index of the next instance\n     * * If `s` is not present in the buffer (at or after `pos`), returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]\n     */\n    function indexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {\n        uint256 length = buffer.length;\n        for (uint256 i = pos; i < length; ++i) {\n            if (bytes1(_unsafeReadBytesOffset(buffer, i)) == s) {\n                return i;\n            }\n        }\n        return type(uint256).max;\n    }\n\n    /**\n     * @dev Backward search for `s` in `buffer`\n     * * If `s` is present in the buffer, returns the index of the last instance\n     * * If `s` is not present in the buffer, returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]\n     */\n    function lastIndexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {\n        return lastIndexOf(buffer, s, type(uint256).max);\n    }\n\n    /**\n     * @dev Backward search for `s` in `buffer` starting at position `pos`\n     * * If `s` is present in the buffer (at or before `pos`), returns the index of the previous instance\n     * * If `s` is not present in the buffer (at or before `pos`), returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]\n     */\n    function lastIndexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {\n        unchecked {\n            uint256 length = buffer.length;\n            for (uint256 i = Math.min(Math.saturatingAdd(pos, 1), length); i > 0; --i) {\n                if (bytes1(_unsafeReadBytesOffset(buffer, i - 1)) == s) {\n                    return i - 1;\n                }\n            }\n            return type(uint256).max;\n        }\n    }\n\n    /**\n     * @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {\n        return slice(buffer, start, buffer.length);\n    }\n\n    /**\n     * @dev Copies the content of `buffer`, from `start` (included) to `end` (excluded) into a new bytes object in\n     * memory. The `end` argument is truncated to the length of the `buffer`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {\n        // sanitize\n        end = Math.min(end, buffer.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        bytes memory result = new bytes(end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(buffer, 0x20), start), sub(end, start))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer,\n     * and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:].\n     *\n     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead\n     */\n    function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {\n        return splice(buffer, start, buffer.length);\n    }\n\n    /**\n     * @dev Moves the content of `buffer`, from `start` (included) to `end` (excluded) to the start of that buffer,\n     * and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:end].\n     * The `end` argument is truncated to the length of the `buffer`.\n     *\n     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead\n     */\n    function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {\n        // sanitize\n        end = Math.min(end, buffer.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))\n            mstore(buffer, sub(end, start))\n        }\n\n        return buffer;\n    }\n\n    /**\n     * @dev Replaces bytes in `buffer` starting at `pos` with all bytes from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`).\n     * If `pos >= buffer.length`, no replacement occurs and the buffer is returned unchanged.\n     *\n     * NOTE: This function modifies the provided buffer in place.\n     */\n    function replace(bytes memory buffer, uint256 pos, bytes memory replacement) internal pure returns (bytes memory) {\n        return replace(buffer, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces bytes in `buffer` starting at `pos` with bytes from `replacement` starting at `offset`.\n     * Copies at most `length` bytes from `replacement` to `buffer`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * buffer.length - pos))`. If `pos >= buffer.length` or `offset >= replacement.length`, no replacement occurs\n     * and the buffer is returned unchanged.\n     *\n     * NOTE: This function modifies the provided buffer in place.\n     */\n    function replace(\n        bytes memory buffer,\n        uint256 pos,\n        bytes memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (bytes memory) {\n        // sanitize\n        pos = Math.min(pos, buffer.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, buffer.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(add(add(buffer, 0x20), pos), add(add(replacement, 0x20), offset), length)\n        }\n\n        return buffer;\n    }\n\n    /**\n     * @dev Concatenate an array of bytes into a single bytes object.\n     *\n     * For fixed bytes types, we recommend using the solidity built-in `bytes.concat` or (equivalent)\n     * `abi.encodePacked`.\n     *\n     * NOTE: this could be done in assembly with a single loop that expands starting at the FMP, but that would be\n     * significantly less readable. It might be worth benchmarking the savings of the full-assembly approach.\n     */\n    function concat(bytes[] memory buffers) internal pure returns (bytes memory) {\n        uint256 length = 0;\n        for (uint256 i = 0; i < buffers.length; ++i) {\n            length += buffers[i].length;\n        }\n\n        bytes memory result = new bytes(length);\n\n        uint256 offset = 0x20;\n        for (uint256 i = 0; i < buffers.length; ++i) {\n            bytes memory input = buffers[i];\n            assembly (\"memory-safe\") {\n                mcopy(add(result, offset), add(input, 0x20), mload(input))\n            }\n            unchecked {\n                offset += input.length;\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Split each byte in `input` into two nibbles (4 bits each)\n     *\n     * Example: hex\"01234567\" → hex\"0001020304050607\"\n     */\n    function toNibbles(bytes memory input) internal pure returns (bytes memory output) {\n        assembly (\"memory-safe\") {\n            let length := mload(input)\n            output := mload(0x40)\n            mstore(0x40, add(add(output, 0x20), mul(length, 2)))\n            mstore(output, mul(length, 2))\n            for {\n                let i := 0\n            } lt(i, length) {\n                i := add(i, 0x10)\n            } {\n                let chunk := shr(128, mload(add(add(input, 0x20), i)))\n                chunk := and(\n                    0x0000000000000000ffffffffffffffff0000000000000000ffffffffffffffff,\n                    or(shl(64, chunk), chunk)\n                )\n                chunk := and(\n                    0x00000000ffffffff00000000ffffffff00000000ffffffff00000000ffffffff,\n                    or(shl(32, chunk), chunk)\n                )\n                chunk := and(\n                    0x0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff,\n                    or(shl(16, chunk), chunk)\n                )\n                chunk := and(\n                    0x00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff,\n                    or(shl(8, chunk), chunk)\n                )\n                chunk := and(\n                    0x0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f,\n                    or(shl(4, chunk), chunk)\n                )\n                mstore(add(add(output, 0x20), mul(i, 2)), chunk)\n            }\n        }\n    }\n\n    /**\n     * @dev Returns true if the two byte buffers are equal.\n     */\n    function equal(bytes memory a, bytes memory b) internal pure returns (bool) {\n        return a.length == b.length && keccak256(a) == keccak256(b);\n    }\n\n    /**\n     * @dev Reverses the byte order of a bytes32 value, converting between little-endian and big-endian.\n     * Inspired by https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel[Reverse Parallel]\n     */\n    function reverseBytes32(bytes32 value) internal pure returns (bytes32) {\n        value = // swap bytes\n            ((value >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\n            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\n            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\n            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\n        value = // swap 8-byte long pairs\n            ((value >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\n            ((value & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\n        return (value >> 128) | (value << 128); // swap 16-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 128-bit values.\n    function reverseBytes16(bytes16 value) internal pure returns (bytes16) {\n        value = // swap bytes\n            ((value & 0xFF00FF00FF00FF00FF00FF00FF00FF00) >> 8) |\n            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) |\n            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) |\n            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF) << 32);\n        return (value >> 64) | (value << 64); // swap 8-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 64-bit values.\n    function reverseBytes8(bytes8 value) internal pure returns (bytes8) {\n        value = ((value & 0xFF00FF00FF00FF00) >> 8) | ((value & 0x00FF00FF00FF00FF) << 8); // swap bytes\n        value = ((value & 0xFFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF) << 16); // swap 2-byte long pairs\n        return (value >> 32) | (value << 32); // swap 4-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 32-bit values.\n    function reverseBytes4(bytes4 value) internal pure returns (bytes4) {\n        value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); // swap bytes\n        return (value >> 16) | (value << 16); // swap 2-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 16-bit values.\n    function reverseBytes2(bytes2 value) internal pure returns (bytes2) {\n        return (value >> 8) | (value << 8);\n    }\n\n    /**\n     * @dev Counts the number of leading zero bits a bytes array. Returns `8 * buffer.length`\n     * if the buffer is all zeros.\n     */\n    function clz(bytes memory buffer) internal pure returns (uint256) {\n        for (uint256 i = 0; i < buffer.length; i += 0x20) {\n            bytes32 chunk = _unsafeReadBytesOffset(buffer, i);\n            if (chunk != bytes32(0)) {\n                return Math.min(8 * i + Math.clz(uint256(chunk)), 8 * buffer.length);\n            }\n        }\n        return 8 * buffer.length;\n    }\n\n    /**\n     * @dev Reads a bytes32 from a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            value := mload(add(add(buffer, 0x20), offset))\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { EnumerableSet } from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\n\n/**\n * @title EnumerableSetPagination\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Library providing pagination utilities for `EnumerableSet.AddressSet` and `EnumerableSet.UintSet`.\n */\nlibrary EnumerableSetPagination {\n    using EnumerableSet for EnumerableSet.AddressSet;\n    using EnumerableSet for EnumerableSet.UintSet;\n\n    /**\n     * @notice Returns a paginated subset of addresses from an `EnumerableSet`.\n     * @param _set `EnumerableSet.AddressSet` to paginate\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of addresses in the specified range\n     */\n    function paginate(\n        EnumerableSet.AddressSet storage _set,\n        uint256 _offset,\n        uint256 _limit\n    ) internal view returns (address[] memory addresses) {\n        uint256 total = _set.length();\n\n        if (_offset >= total) {\n            return new address[](0);\n        }\n\n        uint256 end = _offset + _limit;\n        if (end > total) {\n            end = total;\n        }\n\n        uint256 resultLength = end - _offset;\n        addresses = new address[](resultLength);\n\n        for (uint256 i = 0; i < resultLength; i++) {\n            addresses[i] = _set.at(_offset + i);\n        }\n    }\n\n    /**\n     * @notice Returns a paginated subset of `uint256` values from an `EnumerableSet`.\n     * @param _set `EnumerableSet.UintSet` to paginate\n     * @param _offset Starting index\n     * @param _limit Maximum number of values to return\n     * @return values Array of `uint256` values in the specified range\n     */\n    function paginate(\n        EnumerableSet.UintSet storage _set,\n        uint256 _offset,\n        uint256 _limit\n    ) internal view returns (uint256[] memory values) {\n        uint256 total = _set.length();\n\n        if (_offset >= total) {\n            return new uint256[](0);\n        }\n\n        uint256 end = _offset + _limit;\n        if (end > total) {\n            end = total;\n        }\n\n        uint256 resultLength = end - _offset;\n        values = new uint256[](resultLength);\n\n        for (uint256 i = 0; i < resultLength; i++) {\n            values[i] = _set.at(_offset + i);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/MessageHashUtils.sol)\n\npragma solidity ^0.8.24;\n\nimport {Strings} from \"../Strings.sol\";\n\n/**\n * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.\n *\n * The library provides methods for generating a hash of a message that conforms to the\n * https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]\n * specifications.\n */\nlibrary MessageHashUtils {\n    error ERC5267ExtensionsNotSupported();\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x45` (`personal_sign` messages).\n     *\n     * The digest is calculated by prefixing a bytes32 `messageHash` with\n     * `\"\\x19Ethereum Signed Message:\\n32\"` and hashing the result. It corresponds with the\n     * hash signed when using the https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_sign[`eth_sign`] JSON-RPC method.\n     *\n     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with\n     * keccak256, although any bytes32 value can be safely used because the final digest will\n     * be re-hashed.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, \"\\x19Ethereum Signed Message:\\n32\") // 32 is the bytes-length of messageHash\n            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix\n            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)\n        }\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x45` (`personal_sign` messages).\n     *\n     * The digest is calculated by prefixing an arbitrary `message` with\n     * `\"\\x19Ethereum Signed Message:\\n\" + len(message)` and hashing the result. It corresponds with the\n     * hash signed when using the https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_sign[`eth_sign`] JSON-RPC method.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {\n        return\n            keccak256(bytes.concat(\"\\x19Ethereum Signed Message:\\n\", bytes(Strings.toString(message.length)), message));\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x00` (data with intended validator).\n     *\n     * The digest is calculated by prefixing an arbitrary `data` with `\"\\x19\\x00\"` and the intended\n     * `validator` address. Then hashing the result.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {\n        return keccak256(abi.encodePacked(hex\"19_00\", validator, data));\n    }\n\n    /**\n     * @dev Variant of {toDataWithIntendedValidatorHash-address-bytes} optimized for cases where `data` is a bytes32.\n     */\n    function toDataWithIntendedValidatorHash(\n        address validator,\n        bytes32 messageHash\n    ) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, hex\"19_00\")\n            mstore(0x02, shl(96, validator))\n            mstore(0x16, messageHash)\n            digest := keccak256(0x00, 0x36)\n        }\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).\n     *\n     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with\n     * `\\x19\\x01` and hashing the result. It corresponds to the hash signed by the\n     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            let ptr := mload(0x40)\n            mstore(ptr, hex\"19_01\")\n            mstore(add(ptr, 0x02), domainSeparator)\n            mstore(add(ptr, 0x22), structHash)\n            digest := keccak256(ptr, 0x42)\n        }\n    }\n\n    /**\n     * @dev Returns the EIP-712 domain separator constructed from an `eip712Domain`. See {IERC5267-eip712Domain}\n     *\n     * This function dynamically constructs the domain separator based on which fields are present in the\n     * `fields` parameter. It contains flags that indicate which domain fields are present:\n     *\n     * * Bit 0 (0x01): name\n     * * Bit 1 (0x02): version\n     * * Bit 2 (0x04): chainId\n     * * Bit 3 (0x08): verifyingContract\n     * * Bit 4 (0x10): salt\n     *\n     * Arguments that correspond to fields which are not present in `fields` are ignored. For example, if `fields` is\n     * `0x0f` (`0b01111`), then the `salt` parameter is ignored.\n     */\n    function toDomainSeparator(\n        bytes1 fields,\n        string memory name,\n        string memory version,\n        uint256 chainId,\n        address verifyingContract,\n        bytes32 salt\n    ) internal pure returns (bytes32 hash) {\n        return\n            toDomainSeparator(\n                fields,\n                keccak256(bytes(name)),\n                keccak256(bytes(version)),\n                chainId,\n                verifyingContract,\n                salt\n            );\n    }\n\n    /// @dev Variant of {toDomainSeparator-bytes1-string-string-uint256-address-bytes32} that uses hashed name and version.\n    function toDomainSeparator(\n        bytes1 fields,\n        bytes32 nameHash,\n        bytes32 versionHash,\n        uint256 chainId,\n        address verifyingContract,\n        bytes32 salt\n    ) internal pure returns (bytes32 hash) {\n        bytes32 domainTypeHash = toDomainTypeHash(fields);\n\n        assembly (\"memory-safe\") {\n            // align fields to the right for easy processing\n            fields := shr(248, fields)\n\n            // FMP used as scratch space\n            let fmp := mload(0x40)\n            mstore(fmp, domainTypeHash)\n\n            let ptr := add(fmp, 0x20)\n            if and(fields, 0x01) {\n                mstore(ptr, nameHash)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x02) {\n                mstore(ptr, versionHash)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x04) {\n                mstore(ptr, chainId)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x08) {\n                mstore(ptr, verifyingContract)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x10) {\n                mstore(ptr, salt)\n                ptr := add(ptr, 0x20)\n            }\n\n            hash := keccak256(fmp, sub(ptr, fmp))\n        }\n    }\n\n    /// @dev Builds an EIP-712 domain type hash depending on the `fields` provided, following https://eips.ethereum.org/EIPS/eip-5267[ERC-5267]\n    function toDomainTypeHash(bytes1 fields) internal pure returns (bytes32 hash) {\n        if (fields & 0x20 == 0x20) revert ERC5267ExtensionsNotSupported();\n\n        assembly (\"memory-safe\") {\n            // align fields to the right for easy processing\n            fields := shr(248, fields)\n\n            // FMP used as scratch space\n            let fmp := mload(0x40)\n            mstore(fmp, \"EIP712Domain(\")\n\n            let ptr := add(fmp, 0x0d)\n            // name field\n            if and(fields, 0x01) {\n                mstore(ptr, \"string name,\")\n                ptr := add(ptr, 0x0c)\n            }\n            // version field\n            if and(fields, 0x02) {\n                mstore(ptr, \"string version,\")\n                ptr := add(ptr, 0x0f)\n            }\n            // chainId field\n            if and(fields, 0x04) {\n                mstore(ptr, \"uint256 chainId,\")\n                ptr := add(ptr, 0x10)\n            }\n            // verifyingContract field\n            if and(fields, 0x08) {\n                mstore(ptr, \"address verifyingContract,\")\n                ptr := add(ptr, 0x1a)\n            }\n            // salt field\n            if and(fields, 0x10) {\n                mstore(ptr, \"bytes32 salt,\")\n                ptr := add(ptr, 0x0d)\n            }\n            // if any field is enabled, remove the trailing comma\n            ptr := sub(ptr, iszero(iszero(and(fields, 0x1f))))\n            // add the closing brace\n            mstore8(ptr, 0x29) // add closing brace\n            ptr := add(ptr, 1)\n\n            hash := keccak256(fmp, sub(ptr, fmp))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC5267.sol)\n\npragma solidity >=0.4.16;\n\ninterface IERC5267 {\n    /**\n     * @dev MAY be emitted to signal that the domain could have changed.\n     */\n    event EIP712DomainChanged();\n\n    /**\n     * @dev returns the fields and values that describe the domain separator used by this contract for EIP-712\n     * signature.\n     */\n    function eip712Domain()\n        external\n        view\n        returns (\n            bytes1 fields,\n            string memory name,\n            string memory version,\n            uint256 chainId,\n            address verifyingContract,\n            bytes32 salt,\n            uint256[] memory extensions\n        );\n}\n"},"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (access/extensions/IAccessControlEnumerable.sol)\n\npragma solidity >=0.8.4;\n\nimport {IAccessControl} from \"../IAccessControl.sol\";\n\n/**\n * @dev External interface of AccessControlEnumerable declared to support ERC-165 detection.\n */\ninterface IAccessControlEnumerable is IAccessControl {\n    /**\n     * @dev Returns one of the accounts that have `role`. `index` must be a\n     * value between 0 and {getRoleMemberCount}, non-inclusive.\n     *\n     * Role bearers are not sorted in any particular way, and their ordering may\n     * change at any point.\n     *\n     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n     * you perform all queries on the same block. See the following\n     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n     * for more information.\n     */\n    function getRoleMember(bytes32 role, uint256 index) external view returns (address);\n\n    /**\n     * @dev Returns the number of accounts that have `role`. Can be used\n     * together with {getRoleMember} to enumerate all bearers of a role.\n     */\n    function getRoleMemberCount(bytes32 role) external view returns (uint256);\n}\n"},"node_modules/@openzeppelin/contracts/access/IAccessControl.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (access/IAccessControl.sol)\n\npragma solidity >=0.8.4;\n\n/**\n * @dev External interface of AccessControl declared to support ERC-165 detection.\n */\ninterface IAccessControl {\n    /**\n     * @dev The `account` is missing a role.\n     */\n    error AccessControlUnauthorizedAccount(address account, bytes32 neededRole);\n\n    /**\n     * @dev The caller of a function is not the expected one.\n     *\n     * NOTE: Don't confuse with {AccessControlUnauthorizedAccount}.\n     */\n    error AccessControlBadConfirmation();\n\n    /**\n     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`\n     *\n     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite\n     * {RoleAdminChanged} not being emitted to signal this.\n     */\n    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);\n\n    /**\n     * @dev Emitted when `account` is granted `role`.\n     *\n     * `sender` is the account that originated the contract call. This account bears the admin role (for the granted role).\n     * Expected in cases where the role was granted using the internal {AccessControl-_grantRole}.\n     */\n    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);\n\n    /**\n     * @dev Emitted when `account` is revoked `role`.\n     *\n     * `sender` is the account that originated the contract call:\n     *   - if using `revokeRole`, it is the admin role bearer\n     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)\n     */\n    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);\n\n    /**\n     * @dev Returns `true` if `account` has been granted `role`.\n     */\n    function hasRole(bytes32 role, address account) external view returns (bool);\n\n    /**\n     * @dev Returns the admin role that controls `role`. See {grantRole} and\n     * {revokeRole}.\n     *\n     * To change a role's admin, use {AccessControl-_setRoleAdmin}.\n     */\n    function getRoleAdmin(bytes32 role) external view returns (bytes32);\n\n    /**\n     * @dev Grants `role` to `account`.\n     *\n     * If `account` had not been already granted `role`, emits a {RoleGranted}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     */\n    function grantRole(bytes32 role, address account) external;\n\n    /**\n     * @dev Revokes `role` from `account`.\n     *\n     * If `account` had been granted `role`, emits a {RoleRevoked} event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     */\n    function revokeRole(bytes32 role, address account) external;\n\n    /**\n     * @dev Revokes `role` from the calling account.\n     *\n     * Roles are often managed via {grantRole} and {revokeRole}: this function's\n     * purpose is to provide a mechanism for accounts to lose their privileges\n     * if they are compromised (such as when a trusted device is misplaced).\n     *\n     * If the calling account had been granted `role`, emits a {RoleRevoked}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must be `callerConfirmation`.\n     */\n    function renounceRole(bytes32 role, address callerConfirmation) external;\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/ERC165.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC165} from \"@openzeppelin/contracts/utils/introspection/IERC165.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the {IERC165} interface.\n *\n * Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check\n * for the additional interface id that will be supported. For example:\n *\n * ```solidity\n * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);\n * }\n * ```\n */\nabstract contract ERC165Upgradeable is Initializable, IERC165 {\n    function __ERC165_init() internal onlyInitializing {\n    }\n\n    function __ERC165_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc IERC165\n    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {\n        return interfaceId == type(IERC165).interfaceId;\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/IERC165.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-165 standard, as defined in the\n * https://eips.ethereum.org/EIPS/eip-165[ERC].\n *\n * Implementers can declare support of contract interfaces, which can then be\n * queried by others ({ERC165Checker}).\n *\n * For an implementation, see {ERC165}.\n */\ninterface IERC165 {\n    /**\n     * @dev Returns true if this contract implements the interface defined by\n     * `interfaceId`. See the corresponding\n     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]\n     * to learn more about how these ids are created.\n     *\n     * This function call must use less than 30 000 gas.\n     */\n    function supportsInterface(bytes4 interfaceId) external view returns (bool);\n}\n"},"node_modules/@openzeppelin/contracts/utils/Arrays.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Arrays.sol)\n// This file was procedurally generated from scripts/generate/templates/Arrays.js.\n\npragma solidity ^0.8.24;\n\nimport {Comparators} from \"./Comparators.sol\";\nimport {SlotDerivation} from \"./SlotDerivation.sol\";\nimport {StorageSlot} from \"./StorageSlot.sol\";\nimport {Math} from \"./math/Math.sol\";\n\n/**\n * @dev Collection of functions related to array types.\n */\nlibrary Arrays {\n    using SlotDerivation for bytes32;\n    using StorageSlot for bytes32;\n\n    /**\n     * @dev Sort an array of uint256 (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        uint256[] memory array,\n        function(uint256, uint256) pure returns (bool) comp\n    ) internal pure returns (uint256[] memory) {\n        _quickSort(_begin(array), _end(array), comp);\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of uint256 in increasing order.\n     */\n    function sort(uint256[] memory array) internal pure returns (uint256[] memory) {\n        sort(array, Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Sort an array of address (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        address[] memory array,\n        function(address, address) pure returns (bool) comp\n    ) internal pure returns (address[] memory) {\n        sort(_castToUint256Array(array), _castToUint256Comp(comp));\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of address in increasing order.\n     */\n    function sort(address[] memory array) internal pure returns (address[] memory) {\n        sort(_castToUint256Array(array), Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Sort an array of bytes32 (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        bytes32[] memory array,\n        function(bytes32, bytes32) pure returns (bool) comp\n    ) internal pure returns (bytes32[] memory) {\n        sort(_castToUint256Array(array), _castToUint256Comp(comp));\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of bytes32 in increasing order.\n     */\n    function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {\n        sort(_castToUint256Array(array), Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops\n     * at end (exclusive). Sorting follows the `comp` comparator.\n     *\n     * Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.\n     *\n     * IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should\n     * be used only if the limits are within a memory array.\n     */\n    function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {\n        unchecked {\n            if (end - begin < 0x40) return;\n\n            // Use first element as pivot\n            uint256 pivot = _mload(begin);\n            // Position where the pivot should be at the end of the loop\n            uint256 pos = begin;\n\n            for (uint256 it = begin + 0x20; it < end; it += 0x20) {\n                if (comp(_mload(it), pivot)) {\n                    // If the value stored at the iterator's position comes before the pivot, we increment the\n                    // position of the pivot and move the value there.\n                    pos += 0x20;\n                    _swap(pos, it);\n                }\n            }\n\n            _swap(begin, pos); // Swap pivot into place\n            _quickSort(begin, pos, comp); // Sort the left side of the pivot\n            _quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot\n        }\n    }\n\n    /**\n     * @dev Pointer to the memory location of the first element of `array`.\n     */\n    function _begin(uint256[] memory array) private pure returns (uint256 ptr) {\n        assembly (\"memory-safe\") {\n            ptr := add(array, 0x20)\n        }\n    }\n\n    /**\n     * @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word\n     * that comes just after the last element of the array.\n     */\n    function _end(uint256[] memory array) private pure returns (uint256 ptr) {\n        unchecked {\n            return _begin(array) + array.length * 0x20;\n        }\n    }\n\n    /**\n     * @dev Load memory word (as a uint256) at location `ptr`.\n     */\n    function _mload(uint256 ptr) private pure returns (uint256 value) {\n        assembly {\n            value := mload(ptr)\n        }\n    }\n\n    /**\n     * @dev Swaps the elements memory location `ptr1` and `ptr2`.\n     */\n    function _swap(uint256 ptr1, uint256 ptr2) private pure {\n        assembly {\n            let value1 := mload(ptr1)\n            let value2 := mload(ptr2)\n            mstore(ptr1, value2)\n            mstore(ptr2, value1)\n        }\n    }\n\n    /// @dev Helper: low level cast address memory array to uint256 memory array\n    function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast bytes32 memory array to uint256 memory array\n    function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast address comp function to uint256 comp function\n    function _castToUint256Comp(\n        function(address, address) pure returns (bool) input\n    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast bytes32 comp function to uint256 comp function\n    function _castToUint256Comp(\n        function(bytes32, bytes32) pure returns (bool) input\n    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /**\n     * @dev Searches a sorted `array` and returns the first index that contains\n     * a value greater or equal to `element`. If no such index exists (i.e. all\n     * values in the array are strictly less than `element`), the array length is\n     * returned. Time complexity O(log n).\n     *\n     * NOTE: The `array` is expected to be sorted in ascending order, and to\n     * contain no repeated elements.\n     *\n     * IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks\n     * support for repeated elements in the array. The {lowerBound} function should\n     * be used instead.\n     */\n    function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value > element) {\n                high = mid;\n            } else {\n                low = mid + 1;\n            }\n        }\n\n        // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.\n        if (low > 0 && unsafeAccess(array, low - 1).value == element) {\n            return low - 1;\n        } else {\n            return low;\n        }\n    }\n\n    /**\n     * @dev Searches an `array` sorted in ascending order and returns the first\n     * index that contains a value greater or equal than `element`. If no such index\n     * exists (i.e. all values in the array are strictly less than `element`), the array\n     * length is returned. Time complexity O(log n).\n     *\n     * See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].\n     */\n    function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value < element) {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            } else {\n                high = mid;\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Searches an `array` sorted in ascending order and returns the first\n     * index that contains a value strictly greater than `element`. If no such index\n     * exists (i.e. all values in the array are strictly less than `element`), the array\n     * length is returned. Time complexity O(log n).\n     *\n     * See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].\n     */\n    function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value > element) {\n                high = mid;\n            } else {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Same as {lowerBound}, but with an array in memory.\n     */\n    function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeMemoryAccess(array, mid) < element) {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            } else {\n                high = mid;\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Same as {upperBound}, but with an array in memory.\n     */\n    function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeMemoryAccess(array, mid) > element) {\n                high = mid;\n            } else {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new address array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(address[] memory array, uint256 start) internal pure returns (address[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new address array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(address[] memory array, uint256 start, uint256 end) internal pure returns (address[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        address[] memory result = new address[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new bytes32 array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes32[] memory array, uint256 start) internal pure returns (bytes32[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new bytes32 array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes32[] memory array, uint256 start, uint256 end) internal pure returns (bytes32[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        bytes32[] memory result = new bytes32[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new uint256 array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(uint256[] memory array, uint256 start) internal pure returns (uint256[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new uint256 array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(uint256[] memory array, uint256 start, uint256 end) internal pure returns (uint256[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        uint256[] memory result = new uint256[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(address[] memory array, uint256 start) internal pure returns (address[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(address[] memory array, uint256 start, uint256 end) internal pure returns (address[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        address[] memory array,\n        uint256 pos,\n        address[] memory replacement\n    ) internal pure returns (address[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        address[] memory array,\n        uint256 pos,\n        address[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (address[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(bytes32[] memory array, uint256 start) internal pure returns (bytes32[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(bytes32[] memory array, uint256 start, uint256 end) internal pure returns (bytes32[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        bytes32[] memory array,\n        uint256 pos,\n        bytes32[] memory replacement\n    ) internal pure returns (bytes32[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        bytes32[] memory array,\n        uint256 pos,\n        bytes32[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (bytes32[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(uint256[] memory array, uint256 start) internal pure returns (uint256[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(uint256[] memory array, uint256 start, uint256 end) internal pure returns (uint256[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        uint256[] memory array,\n        uint256 pos,\n        uint256[] memory replacement\n    ) internal pure returns (uint256[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        uint256[] memory array,\n        uint256 pos,\n        uint256[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (uint256[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getAddressSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getBytes32Slot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getUint256Slot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(bytes[] storage arr, uint256 pos) internal pure returns (StorageSlot.BytesSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getBytesSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(string[] storage arr, uint256 pos) internal pure returns (StorageSlot.StringSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getStringSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(bytes[] memory arr, uint256 pos) internal pure returns (bytes memory res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(string[] memory arr, uint256 pos) internal pure returns (string memory res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(address[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(bytes32[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(uint256[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(bytes[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(string[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/Math.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/Math.sol)\n\npragma solidity ^0.8.20;\n\nimport {Panic} from \"../Panic.sol\";\nimport {SafeCast} from \"./SafeCast.sol\";\n\n/**\n * @dev Standard math utilities missing in the Solidity language.\n */\nlibrary Math {\n    enum Rounding {\n        Floor, // Toward negative infinity\n        Ceil, // Toward positive infinity\n        Trunc, // Toward zero\n        Expand // Away from zero\n    }\n\n    /**\n     * @dev Return the 512-bit addition of two uint256.\n     *\n     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.\n     */\n    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {\n        assembly (\"memory-safe\") {\n            low := add(a, b)\n            high := lt(low, a)\n        }\n    }\n\n    /**\n     * @dev Return the 512-bit multiplication of two uint256.\n     *\n     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.\n     */\n    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {\n        // 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use\n        // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256\n        // variables such that product = high * 2²⁵⁶ + low.\n        assembly (\"memory-safe\") {\n            let mm := mulmod(a, b, not(0))\n            low := mul(a, b)\n            high := sub(sub(mm, low), lt(mm, low))\n        }\n    }\n\n    /**\n     * @dev Returns the addition of two unsigned integers, with a success flag (no overflow).\n     */\n    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a + b;\n            success = c >= a;\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).\n     */\n    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a - b;\n            success = c <= a;\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).\n     */\n    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a * b;\n            assembly (\"memory-safe\") {\n                // Only true when the multiplication doesn't overflow\n                // (c / a == b) || (a == 0)\n                success := or(eq(div(c, a), b), iszero(a))\n            }\n            // equivalent to: success ? c : 0\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).\n     */\n    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            success = b > 0;\n            assembly (\"memory-safe\") {\n                // The `DIV` opcode returns zero when the denominator is 0.\n                result := div(a, b)\n            }\n        }\n    }\n\n    /**\n     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).\n     */\n    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            success = b > 0;\n            assembly (\"memory-safe\") {\n                // The `MOD` opcode returns zero when the denominator is 0.\n                result := mod(a, b)\n            }\n        }\n    }\n\n    /**\n     * @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.\n     */\n    function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {\n        (bool success, uint256 result) = tryAdd(a, b);\n        return ternary(success, result, type(uint256).max);\n    }\n\n    /**\n     * @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.\n     */\n    function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {\n        (, uint256 result) = trySub(a, b);\n        return result;\n    }\n\n    /**\n     * @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.\n     */\n    function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {\n        (bool success, uint256 result) = tryMul(a, b);\n        return ternary(success, result, type(uint256).max);\n    }\n\n    /**\n     * @dev Branchless ternary evaluation for `condition ? a : b`. Gas costs are constant.\n     *\n     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.\n     * However, the compiler may optimize Solidity ternary operations (i.e. `condition ? a : b`) to only compute\n     * one branch when needed, making this function more expensive.\n     */\n    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {\n        unchecked {\n            // branchless ternary works because:\n            // b ^ (a ^ b) == a\n            // b ^ 0 == b\n            return b ^ ((a ^ b) * SafeCast.toUint(condition));\n        }\n    }\n\n    /**\n     * @dev Returns the largest of two numbers.\n     */\n    function max(uint256 a, uint256 b) internal pure returns (uint256) {\n        return ternary(a > b, a, b);\n    }\n\n    /**\n     * @dev Returns the smallest of two numbers.\n     */\n    function min(uint256 a, uint256 b) internal pure returns (uint256) {\n        return ternary(a < b, a, b);\n    }\n\n    /**\n     * @dev Returns the average of two numbers. The result is rounded towards\n     * zero.\n     */\n    function average(uint256 a, uint256 b) internal pure returns (uint256) {\n        unchecked {\n            // (a + b) / 2 can overflow.\n            return (a & b) + (a ^ b) / 2;\n        }\n    }\n\n    /**\n     * @dev Returns the ceiling of the division of two numbers.\n     *\n     * This differs from standard division with `/` in that it rounds towards infinity instead\n     * of rounding towards zero.\n     */\n    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\n        if (b == 0) {\n            // Guarantee the same behavior as in a regular Solidity division.\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n\n        // The following calculation ensures accurate ceiling division without overflow.\n        // Since a is non-zero, (a - 1) / b will not overflow.\n        // The largest possible result occurs when (a - 1) / b is type(uint256).max,\n        // but the largest value we can obtain is type(uint256).max - 1, which happens\n        // when a = type(uint256).max and b = 1.\n        unchecked {\n            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);\n        }\n    }\n\n    /**\n     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or\n     * denominator == 0.\n     *\n     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by\n     * Uniswap Labs also under MIT license.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {\n        unchecked {\n            (uint256 high, uint256 low) = mul512(x, y);\n\n            // Handle non-overflow cases, 256 by 256 division.\n            if (high == 0) {\n                // Solidity will revert if denominator == 0, unlike the div opcode on its own.\n                // The surrounding unchecked block does not change this fact.\n                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.\n                return low / denominator;\n            }\n\n            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.\n            if (denominator <= high) {\n                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));\n            }\n\n            ///////////////////////////////////////////////\n            // 512 by 256 division.\n            ///////////////////////////////////////////////\n\n            // Make division exact by subtracting the remainder from [high low].\n            uint256 remainder;\n            assembly (\"memory-safe\") {\n                // Compute remainder using mulmod.\n                remainder := mulmod(x, y, denominator)\n\n                // Subtract 256 bit number from 512 bit number.\n                high := sub(high, gt(remainder, low))\n                low := sub(low, remainder)\n            }\n\n            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.\n            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.\n\n            uint256 twos = denominator & (0 - denominator);\n            assembly (\"memory-safe\") {\n                // Divide denominator by twos.\n                denominator := div(denominator, twos)\n\n                // Divide [high low] by twos.\n                low := div(low, twos)\n\n                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.\n                twos := add(div(sub(0, twos), twos), 1)\n            }\n\n            // Shift in bits from high into low.\n            low |= high * twos;\n\n            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such\n            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for\n            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.\n            uint256 inverse = (3 * denominator) ^ 2;\n\n            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also\n            // works in modular arithmetic, doubling the correct bits in each step.\n            inverse *= 2 - denominator * inverse; // inverse mod 2⁸\n            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶\n            inverse *= 2 - denominator * inverse; // inverse mod 2³²\n            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴\n            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸\n            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶\n\n            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.\n            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is\n            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and high\n            // is no longer required.\n            result = low * inverse;\n            return result;\n        }\n    }\n\n    /**\n     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {\n        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);\n    }\n\n    /**\n     * @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.\n     */\n    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {\n        unchecked {\n            (uint256 high, uint256 low) = mul512(x, y);\n            if (high >= 1 << n) {\n                Panic.panic(Panic.UNDER_OVERFLOW);\n            }\n            return (high << (256 - n)) | (low >> n);\n        }\n    }\n\n    /**\n     * @dev Calculates x * y >> n with full precision, following the selected rounding direction.\n     */\n    function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {\n        return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 0);\n    }\n\n    /**\n     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.\n     *\n     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.\n     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.\n     *\n     * If the input value is not inversible, 0 is returned.\n     *\n     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the\n     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.\n     */\n    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {\n        unchecked {\n            if (n == 0) return 0;\n\n            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)\n            // Used to compute integers x and y such that: ax + ny = gcd(a, n).\n            // When the gcd is 1, then the inverse of a modulo n exists and it's x.\n            // ax + ny = 1\n            // ax = 1 + (-y)n\n            // ax ≡ 1 (mod n) # x is the inverse of a modulo n\n\n            // If the remainder is 0 the gcd is n right away.\n            uint256 remainder = a % n;\n            uint256 gcd = n;\n\n            // Therefore the initial coefficients are:\n            // ax + ny = gcd(a, n) = n\n            // 0a + 1n = n\n            int256 x = 0;\n            int256 y = 1;\n\n            while (remainder != 0) {\n                uint256 quotient = gcd / remainder;\n\n                (gcd, remainder) = (\n                    // The old remainder is the next gcd to try.\n                    remainder,\n                    // Compute the next remainder.\n                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd\n                    // where gcd is at most n (capped to type(uint256).max)\n                    gcd - remainder * quotient\n                );\n\n                (x, y) = (\n                    // Increment the coefficient of a.\n                    y,\n                    // Decrement the coefficient of n.\n                    // Can overflow, but the result is casted to uint256 so that the\n                    // next value of y is \"wrapped around\" to a value between 0 and n - 1.\n                    x - y * int256(quotient)\n                );\n            }\n\n            if (gcd != 1) return 0; // No inverse exists.\n            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.\n        }\n    }\n\n    /**\n     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.\n     *\n     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is\n     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that\n     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.\n     *\n     * NOTE: this function does NOT check that `p` is a prime greater than `2`.\n     */\n    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {\n        unchecked {\n            return Math.modExp(a, p - 2, p);\n        }\n    }\n\n    /**\n     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)\n     *\n     * Requirements:\n     * - modulus can't be zero\n     * - underlying staticcall to precompile must succeed\n     *\n     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make\n     * sure the chain you're using it on supports the precompiled contract for modular exponentiation\n     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,\n     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly\n     * interpreted as 0.\n     */\n    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {\n        (bool success, uint256 result) = tryModExp(b, e, m);\n        if (!success) {\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n        return result;\n    }\n\n    /**\n     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).\n     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying\n     * to operate modulo 0 or if the underlying precompile reverted.\n     *\n     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain\n     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in\n     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack\n     * of a revert, but the result may be incorrectly interpreted as 0.\n     */\n    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {\n        if (m == 0) return (false, 0);\n        assembly (\"memory-safe\") {\n            let ptr := mload(0x40)\n            // | Offset    | Content    | Content (Hex)                                                      |\n            // |-----------|------------|--------------------------------------------------------------------|\n            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x60:0x7f | value of b | 0x<.............................................................b> |\n            // | 0x80:0x9f | value of e | 0x<.............................................................e> |\n            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |\n            mstore(ptr, 0x20)\n            mstore(add(ptr, 0x20), 0x20)\n            mstore(add(ptr, 0x40), 0x20)\n            mstore(add(ptr, 0x60), b)\n            mstore(add(ptr, 0x80), e)\n            mstore(add(ptr, 0xa0), m)\n\n            // Given the result < m, it's guaranteed to fit in 32 bytes,\n            // so we can use the memory scratch space located at offset 0.\n            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)\n            result := mload(0x00)\n        }\n    }\n\n    /**\n     * @dev Variant of {modExp} that supports inputs of arbitrary length.\n     */\n    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {\n        (bool success, bytes memory result) = tryModExp(b, e, m);\n        if (!success) {\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n        return result;\n    }\n\n    /**\n     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.\n     */\n    function tryModExp(\n        bytes memory b,\n        bytes memory e,\n        bytes memory m\n    ) internal view returns (bool success, bytes memory result) {\n        if (_zeroBytes(m)) return (false, new bytes(0));\n\n        uint256 mLen = m.length;\n\n        // Encode call args in result and move the free memory pointer\n        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);\n\n        assembly (\"memory-safe\") {\n            let dataPtr := add(result, 0x20)\n            // Write result on top of args to avoid allocating extra memory.\n            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)\n            // Overwrite the length.\n            // result.length > returndatasize() is guaranteed because returndatasize() == m.length\n            mstore(result, mLen)\n            // Set the memory pointer after the returned data.\n            mstore(0x40, add(dataPtr, mLen))\n        }\n    }\n\n    /**\n     * @dev Returns whether the provided byte array is zero.\n     */\n    function _zeroBytes(bytes memory buffer) private pure returns (bool) {\n        uint256 chunk;\n        for (uint256 i = 0; i < buffer.length; i += 0x20) {\n            // See _unsafeReadBytesOffset from utils/Bytes.sol\n            assembly (\"memory-safe\") {\n                chunk := mload(add(add(buffer, 0x20), i))\n            }\n            if (chunk >> (8 * saturatingSub(i + 0x20, buffer.length)) != 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    /**\n     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded\n     * towards zero.\n     *\n     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only\n     * using integer operations.\n     */\n    function sqrt(uint256 a) internal pure returns (uint256) {\n        unchecked {\n            // Take care of easy edge cases when a == 0 or a == 1\n            if (a <= 1) {\n                return a;\n            }\n\n            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a\n            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between\n            // the current value as `ε_n = | x_n - sqrt(a) |`.\n            //\n            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root\n            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is\n            // bigger than any uint256.\n            //\n            // By noticing that\n            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`\n            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar\n            // to the msb function.\n            uint256 aa = a;\n            uint256 xn = 1;\n\n            if (aa >= (1 << 128)) {\n                aa >>= 128;\n                xn <<= 64;\n            }\n            if (aa >= (1 << 64)) {\n                aa >>= 64;\n                xn <<= 32;\n            }\n            if (aa >= (1 << 32)) {\n                aa >>= 32;\n                xn <<= 16;\n            }\n            if (aa >= (1 << 16)) {\n                aa >>= 16;\n                xn <<= 8;\n            }\n            if (aa >= (1 << 8)) {\n                aa >>= 8;\n                xn <<= 4;\n            }\n            if (aa >= (1 << 4)) {\n                aa >>= 4;\n                xn <<= 2;\n            }\n            if (aa >= (1 << 2)) {\n                xn <<= 1;\n            }\n\n            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).\n            //\n            // We can refine our estimation by noticing that the middle of that interval minimizes the error.\n            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).\n            // This is going to be our x_0 (and ε_0)\n            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)\n\n            // From here, Newton's method give us:\n            // x_{n+1} = (x_n + a / x_n) / 2\n            //\n            // One should note that:\n            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a\n            //              = ((x_n² + a) / (2 * x_n))² - a\n            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a\n            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)\n            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)\n            //              = (x_n² - a)² / (2 * x_n)²\n            //              = ((x_n² - a) / (2 * x_n))²\n            //              ≥ 0\n            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n\n            //\n            // This gives us the proof of quadratic convergence of the sequence:\n            // ε_{n+1} = | x_{n+1} - sqrt(a) |\n            //         = | (x_n + a / x_n) / 2 - sqrt(a) |\n            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |\n            //         = | (x_n - sqrt(a))² / (2 * x_n) |\n            //         = | ε_n² / (2 * x_n) |\n            //         = ε_n² / | (2 * x_n) |\n            //\n            // For the first iteration, we have a special case where x_0 is known:\n            // ε_1 = ε_0² / | (2 * x_0) |\n            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))\n            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))\n            //     ≤ 2**(e-3) / 3\n            //     ≤ 2**(e-3-log2(3))\n            //     ≤ 2**(e-4.5)\n            //\n            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:\n            // ε_{n+1} = ε_n² / | (2 * x_n) |\n            //         ≤ (2**(e-k))² / (2 * 2**(e-1))\n            //         ≤ 2**(2*e-2*k) / 2**e\n            //         ≤ 2**(e-2*k)\n            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above\n            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5\n            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9\n            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18\n            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36\n            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72\n\n            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision\n            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either\n            // sqrt(a) or sqrt(a) + 1.\n            return xn - SafeCast.toUint(xn > a / xn);\n        }\n    }\n\n    /**\n     * @dev Calculates sqrt(a), following the selected rounding direction.\n     */\n    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = sqrt(a);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 2 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 x) internal pure returns (uint256 r) {\n        // If value has upper 128 bits set, log2 result is at least 128\n        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;\n        // If upper 64 bits of 128-bit half set, add 64 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;\n        // If upper 32 bits of 64-bit half set, add 32 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;\n        // If upper 16 bits of 32-bit half set, add 16 to result\n        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;\n        // If upper 8 bits of 16-bit half set, add 8 to result\n        r |= SafeCast.toUint((x >> r) > 0xff) << 3;\n        // If upper 4 bits of 8-bit half set, add 4 to result\n        r |= SafeCast.toUint((x >> r) > 0xf) << 2;\n\n        // Shifts value right by the current result and use it as an index into this lookup table:\n        //\n        // | x (4 bits) |  index  | table[index] = MSB position |\n        // |------------|---------|-----------------------------|\n        // |    0000    |    0    |        table[0] = 0         |\n        // |    0001    |    1    |        table[1] = 0         |\n        // |    0010    |    2    |        table[2] = 1         |\n        // |    0011    |    3    |        table[3] = 1         |\n        // |    0100    |    4    |        table[4] = 2         |\n        // |    0101    |    5    |        table[5] = 2         |\n        // |    0110    |    6    |        table[6] = 2         |\n        // |    0111    |    7    |        table[7] = 2         |\n        // |    1000    |    8    |        table[8] = 3         |\n        // |    1001    |    9    |        table[9] = 3         |\n        // |    1010    |   10    |        table[10] = 3        |\n        // |    1011    |   11    |        table[11] = 3        |\n        // |    1100    |   12    |        table[12] = 3        |\n        // |    1101    |   13    |        table[13] = 3        |\n        // |    1110    |   14    |        table[14] = 3        |\n        // |    1111    |   15    |        table[15] = 3        |\n        //\n        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the first 16 bytes (most significant half).\n        assembly (\"memory-safe\") {\n            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))\n        }\n    }\n\n    /**\n     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log2(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 10 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value) internal pure returns (uint256) {\n        uint256 result = 0;\n        unchecked {\n            if (value >= 10 ** 64) {\n                value /= 10 ** 64;\n                result += 64;\n            }\n            if (value >= 10 ** 32) {\n                value /= 10 ** 32;\n                result += 32;\n            }\n            if (value >= 10 ** 16) {\n                value /= 10 ** 16;\n                result += 16;\n            }\n            if (value >= 10 ** 8) {\n                value /= 10 ** 8;\n                result += 8;\n            }\n            if (value >= 10 ** 4) {\n                value /= 10 ** 4;\n                result += 4;\n            }\n            if (value >= 10 ** 2) {\n                value /= 10 ** 2;\n                result += 2;\n            }\n            if (value >= 10 ** 1) {\n                result += 1;\n            }\n        }\n        return result;\n    }\n\n    /**\n     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log10(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 256 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     *\n     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.\n     */\n    function log256(uint256 x) internal pure returns (uint256 r) {\n        // If value has upper 128 bits set, log2 result is at least 128\n        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;\n        // If upper 64 bits of 128-bit half set, add 64 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;\n        // If upper 32 bits of 64-bit half set, add 32 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;\n        // If upper 16 bits of 32-bit half set, add 16 to result\n        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;\n        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8\n        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);\n    }\n\n    /**\n     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log256(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);\n        }\n    }\n\n    /**\n     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.\n     */\n    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {\n        return uint8(rounding) % 2 == 1;\n    }\n\n    /**\n     * @dev Counts the number of leading zero bits in a uint256.\n     */\n    function clz(uint256 x) internal pure returns (uint256) {\n        return ternary(x == 0, 256, 255 - log2(x));\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Strings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Strings.sol)\n\npragma solidity ^0.8.24;\n\nimport {Math} from \"./math/Math.sol\";\nimport {SafeCast} from \"./math/SafeCast.sol\";\nimport {SignedMath} from \"./math/SignedMath.sol\";\nimport {Bytes} from \"./Bytes.sol\";\n\n/**\n * @dev String operations.\n */\nlibrary Strings {\n    using SafeCast for *;\n\n    bytes16 private constant HEX_DIGITS = \"0123456789abcdef\";\n    uint8 private constant ADDRESS_LENGTH = 20;\n    uint256 private constant SPECIAL_CHARS_LOOKUP =\n        0xffffffff | // first 32 bits corresponding to the control characters (U+0000 to U+001F)\n            (1 << 0x22) | // double quote\n            (1 << 0x5c); // backslash\n\n    /**\n     * @dev The `value` string doesn't fit in the specified `length`.\n     */\n    error StringsInsufficientHexLength(uint256 value, uint256 length);\n\n    /**\n     * @dev The string being parsed contains characters that are not in scope of the given base.\n     */\n    error StringsInvalidChar();\n\n    /**\n     * @dev The string being parsed is not a properly formatted address.\n     */\n    error StringsInvalidAddressFormat();\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` decimal representation.\n     */\n    function toString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            uint256 length = Math.log10(value) + 1;\n            string memory buffer = new string(length);\n            uint256 ptr;\n            assembly (\"memory-safe\") {\n                ptr := add(add(buffer, 0x20), length)\n            }\n            while (true) {\n                ptr--;\n                assembly (\"memory-safe\") {\n                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))\n                }\n                value /= 10;\n                if (value == 0) break;\n            }\n            return buffer;\n        }\n    }\n\n    /**\n     * @dev Converts a `int256` to its ASCII `string` decimal representation.\n     */\n    function toStringSigned(int256 value) internal pure returns (string memory) {\n        return string.concat(value < 0 ? \"-\" : \"\", toString(SignedMath.abs(value)));\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.\n     */\n    function toHexString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            return toHexString(value, Math.log256(value) + 1);\n        }\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.\n     */\n    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {\n        uint256 localValue = value;\n        bytes memory buffer = new bytes(2 * length + 2);\n        buffer[0] = \"0\";\n        buffer[1] = \"x\";\n        for (uint256 i = 2 * length + 1; i > 1; --i) {\n            buffer[i] = HEX_DIGITS[localValue & 0xf];\n            localValue >>= 4;\n        }\n        if (localValue != 0) {\n            revert StringsInsufficientHexLength(value, length);\n        }\n        return string(buffer);\n    }\n\n    /**\n     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal\n     * representation.\n     */\n    function toHexString(address addr) internal pure returns (string memory) {\n        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);\n    }\n\n    /**\n     * @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal\n     * representation, according to EIP-55.\n     */\n    function toChecksumHexString(address addr) internal pure returns (string memory) {\n        bytes memory buffer = bytes(toHexString(addr));\n\n        // hash the hex part of buffer (skip length + 2 bytes, length 40)\n        uint256 hashValue;\n        assembly (\"memory-safe\") {\n            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))\n        }\n\n        for (uint256 i = 41; i > 1; --i) {\n            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)\n            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {\n                // case shift by xoring with 0x20\n                buffer[i] ^= 0x20;\n            }\n            hashValue >>= 4;\n        }\n        return string(buffer);\n    }\n\n    /**\n     * @dev Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.\n     */\n    function toHexString(bytes memory input) internal pure returns (string memory) {\n        unchecked {\n            bytes memory buffer = new bytes(2 * input.length + 2);\n            buffer[0] = \"0\";\n            buffer[1] = \"x\";\n            for (uint256 i = 0; i < input.length; ++i) {\n                uint8 v = uint8(input[i]);\n                buffer[2 * i + 2] = HEX_DIGITS[v >> 4];\n                buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];\n            }\n            return string(buffer);\n        }\n    }\n\n    /**\n     * @dev Returns true if the two strings are equal.\n     */\n    function equal(string memory a, string memory b) internal pure returns (bool) {\n        return Bytes.equal(bytes(a), bytes(b));\n    }\n\n    /**\n     * @dev Parse a decimal string and returns the value as a `uint256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `[0-9]*`\n     * - The result must fit into an `uint256` type\n     */\n    function parseUint(string memory input) internal pure returns (uint256) {\n        return parseUint(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseUint-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `[0-9]*`\n     * - The result must fit into an `uint256` type\n     */\n    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {\n        (bool success, uint256 value) = tryParseUint(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {\n        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid\n     * character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseUint(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, uint256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseUintUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseUint-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseUintUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, uint256 value) {\n        bytes memory buffer = bytes(input);\n\n        uint256 result = 0;\n        for (uint256 i = begin; i < end; ++i) {\n            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (chr > 9) return (false, 0);\n            result *= 10;\n            result += chr;\n        }\n        return (true, result);\n    }\n\n    /**\n     * @dev Parse a decimal string and returns the value as a `int256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `[-+]?[0-9]*`\n     * - The result must fit in an `int256` type.\n     */\n    function parseInt(string memory input) internal pure returns (int256) {\n        return parseInt(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `[-+]?[0-9]*`\n     * - The result must fit in an `int256` type.\n     */\n    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {\n        (bool success, int256 value) = tryParseInt(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if\n     * the result does not fit in a `int256`.\n     *\n     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.\n     */\n    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {\n        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    uint256 private constant ABS_MIN_INT256 = 2 ** 255;\n\n    /**\n     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid\n     * character or if the result does not fit in a `int256`.\n     *\n     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.\n     */\n    function tryParseInt(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, int256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseIntUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseInt-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseIntUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, int256 value) {\n        bytes memory buffer = bytes(input);\n\n        // Check presence of a negative sign.\n        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        bool positiveSign = sign == bytes1(\"+\");\n        bool negativeSign = sign == bytes1(\"-\");\n        uint256 offset = (positiveSign || negativeSign).toUint();\n\n        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);\n\n        if (absSuccess && absValue < ABS_MIN_INT256) {\n            return (true, negativeSign ? -int256(absValue) : int256(absValue));\n        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {\n            return (true, type(int256).min);\n        } else return (false, 0);\n    }\n\n    /**\n     * @dev Parse a hexadecimal string (with or without \"0x\" prefix), and returns the value as a `uint256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`\n     * - The result must fit in an `uint256` type.\n     */\n    function parseHexUint(string memory input) internal pure returns (uint256) {\n        return parseHexUint(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`\n     * - The result must fit in an `uint256` type.\n     */\n    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {\n        (bool success, uint256 value) = tryParseHexUint(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {\n        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an\n     * invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseHexUint(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, uint256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseHexUintUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseHexUint-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseHexUintUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, uint256 value) {\n        bytes memory buffer = bytes(input);\n\n        // skip 0x prefix if present\n        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2(\"0x\"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        uint256 offset = hasPrefix.toUint() * 2;\n\n        uint256 result = 0;\n        for (uint256 i = begin + offset; i < end; ++i) {\n            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (chr > 15) return (false, 0);\n            result *= 16;\n            unchecked {\n                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).\n                // This guarantees that adding a value < 16 will not cause an overflow, hence the unchecked.\n                result += chr;\n            }\n        }\n        return (true, result);\n    }\n\n    /**\n     * @dev Parse a hexadecimal string (with or without \"0x\" prefix), and returns the value as an `address`.\n     *\n     * Requirements:\n     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`\n     */\n    function parseAddress(string memory input) internal pure returns (address) {\n        return parseAddress(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`\n     */\n    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {\n        (bool success, address value) = tryParseAddress(input, begin, end);\n        if (!success) revert StringsInvalidAddressFormat();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly\n     * formatted address. See {parseAddress-string} requirements.\n     */\n    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {\n        return tryParseAddress(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly\n     * formatted address. See {parseAddress-string-uint256-uint256} requirements.\n     */\n    function tryParseAddress(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, address value) {\n        if (end > bytes(input).length || begin > end) return (false, address(0));\n\n        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2(\"0x\"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;\n\n        // check that input is the correct length\n        if (end - begin == expectedLength) {\n            // length guarantees that this does not overflow, and value is at most type(uint160).max\n            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);\n            return (s, address(uint160(v)));\n        } else {\n            return (false, address(0));\n        }\n    }\n\n    function _tryParseChr(bytes1 chr) private pure returns (uint8) {\n        uint8 value = uint8(chr);\n\n        // Try to parse `chr`:\n        // - Case 1: [0-9]\n        // - Case 2: [a-f]\n        // - Case 3: [A-F]\n        // - otherwise not supported\n        unchecked {\n            if (value > 47 && value < 58) value -= 48;\n            else if (value > 96 && value < 103) value -= 87;\n            else if (value > 64 && value < 71) value -= 55;\n            else return type(uint8).max;\n        }\n\n        return value;\n    }\n\n    /**\n     * @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.\n     *\n     * WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.\n     *\n     * NOTE: This function escapes backslashes (including those in \\uXXXX sequences) and the characters in ranges\n     * defined in section 2.5 of RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). All control characters in U+0000\n     * to U+001F are escaped (\\b, \\t, \\n, \\f, \\r use short form; others use \\u00XX). ECMAScript's `JSON.parse` does\n     * recover escaped unicode characters that are not in this range, but other tooling may provide different results.\n     */\n    function escapeJSON(string memory input) internal pure returns (string memory) {\n        bytes memory buffer = bytes(input);\n\n        // Put output at the FMP. Memory will be reserved later when we figure out the actual length of the escaped\n        // string. All write are done using _unsafeWriteBytesOffset, which avoid the (expensive) length checks for\n        // each character written.\n        bytes memory output;\n        assembly (\"memory-safe\") {\n            output := mload(0x40)\n        }\n        uint256 outputLength = 0;\n\n        for (uint256 i = 0; i < buffer.length; ++i) {\n            uint8 char = uint8(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (((SPECIAL_CHARS_LOOKUP & (1 << char)) != 0)) {\n                _unsafeWriteBytesOffset(output, outputLength++, \"\\\\\");\n                if (char == 0x08) _unsafeWriteBytesOffset(output, outputLength++, \"b\");\n                else if (char == 0x09) _unsafeWriteBytesOffset(output, outputLength++, \"t\");\n                else if (char == 0x0a) _unsafeWriteBytesOffset(output, outputLength++, \"n\");\n                else if (char == 0x0c) _unsafeWriteBytesOffset(output, outputLength++, \"f\");\n                else if (char == 0x0d) _unsafeWriteBytesOffset(output, outputLength++, \"r\");\n                else if (char == 0x5c) _unsafeWriteBytesOffset(output, outputLength++, \"\\\\\");\n                else if (char == 0x22) {\n                    // solhint-disable-next-line quotes\n                    _unsafeWriteBytesOffset(output, outputLength++, '\"');\n                } else {\n                    // U+0000 to U+001F without short form: output \\u00XX\n                    _unsafeWriteBytesOffset(output, outputLength++, \"u\");\n                    _unsafeWriteBytesOffset(output, outputLength++, \"0\");\n                    _unsafeWriteBytesOffset(output, outputLength++, \"0\");\n                    _unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char >> 4]);\n                    _unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char & 0x0f]);\n                }\n            } else {\n                _unsafeWriteBytesOffset(output, outputLength++, bytes1(char));\n            }\n        }\n        // write the actual length and reserve memory\n        assembly (\"memory-safe\") {\n            mstore(output, outputLength)\n            mstore(0x40, add(output, add(outputLength, 0x20)))\n        }\n\n        return string(output);\n    }\n\n    /**\n     * @dev Reads a bytes32 from a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            value := mload(add(add(buffer, 0x20), offset))\n        }\n    }\n\n    /**\n     * @dev Write a bytes1 to a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeWriteBytesOffset(bytes memory buffer, uint256 offset, bytes1 value) private pure {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            mstore8(add(add(buffer, 0x20), offset), shr(248, value))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Comparators.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/Comparators.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Provides a set of functions to compare values.\n *\n * _Available since v5.1._\n */\nlibrary Comparators {\n    function lt(uint256 a, uint256 b) internal pure returns (bool) {\n        return a < b;\n    }\n\n    function gt(uint256 a, uint256 b) internal pure returns (bool) {\n        return a > b;\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/SlotDerivation.sol)\n// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots\n * corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by\n * the solidity language / compiler.\n *\n * See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].\n *\n * Example usage:\n * ```solidity\n * contract Example {\n *     // Add the library methods\n *     using StorageSlot for bytes32;\n *     using SlotDerivation for *;\n *\n *     // Declare a namespace\n *     string private constant _NAMESPACE = \"<namespace>\"; // eg. OpenZeppelin.Slot\n *\n *     function setValueInNamespace(uint256 key, address newValue) internal {\n *         _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;\n *     }\n *\n *     function getValueInNamespace(uint256 key) internal view returns (address) {\n *         return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;\n *     }\n * }\n * ```\n *\n * TIP: Consider using this library along with {StorageSlot}.\n *\n * NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking\n * upgrade safety will ignore the slots accessed through this library.\n *\n * _Available since v5.1._\n */\nlibrary SlotDerivation {\n    /**\n     * @dev Derive an ERC-7201 slot from a string (namespace).\n     */\n    function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))\n            slot := and(keccak256(0x00, 0x20), not(0xff))\n        }\n    }\n\n    /**\n     * @dev Add an offset to a slot to get the n-th element of a structure or an array.\n     */\n    function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {\n        unchecked {\n            return bytes32(uint256(slot) + pos);\n        }\n    }\n\n    /**\n     * @dev Derive the location of the first element in an array from the slot where the length is stored.\n     */\n    function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, slot)\n            result := keccak256(0x00, 0x20)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, and(key, shr(96, not(0))))\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, iszero(iszero(key)))\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            let length := mload(key)\n            let begin := add(key, 0x20)\n            let end := add(begin, length)\n            let cache := mload(end)\n            mstore(end, slot)\n            result := keccak256(begin, add(length, 0x20))\n            mstore(end, cache)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            let length := mload(key)\n            let begin := add(key, 0x20)\n            let end := add(begin, length)\n            let cache := mload(end)\n            mstore(end, slot)\n            result := keccak256(begin, add(length, 0x20))\n            mstore(end, cache)\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/StorageSlot.sol)\n// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Library for reading and writing primitive types to specific storage slots.\n *\n * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.\n * This library helps with reading and writing to such slots without the need for inline assembly.\n *\n * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.\n *\n * Example usage to set ERC-1967 implementation slot:\n * ```solidity\n * contract ERC1967 {\n *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.\n *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\n *\n *     function _getImplementation() internal view returns (address) {\n *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;\n *     }\n *\n *     function _setImplementation(address newImplementation) internal {\n *         require(newImplementation.code.length > 0);\n *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;\n *     }\n * }\n * ```\n *\n * TIP: Consider using this library along with {SlotDerivation}.\n */\nlibrary StorageSlot {\n    struct AddressSlot {\n        address value;\n    }\n\n    struct BooleanSlot {\n        bool value;\n    }\n\n    struct Bytes32Slot {\n        bytes32 value;\n    }\n\n    struct Uint256Slot {\n        uint256 value;\n    }\n\n    struct Int256Slot {\n        int256 value;\n    }\n\n    struct StringSlot {\n        string value;\n    }\n\n    struct BytesSlot {\n        bytes value;\n    }\n\n    /**\n     * @dev Returns an `AddressSlot` with member `value` located at `slot`.\n     */\n    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `BooleanSlot` with member `value` located at `slot`.\n     */\n    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Bytes32Slot` with member `value` located at `slot`.\n     */\n    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Uint256Slot` with member `value` located at `slot`.\n     */\n    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Int256Slot` with member `value` located at `slot`.\n     */\n    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `StringSlot` with member `value` located at `slot`.\n     */\n    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.\n     */\n    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := store.slot\n        }\n    }\n\n    /**\n     * @dev Returns a `BytesSlot` with member `value` located at `slot`.\n     */\n    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.\n     */\n    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := store.slot\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Panic.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Helper library for emitting standardized panic codes.\n *\n * ```solidity\n * contract Example {\n *      using Panic for uint256;\n *\n *      // Use any of the declared internal constants\n *      function foo() { Panic.GENERIC.panic(); }\n *\n *      // Alternatively\n *      function foo() { Panic.panic(Panic.GENERIC); }\n * }\n * ```\n *\n * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].\n *\n * _Available since v5.1._\n */\n// slither-disable-next-line unused-state\nlibrary Panic {\n    /// @dev generic / unspecified error\n    uint256 internal constant GENERIC = 0x00;\n    /// @dev used by the assert() builtin\n    uint256 internal constant ASSERT = 0x01;\n    /// @dev arithmetic underflow or overflow\n    uint256 internal constant UNDER_OVERFLOW = 0x11;\n    /// @dev division or modulo by zero\n    uint256 internal constant DIVISION_BY_ZERO = 0x12;\n    /// @dev enum conversion error\n    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;\n    /// @dev invalid encoding in storage\n    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;\n    /// @dev empty array pop\n    uint256 internal constant EMPTY_ARRAY_POP = 0x31;\n    /// @dev array out of bounds access\n    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;\n    /// @dev resource error (too large allocation or too large array)\n    uint256 internal constant RESOURCE_ERROR = 0x41;\n    /// @dev calling invalid internal function\n    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;\n\n    /// @dev Reverts with a panic code. Recommended to use with\n    /// the internal constants with predefined codes.\n    function panic(uint256 code) internal pure {\n        assembly (\"memory-safe\") {\n            mstore(0x00, 0x4e487b71)\n            mstore(0x20, code)\n            revert(0x1c, 0x24)\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IPause } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport { Initializable } from \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\n\n/**\n * @title PauseBaseUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that implements pause configuration and enforcement.\n * @dev No public management functions are exposed by this contract, wrappers should be used with access control.\n *      Alternatively, refer to `PauseRBACUpgradeable` for a permissioned implementation.\n */\nabstract contract PauseBaseUpgradeable is IPause, Initializable {\n    /// @custom:storage-location erc7201:layerzerov2.storage.pause\n    struct PauseStorage {\n        bool paused;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.pause\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant PAUSE_STORAGE_LOCATION =\n        0x27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000;\n\n    /**\n     * @notice Internal function to get the pause storage.\n     * @return $ Storage pointer\n     */\n    function _getPauseStorage() internal pure returns (PauseStorage storage $) {\n        assembly {\n            $.slot := PAUSE_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseBase_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseBase_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @notice Modifier that reverts if the system is paused.\n     */\n    modifier whenNotPaused() {\n        if (_getPaused()) revert Paused();\n        _;\n    }\n\n    /**\n     * @inheritdoc IPause\n     */\n    function isPaused() public view virtual returns (bool paused) {\n        return _getPaused();\n    }\n\n    /**\n     * @notice Retrieves the pause status.\n     * @return paused Whether the system is paused\n     */\n    function _getPaused() internal view virtual returns (bool) {\n        PauseStorage storage $ = _getPauseStorage();\n        return $.paused;\n    }\n\n    /**\n     * @notice Enforces that the system is not paused.\n     * @dev Reverts with `Paused` error if the system is paused.\n     */\n    function _assertNotPaused() internal view virtual {\n        if (_getPaused()) revert Paused();\n    }\n\n    /**\n     * @notice Internal function to set the pause status.\n     * @param _paused New pause status\n     */\n    function _setPaused(bool _paused) internal virtual {\n        PauseStorage storage $ = _getPauseStorage();\n        if ($.paused == _paused) revert PauseStateIdempotent(_paused);\n        $.paused = _paused;\n        emit PauseSet(_paused);\n    }\n\n    // ============ Internal Functions to Wrap with Access Control ============\n\n    /**\n     * @notice Internal function to set the pause status to true.\n     * @dev To be wrapped with access control.\n     */\n    function _pause() internal virtual {\n        _setPaused(true);\n    }\n\n    /**\n     * @notice Internal function to set the pause status to false.\n     * @dev To be wrapped with access control.\n     */\n    function _unpause() internal virtual {\n        _setPaused(false);\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)\n\npragma solidity ^0.8.20;\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Provides information about the current execution context, including the\n * sender of the transaction and its data. While these are generally available\n * via msg.sender and msg.data, they should not be accessed in such a direct\n * manner, since when dealing with meta-transactions the account sending and\n * paying for execution may not be the actual sender (as far as an application\n * is concerned).\n *\n * This contract is only required for intermediate, library-like contracts.\n */\nabstract contract ContextUpgradeable is Initializable {\n    function __Context_init() internal onlyInitializing {\n    }\n\n    function __Context_init_unchained() internal onlyInitializing {\n    }\n    function _msgSender() internal view virtual returns (address) {\n        return msg.sender;\n    }\n\n    function _msgData() internal view virtual returns (bytes calldata) {\n        return msg.data;\n    }\n\n    function _contextSuffixLength() internal view virtual returns (uint256) {\n        return 0;\n    }\n}\n"},"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (interfaces/draft-IERC6093.sol)\n\npragma solidity >=0.8.4;\n\n/**\n * @dev Standard ERC-20 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.\n */\ninterface IERC20Errors {\n    /**\n     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param balance Current balance for the interacting account.\n     * @param needed Minimum amount required to perform a transfer.\n     */\n    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC20InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC20InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.\n     * @param spender Address that may be allowed to operate on tokens without being their owner.\n     * @param allowance Amount of tokens a `spender` is allowed to operate with.\n     * @param needed Minimum amount required to perform a transfer.\n     */\n    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC20InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.\n     * @param spender Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC20InvalidSpender(address spender);\n}\n\n/**\n * @dev Standard ERC-721 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.\n */\ninterface IERC721Errors {\n    /**\n     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-721.\n     * Used in balance queries.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC721InvalidOwner(address owner);\n\n    /**\n     * @dev Indicates a `tokenId` whose `owner` is the zero address.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC721NonexistentToken(uint256 tokenId);\n\n    /**\n     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param tokenId Identifier number of a token.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC721InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC721InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC721InsufficientApproval(address operator, uint256 tokenId);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC721InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC721InvalidOperator(address operator);\n}\n\n/**\n * @dev Standard ERC-1155 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.\n */\ninterface IERC1155Errors {\n    /**\n     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param balance Current balance for the interacting account.\n     * @param needed Minimum amount required to perform a transfer.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC1155InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC1155InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC1155MissingApprovalForAll(address operator, address owner);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC1155InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC1155InvalidOperator(address operator);\n\n    /**\n     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.\n     * Used in batch transfers.\n     * @param idsLength Length of the array of token identifiers\n     * @param valuesLength Length of the array of token amounts\n     */\n    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);\n}\n"},"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.3.0) (proxy/utils/Initializable.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\n *\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\n * reused. This mechanism prevents re-execution of each \"step\" but allows the creation of new initialization steps in\n * case an upgrade adds a module that needs to be initialized.\n *\n * For example:\n *\n * [.hljs-theme-light.nopadding]\n * ```solidity\n * contract MyToken is ERC20Upgradeable {\n *     function initialize() initializer public {\n *         __ERC20_init(\"MyToken\", \"MTK\");\n *     }\n * }\n *\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\n *     function initializeV2() reinitializer(2) public {\n *         __ERC20Permit_init(\"MyToken\");\n *     }\n * }\n * ```\n *\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\n *\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\n *\n * [CAUTION]\n * ====\n * Avoid leaving a contract uninitialized.\n *\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\n *\n * [.hljs-theme-light.nopadding]\n * ```\n * /// @custom:oz-upgrades-unsafe-allow constructor\n * constructor() {\n *     _disableInitializers();\n * }\n * ```\n * ====\n */\nabstract contract Initializable {\n    /**\n     * @dev Storage of the initializable contract.\n     *\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\n     * when using with upgradeable contracts.\n     *\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\n     */\n    struct InitializableStorage {\n        /**\n         * @dev Indicates that the contract has been initialized.\n         */\n        uint64 _initialized;\n        /**\n         * @dev Indicates that the contract is in the process of being initialized.\n         */\n        bool _initializing;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.Initializable\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;\n\n    /**\n     * @dev The contract is already initialized.\n     */\n    error InvalidInitialization();\n\n    /**\n     * @dev The contract is not initializing.\n     */\n    error NotInitializing();\n\n    /**\n     * @dev Triggered when the contract has been initialized or reinitialized.\n     */\n    event Initialized(uint64 version);\n\n    /**\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\n     * `onlyInitializing` functions can be used to initialize parent contracts.\n     *\n     * Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any\n     * number of times. This behavior in the constructor can be useful during testing and is not expected to be used in\n     * production.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier initializer() {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        // Cache values to avoid duplicated sloads\n        bool isTopLevelCall = !$._initializing;\n        uint64 initialized = $._initialized;\n\n        // Allowed calls:\n        // - initialSetup: the contract is not in the initializing state and no previous version was\n        //                 initialized\n        // - construction: the contract is initialized at version 1 (no reinitialization) and the\n        //                 current contract is just being deployed\n        bool initialSetup = initialized == 0 && isTopLevelCall;\n        bool construction = initialized == 1 && address(this).code.length == 0;\n\n        if (!initialSetup && !construction) {\n            revert InvalidInitialization();\n        }\n        $._initialized = 1;\n        if (isTopLevelCall) {\n            $._initializing = true;\n        }\n        _;\n        if (isTopLevelCall) {\n            $._initializing = false;\n            emit Initialized(1);\n        }\n    }\n\n    /**\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\n     * used to initialize parent contracts.\n     *\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\n     * are added through upgrades and that require initialization.\n     *\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\n     *\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\n     * a contract, executing them in the right order is up to the developer or operator.\n     *\n     * WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier reinitializer(uint64 version) {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        if ($._initializing || $._initialized >= version) {\n            revert InvalidInitialization();\n        }\n        $._initialized = version;\n        $._initializing = true;\n        _;\n        $._initializing = false;\n        emit Initialized(version);\n    }\n\n    /**\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\n     */\n    modifier onlyInitializing() {\n        _checkInitializing();\n        _;\n    }\n\n    /**\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\n     */\n    function _checkInitializing() internal view virtual {\n        if (!_isInitializing()) {\n            revert NotInitializing();\n        }\n    }\n\n    /**\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\n     * through proxies.\n     *\n     * Emits an {Initialized} event the first time it is successfully executed.\n     */\n    function _disableInitializers() internal virtual {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        if ($._initializing) {\n            revert InvalidInitialization();\n        }\n        if ($._initialized != type(uint64).max) {\n            $._initialized = type(uint64).max;\n            emit Initialized(type(uint64).max);\n        }\n    }\n\n    /**\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\n     */\n    function _getInitializedVersion() internal view returns (uint64) {\n        return _getInitializableStorage()._initialized;\n    }\n\n    /**\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\n     */\n    function _isInitializing() internal view returns (bool) {\n        return _getInitializableStorage()._initializing;\n    }\n\n    /**\n     * @dev Pointer to storage slot. Allows integrators to override it with a custom storage location.\n     *\n     * NOTE: Consider following the ERC-7201 formula to derive storage locations.\n     */\n    function _initializableStorageSlot() internal pure virtual returns (bytes32) {\n        return INITIALIZABLE_STORAGE;\n    }\n\n    /**\n     * @dev Returns a pointer to the storage namespace.\n     */\n    // solhint-disable-next-line var-name-mixedcase\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\n        bytes32 slot = _initializableStorageSlot();\n        assembly {\n            $.slot := slot\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/ECDSA.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.\n *\n * These functions can be used to verify that a message was signed by the holder\n * of the private keys of a given address.\n */\nlibrary ECDSA {\n    enum RecoverError {\n        NoError,\n        InvalidSignature,\n        InvalidSignatureLength,\n        InvalidSignatureS\n    }\n\n    /**\n     * @dev The signature is invalid.\n     */\n    error ECDSAInvalidSignature();\n\n    /**\n     * @dev The signature has an invalid length.\n     */\n    error ECDSAInvalidSignatureLength(uint256 length);\n\n    /**\n     * @dev The signature has an S value that is in the upper half order.\n     */\n    error ECDSAInvalidSignatureS(bytes32 s);\n\n    /**\n     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not\n     * return address(0) without also returning an error description. Errors are documented using an enum (error type)\n     * and a bytes32 providing additional information about the error.\n     *\n     * If no error is returned, then the address can be used for verification purposes.\n     *\n     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:\n     * this function rejects them by requiring the `s` value to be in the lower\n     * half order, and the `v` value to be either 27 or 28.\n     *\n     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction\n     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash\n     * invalidation or nonces for replay protection.\n     *\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\n     * verification to be secure: it is possible to craft signatures that\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\n     * this is by receiving a hash of the original message (which may otherwise\n     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.\n     *\n     * Documentation for signature generation:\n     *\n     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]\n     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]\n     */\n    function tryRecover(\n        bytes32 hash,\n        bytes memory signature\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        if (signature.length == 65) {\n            bytes32 r;\n            bytes32 s;\n            uint8 v;\n            // ecrecover takes the signature parameters, and the only way to get them\n            // currently is to use assembly.\n            assembly (\"memory-safe\") {\n                r := mload(add(signature, 0x20))\n                s := mload(add(signature, 0x40))\n                v := byte(0, mload(add(signature, 0x60)))\n            }\n            return tryRecover(hash, v, r, s);\n        } else {\n            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));\n        }\n    }\n\n    /**\n     * @dev Variant of {tryRecover} that takes a signature in calldata\n     */\n    function tryRecoverCalldata(\n        bytes32 hash,\n        bytes calldata signature\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        if (signature.length == 65) {\n            bytes32 r;\n            bytes32 s;\n            uint8 v;\n            // ecrecover takes the signature parameters, calldata slices would work here, but are\n            // significantly more expensive (length check) than using calldataload in assembly.\n            assembly (\"memory-safe\") {\n                r := calldataload(signature.offset)\n                s := calldataload(add(signature.offset, 0x20))\n                v := byte(0, calldataload(add(signature.offset, 0x40)))\n            }\n            return tryRecover(hash, v, r, s);\n        } else {\n            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));\n        }\n    }\n\n    /**\n     * @dev Returns the address that signed a hashed message (`hash`) with\n     * `signature`. This address can then be used for verification purposes.\n     *\n     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:\n     * this function rejects them by requiring the `s` value to be in the lower\n     * half order, and the `v` value to be either 27 or 28.\n     *\n     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction\n     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash\n     * invalidation or nonces for replay protection.\n     *\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\n     * verification to be secure: it is possible to craft signatures that\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\n     * this is by receiving a hash of the original message (which may otherwise\n     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.\n     */\n    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Variant of {recover} that takes a signature in calldata\n     */\n    function recoverCalldata(bytes32 hash, bytes calldata signature) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecoverCalldata(hash, signature);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.\n     *\n     * See https://eips.ethereum.org/EIPS/eip-2098[ERC-2098 short signatures]\n     */\n    function tryRecover(\n        bytes32 hash,\n        bytes32 r,\n        bytes32 vs\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        unchecked {\n            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);\n            // We do not check for an overflow here since the shift operation results in 0 or 1.\n            uint8 v = uint8((uint256(vs) >> 255) + 27);\n            return tryRecover(hash, v, r, s);\n        }\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `r` and `vs` short-signature fields separately.\n     */\n    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     */\n    function tryRecover(\n        bytes32 hash,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature\n        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines\n        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most\n        // signatures from current libraries generate a unique signature with an s-value in the lower half order.\n        //\n        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value\n        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or\n        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept\n        // these malleable signatures as well.\n        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {\n            return (address(0), RecoverError.InvalidSignatureS, s);\n        }\n\n        // If the signature is valid (and not malleable), return the signer address\n        address signer = ecrecover(hash, v, r, s);\n        if (signer == address(0)) {\n            return (address(0), RecoverError.InvalidSignature, bytes32(0));\n        }\n\n        return (signer, RecoverError.NoError, bytes32(0));\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     */\n    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Parse a signature into its `v`, `r` and `s` components. Supports 65-byte and 64-byte (ERC-2098)\n     * formats. Returns (0,0,0) for invalid signatures.\n     *\n     * For 64-byte signatures, `v` is automatically normalized to 27 or 28.\n     * For 65-byte signatures, `v` is returned as-is and MUST already be 27 or 28 for use with ecrecover.\n     *\n     * Consider validating the result before use, or use {tryRecover}/{recover} which perform full validation.\n     */\n    function parse(bytes memory signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {\n        assembly (\"memory-safe\") {\n            // Check the signature length\n            switch mload(signature)\n            // - case 65: r,s,v signature (standard)\n            case 65 {\n                r := mload(add(signature, 0x20))\n                s := mload(add(signature, 0x40))\n                v := byte(0, mload(add(signature, 0x60)))\n            }\n            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)\n            case 64 {\n                let vs := mload(add(signature, 0x40))\n                r := mload(add(signature, 0x20))\n                s := and(vs, shr(1, not(0)))\n                v := add(shr(255, vs), 27)\n            }\n            default {\n                r := 0\n                s := 0\n                v := 0\n            }\n        }\n    }\n\n    /**\n     * @dev Variant of {parse} that takes a signature in calldata\n     */\n    function parseCalldata(bytes calldata signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {\n        assembly (\"memory-safe\") {\n            // Check the signature length\n            switch signature.length\n            // - case 65: r,s,v signature (standard)\n            case 65 {\n                r := calldataload(signature.offset)\n                s := calldataload(add(signature.offset, 0x20))\n                v := byte(0, calldataload(add(signature.offset, 0x40)))\n            }\n            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)\n            case 64 {\n                let vs := calldataload(add(signature.offset, 0x20))\n                r := calldataload(signature.offset)\n                s := and(vs, shr(1, not(0)))\n                v := add(shr(255, vs), 27)\n            }\n            default {\n                r := 0\n                s := 0\n                v := 0\n            }\n        }\n    }\n\n    /**\n     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.\n     */\n    function _throwError(RecoverError error, bytes32 errorArg) private pure {\n        if (error == RecoverError.NoError) {\n            return; // no error: do nothing\n        } else if (error == RecoverError.InvalidSignature) {\n            revert ECDSAInvalidSignature();\n        } else if (error == RecoverError.InvalidSignatureLength) {\n            revert ECDSAInvalidSignatureLength(uint256(errorArg));\n        } else if (error == RecoverError.InvalidSignatureS) {\n            revert ECDSAInvalidSignatureS(errorArg);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/cryptography/EIP712.sol)\n\npragma solidity ^0.8.24;\n\nimport {MessageHashUtils} from \"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol\";\nimport {IERC5267} from \"@openzeppelin/contracts/interfaces/IERC5267.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev https://eips.ethereum.org/EIPS/eip-712[EIP-712] is a standard for hashing and signing of typed structured data.\n *\n * The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose\n * encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract\n * does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to\n * produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.\n *\n * This contract implements the EIP-712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding\n * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA\n * ({_hashTypedDataV4}).\n *\n * The implementation of the domain separator was designed to be as efficient as possible while still properly updating\n * the chain id to protect against replay attacks on an eventual fork of the chain.\n *\n * NOTE: This contract implements the version of the encoding known as \"v4\", as implemented by the JSON RPC method\n * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].\n *\n * NOTE: The upgradeable version of this contract does not use an immutable cache and recomputes the domain separator\n * each time {_domainSeparatorV4} is called. This is cheaper than accessing a cached version in cold storage.\n */\nabstract contract EIP712Upgradeable is Initializable, IERC5267 {\n    bytes32 private constant TYPE_HASH =\n        keccak256(\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\");\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.EIP712\n    struct EIP712Storage {\n        bytes32 _hashedName;\n        bytes32 _hashedVersion;\n\n        string _name;\n        string _version;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.EIP712\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant EIP712StorageLocation = 0xa16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d100;\n\n    function _getEIP712Storage() private pure returns (EIP712Storage storage $) {\n        assembly {\n            $.slot := EIP712StorageLocation\n        }\n    }\n\n    /**\n     * @dev Initializes the domain separator and parameter caches.\n     *\n     * The meaning of `name` and `version` is specified in\n     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP-712]:\n     *\n     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.\n     * - `version`: the current major version of the signing domain.\n     *\n     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart\n     * contract upgrade].\n     */\n    function __EIP712_init(string memory name, string memory version) internal onlyInitializing {\n        __EIP712_init_unchained(name, version);\n    }\n\n    function __EIP712_init_unchained(string memory name, string memory version) internal onlyInitializing {\n        EIP712Storage storage $ = _getEIP712Storage();\n        $._name = name;\n        $._version = version;\n    }\n\n    /**\n     * @dev Returns the domain separator for the current chain.\n     */\n    function _domainSeparatorV4() internal view returns (bytes32) {\n        return _buildDomainSeparator();\n    }\n\n    function _buildDomainSeparator() private view returns (bytes32) {\n        return keccak256(abi.encode(TYPE_HASH, _EIP712NameHash(), _EIP712VersionHash(), block.chainid, address(this)));\n    }\n\n    /**\n     * @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this\n     * function returns the hash of the fully encoded EIP712 message for this domain.\n     *\n     * This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:\n     *\n     * ```solidity\n     * bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(\n     *     keccak256(\"Mail(address to,string contents)\"),\n     *     mailTo,\n     *     keccak256(bytes(mailContents))\n     * )));\n     * address signer = ECDSA.recover(digest, signature);\n     * ```\n     */\n    function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {\n        return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);\n    }\n\n    /// @inheritdoc IERC5267\n    function eip712Domain()\n        public\n        view\n        virtual\n        returns (\n            bytes1 fields,\n            string memory name,\n            string memory version,\n            uint256 chainId,\n            address verifyingContract,\n            bytes32 salt,\n            uint256[] memory extensions\n        )\n    {\n        return (\n            hex\"0f\", // 01111\n            _EIP712Name(),\n            _EIP712Version(),\n            block.chainid,\n            address(this),\n            bytes32(0),\n            new uint256[](0)\n        );\n    }\n\n    /**\n     * @dev The name parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs\n     * are a concern.\n     */\n    function _EIP712Name() internal view virtual returns (string memory) {\n        EIP712Storage storage $ = _getEIP712Storage();\n        return $._name;\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs\n     * are a concern.\n     */\n    function _EIP712Version() internal view virtual returns (string memory) {\n        EIP712Storage storage $ = _getEIP712Storage();\n        return $._version;\n    }\n\n    /**\n     * @dev The hash of the name parameter for the EIP712 domain.\n     *\n     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Name` instead.\n     */\n    function _EIP712NameHash() internal view returns (bytes32) {\n        return keccak256(bytes(_EIP712Name()));\n    }\n\n    /**\n     * @dev The hash of the version parameter for the EIP712 domain.\n     *\n     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Version` instead.\n     */\n    function _EIP712VersionHash() internal view returns (bytes32) {\n        return keccak256(bytes(_EIP712Version()));\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)\npragma solidity ^0.8.20;\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Provides tracking nonces for addresses. Nonces will only increment.\n */\nabstract contract NoncesUpgradeable is Initializable {\n    /**\n     * @dev The nonce used for an `account` is not the expected current nonce.\n     */\n    error InvalidAccountNonce(address account, uint256 currentNonce);\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.Nonces\n    struct NoncesStorage {\n        mapping(address account => uint256) _nonces;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.Nonces\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant NoncesStorageLocation = 0x5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00;\n\n    function _getNoncesStorage() private pure returns (NoncesStorage storage $) {\n        assembly {\n            $.slot := NoncesStorageLocation\n        }\n    }\n\n    function __Nonces_init() internal onlyInitializing {\n    }\n\n    function __Nonces_init_unchained() internal onlyInitializing {\n    }\n    /**\n     * @dev Returns the next unused nonce for an address.\n     */\n    function nonces(address owner) public view virtual returns (uint256) {\n        NoncesStorage storage $ = _getNoncesStorage();\n        return $._nonces[owner];\n    }\n\n    /**\n     * @dev Consumes a nonce.\n     *\n     * Returns the current value and increments nonce.\n     */\n    function _useNonce(address owner) internal virtual returns (uint256) {\n        NoncesStorage storage $ = _getNoncesStorage();\n        // For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be\n        // decremented or reset. This guarantees that the nonce never overflows.\n        unchecked {\n            // It is important to do x++ and not ++x here.\n            return $._nonces[owner]++;\n        }\n    }\n\n    /**\n     * @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.\n     */\n    function _useCheckedNonce(address owner, uint256 nonce) internal virtual {\n        uint256 current = _useNonce(owner);\n        if (nonce != current) {\n            revert InvalidAccountNonce(owner, current);\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/// @title Interface for burnable and mintable tokens\ninterface IBurnableMintable {\n    /**\n     * @notice Burns tokens from a specified account\n     * @param _from Address from which tokens will be burned\n     * @param _amount Amount of tokens to be burned\n     * @return success Indicates whether the operation was successful\n     */\n    function burn(address _from, uint256 _amount) external returns (bool success);\n\n    /**\n     * @notice Mints tokens to a specified account\n     * @param _to Address to which tokens will be minted\n     * @param _amount Amount of tokens to be minted\n     * @return success Indicates whether the operation was successful\n     */\n    function mint(address _to, uint256 _amount) external returns (bool success);\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAccessControlEnumerable } from \"@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol\";\n\n/**\n * @title IAccessControl2Step\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `AccessControl2Step` contract.\n */\ninterface IAccessControl2Step is IAccessControlEnumerable {\n    /**\n     * @notice Thrown when the intended default admin is invalid.\n     * @param defaultAdmin Invalid default admin address\n     */\n    error InvalidDefaultAdmin(address defaultAdmin);\n\n    /**\n     * @notice Thrown when one of the following rules is violated:\n     *         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.\n     *         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.\n     *         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps.\n     */\n    error AccessControlEnforcedDefaultAdminRules();\n\n    /**\n     * @notice Thrown when the caller is not the pending admin.\n     * @param pendingAdmin Address of the pending admin\n     */\n    error CallerNotPendingAdmin(address pendingAdmin);\n\n    /**\n     * @notice Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started.\n     * @param newAdmin Address of the new pending default admin\n     */\n    event DefaultAdminTransferStarted(address indexed newAdmin);\n\n    /**\n     * @notice Returns the address of the current `DEFAULT_ADMIN_ROLE` holder.\n     * @return defaultAdminAddress Address of the current `DEFAULT_ADMIN_ROLE` holder\n     */\n    function defaultAdmin() external view returns (address defaultAdminAddress);\n\n    /**\n     * @notice Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling\n     *         `acceptDefaultAdminTransfer`.\n     * @return pendingDefaultAdminAddress Address of the pending `DEFAULT_ADMIN_ROLE` account\n     */\n    function pendingDefaultAdmin() external view returns (address pendingDefaultAdminAddress);\n\n    /**\n     * @notice Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`.\n     * @dev It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`.\n     * @param newAdmin Address of the new pending default admin\n     */\n    function beginDefaultAdminTransfer(address newAdmin) external;\n\n    /**\n     * @notice Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`.\n     */\n    function acceptDefaultAdminTransfer() external;\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (access/AccessControl.sol)\n\npragma solidity ^0.8.20;\n\nimport {IAccessControl} from \"@openzeppelin/contracts/access/IAccessControl.sol\";\nimport {ContextUpgradeable} from \"../utils/ContextUpgradeable.sol\";\nimport {ERC165Upgradeable} from \"../utils/introspection/ERC165Upgradeable.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module that allows children to implement role-based access\n * control mechanisms. This is a lightweight version that doesn't allow enumerating role\n * members except through off-chain means by accessing the contract event logs. Some\n * applications may benefit from on-chain enumerability, for those cases see\n * {AccessControlEnumerable}.\n *\n * Roles are referred to by their `bytes32` identifier. These should be exposed\n * in the external API and be unique. The best way to achieve this is by\n * using `public constant` hash digests:\n *\n * ```solidity\n * bytes32 public constant MY_ROLE = keccak256(\"MY_ROLE\");\n * ```\n *\n * Roles can be used to represent a set of permissions. To restrict access to a\n * function call, use {hasRole}:\n *\n * ```solidity\n * function foo() public {\n *     require(hasRole(MY_ROLE, msg.sender));\n *     ...\n * }\n * ```\n *\n * Roles can be granted and revoked dynamically via the {grantRole} and\n * {revokeRole} functions. Each role has an associated admin role, and only\n * accounts that have a role's admin role can call {grantRole} and {revokeRole}.\n *\n * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means\n * that only accounts with this role will be able to grant or revoke other\n * roles. More complex role relationships can be created by using\n * {_setRoleAdmin}.\n *\n * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to\n * grant and revoke this role. Extra precautions should be taken to secure\n * accounts that have been granted it. We recommend using {AccessControlDefaultAdminRules}\n * to enforce additional security measures for this role.\n */\nabstract contract AccessControlUpgradeable is Initializable, ContextUpgradeable, IAccessControl, ERC165Upgradeable {\n    struct RoleData {\n        mapping(address account => bool) hasRole;\n        bytes32 adminRole;\n    }\n\n    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;\n\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.AccessControl\n    struct AccessControlStorage {\n        mapping(bytes32 role => RoleData) _roles;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.AccessControl\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant AccessControlStorageLocation = 0x02dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800;\n\n    function _getAccessControlStorage() private pure returns (AccessControlStorage storage $) {\n        assembly {\n            $.slot := AccessControlStorageLocation\n        }\n    }\n\n    /**\n     * @dev Modifier that checks that an account has a specific role. Reverts\n     * with an {AccessControlUnauthorizedAccount} error including the required role.\n     */\n    modifier onlyRole(bytes32 role) {\n        _checkRole(role);\n        _;\n    }\n\n    function __AccessControl_init() internal onlyInitializing {\n    }\n\n    function __AccessControl_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc ERC165Upgradeable\n    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);\n    }\n\n    /**\n     * @dev Returns `true` if `account` has been granted `role`.\n     */\n    function hasRole(bytes32 role, address account) public view virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        return $._roles[role].hasRole[account];\n    }\n\n    /**\n     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `_msgSender()`\n     * is missing `role`. Overriding this function changes the behavior of the {onlyRole} modifier.\n     */\n    function _checkRole(bytes32 role) internal view virtual {\n        _checkRole(role, _msgSender());\n    }\n\n    /**\n     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `account`\n     * is missing `role`.\n     */\n    function _checkRole(bytes32 role, address account) internal view virtual {\n        if (!hasRole(role, account)) {\n            revert AccessControlUnauthorizedAccount(account, role);\n        }\n    }\n\n    /**\n     * @dev Returns the admin role that controls `role`. See {grantRole} and\n     * {revokeRole}.\n     *\n     * To change a role's admin, use {_setRoleAdmin}.\n     */\n    function getRoleAdmin(bytes32 role) public view virtual returns (bytes32) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        return $._roles[role].adminRole;\n    }\n\n    /**\n     * @dev Grants `role` to `account`.\n     *\n     * If `account` had not been already granted `role`, emits a {RoleGranted}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     *\n     * May emit a {RoleGranted} event.\n     */\n    function grantRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {\n        _grantRole(role, account);\n    }\n\n    /**\n     * @dev Revokes `role` from `account`.\n     *\n     * If `account` had been granted `role`, emits a {RoleRevoked} event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function revokeRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {\n        _revokeRole(role, account);\n    }\n\n    /**\n     * @dev Revokes `role` from the calling account.\n     *\n     * Roles are often managed via {grantRole} and {revokeRole}: this function's\n     * purpose is to provide a mechanism for accounts to lose their privileges\n     * if they are compromised (such as when a trusted device is misplaced).\n     *\n     * If the calling account had been revoked `role`, emits a {RoleRevoked}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must be `callerConfirmation`.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function renounceRole(bytes32 role, address callerConfirmation) public virtual {\n        if (callerConfirmation != _msgSender()) {\n            revert AccessControlBadConfirmation();\n        }\n\n        _revokeRole(role, callerConfirmation);\n    }\n\n    /**\n     * @dev Sets `adminRole` as ``role``'s admin role.\n     *\n     * Emits a {RoleAdminChanged} event.\n     */\n    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        bytes32 previousAdminRole = getRoleAdmin(role);\n        $._roles[role].adminRole = adminRole;\n        emit RoleAdminChanged(role, previousAdminRole, adminRole);\n    }\n\n    /**\n     * @dev Attempts to grant `role` to `account` and returns a boolean indicating if `role` was granted.\n     *\n     * Internal function without access restriction.\n     *\n     * May emit a {RoleGranted} event.\n     */\n    function _grantRole(bytes32 role, address account) internal virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        if (!hasRole(role, account)) {\n            $._roles[role].hasRole[account] = true;\n            emit RoleGranted(role, account, _msgSender());\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Attempts to revoke `role` from `account` and returns a boolean indicating if `role` was revoked.\n     *\n     * Internal function without access restriction.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        if (hasRole(role, account)) {\n            $._roles[role].hasRole[account] = false;\n            emit RoleRevoked(role, account, _msgSender());\n            return true;\n        } else {\n            return false;\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (access/extensions/AccessControlEnumerable.sol)\n\npragma solidity ^0.8.24;\n\nimport {IAccessControlEnumerable} from \"@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol\";\nimport {AccessControlUpgradeable} from \"../AccessControlUpgradeable.sol\";\nimport {EnumerableSet} from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\nimport {IERC165} from \"@openzeppelin/contracts/utils/introspection/IERC165.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Extension of {AccessControl} that allows enumerating the members of each role.\n */\nabstract contract AccessControlEnumerableUpgradeable is Initializable, IAccessControlEnumerable, AccessControlUpgradeable {\n    using EnumerableSet for EnumerableSet.AddressSet;\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.AccessControlEnumerable\n    struct AccessControlEnumerableStorage {\n        mapping(bytes32 role => EnumerableSet.AddressSet) _roleMembers;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.AccessControlEnumerable\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant AccessControlEnumerableStorageLocation = 0xc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000;\n\n    function _getAccessControlEnumerableStorage() private pure returns (AccessControlEnumerableStorage storage $) {\n        assembly {\n            $.slot := AccessControlEnumerableStorageLocation\n        }\n    }\n\n    function __AccessControlEnumerable_init() internal onlyInitializing {\n    }\n\n    function __AccessControlEnumerable_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc IERC165\n    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n        return interfaceId == type(IAccessControlEnumerable).interfaceId || super.supportsInterface(interfaceId);\n    }\n\n    /**\n     * @dev Returns one of the accounts that have `role`. `index` must be a\n     * value between 0 and {getRoleMemberCount}, non-inclusive.\n     *\n     * Role bearers are not sorted in any particular way, and their ordering may\n     * change at any point.\n     *\n     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n     * you perform all queries on the same block. See the following\n     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n     * for more information.\n     */\n    function getRoleMember(bytes32 role, uint256 index) public view virtual returns (address) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].at(index);\n    }\n\n    /**\n     * @dev Returns the number of accounts that have `role`. Can be used\n     * together with {getRoleMember} to enumerate all bearers of a role.\n     */\n    function getRoleMemberCount(bytes32 role) public view virtual returns (uint256) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].length();\n    }\n\n    /**\n     * @dev Return all accounts that have `role`\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function getRoleMembers(bytes32 role) public view virtual returns (address[] memory) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].values();\n    }\n\n    /**\n     * @dev Overload {AccessControl-_grantRole} to track enumerable memberships\n     */\n    function _grantRole(bytes32 role, address account) internal virtual override returns (bool) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        bool granted = super._grantRole(role, account);\n        if (granted) {\n            $._roleMembers[role].add(account);\n        }\n        return granted;\n    }\n\n    /**\n     * @dev Overload {AccessControl-_revokeRole} to track enumerable memberships\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual override returns (bool) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        bool revoked = super._revokeRole(role, account);\n        if (revoked) {\n            $._roleMembers[role].remove(account);\n        }\n        return revoked;\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol":{"content":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.20;\n\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n"},"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/structs/EnumerableSet.sol)\n// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.\n\npragma solidity ^0.8.24;\n\nimport {Arrays} from \"../Arrays.sol\";\nimport {Math} from \"../math/Math.sol\";\n\n/**\n * @dev Library for managing\n * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive\n * types.\n *\n * Sets have the following properties:\n *\n * - Elements are added, removed, and checked for existence in constant time\n * (O(1)).\n * - Elements are enumerated in O(n). No guarantees are made on the ordering.\n * - Set can be cleared (all elements removed) in O(n).\n *\n * ```solidity\n * contract Example {\n *     // Add the library methods\n *     using EnumerableSet for EnumerableSet.AddressSet;\n *\n *     // Declare a set state variable\n *     EnumerableSet.AddressSet private mySet;\n * }\n * ```\n *\n * The following types are supported:\n *\n * - `bytes32` (`Bytes32Set`) since v3.3.0\n * - `address` (`AddressSet`) since v3.3.0\n * - `uint256` (`UintSet`) since v3.3.0\n * - `string` (`StringSet`) since v5.4.0\n * - `bytes` (`BytesSet`) since v5.4.0\n * - `bytes4` (`Bytes4Set`) since v5.6.0\n *\n * [WARNING]\n * ====\n * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure\n * unusable.\n * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.\n *\n * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an\n * array of EnumerableSet.\n * ====\n */\nlibrary EnumerableSet {\n    // To implement this library for multiple types with as little code\n    // repetition as possible, we write it in terms of a generic Set type with\n    // bytes32 values.\n    // The Set implementation uses private functions, and user-facing\n    // implementations (such as AddressSet) are just wrappers around the\n    // underlying Set.\n    // This means that we can only create new EnumerableSets for types that fit\n    // in bytes32.\n\n    struct Set {\n        // Storage of set values\n        bytes32[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(bytes32 value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function _add(Set storage set, bytes32 value) private returns (bool) {\n        if (!_contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function _remove(Set storage set, bytes32 value) private returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                bytes32 lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: This function has an unbounded cost that scales with set size. Developers should keep in mind that\n     * using it may render the function uncallable if the set grows to the point where clearing it consumes too much\n     * gas to fit in a block.\n     */\n    function _clear(Set storage set) private {\n        uint256 len = _length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function _contains(Set storage set, bytes32 value) private view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function _length(Set storage set) private view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function _at(Set storage set, uint256 index) private view returns (bytes32) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function _values(Set storage set) private view returns (bytes32[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function _values(Set storage set, uint256 start, uint256 end) private view returns (bytes32[] memory) {\n        unchecked {\n            end = Math.min(end, _length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            bytes32[] memory result = new bytes32[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n\n    // Bytes32Set\n\n    struct Bytes32Set {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n        return _add(set._inner, value);\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n        return _remove(set._inner, value);\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(Bytes32Set storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {\n        return _contains(set._inner, value);\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(Bytes32Set storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {\n        return _at(set._inner, index);\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        bytes32[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes32Set storage set, uint256 start, uint256 end) internal view returns (bytes32[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        bytes32[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // Bytes4Set\n\n    struct Bytes4Set {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(Bytes4Set storage set, bytes4 value) internal returns (bool) {\n        return _add(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(Bytes4Set storage set, bytes4 value) internal returns (bool) {\n        return _remove(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(Bytes4Set storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(Bytes4Set storage set, bytes4 value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(Bytes4Set storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(Bytes4Set storage set, uint256 index) internal view returns (bytes4) {\n        return bytes4(_at(set._inner, index));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes4Set storage set) internal view returns (bytes4[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        bytes4[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes4Set storage set, uint256 start, uint256 end) internal view returns (bytes4[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        bytes4[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // AddressSet\n\n    struct AddressSet {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(AddressSet storage set, address value) internal returns (bool) {\n        return _add(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(AddressSet storage set, address value) internal returns (bool) {\n        return _remove(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(AddressSet storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(AddressSet storage set, address value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(AddressSet storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(AddressSet storage set, uint256 index) internal view returns (address) {\n        return address(uint160(uint256(_at(set._inner, index))));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(AddressSet storage set) internal view returns (address[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        address[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(AddressSet storage set, uint256 start, uint256 end) internal view returns (address[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        address[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // UintSet\n\n    struct UintSet {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(UintSet storage set, uint256 value) internal returns (bool) {\n        return _add(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(UintSet storage set, uint256 value) internal returns (bool) {\n        return _remove(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(UintSet storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(UintSet storage set, uint256 value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(UintSet storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(UintSet storage set, uint256 index) internal view returns (uint256) {\n        return uint256(_at(set._inner, index));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(UintSet storage set) internal view returns (uint256[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        uint256[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(UintSet storage set, uint256 start, uint256 end) internal view returns (uint256[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        uint256[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    struct StringSet {\n        // Storage of set values\n        string[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(string value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(StringSet storage set, string memory value) internal returns (bool) {\n        if (!contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(StringSet storage set, string memory value) internal returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                string memory lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(StringSet storage set) internal {\n        uint256 len = length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(StringSet storage set, string memory value) internal view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function length(StringSet storage set) internal view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(StringSet storage set, uint256 index) internal view returns (string memory) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(StringSet storage set) internal view returns (string[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(StringSet storage set, uint256 start, uint256 end) internal view returns (string[] memory) {\n        unchecked {\n            end = Math.min(end, length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            string[] memory result = new string[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n\n    struct BytesSet {\n        // Storage of set values\n        bytes[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(bytes value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(BytesSet storage set, bytes memory value) internal returns (bool) {\n        if (!contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(BytesSet storage set, bytes memory value) internal returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                bytes memory lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(BytesSet storage set) internal {\n        uint256 len = length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(BytesSet storage set, bytes memory value) internal view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function length(BytesSet storage set) internal view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(BytesSet storage set, uint256 index) internal view returns (bytes memory) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(BytesSet storage set) internal view returns (bytes[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(BytesSet storage set, uint256 start, uint256 end) internal view returns (bytes[] memory) {\n        unchecked {\n            end = Math.min(end, length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            bytes[] memory result = new bytes[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n}\n"}},"compilation":{"language":"Solidity","compiler":"solc","compilerVersion":"0.8.26+commit.8a97fa7a","compilerSettings":{"viaIR":true,"metadata":{"appendCBOR":true,"bytecodeHash":"ipfs","useLiteralContent":false},"libraries":{},"optimizer":{"runs":750,"enabled":true},"evmVersion":"cancun","remappings":["@layerzerolabs/=node_modules/@layerzerolabs/","@openzeppelin/=node_modules/@openzeppelin/","forge-std/=lib/forge-std/src/","@axelar-network/=node_modules/@axelar-network/","@chainlink/=node_modules/@chainlink/","@eth-optimism/=node_modules/@eth-optimism/","hardhat-deploy/=node_modules/hardhat-deploy/","solidity-bytes-utils/=node_modules/solidity-bytes-utils/"]},"name":"SaturnOFT","fullyQualifiedName":"contracts/evm/SaturnOFT.sol:SaturnOFT"},"abi":[{"type":"constructor","inputs":[{"name":"_decimals","type":"uint8","internalType":"uint8"}],"stateMutability":"nonpayable"},{"name":"AccessControlBadConfirmation","type":"error","inputs":[]},{"name":"AccessControlEnforcedDefaultAdminRules","type":"error","inputs":[]},{"name":"AccessControlUnauthorizedAccount","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"},{"name":"neededRole","type":"bytes32","internalType":"bytes32"}]},{"name":"AllowlistStateIdempotent","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}]},{"name":"CallerNotPendingAdmin","type":"error","inputs":[{"name":"pendingAdmin","type":"address","internalType":"address"}]},{"name":"CannotRecoverFromAllowlisted","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"}]},{"name":"ECDSAInvalidSignature","type":"error","inputs":[]},{"name":"ECDSAInvalidSignatureLength","type":"error","inputs":[{"name":"length","type":"uint256","internalType":"uint256"}]},{"name":"ECDSAInvalidSignatureS","type":"error","inputs":[{"name":"s","type":"bytes32","internalType":"bytes32"}]},{"name":"ERC20InsufficientAllowance","type":"error","inputs":[{"name":"spender","type":"address","internalType":"address"},{"name":"allowance","type":"uint256","internalType":"uint256"},{"name":"needed","type":"uint256","internalType":"uint256"}]},{"name":"ERC20InsufficientBalance","type":"error","inputs":[{"name":"sender","type":"address","internalType":"address"},{"name":"balance","type":"uint256","internalType":"uint256"},{"name":"needed","type":"uint256","internalType":"uint256"}]},{"name":"ERC20InvalidApprover","type":"error","inputs":[{"name":"approver","type":"address","internalType":"address"}]},{"name":"ERC20InvalidReceiver","type":"error","inputs":[{"name":"receiver","type":"address","internalType":"address"}]},{"name":"ERC20InvalidSender","type":"error","inputs":[{"name":"sender","type":"address","internalType":"address"}]},{"name":"ERC20InvalidSpender","type":"error","inputs":[{"name":"spender","type":"address","internalType":"address"}]},{"name":"ERC2612ExpiredSignature","type":"error","inputs":[{"name":"deadline","type":"uint256","internalType":"uint256"}]},{"name":"ERC2612InvalidSigner","type":"error","inputs":[{"name":"signer","type":"address","internalType":"address"},{"name":"owner","type":"address","internalType":"address"}]},{"name":"InvalidAccountNonce","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"},{"name":"currentNonce","type":"uint256","internalType":"uint256"}]},{"name":"InvalidDefaultAdmin","type":"error","inputs":[{"name":"defaultAdmin","type":"address","internalType":"address"}]},{"name":"InvalidInitialization","type":"error","inputs":[]},{"name":"ModeAlreadySet","type":"error","inputs":[{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}]},{"name":"NotAllowlisted","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"},{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}]},{"name":"NotInitializing","type":"error","inputs":[]},{"name":"PauseStateIdempotent","type":"error","inputs":[{"name":"isPaused","type":"bool","internalType":"bool"}]},{"name":"Paused","type":"error","inputs":[]},{"name":"AllowlistModeUpdated","type":"event","inputs":[{"name":"newMode","type":"uint8","indexed":false,"internalType":"enum IAllowlist.AllowlistMode"}],"anonymous":false},{"name":"Approval","type":"event","inputs":[{"name":"owner","type":"address","indexed":true,"internalType":"address"},{"name":"spender","type":"address","indexed":true,"internalType":"address"},{"name":"value","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"BlacklistUpdated","type":"event","inputs":[{"name":"user","type":"address","indexed":true,"internalType":"address"},{"name":"isBlacklisted","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"DefaultAdminTransferStarted","type":"event","inputs":[{"name":"newAdmin","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"Initialized","type":"event","inputs":[{"name":"version","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"PauseSet","type":"event","inputs":[{"name":"paused","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"RoleAdminChanged","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"previousAdminRole","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"newAdminRole","type":"bytes32","indexed":true,"internalType":"bytes32"}],"anonymous":false},{"name":"RoleGranted","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"account","type":"address","indexed":true,"internalType":"address"},{"name":"sender","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"RoleRevoked","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"account","type":"address","indexed":true,"internalType":"address"},{"name":"sender","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"Transfer","type":"event","inputs":[{"name":"from","type":"address","indexed":true,"internalType":"address"},{"name":"to","type":"address","indexed":true,"internalType":"address"},{"name":"value","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"WhitelistUpdated","type":"event","inputs":[{"name":"user","type":"address","indexed":true,"internalType":"address"},{"name":"isWhitelisted","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"BLACKLISTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"BURNER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"DEFAULT_ADMIN_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"DOMAIN_SEPARATOR","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"MINTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"PAUSER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"UNPAUSER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"WHITELISTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"acceptDefaultAdminTransfer","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"allowance","type":"function","inputs":[{"name":"owner","type":"address","internalType":"address"},{"name":"spender","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"allowlistMode","type":"function","inputs":[],"outputs":[{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}],"stateMutability":"view"},{"name":"approve","type":"function","inputs":[{"name":"spender","type":"address","internalType":"address"},{"name":"value","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"balanceOf","type":"function","inputs":[{"name":"account","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"beginDefaultAdminTransfer","type":"function","inputs":[{"name":"_newAdmin","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"blacklistedCount","type":"function","inputs":[],"outputs":[{"name":"count","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"burn","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"decimals","type":"function","inputs":[],"outputs":[{"name":"tokenDecimals","type":"uint8","internalType":"uint8"}],"stateMutability":"view"},{"name":"defaultAdmin","type":"function","inputs":[],"outputs":[{"name":"defaultAdminAddress","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"eip712Domain","type":"function","inputs":[],"outputs":[{"name":"fields","type":"bytes1","internalType":"bytes1"},{"name":"name","type":"string","internalType":"string"},{"name":"version","type":"string","internalType":"string"},{"name":"chainId","type":"uint256","internalType":"uint256"},{"name":"verifyingContract","type":"address","internalType":"address"},{"name":"salt","type":"bytes32","internalType":"bytes32"},{"name":"extensions","type":"uint256[]","internalType":"uint256[]"}],"stateMutability":"view"},{"name":"getBlacklist","type":"function","inputs":[{"name":"_offset","type":"uint256","internalType":"uint256"},{"name":"_limit","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"addresses","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"getRoleAdmin","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"getRoleMember","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"index","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"getRoleMemberCount","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"getRoleMembers","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"getWhitelist","type":"function","inputs":[{"name":"_offset","type":"uint256","internalType":"uint256"},{"name":"_limit","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"addresses","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"grantRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"hasRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"initialize","type":"function","inputs":[{"name":"_name","type":"string","internalType":"string"},{"name":"_symbol","type":"string","internalType":"string"},{"name":"_initialAdmin","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"isAllowlisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserAllowlisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isBlacklisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserBlacklisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isPaused","type":"function","inputs":[],"outputs":[{"name":"paused","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isWhitelisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserWhitelisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"mint","type":"function","inputs":[{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"name","type":"function","inputs":[],"outputs":[{"name":"","type":"string","internalType":"string"}],"stateMutability":"view"},{"name":"nonces","type":"function","inputs":[{"name":"_owner","type":"address","internalType":"address"}],"outputs":[{"name":"nonce","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"pause","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"pendingDefaultAdmin","type":"function","inputs":[],"outputs":[{"name":"pendingDefaultAdminAddress","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"permit","type":"function","inputs":[{"name":"owner","type":"address","internalType":"address"},{"name":"spender","type":"address","internalType":"address"},{"name":"value","type":"uint256","internalType":"uint256"},{"name":"deadline","type":"uint256","internalType":"uint256"},{"name":"v","type":"uint8","internalType":"uint8"},{"name":"r","type":"bytes32","internalType":"bytes32"},{"name":"s","type":"bytes32","internalType":"bytes32"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"recoverFunds","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"renounceRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"callerConfirmation","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"revokeRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setAllowlistMode","type":"function","inputs":[{"name":"_mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setBlacklisted","type":"function","inputs":[{"name":"_params","type":"tuple[]","components":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setWhitelisted","type":"function","inputs":[{"name":"_params","type":"tuple[]","components":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"supportsInterface","type":"function","inputs":[{"name":"interfaceId","type":"bytes4","internalType":"bytes4"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"symbol","type":"function","inputs":[],"outputs":[{"name":"","type":"string","internalType":"string"}],"stateMutability":"view"},{"name":"totalSupply","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"transfer","type":"function","inputs":[{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"transferFrom","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"unpause","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"whitelistedCount","type":"function","inputs":[],"outputs":[{"name":"count","type":"uint256","internalType":"uint256"}],"stateMutability":"view"}],"metadata":{"compiler":{"version":"0.8.26+commit.8a97fa7a"},"language":"Solidity","output":{"abi":[{"inputs":[{"internalType":"uint8","name":"_decimals","type":"uint8"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AccessControlBadConfirmation","type":"error"},{"inputs":[],"name":"AccessControlEnforcedDefaultAdminRules","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"bytes32","name":"neededRole","type":"bytes32"}],"name":"AccessControlUnauthorizedAccount","type":"error"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"bool","name":"isEnabled","type":"bool"}],"name":"AllowlistStateIdempotent","type":"error"},{"inputs":[{"internalType":"address","name":"pendingAdmin","type":"address"}],"name":"CallerNotPendingAdmin","type":"error"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"CannotRecoverFromAllowlisted","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"allowance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientAllowance","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"}],"name":"ERC20InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC20InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC20InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC20InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"ERC20InvalidSpender","type":"error"},{"inputs":[{"internalType":"uint256","name":"deadline","type":"uint256"}],"name":"ERC2612ExpiredSignature","type":"error"},{"inputs":[{"internalType":"address","name":"signer","type":"address"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC2612InvalidSigner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"currentNonce","type":"uint256"}],"name":"InvalidAccountNonce","type":"error"},{"inputs":[{"internalType":"address","name":"defaultAdmin","type":"address"}],"name":"InvalidDefaultAdmin","type":"error"},{"inputs":[],"name":"InvalidInitialization","type":"error"},{"inputs":[{"internalType":"enum IAllowlist.AllowlistMode","name":"mode","type":"uint8"}],"name":"ModeAlreadySet","type":"error"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"enum IAllowlist.AllowlistMode","name":"mode","type":"uint8"}],"name":"NotAllowlisted","type":"error"},{"inputs":[],"name":"NotInitializing","type":"error"},{"inputs":[{"internalType":"bool","name":"isPaused","type":"bool"}],"name":"PauseStateIdempotent","type":"error"},{"inputs":[],"name":"Paused","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"enum IAllowlist.AllowlistMode","name":"newMode","type":"uint8"}],"name":"AllowlistModeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"bool","name":"isBlacklisted","type":"bool"}],"name":"BlacklistUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"newAdmin","type":"address"}],"name":"DefaultAdminTransferStarted","type":"event"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"version","type":"uint64"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bool","name":"paused","type":"bool"}],"name":"PauseSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"bool","name":"isWhitelisted","type":"bool"}],"name":"WhitelistUpdated","type":"event"},{"inputs":[],"name":"BLACKLISTER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"BURNER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DOMAIN_SEPARATOR","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MINTER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PAUSER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"UNPAUSER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"WHITELISTER_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"acceptDefaultAdminTransfer","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"allowlistMode","outputs":[{"internalType":"enum IAllowlist.AllowlistMode","name":"mode","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_newAdmin","type":"address"}],"name":"beginDefaultAdminTransfer","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"blacklistedCount","outputs":[{"internalType":"uint256","name":"count","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_from","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"burn","outputs":[{"internalType":"bool","name":"success","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"tokenDecimals","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"defaultAdmin","outputs":[{"internalType":"address","name":"defaultAdminAddress","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"eip712Domain","outputs":[{"internalType":"bytes1","name":"fields","type":"bytes1"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"version","type":"string"},{"internalType":"uint256","name":"chainId","type":"uint256"},{"internalType":"address","name":"verifyingContract","type":"address"},{"internalType":"bytes32","name":"salt","type":"bytes32"},{"internalType":"uint256[]","name":"extensions","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_offset","type":"uint256"},{"internalType":"uint256","name":"_limit","type":"uint256"}],"name":"getBlacklist","outputs":[{"internalType":"address[]","name":"addresses","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleAdmin","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getRoleMember","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleMemberCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleMembers","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_offset","type":"uint256"},{"internalType":"uint256","name":"_limit","type":"uint256"}],"name":"getWhitelist","outputs":[{"internalType":"address[]","name":"addresses","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"_name","type":"string"},{"internalType":"string","name":"_symbol","type":"string"},{"internalType":"address","name":"_initialAdmin","type":"address"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_user","type":"address"}],"name":"isAllowlisted","outputs":[{"internalType":"bool","name":"isUserAllowlisted","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_user","type":"address"}],"name":"isBlacklisted","outputs":[{"internalType":"bool","name":"isUserBlacklisted","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isPaused","outputs":[{"internalType":"bool","name":"paused","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_user","type":"address"}],"name":"isWhitelisted","outputs":[{"internalType":"bool","name":"isUserWhitelisted","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"mint","outputs":[{"internalType":"bool","name":"success","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_owner","type":"address"}],"name":"nonces","outputs":[{"internalType":"uint256","name":"nonce","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pause","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"pendingDefaultAdmin","outputs":[{"internalType":"address","name":"pendingDefaultAdminAddress","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"value","type":"uint256"},{"internalType":"uint256","name":"deadline","type":"uint256"},{"internalType":"uint8","name":"v","type":"uint8"},{"internalType":"bytes32","name":"r","type":"bytes32"},{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"permit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_from","type":"address"},{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"recoverFunds","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"callerConfirmation","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum IAllowlist.AllowlistMode","name":"_mode","type":"uint8"}],"name":"setAllowlistMode","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"user","type":"address"},{"internalType":"bool","name":"isEnabled","type":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]","name":"_params","type":"tuple[]"}],"name":"setBlacklisted","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"address","name":"user","type":"address"},{"internalType":"bool","name":"isEnabled","type":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]","name":"_params","type":"tuple[]"}],"name":"setWhitelisted","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"success","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_from","type":"address"},{"internalType":"address","name":"_to","type":"address"},{"internalType":"uint256","name":"_amount","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"success","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"unpause","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"whitelistedCount","outputs":[{"internalType":"uint256","name":"count","type":"uint256"}],"stateMutability":"view","type":"function"}],"devdoc":{"author":"LayerZero Labs (@TRileySchwarz, tinom.eth)","custom:version":"1.0.0","details":"Roles are handled through `AccessControl2StepUpgradeable`.","errors":{"AccessControlBadConfirmation()":[{"details":"The caller of a function is not the expected one. NOTE: Don't confuse with {AccessControlUnauthorizedAccount}."}],"AccessControlUnauthorizedAccount(address,bytes32)":[{"details":"The `account` is missing a role."}],"AllowlistStateIdempotent(address,bool)":[{"params":{"isEnabled":"The desired state that the user is already in","user":"User address"}}],"CallerNotPendingAdmin(address)":[{"params":{"pendingAdmin":"Address of the pending admin"}}],"CannotRecoverFromAllowlisted(address)":[{"params":{"user":"Address that is allowlisted"}}],"ECDSAInvalidSignature()":[{"details":"The signature is invalid."}],"ECDSAInvalidSignatureLength(uint256)":[{"details":"The signature has an invalid length."}],"ECDSAInvalidSignatureS(bytes32)":[{"details":"The signature has an S value that is in the upper half order."}],"ERC20InsufficientAllowance(address,uint256,uint256)":[{"details":"Indicates a failure with the `spender`’s `allowance`. Used in transfers.","params":{"allowance":"Amount of tokens a `spender` is allowed to operate with.","needed":"Minimum amount required to perform a transfer.","spender":"Address that may be allowed to operate on tokens without being their owner."}}],"ERC20InsufficientBalance(address,uint256,uint256)":[{"details":"Indicates an error related to the current `balance` of a `sender`. Used in transfers.","params":{"balance":"Current balance for the interacting account.","needed":"Minimum amount required to perform a transfer.","sender":"Address whose tokens are being transferred."}}],"ERC20InvalidApprover(address)":[{"details":"Indicates a failure with the `approver` of a token to be approved. Used in approvals.","params":{"approver":"Address initiating an approval operation."}}],"ERC20InvalidReceiver(address)":[{"details":"Indicates a failure with the token `receiver`. Used in transfers.","params":{"receiver":"Address to which tokens are being transferred."}}],"ERC20InvalidSender(address)":[{"details":"Indicates a failure with the token `sender`. Used in transfers.","params":{"sender":"Address whose tokens are being transferred."}}],"ERC20InvalidSpender(address)":[{"details":"Indicates a failure with the `spender` to be approved. Used in approvals.","params":{"spender":"Address that may be allowed to operate on tokens without being their owner."}}],"ERC2612ExpiredSignature(uint256)":[{"details":"Permit deadline has expired."}],"ERC2612InvalidSigner(address,address)":[{"details":"Mismatched signature."}],"InvalidAccountNonce(address,uint256)":[{"details":"The nonce used for an `account` is not the expected current nonce."}],"InvalidDefaultAdmin(address)":[{"params":{"defaultAdmin":"Invalid default admin address"}}],"InvalidInitialization()":[{"details":"The contract is already initialized."}],"ModeAlreadySet(uint8)":[{"params":{"mode":"Current mode"}}],"NotAllowlisted(address,uint8)":[{"params":{"mode":"Current mode","user":"User address"}}],"NotInitializing()":[{"details":"The contract is not initializing."}],"PauseStateIdempotent(bool)":[{"params":{"isPaused":"Whether system is paused"}}]},"events":{"AllowlistModeUpdated(uint8)":{"params":{"newMode":"New mode"}},"Approval(address,address,uint256)":{"details":"Emitted when the allowance of a `spender` for an `owner` is set by a call to {approve}. `value` is the new allowance."},"BlacklistUpdated(address,bool)":{"params":{"isBlacklisted":"Whether the user is now blacklisted","user":"User address"}},"DefaultAdminTransferStarted(address)":{"params":{"newAdmin":"Address of the new pending default admin"}},"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."},"Initialized(uint64)":{"details":"Triggered when the contract has been initialized or reinitialized."},"PauseSet(bool)":{"params":{"paused":"Pause status"}},"RoleAdminChanged(bytes32,bytes32,bytes32)":{"details":"Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole` `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite {RoleAdminChanged} not being emitted to signal this."},"RoleGranted(bytes32,address,address)":{"details":"Emitted when `account` is granted `role`. `sender` is the account that originated the contract call. This account bears the admin role (for the granted role). Expected in cases where the role was granted using the internal {AccessControl-_grantRole}."},"RoleRevoked(bytes32,address,address)":{"details":"Emitted when `account` is revoked `role`. `sender` is the account that originated the contract call:   - if using `revokeRole`, it is the admin role bearer   - if using `renounceRole`, it is the role bearer (i.e. `account`)"},"Transfer(address,address,uint256)":{"details":"Emitted when `value` tokens are moved from one account (`from`) to another (`to`). Note that `value` may be zero."},"WhitelistUpdated(address,bool)":{"params":{"isWhitelisted":"Whether the user is now whitelisted","user":"User address"}}},"kind":"dev","methods":{"DOMAIN_SEPARATOR()":{"details":"Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}."},"allowance(address,address)":{"details":"Returns the remaining number of tokens that `spender` will be allowed to spend on behalf of `owner` through {transferFrom}. This is zero by default. This value changes when {approve} or {transferFrom} are called."},"allowlistMode()":{"returns":{"mode":"Current mode"}},"approve(address,uint256)":{"details":"See {IERC20-approve}. NOTE: If `value` is the maximum `uint256`, the allowance is not updated on `transferFrom`. This is semantically equivalent to an infinite approval. Requirements: - `spender` cannot be the zero address."},"balanceOf(address)":{"details":"Returns the value of tokens owned by `account`."},"beginDefaultAdminTransfer(address)":{"details":"It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`.","params":{"newAdmin":"Address of the new pending default admin"}},"blacklistedCount()":{"returns":{"count":"Total number of blacklisted addresses"}},"burn(address,uint256)":{"params":{"_amount":"Amount of tokens to burn","_from":"Address to burn tokens from"},"returns":{"success":"Always returns true"}},"constructor":{"details":"Sets immutable variables.","params":{"_decimals":"Decimals of the token"}},"decimals()":{"details":"Override to set immutable decimals."},"defaultAdmin()":{"returns":{"defaultAdminAddress":"Address of the current `DEFAULT_ADMIN_ROLE` holder"}},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"getBlacklist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of blacklisted addresses"}},"getRoleAdmin(bytes32)":{"details":"Returns the admin role that controls `role`. See {grantRole} and {revokeRole}. To change a role's admin, use {_setRoleAdmin}."},"getRoleMember(bytes32,uint256)":{"details":"Returns one of the accounts that have `role`. `index` must be a value between 0 and {getRoleMemberCount}, non-inclusive. Role bearers are not sorted in any particular way, and their ordering may change at any point. WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure you perform all queries on the same block. See the following https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] for more information."},"getRoleMemberCount(bytes32)":{"details":"Returns the number of accounts that have `role`. Can be used together with {getRoleMember} to enumerate all bearers of a role."},"getRoleMembers(bytes32)":{"details":"Return all accounts that have `role` WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that this function has an unbounded cost, and using it as part of a state-changing function may render the function uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block."},"getWhitelist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of whitelisted addresses"}},"grantRole(bytes32,address)":{"details":"Grants `role` to `account`. If `account` had not been already granted `role`, emits a {RoleGranted} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleGranted} event."},"hasRole(bytes32,address)":{"details":"Returns `true` if `account` has been granted `role`."},"initialize(string,string,address)":{"params":{"_initialAdmin":"Address to be granted `DEFAULT_ADMIN_ROLE`","_name":"Name of the token","_symbol":"Symbol of the token"}},"isAllowlisted(address)":{"params":{"_user":"User address"},"returns":{"isUserAllowlisted":"Whether the user is allowlisted"}},"isBlacklisted(address)":{"params":{"_user":"User address"},"returns":{"isUserBlacklisted":"Whether the user is blacklisted"}},"isPaused()":{"returns":{"paused":"Whether the system is paused"}},"isWhitelisted(address)":{"params":{"_user":"User address"},"returns":{"isUserWhitelisted":"Whether the user is whitelisted"}},"mint(address,uint256)":{"details":"It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.","params":{"_amount":"Amount of tokens to mint","_to":"Address to mint tokens to"},"returns":{"success":"Always returns true"}},"name()":{"details":"Returns the name of the token."},"nonces(address)":{"details":"Returns the current nonce for `owner`. This value must be included whenever a signature is generated for {permit}. Every successful call to {permit} increases ``owner``'s nonce by one. This prevents a signature from being used multiple times."},"pendingDefaultAdmin()":{"returns":{"pendingDefaultAdminAddress":"Address of the pending `DEFAULT_ADMIN_ROLE` account"}},"permit(address,address,uint256,uint256,uint8,bytes32,bytes32)":{"details":"Sets `value` as the allowance of `spender` over ``owner``'s tokens, given ``owner``'s signed approval. IMPORTANT: The same issues {IERC20-approve} has related to transaction ordering also applies here. Emits an {Approval} event. Requirements: - `spender` cannot be the zero address. - `deadline` must be a timestamp in the future. - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner` over the EIP712-formatted function arguments. - the signature must use ``owner``'s current nonce (see {nonces}). For more information on the signature format, see the https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP section]. CAUTION: See Security Considerations above."},"recoverFunds(address,address,uint256)":{"details":"Only recovers from non-allowlisted `_from` address.","params":{"_amount":"Amount of funds to recover","_from":"Address to recover funds from","_to":"Address to send the recovered funds to"}},"renounceRole(bytes32,address)":{"details":"Revokes `role` from the calling account. Roles are often managed via {grantRole} and {revokeRole}: this function's purpose is to provide a mechanism for accounts to lose their privileges if they are compromised (such as when a trusted device is misplaced). If the calling account had been revoked `role`, emits a {RoleRevoked} event. Requirements: - the caller must be `callerConfirmation`. May emit a {RoleRevoked} event."},"revokeRole(bytes32,address)":{"details":"Revokes `role` from `account`. If `account` had been granted `role`, emits a {RoleRevoked} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleRevoked} event."},"setAllowlistMode(uint8)":{"params":{"_mode":"New allowlist mode"}},"setBlacklisted((address,bool)[])":{"params":{"_params":"Array of users and blacklist states"}},"setWhitelisted((address,bool)[])":{"params":{"_params":"Array of users and whitelist states"}},"supportsInterface(bytes4)":{"details":"Returns true if this contract implements the interface defined by `interfaceId`. See the corresponding https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section] to learn more about how these ids are created. This function call must use less than 30 000 gas."},"symbol()":{"details":"Returns the symbol of the token, usually a shorter version of the name."},"totalSupply()":{"details":"Returns the value of tokens in existence."},"transfer(address,uint256)":{"details":"Override to add allowlist checks."},"transferFrom(address,address,uint256)":{"details":"Override to add allowlist checks."},"whitelistedCount()":{"returns":{"count":"Total number of whitelisted addresses"}}},"stateVariables":{"DECIMALS":{"details":"Immutable decimals of the token."}},"title":"SaturnOFT","version":1},"userdoc":{"errors":{"AccessControlEnforcedDefaultAdminRules()":[{"notice":"Thrown when one of the following rules is violated:         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps."}],"AllowlistStateIdempotent(address,bool)":[{"notice":"Thrown when a user is already in the desired state (blacklist or whitelist)."}],"CallerNotPendingAdmin(address)":[{"notice":"Thrown when the caller is not the pending admin."}],"CannotRecoverFromAllowlisted(address)":[{"notice":"Thrown when trying to recover funds from an allowlisted address."}],"InvalidDefaultAdmin(address)":[{"notice":"Thrown when the intended default admin is invalid."}],"ModeAlreadySet(uint8)":[{"notice":"Thrown when the intended allowlist mode is already set."}],"NotAllowlisted(address,uint8)":[{"notice":"Thrown when a user is not allowlisted."}],"PauseStateIdempotent(bool)":[{"notice":"Thrown when setting pause state is idempotent (no change)."}],"Paused()":[{"notice":"Thrown when attempting to perform an action while paused."}]},"events":{"AllowlistModeUpdated(uint8)":{"notice":"Emitted when the allowlist mode is updated."},"BlacklistUpdated(address,bool)":{"notice":"Emitted when a user's blacklist state is updated."},"DefaultAdminTransferStarted(address)":{"notice":"Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started."},"PauseSet(bool)":{"notice":"Emitted when the pause status is set."},"WhitelistUpdated(address,bool)":{"notice":"Emitted when a user's whitelist state is updated."}},"kind":"user","methods":{"BLACKLISTER_ROLE()":{"notice":"Role for setting the blacklist state for users."},"BURNER_ROLE()":{"notice":"Role for burning tokens."},"MINTER_ROLE()":{"notice":"Role for minting tokens."},"PAUSER_ROLE()":{"notice":"Role for pausing the contract."},"UNPAUSER_ROLE()":{"notice":"Role for unpausing the contract."},"WHITELISTER_ROLE()":{"notice":"Role for setting the whitelist state for users."},"acceptDefaultAdminTransfer()":{"notice":"Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`."},"allowlistMode()":{"notice":"Returns the current allowlist mode."},"beginDefaultAdminTransfer(address)":{"notice":"Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`."},"blacklistedCount()":{"notice":"Returns the total count of blacklisted addresses."},"burn(address,uint256)":{"notice":"Burns tokens from address without approval."},"defaultAdmin()":{"notice":"Returns the address of the current `DEFAULT_ADMIN_ROLE` holder."},"getBlacklist(uint256,uint256)":{"notice":"Returns a paginated list of blacklisted addresses."},"getWhitelist(uint256,uint256)":{"notice":"Returns a paginated list of whitelisted addresses."},"initialize(string,string,address)":{"notice":"Initializes the contract with a name, symbol, and default admin."},"isAllowlisted(address)":{"notice":"Checks if a user is allowlisted under the current mode."},"isBlacklisted(address)":{"notice":"Returns the blacklist state for a user."},"isPaused()":{"notice":"Checks if the system is paused."},"isWhitelisted(address)":{"notice":"Returns the whitelist state for a user."},"mint(address,uint256)":{"notice":"Mints tokens to address."},"pause()":{"notice":"Pauses the system."},"pendingDefaultAdmin()":{"notice":"Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling         `acceptDefaultAdminTransfer`."},"recoverFunds(address,address,uint256)":{"notice":"Recovers funds from a non-allowlisted address."},"setAllowlistMode(uint8)":{"notice":"Sets the allowlist mode."},"setBlacklisted((address,bool)[])":{"notice":"Sets the blacklist state for an array of users."},"setWhitelisted((address,bool)[])":{"notice":"Sets the whitelist state for an array of users."},"unpause()":{"notice":"Unpauses the system."},"whitelistedCount()":{"notice":"Returns the total count of whitelisted addresses."}},"notice":"Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.","version":1}},"settings":{"compilationTarget":{"contracts/evm/SaturnOFT.sol":"SaturnOFT"},"evmVersion":"cancun","libraries":{},"metadata":{"bytecodeHash":"ipfs"},"optimizer":{"enabled":true,"runs":750},"remappings":[":@axelar-network/=node_modules/@axelar-network/",":@chainlink/=node_modules/@chainlink/",":@eth-optimism/=node_modules/@eth-optimism/",":@layerzerolabs/=node_modules/@layerzerolabs/",":@openzeppelin/=node_modules/@openzeppelin/",":forge-std/=lib/forge-std/src/",":hardhat-deploy/=node_modules/hardhat-deploy/",":solidity-bytes-utils/=node_modules/solidity-bytes-utils/"],"viaIR":true},"sources":{"contracts/evm/SaturnOFT.sol":{"keccak256":"0x1c867b09d30364dbcd4ac3623b2c77c168b2e9d785cadea9fbaed573d4db4a49","license":"MIT","urls":["bzz-raw://de5ed006bf72c334abb4be1e639ece22f3b2629fb65332e460e5af316522f648","dweb:/ipfs/QmTDMhe4eEiaa51E4P79fmw3WVXbuw5b3kwKmQUanj6riW"]},"contracts/evm/interfaces/IERC20Plus.sol":{"keccak256":"0x29b872b47b10724dac5d6102161f6f9fb5a6cd4a6ccc047b4b334f70be7e1d5c","license":"MIT","urls":["bzz-raw://bcd9e4b98d4d6f2a339d3917268f821337fb38af0a26d5a61fee97afc625db73","dweb:/ipfs/QmWczcgzgUv1ykjfmuS2tnCE921gPb4mXFXGVGZWWWnXk2"]},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol":{"keccak256":"0x97c5800d918f21faa1599728d07a726643437f2744930567addfddd962338507","license":"MIT","urls":["bzz-raw://f4ad0d138f2a9ee852d3d21c396bd6b4a5157cd9c67158e7dc108bad8f11c6cb","dweb:/ipfs/QmZMgQqJtHQPJkV1R3amYXHmMPHRbQfbgXA3dqmqFonjrH"]},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol":{"keccak256":"0x8eb3b1ab7135ad0ab6af2382336923ea4bbdc166be0ac4b26362c358c7b47e4d","license":"MIT","urls":["bzz-raw://87d50a2cbe5164be9479740a8f4305ea29dc0373f57ca50bc292d822eb9d8210","dweb:/ipfs/QmbWV3XD5fqKCPEsE97szdCt9YwuuEbiP3VepDfqC4Ti47"]},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol":{"keccak256":"0x3f65bb879652c2263aa42dbb71cd919e6622ceaac68e2eb94a08b073d0bf2d4b","license":"MIT","urls":["bzz-raw://f38cd755df8e6a7bfe6b56c4c9a49ab33f1f1716d93452e57131645a7ae344a9","dweb:/ipfs/QmY2KmFvNYZJAMNU13uQVmMgjQuYyGTfNRPCiqq2w299Vv"]},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol":{"keccak256":"0x6334069fdbb0857f33a25c9d6cb2730a670e317d0057e014fb9db812104c8ad6","license":"MIT","urls":["bzz-raw://cf327cec0bb87af4737ac4d6ed1aa0896c4d192de765dd95bbb9f104475f2924","dweb:/ipfs/QmYe8AaEtYED27ut6hVaF28JQQYV8RMXVa4KaQ2qs7ZJx9"]},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol":{"keccak256":"0xdbf9112508e836469eaa25e27828efe1ef37233e14a2494aeaa0c953856f5e25","license":"MIT","urls":["bzz-raw://ef0de4f3cb423772523fe908bf2f647bd78306021e2c63429ea859f2317ebfba","dweb:/ipfs/QmP4HSLZSSZrK816J8in3BtXZbfbAzKJ24SMmKZRLKKuHD"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol":{"keccak256":"0xedbdd0eda025c2455d16f6f6551b1c93e3a41eb8d00ee4cb8a530b45d8818cc4","license":"MIT","urls":["bzz-raw://e50a28b34bd9808fc497b13bd4b3a3fcf0acc2df4eb4b578e67ecaa2be4730cf","dweb:/ipfs/QmUovTphKRAiPX2XqH4mxSoei2imekQfKwnxce6sJbSqwL"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol":{"keccak256":"0x6854c032eff37100c1dd8eca325cfeefe2825ac17b54bfeef254b7f845b736ef","license":"MIT","urls":["bzz-raw://5271ec59efa1675eb643a352f72e38a12f541c6e20c4db3101edf6411981f9b3","dweb:/ipfs/QmRhsQknMiy3fBcKUh3UEgWN39UKtfszw8PT6NteSbYeXM"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol":{"keccak256":"0x65e3a96d05da05311112ac6e53bca28e2cb9a2b0e1f5908052afc7da843f2b98","license":"MIT","urls":["bzz-raw://33b9251dd6a7f5d6f9a6cd8dbfa30c2226eefbf008580bdae64e42a67c3a106d","dweb:/ipfs/QmdyFyJdvg6kxoLHhGUbP8ZLPEehSKvYBRxrz2mZK7JNpQ"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol":{"keccak256":"0x6287aa20cbf7d64e8721ecf490767c7ac96fe81730aee1351944d3e58df9c415","license":"MIT","urls":["bzz-raw://b8bfaf291795f2960566ca52f2b37565b36e613d7a81e33887191d3240cf706b","dweb:/ipfs/QmdA5jvfXZcA2d8P5b5YJrJFmmsokj78Pv7aH99CEFb8ST"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol":{"keccak256":"0xeeefcf141f9fdd6ca36f302cd3374a42cdf99680293df01bd42fcffaa36bcfa8","license":"MIT","urls":["bzz-raw://b5652e21bba9d72ead138e2daafe14f38e3b5c19e928c4d0d2d11aa8d65f814a","dweb:/ipfs/Qmf3MFUrfuJSa2LXrC2Ho6AQuDCTYY2CfctPeR2q29xnKe"]},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol":{"keccak256":"0x44409bb3c2ade83957c63c655d3becf2b054cccad52bbd05987f3252c26f867f","license":"MIT","urls":["bzz-raw://a87c6afad5797ac99a5e0803ed765a94f47657b90b833a82a0670e337f5a340e","dweb:/ipfs/QmRHBDFCSrUoMmLmgHLQmQLTj38gEZ4DWepND2CHN2UGu2"]},"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol":{"keccak256":"0xe3a2cff969716ebedd6f9fc7f4cbc499449e9bd0377afa49dab9e9c21212a50e","license":"MIT","urls":["bzz-raw://b14eb6728d660a790b2c49df0e96fe31e467ec30fc02ae41944b5d5a628610d8","dweb:/ipfs/QmSP2j6xhEbCRzDyv5HTwvJV14vBtyZFog3LUh7wp94YHc"]},"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol":{"keccak256":"0x330e7d8f3e5ada1545f79e293731092705e27177eb1a79605f8938a925828997","license":"MIT","urls":["bzz-raw://2a522cc0fcda63a508a40a5f438d28dbd51581bfdf841ff948e31fd8bc090127","dweb:/ipfs/QmXZrGyomqrLtvV417EUT3XBTm8zN4fY26AHBxGVEarXjc"]},"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol":{"keccak256":"0x30d125b8417684dbfea3e8d57284b353a86b22077237b4aaf098c0b54b153e16","license":"MIT","urls":["bzz-raw://2813775a6326190e75dfa9005c1abbdb1e541c195c0bf5656dd4199e8c66fd8d","dweb:/ipfs/QmYDKANBezQXNrEDyJ69RVXkgypW1hWj7MAvjfdNHTZY8L"]},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol":{"keccak256":"0xd518def45c722a6e803e1e26e625db25e01497f672ca566cca585d234ec903b0","license":"MIT","urls":["bzz-raw://6e7de3fccd96783244790cde282435ce0fd3a44ab4ccb10f17005c743202882f","dweb:/ipfs/QmYSepstTqs5UPJvjeJXkWU5R659yReqrSgSGGh65hkbdK"]},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol":{"keccak256":"0x2abba89aa289a6c0e38404a5b2e0020ca133e1ae0c790bdfc4cc99a1e2af93ba","license":"MIT","urls":["bzz-raw://babdfa68f728f6063f378692ac75dc086d3a7d7a4c04f53779c4365d0b2d1124","dweb:/ipfs/QmNZe3zu6FvpN9xBMadQsxip11VAUyqJWHTbrBGCqes9SC"]},"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol":{"keccak256":"0xad316bdc3ee64a0e29773256245045dc57b92660799ff14f668f7c0da9456a9d","license":"MIT","urls":["bzz-raw://66463434d266816fca2a3a2734ceee88544e61b7cc3899c50333b46e8e771455","dweb:/ipfs/QmPYCzHjki1HQLvBub3uUqoUKGrwdgR3xP9Zpya14YTdXS"]},"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol":{"keccak256":"0xe82a34ce4440f4c0a144fcd5c837c05bcd6bfbd947ba184f3e9904c14ed280ad","license":"MIT","urls":["bzz-raw://f05905d8f1f2941589c625b74f2ca7fb3f2a8d8b9e55c0b31072404720a1cb95","dweb:/ipfs/QmVCzDUqSaUYGLSqwkeEQHBMTrJQtUMjEsBBEsGYBdyazE"]},"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol":{"keccak256":"0xf415d9f93e322a9fe3682712ffb72cfd3daf8f4c4acfa1bb4fea8f5fb7e1cf0d","license":"MIT","urls":["bzz-raw://7ce394d9dd8bd6902a4d529ad3a1f3529918f26aafd4740d2f739712d89bebdd","dweb:/ipfs/QmSgrefNY63FEpgWQAsnn46VwcrP2ShEY3mtB58x7pAiuN"]},"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol":{"keccak256":"0x16b88aca1f1c3aa38783416d86207ce6fe574fcd1993dfe54403b5c8b6c74224","license":"MIT","urls":["bzz-raw://29f3c5c687fe0d87742b013872f495e67656910530c916a69873860dc8fea812","dweb:/ipfs/QmbspfQXmbhCANqqiunUFm9fiVVQwPet2YKQoJ58km442Y"]},"node_modules/@openzeppelin/contracts/access/IAccessControl.sol":{"keccak256":"0xbff9f59c84e5337689161ce7641c0ef8e872d6a7536fbc1f5133f128887aba3c","license":"MIT","urls":["bzz-raw://b308f882e796f7b79c9502deacb0a62983035c6f6f4e962b319ba6a1f4a77d3d","dweb:/ipfs/QmaWCW7ahEQqFjwhSUhV7Ae7WhfNvzSpE7DQ58hvEooqPL"]},"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol":{"keccak256":"0xbc97d8c0d67d4d7eba1e662f0a8671712ace9e060ab03af547c4bb321aec1d8c","license":"MIT","urls":["bzz-raw://890d156f50630d52c7be57d7e0499132d6fd92b2e1365b81531f4463b3304377","dweb:/ipfs/QmUHe9uL1ciePH2pQg7wdrgTAFRZWjcpBEAg8V1UNtXutd"]},"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol":{"keccak256":"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee","license":"MIT","urls":["bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae","dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1"]},"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"keccak256":"0x1b88b3fb3d85ba5496d7d5f396f83ee1fddcdd6762059ff65992655b67920998","license":"MIT","urls":["bzz-raw://89393bb3212da1c0889601b9706a07b39419ddc4d2faab9eaf6e7f9152cf6a1c","dweb:/ipfs/QmcCfzzxv1Bkdz1c1yF4gQCeYb6Us5BJANnzTFqawfd1HL"]},"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol":{"keccak256":"0xdb4d24ee2c087c391d587cd17adfe5b3f9d93b3110b1388c2ab6c7c0ad1dcd05","license":"MIT","urls":["bzz-raw://ab7b6d5b9e2b88176312967fe0f0e78f3d9a1422fa5e4b64e2440c35869b5d08","dweb:/ipfs/QmXKYWWyzcLg1B2k7Sb1qkEXgLCYfXecR9wYW5obRzWP1Q"]},"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol":{"keccak256":"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2","license":"MIT","urls":["bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303","dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV"]},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"keccak256":"0xd6fa4088198f04eef10c5bce8a2f4d60554b7ec4b987f684393c01bf79b94d9f","license":"MIT","urls":["bzz-raw://f95ee0bbd4dd3ac730d066ba3e785ded4565e890dbec2fa7d3b9fe3bad9d0d6e","dweb:/ipfs/QmSLr6bHkPFWT7ntj34jmwfyskpwo97T9jZUrk5sz3sdtR"]},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol":{"keccak256":"0x53befc41288eaa87edcd3a7be7e8475a32e44c6a29f9bf52fae789781301d9ff","license":"MIT","urls":["bzz-raw://a1d7fab53c4ceaf42391b83d9b36d7e9cc524a8da125cffdcd32c56560f9d1c9","dweb:/ipfs/QmaRZdVhQdqNXofeimibkBG65q9GVcXVZEGpycwwX3znC6"]},"node_modules/@openzeppelin/contracts/utils/Arrays.sol":{"keccak256":"0xb3b81029526a4c3acf39e57cc446407141ebce338cc99585942af1340e1a69e0","license":"MIT","urls":["bzz-raw://3857ce97e8f7a51ad78ea5419b3386e18fcc8af73b65803eedd8193ab7abc9df","dweb:/ipfs/QmSQi6x2cYsUy76mfMNwuq151bVmh4kAND141kjume51Aq"]},"node_modules/@openzeppelin/contracts/utils/Bytes.sol":{"keccak256":"0xf80e4b96b6849936ea0fabd76cf81b13d7276295fddb1e1c07afb3ddf650b0ac","license":"MIT","urls":["bzz-raw://6430007255ac11c6e9c4331a418f3af52ff66fbbae959f645301d025b20aeb08","dweb:/ipfs/QmQE5fjmBBRw9ndnzJuC2uskYss1gbaR7JdazoCf1FGoBj"]},"node_modules/@openzeppelin/contracts/utils/Comparators.sol":{"keccak256":"0x302eecd8cf323b4690e3494a7d960b3cbce077032ab8ef655b323cdd136cec58","license":"MIT","urls":["bzz-raw://49ba706f1bc476d68fe6c1fad75517acea4e9e275be0989b548e292eb3a3eacd","dweb:/ipfs/QmeBpvcdGWzWMKTQESUCEhHgnEQYYATVwPxLMxa6vMT7jC"]},"node_modules/@openzeppelin/contracts/utils/Panic.sol":{"keccak256":"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a","license":"MIT","urls":["bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a","dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG"]},"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol":{"keccak256":"0x94045fd4f268edf2b2d01ef119268548c320366d6f5294ad30c1b8f9d4f5225f","license":"MIT","urls":["bzz-raw://edfda81f426f8948b3834115c21e83c48180e6db0d2a8cd2debb2185ed349337","dweb:/ipfs/QmdYZneFyDAux1BuWQxLAdqtABrGS2k9WYCa7C9dvpKkWv"]},"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol":{"keccak256":"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97","license":"MIT","urls":["bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b","dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM"]},"node_modules/@openzeppelin/contracts/utils/Strings.sol":{"keccak256":"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8","license":"MIT","urls":["bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc","dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS"]},"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"keccak256":"0xbeb5cad8aaabe0d35d2ec1a8414d91e81e5a8ca679add4cf57e2f33476861f40","license":"MIT","urls":["bzz-raw://ebb272a5ee2da4e8bd5551334e0ce8dce4e9c56a04570d6bf046d260fab3116a","dweb:/ipfs/QmNw6RyM769qcqFocDq6HJMG2WiEnQbvizpRaUXsACHho2"]},"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"keccak256":"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d","license":"MIT","urls":["bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c","dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL"]},"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol":{"keccak256":"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c","license":"MIT","urls":["bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617","dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u"]},"node_modules/@openzeppelin/contracts/utils/math/Math.sol":{"keccak256":"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857","license":"MIT","urls":["bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5","dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y"]},"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol":{"keccak256":"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083","license":"MIT","urls":["bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9","dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif"]},"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol":{"keccak256":"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3","license":"MIT","urls":["bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03","dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ"]},"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol":{"keccak256":"0x5c298e834696707e274a71a224969d36faecd928a8076603210d67d091adb4ae","license":"MIT","urls":["bzz-raw://a93fe967b4d55b31157164cbb7e3e1ebaf3535fc1d3f8d0156da7abb9b565d90","dweb:/ipfs/QmXH7nyxwEUeMPFDDmkdUwqxLEcezaSmVyunyMAuck1WqR"]}},"version":1},"storageLayout":{"types":null,"storage":[]},"transientStorageLayout":null,"userdoc":{"kind":"user","errors":{"Paused()":[{"notice":"Thrown when attempting to perform an action while paused."}],"ModeAlreadySet(uint8)":[{"notice":"Thrown when the intended allowlist mode is already set."}],"PauseStateIdempotent(bool)":[{"notice":"Thrown when setting pause state is idempotent (no change)."}],"InvalidDefaultAdmin(address)":[{"notice":"Thrown when the intended default admin is invalid."}],"NotAllowlisted(address,uint8)":[{"notice":"Thrown when a user is not allowlisted."}],"CallerNotPendingAdmin(address)":[{"notice":"Thrown when the caller is not the pending admin."}],"CannotRecoverFromAllowlisted(address)":[{"notice":"Thrown when trying to recover funds from an allowlisted address."}],"AllowlistStateIdempotent(address,bool)":[{"notice":"Thrown when a user is already in the desired state (blacklist or whitelist)."}],"AccessControlEnforcedDefaultAdminRules()":[{"notice":"Thrown when one of the following rules is violated:         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps."}]},"events":{"PauseSet(bool)":{"notice":"Emitted when the pause status is set."},"AllowlistModeUpdated(uint8)":{"notice":"Emitted when the allowlist mode is updated."},"BlacklistUpdated(address,bool)":{"notice":"Emitted when a user's blacklist state is updated."},"WhitelistUpdated(address,bool)":{"notice":"Emitted when a user's whitelist state is updated."},"DefaultAdminTransferStarted(address)":{"notice":"Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started."}},"notice":"Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.","methods":{"pause()":{"notice":"Pauses the system."},"unpause()":{"notice":"Unpauses the system."},"isPaused()":{"notice":"Checks if the system is paused."},"BURNER_ROLE()":{"notice":"Role for burning tokens."},"MINTER_ROLE()":{"notice":"Role for minting tokens."},"PAUSER_ROLE()":{"notice":"Role for pausing the contract."},"defaultAdmin()":{"notice":"Returns the address of the current `DEFAULT_ADMIN_ROLE` holder."},"UNPAUSER_ROLE()":{"notice":"Role for unpausing the contract."},"allowlistMode()":{"notice":"Returns the current allowlist mode."},"BLACKLISTER_ROLE()":{"notice":"Role for setting the blacklist state for users."},"WHITELISTER_ROLE()":{"notice":"Role for setting the whitelist state for users."},"blacklistedCount()":{"notice":"Returns the total count of blacklisted addresses."},"whitelistedCount()":{"notice":"Returns the total count of whitelisted addresses."},"burn(address,uint256)":{"notice":"Burns tokens from address without approval."},"mint(address,uint256)":{"notice":"Mints tokens to address."},"pendingDefaultAdmin()":{"notice":"Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling         `acceptDefaultAdminTransfer`."},"isAllowlisted(address)":{"notice":"Checks if a user is allowlisted under the current mode."},"isBlacklisted(address)":{"notice":"Returns the blacklist state for a user."},"isWhitelisted(address)":{"notice":"Returns the whitelist state for a user."},"setAllowlistMode(uint8)":{"notice":"Sets the allowlist mode."},"acceptDefaultAdminTransfer()":{"notice":"Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`."},"getBlacklist(uint256,uint256)":{"notice":"Returns a paginated list of blacklisted addresses."},"getWhitelist(uint256,uint256)":{"notice":"Returns a paginated list of whitelisted addresses."},"setBlacklisted((address,bool)[])":{"notice":"Sets the blacklist state for an array of users."},"setWhitelisted((address,bool)[])":{"notice":"Sets the whitelist state for an array of users."},"initialize(string,string,address)":{"notice":"Initializes the contract with a name, symbol, and default admin."},"beginDefaultAdminTransfer(address)":{"notice":"Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`."},"recoverFunds(address,address,uint256)":{"notice":"Recovers funds from a non-allowlisted address."}},"version":1},"devdoc":{"kind":"dev","title":"SaturnOFT","author":"LayerZero Labs (@TRileySchwarz, tinom.eth)","errors":{"NotInitializing()":[{"details":"The contract is not initializing."}],"ModeAlreadySet(uint8)":[{"params":{"mode":"Current mode"}}],"ECDSAInvalidSignature()":[{"details":"The signature is invalid."}],"InvalidInitialization()":[{"details":"The contract is already initialized."}],"PauseStateIdempotent(bool)":[{"params":{"isPaused":"Whether system is paused"}}],"ERC20InvalidSender(address)":[{"params":{"sender":"Address whose tokens are being transferred."},"details":"Indicates a failure with the token `sender`. Used in transfers."}],"ERC20InvalidSpender(address)":[{"params":{"spender":"Address that may be allowed to operate on tokens without being their owner."},"details":"Indicates a failure with the `spender` to be approved. Used in approvals."}],"InvalidDefaultAdmin(address)":[{"params":{"defaultAdmin":"Invalid default admin address"}}],"ERC20InvalidApprover(address)":[{"params":{"approver":"Address initiating an approval operation."},"details":"Indicates a failure with the `approver` of a token to be approved. Used in approvals."}],"ERC20InvalidReceiver(address)":[{"params":{"receiver":"Address to which tokens are being transferred."},"details":"Indicates a failure with the token `receiver`. Used in transfers."}],"NotAllowlisted(address,uint8)":[{"params":{"mode":"Current mode","user":"User address"}}],"AccessControlBadConfirmation()":[{"details":"The caller of a function is not the expected one. NOTE: Don't confuse with {AccessControlUnauthorizedAccount}."}],"CallerNotPendingAdmin(address)":[{"params":{"pendingAdmin":"Address of the pending admin"}}],"ECDSAInvalidSignatureS(bytes32)":[{"details":"The signature has an S value that is in the upper half order."}],"ERC2612ExpiredSignature(uint256)":[{"details":"Permit deadline has expired."}],"ECDSAInvalidSignatureLength(uint256)":[{"details":"The signature has an invalid length."}],"InvalidAccountNonce(address,uint256)":[{"details":"The nonce used for an `account` is not the expected current nonce."}],"CannotRecoverFromAllowlisted(address)":[{"params":{"user":"Address that is allowlisted"}}],"ERC2612InvalidSigner(address,address)":[{"details":"Mismatched signature."}],"AllowlistStateIdempotent(address,bool)":[{"params":{"user":"User address","isEnabled":"The desired state that the user is already in"}}],"AccessControlUnauthorizedAccount(address,bytes32)":[{"details":"The `account` is missing a role."}],"ERC20InsufficientBalance(address,uint256,uint256)":[{"params":{"needed":"Minimum amount required to perform a transfer.","sender":"Address whose tokens are being transferred.","balance":"Current balance for the interacting account."},"details":"Indicates an error related to the current `balance` of a `sender`. Used in transfers."}],"ERC20InsufficientAllowance(address,uint256,uint256)":[{"params":{"needed":"Minimum amount required to perform a transfer.","spender":"Address that may be allowed to operate on tokens without being their owner.","allowance":"Amount of tokens a `spender` is allowed to operate with."},"details":"Indicates a failure with the `spender`’s `allowance`. Used in transfers."}]},"events":{"PauseSet(bool)":{"params":{"paused":"Pause status"}},"Initialized(uint64)":{"details":"Triggered when the contract has been initialized or reinitialized."},"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."},"AllowlistModeUpdated(uint8)":{"params":{"newMode":"New mode"}},"BlacklistUpdated(address,bool)":{"params":{"user":"User address","isBlacklisted":"Whether the user is now blacklisted"}},"WhitelistUpdated(address,bool)":{"params":{"user":"User address","isWhitelisted":"Whether the user is now whitelisted"}},"Approval(address,address,uint256)":{"details":"Emitted when the allowance of a `spender` for an `owner` is set by a call to {approve}. `value` is the new allowance."},"Transfer(address,address,uint256)":{"details":"Emitted when `value` tokens are moved from one account (`from`) to another (`to`). Note that `value` may be zero."},"DefaultAdminTransferStarted(address)":{"params":{"newAdmin":"Address of the new pending default admin"}},"RoleGranted(bytes32,address,address)":{"details":"Emitted when `account` is granted `role`. `sender` is the account that originated the contract call. This account bears the admin role (for the granted role). Expected in cases where the role was granted using the internal {AccessControl-_grantRole}."},"RoleRevoked(bytes32,address,address)":{"details":"Emitted when `account` is revoked `role`. `sender` is the account that originated the contract call:   - if using `revokeRole`, it is the admin role bearer   - if using `renounceRole`, it is the role bearer (i.e. `account`)"},"RoleAdminChanged(bytes32,bytes32,bytes32)":{"details":"Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole` `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite {RoleAdminChanged} not being emitted to signal this."}},"details":"Roles are handled through `AccessControl2StepUpgradeable`.","methods":{"name()":{"details":"Returns the name of the token."},"symbol()":{"details":"Returns the symbol of the token, usually a shorter version of the name."},"decimals()":{"details":"Override to set immutable decimals."},"isPaused()":{"returns":{"paused":"Whether the system is paused"}},"constructor":{"params":{"_decimals":"Decimals of the token"},"details":"Sets immutable variables."},"totalSupply()":{"details":"Returns the value of tokens in existence."},"defaultAdmin()":{"returns":{"defaultAdminAddress":"Address of the current `DEFAULT_ADMIN_ROLE` holder"}},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"allowlistMode()":{"returns":{"mode":"Current mode"}},"nonces(address)":{"details":"Returns the current nonce for `owner`. This value must be included whenever a signature is generated for {permit}. Every successful call to {permit} increases ``owner``'s nonce by one. This prevents a signature from being used multiple times."},"DOMAIN_SEPARATOR()":{"details":"Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}."},"balanceOf(address)":{"details":"Returns the value of tokens owned by `account`."},"blacklistedCount()":{"returns":{"count":"Total number of blacklisted addresses"}},"whitelistedCount()":{"returns":{"count":"Total number of whitelisted addresses"}},"burn(address,uint256)":{"params":{"_from":"Address to burn tokens from","_amount":"Amount of tokens to burn"},"returns":{"success":"Always returns true"}},"getRoleAdmin(bytes32)":{"details":"Returns the admin role that controls `role`. See {grantRole} and {revokeRole}. To change a role's admin, use {_setRoleAdmin}."},"mint(address,uint256)":{"params":{"_to":"Address to mint tokens to","_amount":"Amount of tokens to mint"},"details":"It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.","returns":{"success":"Always returns true"}},"pendingDefaultAdmin()":{"returns":{"pendingDefaultAdminAddress":"Address of the pending `DEFAULT_ADMIN_ROLE` account"}},"isAllowlisted(address)":{"params":{"_user":"User address"},"returns":{"isUserAllowlisted":"Whether the user is allowlisted"}},"isBlacklisted(address)":{"params":{"_user":"User address"},"returns":{"isUserBlacklisted":"Whether the user is blacklisted"}},"isWhitelisted(address)":{"params":{"_user":"User address"},"returns":{"isUserWhitelisted":"Whether the user is whitelisted"}},"getRoleMembers(bytes32)":{"details":"Return all accounts that have `role` WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that this function has an unbounded cost, and using it as part of a state-changing function may render the function uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block."},"setAllowlistMode(uint8)":{"params":{"_mode":"New allowlist mode"}},"approve(address,uint256)":{"details":"See {IERC20-approve}. NOTE: If `value` is the maximum `uint256`, the allowance is not updated on `transferFrom`. This is semantically equivalent to an infinite approval. Requirements: - `spender` cannot be the zero address."},"hasRole(bytes32,address)":{"details":"Returns `true` if `account` has been granted `role`."},"supportsInterface(bytes4)":{"details":"Returns true if this contract implements the interface defined by `interfaceId`. See the corresponding https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section] to learn more about how these ids are created. This function call must use less than 30 000 gas."},"transfer(address,uint256)":{"details":"Override to add allowlist checks."},"allowance(address,address)":{"details":"Returns the remaining number of tokens that `spender` will be allowed to spend on behalf of `owner` through {transferFrom}. This is zero by default. This value changes when {approve} or {transferFrom} are called."},"grantRole(bytes32,address)":{"details":"Grants `role` to `account`. If `account` had not been already granted `role`, emits a {RoleGranted} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleGranted} event."},"getRoleMemberCount(bytes32)":{"details":"Returns the number of accounts that have `role`. Can be used together with {getRoleMember} to enumerate all bearers of a role."},"revokeRole(bytes32,address)":{"details":"Revokes `role` from `account`. If `account` had been granted `role`, emits a {RoleRevoked} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleRevoked} event."},"getBlacklist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of blacklisted addresses"}},"getWhitelist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of whitelisted addresses"}},"renounceRole(bytes32,address)":{"details":"Revokes `role` from the calling account. Roles are often managed via {grantRole} and {revokeRole}: this function's purpose is to provide a mechanism for accounts to lose their privileges if they are compromised (such as when a trusted device is misplaced). If the calling account had been revoked `role`, emits a {RoleRevoked} event. Requirements: - the caller must be `callerConfirmation`. May emit a {RoleRevoked} event."},"getRoleMember(bytes32,uint256)":{"details":"Returns one of the accounts that have `role`. `index` must be a value between 0 and {getRoleMemberCount}, non-inclusive. Role bearers are not sorted in any particular way, and their ordering may change at any point. WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure you perform all queries on the same block. See the following https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] for more information."},"setBlacklisted((address,bool)[])":{"params":{"_params":"Array of users and blacklist states"}},"setWhitelisted((address,bool)[])":{"params":{"_params":"Array of users and whitelist states"}},"initialize(string,string,address)":{"params":{"_name":"Name of the token","_symbol":"Symbol of the token","_initialAdmin":"Address to be granted `DEFAULT_ADMIN_ROLE`"}},"beginDefaultAdminTransfer(address)":{"params":{"newAdmin":"Address of the new pending default admin"},"details":"It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`."},"recoverFunds(address,address,uint256)":{"params":{"_to":"Address to send the recovered funds to","_from":"Address to recover funds from","_amount":"Amount of funds to recover"},"details":"Only recovers from non-allowlisted `_from` address."},"transferFrom(address,address,uint256)":{"details":"Override to add allowlist checks."},"permit(address,address,uint256,uint256,uint8,bytes32,bytes32)":{"details":"Sets `value` as the allowance of `spender` over ``owner``'s tokens, given ``owner``'s signed approval. IMPORTANT: The same issues {IERC20-approve} has related to transaction ordering also applies here. Emits an {Approval} event. Requirements: - `spender` cannot be the zero address. - `deadline` must be a timestamp in the future. - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner` over the EIP712-formatted function arguments. - the signature must use ``owner``'s current nonce (see {nonces}). For more information on the signature format, see the https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP section]. CAUTION: See Security Considerations above."}},"version":1,"custom:version":"1.0.0","stateVariables":{"DECIMALS":{"details":"Immutable decimals of the token."}}},"sourceIds":{"contracts/evm/SaturnOFT.sol":{"id":0},"contracts/evm/interfaces/IERC20Plus.sol":{"id":1},"node_modules/@openzeppelin/contracts/utils/Bytes.sol":{"id":31},"node_modules/@openzeppelin/contracts/utils/Panic.sol":{"id":33},"node_modules/@openzeppelin/contracts/utils/Arrays.sol":{"id":30},"node_modules/@openzeppelin/contracts/utils/Strings.sol":{"id":36},"node_modules/@openzeppelin/contracts/utils/math/Math.sol":{"id":40},"node_modules/@openzeppelin/contracts/utils/Comparators.sol":{"id":32},"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol":{"id":35},"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol":{"id":27},"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol":{"id":24},"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol":{"id":41},"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol":{"id":34},"node_modules/@openzeppelin/contracts/access/IAccessControl.sol":{"id":22},"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol":{"id":42},"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"id":37},"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"id":25},"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol":{"id":26},"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol":{"id":39},"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol":{"id":43},"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol":{"id":19},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol":{"id":29},"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"id":38},"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol":{"id":18},"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol":{"id":15},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":28},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol":{"id":6},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol":{"id":16},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol":{"id":3},"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol":{"id":23},"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol":{"id":13},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol":{"id":5},"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol":{"id":20},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol":{"id":4},"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol":{"id":21},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol":{"id":2},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol":{"id":17},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol":{"id":11},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol":{"id":12},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol":{"id":10},"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol":{"id":14},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol":{"id":8},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol":{"id":9},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol":{"id":7}},"additionalInput":null,"stdJsonInput":{"sources":{"contracts/evm/SaturnOFT.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.26;\n\nimport {IFundRecovery} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol\";\nimport {\n    AllowlistRBACUpgradeable\n} from \"@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol\";\nimport {\n    PauseRBACUpgradeable\n} from \"@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol\";\nimport {ERC20Upgradeable} from \"@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol\";\nimport {\n    ERC20PermitUpgradeable\n} from \"@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {IERC20Plus} from \"./interfaces/IERC20Plus.sol\";\n\n/**\n * @title SaturnOFT\n * @author LayerZero Labs (@TRileySchwarz, tinom.eth)\n * @custom:version 1.0.0\n * @notice Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.\n *         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.\n * @dev Roles are handled through `AccessControl2StepUpgradeable`.\n */\ncontract SaturnOFT is IERC20Plus, ERC20PermitUpgradeable, AllowlistRBACUpgradeable, PauseRBACUpgradeable {\n    /// @dev Immutable decimals of the token.\n    uint8 internal immutable DECIMALS;\n\n    /// @notice Role for minting tokens.\n    bytes32 public constant MINTER_ROLE = keccak256(\"MINTER_ROLE\");\n\n    /// @notice Role for burning tokens.\n    bytes32 public constant BURNER_ROLE = keccak256(\"BURNER_ROLE\");\n\n    /**\n     * @dev Sets immutable variables.\n     * @param _decimals Decimals of the token\n     */\n    constructor(uint8 _decimals) {\n        _disableInitializers();\n\n        DECIMALS = _decimals;\n    }\n\n    /**\n     * @notice Initializes the contract with a name, symbol, and default admin.\n     * @param _name Name of the token\n     * @param _symbol Symbol of the token\n     * @param _initialAdmin Address to be granted `DEFAULT_ADMIN_ROLE`\n     */\n    function initialize(string calldata _name, string calldata _symbol, address _initialAdmin) public initializer {\n        __ERC20_init(_name, _symbol);\n        __ERC20Permit_init(_name);\n        __AccessControl2Step_init(_initialAdmin);\n        __AllowlistBase_init(AllowlistMode.Blacklist);\n    }\n\n    /**\n     * @notice Mints tokens to address.\n     * @dev It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.\n     * @param _to Address to mint tokens to\n     * @param _amount Amount of tokens to mint\n     * @return success Always returns true\n     */\n    function mint(address _to, uint256 _amount) public virtual onlyRole(MINTER_ROLE) returns (bool success) {\n        _mint(_to, _amount);\n        return true;\n    }\n\n    /**\n     * @notice Burns tokens from address without approval.\n     * @param _from Address to burn tokens from\n     * @param _amount Amount of tokens to burn\n     * @return success Always returns true\n     */\n    function burn(address _from, uint256 _amount)\n        public\n        virtual\n        onlyRole(BURNER_ROLE)\n        whenNotPaused\n        onlyAllowlisted(_from)\n        returns (bool success)\n    {\n        _burn(_from, _amount);\n        return true;\n    }\n\n    // ============ ERC20 Overrides ============\n\n    /**\n     * @dev Override to set immutable decimals.\n     * @inheritdoc IERC20Metadata\n     */\n    function decimals() public view virtual override(ERC20Upgradeable, IERC20Metadata) returns (uint8 tokenDecimals) {\n        return DECIMALS;\n    }\n\n    /**\n     * @dev Override to add allowlist checks.\n     * @inheritdoc ERC20Upgradeable\n     */\n    function transfer(address _to, uint256 _amount)\n        public\n        virtual\n        override(ERC20Upgradeable, IERC20)\n        whenNotPaused\n        onlyAllowlisted(msg.sender)\n        onlyAllowlisted(_to)\n        returns (bool success)\n    {\n        return super.transfer(_to, _amount);\n    }\n\n    /**\n     * @dev Override to add allowlist checks.\n     * @inheritdoc ERC20Upgradeable\n     */\n    function transferFrom(address _from, address _to, uint256 _amount)\n        public\n        virtual\n        override(ERC20Upgradeable, IERC20)\n        whenNotPaused\n        onlyAllowlisted(msg.sender)\n        onlyAllowlisted(_from)\n        onlyAllowlisted(_to)\n        returns (bool success)\n    {\n        return super.transferFrom(_from, _to, _amount);\n    }\n\n    /**\n     * @inheritdoc IERC20Permit\n     */\n    function nonces(address _owner)\n        public\n        view\n        virtual\n        override(ERC20PermitUpgradeable, IERC20Permit)\n        returns (uint256 nonce)\n    {\n        return super.nonces(_owner);\n    }\n\n    // ============ Fund Recovery ============\n\n    /**\n     * @inheritdoc IFundRecovery\n     */\n    function recoverFunds(address _from, address _to, uint256 _amount) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        if (isAllowlisted(_from)) revert CannotRecoverFromAllowlisted(_from);\n        super._transfer(_from, _to, _amount);\n    }\n}\n"},"contracts/evm/interfaces/IERC20Plus.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.26;\n\nimport {IAllowlist} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport {IBurnableMintable} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol\";\nimport {IFundRecovery} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol\";\nimport {IPause} from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\n\n/**\n * @title IERC20Plus\n * @author LayerZero Labs (@TRileySchwarz, tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `ERC20Plus` contract.\n */\ninterface IERC20Plus is IBurnableMintable, IAllowlist, IPause, IFundRecovery, IERC20Metadata, IERC20Permit {\n    /**\n     * @notice Thrown when trying to recover funds from an allowlisted address.\n     * @param user Address that is allowlisted\n     */\n    error CannotRecoverFromAllowlisted(address user);\n}\n"},"node_modules/@openzeppelin/contracts/utils/Bytes.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Bytes.sol)\n\npragma solidity ^0.8.24;\n\nimport {Math} from \"./math/Math.sol\";\n\n/**\n * @dev Bytes operations.\n */\nlibrary Bytes {\n    /**\n     * @dev Forward search for `s` in `buffer`\n     * * If `s` is present in the buffer, returns the index of the first instance\n     * * If `s` is not present in the buffer, returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]\n     */\n    function indexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {\n        return indexOf(buffer, s, 0);\n    }\n\n    /**\n     * @dev Forward search for `s` in `buffer` starting at position `pos`\n     * * If `s` is present in the buffer (at or after `pos`), returns the index of the next instance\n     * * If `s` is not present in the buffer (at or after `pos`), returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]\n     */\n    function indexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {\n        uint256 length = buffer.length;\n        for (uint256 i = pos; i < length; ++i) {\n            if (bytes1(_unsafeReadBytesOffset(buffer, i)) == s) {\n                return i;\n            }\n        }\n        return type(uint256).max;\n    }\n\n    /**\n     * @dev Backward search for `s` in `buffer`\n     * * If `s` is present in the buffer, returns the index of the last instance\n     * * If `s` is not present in the buffer, returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]\n     */\n    function lastIndexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {\n        return lastIndexOf(buffer, s, type(uint256).max);\n    }\n\n    /**\n     * @dev Backward search for `s` in `buffer` starting at position `pos`\n     * * If `s` is present in the buffer (at or before `pos`), returns the index of the previous instance\n     * * If `s` is not present in the buffer (at or before `pos`), returns type(uint256).max\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]\n     */\n    function lastIndexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {\n        unchecked {\n            uint256 length = buffer.length;\n            for (uint256 i = Math.min(Math.saturatingAdd(pos, 1), length); i > 0; --i) {\n                if (bytes1(_unsafeReadBytesOffset(buffer, i - 1)) == s) {\n                    return i - 1;\n                }\n            }\n            return type(uint256).max;\n        }\n    }\n\n    /**\n     * @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {\n        return slice(buffer, start, buffer.length);\n    }\n\n    /**\n     * @dev Copies the content of `buffer`, from `start` (included) to `end` (excluded) into a new bytes object in\n     * memory. The `end` argument is truncated to the length of the `buffer`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {\n        // sanitize\n        end = Math.min(end, buffer.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        bytes memory result = new bytes(end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(buffer, 0x20), start), sub(end, start))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer,\n     * and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:].\n     *\n     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead\n     */\n    function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {\n        return splice(buffer, start, buffer.length);\n    }\n\n    /**\n     * @dev Moves the content of `buffer`, from `start` (included) to `end` (excluded) to the start of that buffer,\n     * and shrinks the buffer length accordingly, effectively overriding the content of buffer with buffer[start:end].\n     * The `end` argument is truncated to the length of the `buffer`.\n     *\n     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead\n     */\n    function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {\n        // sanitize\n        end = Math.min(end, buffer.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))\n            mstore(buffer, sub(end, start))\n        }\n\n        return buffer;\n    }\n\n    /**\n     * @dev Replaces bytes in `buffer` starting at `pos` with all bytes from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`).\n     * If `pos >= buffer.length`, no replacement occurs and the buffer is returned unchanged.\n     *\n     * NOTE: This function modifies the provided buffer in place.\n     */\n    function replace(bytes memory buffer, uint256 pos, bytes memory replacement) internal pure returns (bytes memory) {\n        return replace(buffer, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces bytes in `buffer` starting at `pos` with bytes from `replacement` starting at `offset`.\n     * Copies at most `length` bytes from `replacement` to `buffer`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, buffer.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * buffer.length - pos))`. If `pos >= buffer.length` or `offset >= replacement.length`, no replacement occurs\n     * and the buffer is returned unchanged.\n     *\n     * NOTE: This function modifies the provided buffer in place.\n     */\n    function replace(\n        bytes memory buffer,\n        uint256 pos,\n        bytes memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (bytes memory) {\n        // sanitize\n        pos = Math.min(pos, buffer.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, buffer.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(add(add(buffer, 0x20), pos), add(add(replacement, 0x20), offset), length)\n        }\n\n        return buffer;\n    }\n\n    /**\n     * @dev Concatenate an array of bytes into a single bytes object.\n     *\n     * For fixed bytes types, we recommend using the solidity built-in `bytes.concat` or (equivalent)\n     * `abi.encodePacked`.\n     *\n     * NOTE: this could be done in assembly with a single loop that expands starting at the FMP, but that would be\n     * significantly less readable. It might be worth benchmarking the savings of the full-assembly approach.\n     */\n    function concat(bytes[] memory buffers) internal pure returns (bytes memory) {\n        uint256 length = 0;\n        for (uint256 i = 0; i < buffers.length; ++i) {\n            length += buffers[i].length;\n        }\n\n        bytes memory result = new bytes(length);\n\n        uint256 offset = 0x20;\n        for (uint256 i = 0; i < buffers.length; ++i) {\n            bytes memory input = buffers[i];\n            assembly (\"memory-safe\") {\n                mcopy(add(result, offset), add(input, 0x20), mload(input))\n            }\n            unchecked {\n                offset += input.length;\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Split each byte in `input` into two nibbles (4 bits each)\n     *\n     * Example: hex\"01234567\" → hex\"0001020304050607\"\n     */\n    function toNibbles(bytes memory input) internal pure returns (bytes memory output) {\n        assembly (\"memory-safe\") {\n            let length := mload(input)\n            output := mload(0x40)\n            mstore(0x40, add(add(output, 0x20), mul(length, 2)))\n            mstore(output, mul(length, 2))\n            for {\n                let i := 0\n            } lt(i, length) {\n                i := add(i, 0x10)\n            } {\n                let chunk := shr(128, mload(add(add(input, 0x20), i)))\n                chunk := and(\n                    0x0000000000000000ffffffffffffffff0000000000000000ffffffffffffffff,\n                    or(shl(64, chunk), chunk)\n                )\n                chunk := and(\n                    0x00000000ffffffff00000000ffffffff00000000ffffffff00000000ffffffff,\n                    or(shl(32, chunk), chunk)\n                )\n                chunk := and(\n                    0x0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff,\n                    or(shl(16, chunk), chunk)\n                )\n                chunk := and(\n                    0x00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff,\n                    or(shl(8, chunk), chunk)\n                )\n                chunk := and(\n                    0x0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f,\n                    or(shl(4, chunk), chunk)\n                )\n                mstore(add(add(output, 0x20), mul(i, 2)), chunk)\n            }\n        }\n    }\n\n    /**\n     * @dev Returns true if the two byte buffers are equal.\n     */\n    function equal(bytes memory a, bytes memory b) internal pure returns (bool) {\n        return a.length == b.length && keccak256(a) == keccak256(b);\n    }\n\n    /**\n     * @dev Reverses the byte order of a bytes32 value, converting between little-endian and big-endian.\n     * Inspired by https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel[Reverse Parallel]\n     */\n    function reverseBytes32(bytes32 value) internal pure returns (bytes32) {\n        value = // swap bytes\n            ((value >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\n            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\n            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\n            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\n        value = // swap 8-byte long pairs\n            ((value >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\n            ((value & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\n        return (value >> 128) | (value << 128); // swap 16-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 128-bit values.\n    function reverseBytes16(bytes16 value) internal pure returns (bytes16) {\n        value = // swap bytes\n            ((value & 0xFF00FF00FF00FF00FF00FF00FF00FF00) >> 8) |\n            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) |\n            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) |\n            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF) << 32);\n        return (value >> 64) | (value << 64); // swap 8-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 64-bit values.\n    function reverseBytes8(bytes8 value) internal pure returns (bytes8) {\n        value = ((value & 0xFF00FF00FF00FF00) >> 8) | ((value & 0x00FF00FF00FF00FF) << 8); // swap bytes\n        value = ((value & 0xFFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF) << 16); // swap 2-byte long pairs\n        return (value >> 32) | (value << 32); // swap 4-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 32-bit values.\n    function reverseBytes4(bytes4 value) internal pure returns (bytes4) {\n        value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); // swap bytes\n        return (value >> 16) | (value << 16); // swap 2-byte long pairs\n    }\n\n    /// @dev Same as {reverseBytes32} but optimized for 16-bit values.\n    function reverseBytes2(bytes2 value) internal pure returns (bytes2) {\n        return (value >> 8) | (value << 8);\n    }\n\n    /**\n     * @dev Counts the number of leading zero bits a bytes array. Returns `8 * buffer.length`\n     * if the buffer is all zeros.\n     */\n    function clz(bytes memory buffer) internal pure returns (uint256) {\n        for (uint256 i = 0; i < buffer.length; i += 0x20) {\n            bytes32 chunk = _unsafeReadBytesOffset(buffer, i);\n            if (chunk != bytes32(0)) {\n                return Math.min(8 * i + Math.clz(uint256(chunk)), 8 * buffer.length);\n            }\n        }\n        return 8 * buffer.length;\n    }\n\n    /**\n     * @dev Reads a bytes32 from a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            value := mload(add(add(buffer, 0x20), offset))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Panic.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Helper library for emitting standardized panic codes.\n *\n * ```solidity\n * contract Example {\n *      using Panic for uint256;\n *\n *      // Use any of the declared internal constants\n *      function foo() { Panic.GENERIC.panic(); }\n *\n *      // Alternatively\n *      function foo() { Panic.panic(Panic.GENERIC); }\n * }\n * ```\n *\n * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].\n *\n * _Available since v5.1._\n */\n// slither-disable-next-line unused-state\nlibrary Panic {\n    /// @dev generic / unspecified error\n    uint256 internal constant GENERIC = 0x00;\n    /// @dev used by the assert() builtin\n    uint256 internal constant ASSERT = 0x01;\n    /// @dev arithmetic underflow or overflow\n    uint256 internal constant UNDER_OVERFLOW = 0x11;\n    /// @dev division or modulo by zero\n    uint256 internal constant DIVISION_BY_ZERO = 0x12;\n    /// @dev enum conversion error\n    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;\n    /// @dev invalid encoding in storage\n    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;\n    /// @dev empty array pop\n    uint256 internal constant EMPTY_ARRAY_POP = 0x31;\n    /// @dev array out of bounds access\n    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;\n    /// @dev resource error (too large allocation or too large array)\n    uint256 internal constant RESOURCE_ERROR = 0x41;\n    /// @dev calling invalid internal function\n    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;\n\n    /// @dev Reverts with a panic code. Recommended to use with\n    /// the internal constants with predefined codes.\n    function panic(uint256 code) internal pure {\n        assembly (\"memory-safe\") {\n            mstore(0x00, 0x4e487b71)\n            mstore(0x20, code)\n            revert(0x1c, 0x24)\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Arrays.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Arrays.sol)\n// This file was procedurally generated from scripts/generate/templates/Arrays.js.\n\npragma solidity ^0.8.24;\n\nimport {Comparators} from \"./Comparators.sol\";\nimport {SlotDerivation} from \"./SlotDerivation.sol\";\nimport {StorageSlot} from \"./StorageSlot.sol\";\nimport {Math} from \"./math/Math.sol\";\n\n/**\n * @dev Collection of functions related to array types.\n */\nlibrary Arrays {\n    using SlotDerivation for bytes32;\n    using StorageSlot for bytes32;\n\n    /**\n     * @dev Sort an array of uint256 (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        uint256[] memory array,\n        function(uint256, uint256) pure returns (bool) comp\n    ) internal pure returns (uint256[] memory) {\n        _quickSort(_begin(array), _end(array), comp);\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of uint256 in increasing order.\n     */\n    function sort(uint256[] memory array) internal pure returns (uint256[] memory) {\n        sort(array, Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Sort an array of address (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        address[] memory array,\n        function(address, address) pure returns (bool) comp\n    ) internal pure returns (address[] memory) {\n        sort(_castToUint256Array(array), _castToUint256Comp(comp));\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of address in increasing order.\n     */\n    function sort(address[] memory array) internal pure returns (address[] memory) {\n        sort(_castToUint256Array(array), Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Sort an array of bytes32 (in memory) following the provided comparator function.\n     *\n     * This function does the sorting \"in place\", meaning that it overrides the input. The object is returned for\n     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.\n     *\n     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the\n     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful\n     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may\n     * consume more gas than is available in a block, leading to potential DoS.\n     *\n     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.\n     */\n    function sort(\n        bytes32[] memory array,\n        function(bytes32, bytes32) pure returns (bool) comp\n    ) internal pure returns (bytes32[] memory) {\n        sort(_castToUint256Array(array), _castToUint256Comp(comp));\n        return array;\n    }\n\n    /**\n     * @dev Variant of {sort} that sorts an array of bytes32 in increasing order.\n     */\n    function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {\n        sort(_castToUint256Array(array), Comparators.lt);\n        return array;\n    }\n\n    /**\n     * @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops\n     * at end (exclusive). Sorting follows the `comp` comparator.\n     *\n     * Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.\n     *\n     * IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should\n     * be used only if the limits are within a memory array.\n     */\n    function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {\n        unchecked {\n            if (end - begin < 0x40) return;\n\n            // Use first element as pivot\n            uint256 pivot = _mload(begin);\n            // Position where the pivot should be at the end of the loop\n            uint256 pos = begin;\n\n            for (uint256 it = begin + 0x20; it < end; it += 0x20) {\n                if (comp(_mload(it), pivot)) {\n                    // If the value stored at the iterator's position comes before the pivot, we increment the\n                    // position of the pivot and move the value there.\n                    pos += 0x20;\n                    _swap(pos, it);\n                }\n            }\n\n            _swap(begin, pos); // Swap pivot into place\n            _quickSort(begin, pos, comp); // Sort the left side of the pivot\n            _quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot\n        }\n    }\n\n    /**\n     * @dev Pointer to the memory location of the first element of `array`.\n     */\n    function _begin(uint256[] memory array) private pure returns (uint256 ptr) {\n        assembly (\"memory-safe\") {\n            ptr := add(array, 0x20)\n        }\n    }\n\n    /**\n     * @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word\n     * that comes just after the last element of the array.\n     */\n    function _end(uint256[] memory array) private pure returns (uint256 ptr) {\n        unchecked {\n            return _begin(array) + array.length * 0x20;\n        }\n    }\n\n    /**\n     * @dev Load memory word (as a uint256) at location `ptr`.\n     */\n    function _mload(uint256 ptr) private pure returns (uint256 value) {\n        assembly {\n            value := mload(ptr)\n        }\n    }\n\n    /**\n     * @dev Swaps the elements memory location `ptr1` and `ptr2`.\n     */\n    function _swap(uint256 ptr1, uint256 ptr2) private pure {\n        assembly {\n            let value1 := mload(ptr1)\n            let value2 := mload(ptr2)\n            mstore(ptr1, value2)\n            mstore(ptr2, value1)\n        }\n    }\n\n    /// @dev Helper: low level cast address memory array to uint256 memory array\n    function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast bytes32 memory array to uint256 memory array\n    function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast address comp function to uint256 comp function\n    function _castToUint256Comp(\n        function(address, address) pure returns (bool) input\n    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /// @dev Helper: low level cast bytes32 comp function to uint256 comp function\n    function _castToUint256Comp(\n        function(bytes32, bytes32) pure returns (bool) input\n    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {\n        assembly {\n            output := input\n        }\n    }\n\n    /**\n     * @dev Searches a sorted `array` and returns the first index that contains\n     * a value greater or equal to `element`. If no such index exists (i.e. all\n     * values in the array are strictly less than `element`), the array length is\n     * returned. Time complexity O(log n).\n     *\n     * NOTE: The `array` is expected to be sorted in ascending order, and to\n     * contain no repeated elements.\n     *\n     * IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks\n     * support for repeated elements in the array. The {lowerBound} function should\n     * be used instead.\n     */\n    function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value > element) {\n                high = mid;\n            } else {\n                low = mid + 1;\n            }\n        }\n\n        // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.\n        if (low > 0 && unsafeAccess(array, low - 1).value == element) {\n            return low - 1;\n        } else {\n            return low;\n        }\n    }\n\n    /**\n     * @dev Searches an `array` sorted in ascending order and returns the first\n     * index that contains a value greater or equal than `element`. If no such index\n     * exists (i.e. all values in the array are strictly less than `element`), the array\n     * length is returned. Time complexity O(log n).\n     *\n     * See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].\n     */\n    function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value < element) {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            } else {\n                high = mid;\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Searches an `array` sorted in ascending order and returns the first\n     * index that contains a value strictly greater than `element`. If no such index\n     * exists (i.e. all values in the array are strictly less than `element`), the array\n     * length is returned. Time complexity O(log n).\n     *\n     * See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].\n     */\n    function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeAccess(array, mid).value > element) {\n                high = mid;\n            } else {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Same as {lowerBound}, but with an array in memory.\n     */\n    function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeMemoryAccess(array, mid) < element) {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            } else {\n                high = mid;\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Same as {upperBound}, but with an array in memory.\n     */\n    function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {\n        uint256 low = 0;\n        uint256 high = array.length;\n\n        if (high == 0) {\n            return 0;\n        }\n\n        while (low < high) {\n            uint256 mid = Math.average(low, high);\n\n            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n            // because Math.average rounds towards zero (it does integer division with truncation).\n            if (unsafeMemoryAccess(array, mid) > element) {\n                high = mid;\n            } else {\n                // this cannot overflow because mid < high\n                unchecked {\n                    low = mid + 1;\n                }\n            }\n        }\n\n        return low;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new address array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(address[] memory array, uint256 start) internal pure returns (address[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new address array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(address[] memory array, uint256 start, uint256 end) internal pure returns (address[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        address[] memory result = new address[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new bytes32 array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes32[] memory array, uint256 start) internal pure returns (bytes32[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new bytes32 array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(bytes32[] memory array, uint256 start, uint256 end) internal pure returns (bytes32[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        bytes32[] memory result = new bytes32[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to the end of `array` into a new uint256 array in\n     * memory.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(uint256[] memory array, uint256 start) internal pure returns (uint256[] memory) {\n        return slice(array, start, array.length);\n    }\n\n    /**\n     * @dev Copies the content of `array`, from `start` (included) to `end` (excluded) into a new uint256 array in\n     * memory. The `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]\n     */\n    function slice(uint256[] memory array, uint256 start, uint256 end) internal pure returns (uint256[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // allocate and copy\n        uint256[] memory result = new uint256[](end - start);\n        assembly (\"memory-safe\") {\n            mcopy(add(result, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(address[] memory array, uint256 start) internal pure returns (address[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(address[] memory array, uint256 start, uint256 end) internal pure returns (address[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        address[] memory array,\n        uint256 pos,\n        address[] memory replacement\n    ) internal pure returns (address[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        address[] memory array,\n        uint256 pos,\n        address[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (address[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(bytes32[] memory array, uint256 start) internal pure returns (bytes32[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(bytes32[] memory array, uint256 start, uint256 end) internal pure returns (bytes32[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        bytes32[] memory array,\n        uint256 pos,\n        bytes32[] memory replacement\n    ) internal pure returns (bytes32[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        bytes32[] memory array,\n        uint256 pos,\n        bytes32[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (bytes32[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to the end of `array` to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:].\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(uint256[] memory array, uint256 start) internal pure returns (uint256[] memory) {\n        return splice(array, start, array.length);\n    }\n\n    /**\n     * @dev Moves the content of `array`, from `start` (included) to `end` (excluded) to the start of that array,\n     * and shrinks the array length accordingly, effectively overwriting the array with array[start:end]. The\n     * `end` argument is truncated to the length of the `array`.\n     *\n     * NOTE: This function modifies the provided array in place. If you need to preserve the original array, use {slice} instead.\n     */\n    function splice(uint256[] memory array, uint256 start, uint256 end) internal pure returns (uint256[] memory) {\n        // sanitize\n        end = Math.min(end, array.length);\n        start = Math.min(start, end);\n\n        // move and resize\n        assembly (\"memory-safe\") {\n            mcopy(add(array, 0x20), add(add(array, 0x20), mul(start, 0x20)), mul(sub(end, start), 0x20))\n            mstore(array, sub(end, start))\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with all elements from `replacement`.\n     *\n     * Parameters are clamped to valid ranges (e.g. `pos` is clamped to `[0, array.length]`).\n     * If `pos >= array.length`, no replacement occurs and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        uint256[] memory array,\n        uint256 pos,\n        uint256[] memory replacement\n    ) internal pure returns (uint256[] memory) {\n        return replace(array, pos, replacement, 0, replacement.length);\n    }\n\n    /**\n     * @dev Replaces elements in `array` starting at `pos` with elements from `replacement` starting at `offset`.\n     * Copies at most `length` elements from `replacement` to `array`.\n     *\n     * Parameters are clamped to valid ranges (i.e. `pos` is clamped to `[0, array.length]`, `offset` is\n     * clamped to `[0, replacement.length]`, and `length` is clamped to `min(length, replacement.length - offset,\n     * array.length - pos)`). If `pos >= array.length` or `offset >= replacement.length`, no replacement occurs\n     * and the array is returned unchanged.\n     *\n     * NOTE: This function modifies the provided array in place.\n     */\n    function replace(\n        uint256[] memory array,\n        uint256 pos,\n        uint256[] memory replacement,\n        uint256 offset,\n        uint256 length\n    ) internal pure returns (uint256[] memory) {\n        // sanitize\n        pos = Math.min(pos, array.length);\n        offset = Math.min(offset, replacement.length);\n        length = Math.min(length, Math.min(replacement.length - offset, array.length - pos));\n\n        // replace\n        assembly (\"memory-safe\") {\n            mcopy(\n                add(add(array, 0x20), mul(pos, 0x20)),\n                add(add(replacement, 0x20), mul(offset, 0x20)),\n                mul(length, 0x20)\n            )\n        }\n\n        return array;\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getAddressSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getBytes32Slot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getUint256Slot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(bytes[] storage arr, uint256 pos) internal pure returns (StorageSlot.BytesSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getBytesSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeAccess(string[] storage arr, uint256 pos) internal pure returns (StorageSlot.StringSlot storage) {\n        bytes32 slot;\n        assembly (\"memory-safe\") {\n            slot := arr.slot\n        }\n        return slot.deriveArray().offset(pos).getStringSlot();\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(bytes[] memory arr, uint256 pos) internal pure returns (bytes memory res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n     *\n     * WARNING: Only use if you are certain `pos` is lower than the array length.\n     */\n    function unsafeMemoryAccess(string[] memory arr, uint256 pos) internal pure returns (string memory res) {\n        assembly {\n            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(address[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(bytes32[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(uint256[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(bytes[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n\n    /**\n     * @dev Helper to set the length of a dynamic array. Directly writing to `.length` is forbidden.\n     *\n     * WARNING: this does not clear elements if length is reduced, or initialize elements if length is increased.\n     */\n    function unsafeSetLength(string[] storage array, uint256 len) internal {\n        assembly (\"memory-safe\") {\n            sstore(array.slot, len)\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Strings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/Strings.sol)\n\npragma solidity ^0.8.24;\n\nimport {Math} from \"./math/Math.sol\";\nimport {SafeCast} from \"./math/SafeCast.sol\";\nimport {SignedMath} from \"./math/SignedMath.sol\";\nimport {Bytes} from \"./Bytes.sol\";\n\n/**\n * @dev String operations.\n */\nlibrary Strings {\n    using SafeCast for *;\n\n    bytes16 private constant HEX_DIGITS = \"0123456789abcdef\";\n    uint8 private constant ADDRESS_LENGTH = 20;\n    uint256 private constant SPECIAL_CHARS_LOOKUP =\n        0xffffffff | // first 32 bits corresponding to the control characters (U+0000 to U+001F)\n            (1 << 0x22) | // double quote\n            (1 << 0x5c); // backslash\n\n    /**\n     * @dev The `value` string doesn't fit in the specified `length`.\n     */\n    error StringsInsufficientHexLength(uint256 value, uint256 length);\n\n    /**\n     * @dev The string being parsed contains characters that are not in scope of the given base.\n     */\n    error StringsInvalidChar();\n\n    /**\n     * @dev The string being parsed is not a properly formatted address.\n     */\n    error StringsInvalidAddressFormat();\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` decimal representation.\n     */\n    function toString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            uint256 length = Math.log10(value) + 1;\n            string memory buffer = new string(length);\n            uint256 ptr;\n            assembly (\"memory-safe\") {\n                ptr := add(add(buffer, 0x20), length)\n            }\n            while (true) {\n                ptr--;\n                assembly (\"memory-safe\") {\n                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))\n                }\n                value /= 10;\n                if (value == 0) break;\n            }\n            return buffer;\n        }\n    }\n\n    /**\n     * @dev Converts a `int256` to its ASCII `string` decimal representation.\n     */\n    function toStringSigned(int256 value) internal pure returns (string memory) {\n        return string.concat(value < 0 ? \"-\" : \"\", toString(SignedMath.abs(value)));\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.\n     */\n    function toHexString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            return toHexString(value, Math.log256(value) + 1);\n        }\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.\n     */\n    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {\n        uint256 localValue = value;\n        bytes memory buffer = new bytes(2 * length + 2);\n        buffer[0] = \"0\";\n        buffer[1] = \"x\";\n        for (uint256 i = 2 * length + 1; i > 1; --i) {\n            buffer[i] = HEX_DIGITS[localValue & 0xf];\n            localValue >>= 4;\n        }\n        if (localValue != 0) {\n            revert StringsInsufficientHexLength(value, length);\n        }\n        return string(buffer);\n    }\n\n    /**\n     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal\n     * representation.\n     */\n    function toHexString(address addr) internal pure returns (string memory) {\n        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);\n    }\n\n    /**\n     * @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal\n     * representation, according to EIP-55.\n     */\n    function toChecksumHexString(address addr) internal pure returns (string memory) {\n        bytes memory buffer = bytes(toHexString(addr));\n\n        // hash the hex part of buffer (skip length + 2 bytes, length 40)\n        uint256 hashValue;\n        assembly (\"memory-safe\") {\n            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))\n        }\n\n        for (uint256 i = 41; i > 1; --i) {\n            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)\n            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {\n                // case shift by xoring with 0x20\n                buffer[i] ^= 0x20;\n            }\n            hashValue >>= 4;\n        }\n        return string(buffer);\n    }\n\n    /**\n     * @dev Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.\n     */\n    function toHexString(bytes memory input) internal pure returns (string memory) {\n        unchecked {\n            bytes memory buffer = new bytes(2 * input.length + 2);\n            buffer[0] = \"0\";\n            buffer[1] = \"x\";\n            for (uint256 i = 0; i < input.length; ++i) {\n                uint8 v = uint8(input[i]);\n                buffer[2 * i + 2] = HEX_DIGITS[v >> 4];\n                buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];\n            }\n            return string(buffer);\n        }\n    }\n\n    /**\n     * @dev Returns true if the two strings are equal.\n     */\n    function equal(string memory a, string memory b) internal pure returns (bool) {\n        return Bytes.equal(bytes(a), bytes(b));\n    }\n\n    /**\n     * @dev Parse a decimal string and returns the value as a `uint256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `[0-9]*`\n     * - The result must fit into an `uint256` type\n     */\n    function parseUint(string memory input) internal pure returns (uint256) {\n        return parseUint(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseUint-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `[0-9]*`\n     * - The result must fit into an `uint256` type\n     */\n    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {\n        (bool success, uint256 value) = tryParseUint(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {\n        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid\n     * character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseUint(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, uint256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseUintUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseUint-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseUintUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, uint256 value) {\n        bytes memory buffer = bytes(input);\n\n        uint256 result = 0;\n        for (uint256 i = begin; i < end; ++i) {\n            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (chr > 9) return (false, 0);\n            result *= 10;\n            result += chr;\n        }\n        return (true, result);\n    }\n\n    /**\n     * @dev Parse a decimal string and returns the value as a `int256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `[-+]?[0-9]*`\n     * - The result must fit in an `int256` type.\n     */\n    function parseInt(string memory input) internal pure returns (int256) {\n        return parseInt(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `[-+]?[0-9]*`\n     * - The result must fit in an `int256` type.\n     */\n    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {\n        (bool success, int256 value) = tryParseInt(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if\n     * the result does not fit in a `int256`.\n     *\n     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.\n     */\n    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {\n        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    uint256 private constant ABS_MIN_INT256 = 2 ** 255;\n\n    /**\n     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid\n     * character or if the result does not fit in a `int256`.\n     *\n     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.\n     */\n    function tryParseInt(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, int256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseIntUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseInt-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseIntUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, int256 value) {\n        bytes memory buffer = bytes(input);\n\n        // Check presence of a negative sign.\n        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        bool positiveSign = sign == bytes1(\"+\");\n        bool negativeSign = sign == bytes1(\"-\");\n        uint256 offset = (positiveSign || negativeSign).toUint();\n\n        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);\n\n        if (absSuccess && absValue < ABS_MIN_INT256) {\n            return (true, negativeSign ? -int256(absValue) : int256(absValue));\n        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {\n            return (true, type(int256).min);\n        } else return (false, 0);\n    }\n\n    /**\n     * @dev Parse a hexadecimal string (with or without \"0x\" prefix), and returns the value as a `uint256`.\n     *\n     * Requirements:\n     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`\n     * - The result must fit in an `uint256` type.\n     */\n    function parseHexUint(string memory input) internal pure returns (uint256) {\n        return parseHexUint(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`\n     * - The result must fit in an `uint256` type.\n     */\n    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {\n        (bool success, uint256 value) = tryParseHexUint(input, begin, end);\n        if (!success) revert StringsInvalidChar();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {\n        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an\n     * invalid character.\n     *\n     * NOTE: This function will revert if the result does not fit in a `uint256`.\n     */\n    function tryParseHexUint(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, uint256 value) {\n        if (end > bytes(input).length || begin > end) return (false, 0);\n        return _tryParseHexUintUncheckedBounds(input, begin, end);\n    }\n\n    /**\n     * @dev Implementation of {tryParseHexUint-string-uint256-uint256} that does not check bounds. Caller should make sure that\n     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.\n     */\n    function _tryParseHexUintUncheckedBounds(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) private pure returns (bool success, uint256 value) {\n        bytes memory buffer = bytes(input);\n\n        // skip 0x prefix if present\n        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2(\"0x\"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        uint256 offset = hasPrefix.toUint() * 2;\n\n        uint256 result = 0;\n        for (uint256 i = begin + offset; i < end; ++i) {\n            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (chr > 15) return (false, 0);\n            result *= 16;\n            unchecked {\n                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).\n                // This guarantees that adding a value < 16 will not cause an overflow, hence the unchecked.\n                result += chr;\n            }\n        }\n        return (true, result);\n    }\n\n    /**\n     * @dev Parse a hexadecimal string (with or without \"0x\" prefix), and returns the value as an `address`.\n     *\n     * Requirements:\n     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`\n     */\n    function parseAddress(string memory input) internal pure returns (address) {\n        return parseAddress(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string} that parses a substring of `input` located between position `begin` (included) and\n     * `end` (excluded).\n     *\n     * Requirements:\n     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`\n     */\n    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {\n        (bool success, address value) = tryParseAddress(input, begin, end);\n        if (!success) revert StringsInvalidAddressFormat();\n        return value;\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly\n     * formatted address. See {parseAddress-string} requirements.\n     */\n    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {\n        return tryParseAddress(input, 0, bytes(input).length);\n    }\n\n    /**\n     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly\n     * formatted address. See {parseAddress-string-uint256-uint256} requirements.\n     */\n    function tryParseAddress(\n        string memory input,\n        uint256 begin,\n        uint256 end\n    ) internal pure returns (bool success, address value) {\n        if (end > bytes(input).length || begin > end) return (false, address(0));\n\n        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2(\"0x\"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty\n        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;\n\n        // check that input is the correct length\n        if (end - begin == expectedLength) {\n            // length guarantees that this does not overflow, and value is at most type(uint160).max\n            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);\n            return (s, address(uint160(v)));\n        } else {\n            return (false, address(0));\n        }\n    }\n\n    function _tryParseChr(bytes1 chr) private pure returns (uint8) {\n        uint8 value = uint8(chr);\n\n        // Try to parse `chr`:\n        // - Case 1: [0-9]\n        // - Case 2: [a-f]\n        // - Case 3: [A-F]\n        // - otherwise not supported\n        unchecked {\n            if (value > 47 && value < 58) value -= 48;\n            else if (value > 96 && value < 103) value -= 87;\n            else if (value > 64 && value < 71) value -= 55;\n            else return type(uint8).max;\n        }\n\n        return value;\n    }\n\n    /**\n     * @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.\n     *\n     * WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.\n     *\n     * NOTE: This function escapes backslashes (including those in \\uXXXX sequences) and the characters in ranges\n     * defined in section 2.5 of RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). All control characters in U+0000\n     * to U+001F are escaped (\\b, \\t, \\n, \\f, \\r use short form; others use \\u00XX). ECMAScript's `JSON.parse` does\n     * recover escaped unicode characters that are not in this range, but other tooling may provide different results.\n     */\n    function escapeJSON(string memory input) internal pure returns (string memory) {\n        bytes memory buffer = bytes(input);\n\n        // Put output at the FMP. Memory will be reserved later when we figure out the actual length of the escaped\n        // string. All write are done using _unsafeWriteBytesOffset, which avoid the (expensive) length checks for\n        // each character written.\n        bytes memory output;\n        assembly (\"memory-safe\") {\n            output := mload(0x40)\n        }\n        uint256 outputLength = 0;\n\n        for (uint256 i = 0; i < buffer.length; ++i) {\n            uint8 char = uint8(bytes1(_unsafeReadBytesOffset(buffer, i)));\n            if (((SPECIAL_CHARS_LOOKUP & (1 << char)) != 0)) {\n                _unsafeWriteBytesOffset(output, outputLength++, \"\\\\\");\n                if (char == 0x08) _unsafeWriteBytesOffset(output, outputLength++, \"b\");\n                else if (char == 0x09) _unsafeWriteBytesOffset(output, outputLength++, \"t\");\n                else if (char == 0x0a) _unsafeWriteBytesOffset(output, outputLength++, \"n\");\n                else if (char == 0x0c) _unsafeWriteBytesOffset(output, outputLength++, \"f\");\n                else if (char == 0x0d) _unsafeWriteBytesOffset(output, outputLength++, \"r\");\n                else if (char == 0x5c) _unsafeWriteBytesOffset(output, outputLength++, \"\\\\\");\n                else if (char == 0x22) {\n                    // solhint-disable-next-line quotes\n                    _unsafeWriteBytesOffset(output, outputLength++, '\"');\n                } else {\n                    // U+0000 to U+001F without short form: output \\u00XX\n                    _unsafeWriteBytesOffset(output, outputLength++, \"u\");\n                    _unsafeWriteBytesOffset(output, outputLength++, \"0\");\n                    _unsafeWriteBytesOffset(output, outputLength++, \"0\");\n                    _unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char >> 4]);\n                    _unsafeWriteBytesOffset(output, outputLength++, HEX_DIGITS[char & 0x0f]);\n                }\n            } else {\n                _unsafeWriteBytesOffset(output, outputLength++, bytes1(char));\n            }\n        }\n        // write the actual length and reserve memory\n        assembly (\"memory-safe\") {\n            mstore(output, outputLength)\n            mstore(0x40, add(output, add(outputLength, 0x20)))\n        }\n\n        return string(output);\n    }\n\n    /**\n     * @dev Reads a bytes32 from a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            value := mload(add(add(buffer, 0x20), offset))\n        }\n    }\n\n    /**\n     * @dev Write a bytes1 to a bytes array without bounds checking.\n     *\n     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the\n     * assembly block as such would prevent some optimizations.\n     */\n    function _unsafeWriteBytesOffset(bytes memory buffer, uint256 offset, bytes1 value) private pure {\n        // This is not memory safe in the general case, but all calls to this private function are within bounds.\n        assembly (\"memory-safe\") {\n            mstore8(add(add(buffer, 0x20), offset), shr(248, value))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/Math.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/Math.sol)\n\npragma solidity ^0.8.20;\n\nimport {Panic} from \"../Panic.sol\";\nimport {SafeCast} from \"./SafeCast.sol\";\n\n/**\n * @dev Standard math utilities missing in the Solidity language.\n */\nlibrary Math {\n    enum Rounding {\n        Floor, // Toward negative infinity\n        Ceil, // Toward positive infinity\n        Trunc, // Toward zero\n        Expand // Away from zero\n    }\n\n    /**\n     * @dev Return the 512-bit addition of two uint256.\n     *\n     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.\n     */\n    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {\n        assembly (\"memory-safe\") {\n            low := add(a, b)\n            high := lt(low, a)\n        }\n    }\n\n    /**\n     * @dev Return the 512-bit multiplication of two uint256.\n     *\n     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.\n     */\n    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {\n        // 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use\n        // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256\n        // variables such that product = high * 2²⁵⁶ + low.\n        assembly (\"memory-safe\") {\n            let mm := mulmod(a, b, not(0))\n            low := mul(a, b)\n            high := sub(sub(mm, low), lt(mm, low))\n        }\n    }\n\n    /**\n     * @dev Returns the addition of two unsigned integers, with a success flag (no overflow).\n     */\n    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a + b;\n            success = c >= a;\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).\n     */\n    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a - b;\n            success = c <= a;\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).\n     */\n    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            uint256 c = a * b;\n            assembly (\"memory-safe\") {\n                // Only true when the multiplication doesn't overflow\n                // (c / a == b) || (a == 0)\n                success := or(eq(div(c, a), b), iszero(a))\n            }\n            // equivalent to: success ? c : 0\n            result = c * SafeCast.toUint(success);\n        }\n    }\n\n    /**\n     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).\n     */\n    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            success = b > 0;\n            assembly (\"memory-safe\") {\n                // The `DIV` opcode returns zero when the denominator is 0.\n                result := div(a, b)\n            }\n        }\n    }\n\n    /**\n     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).\n     */\n    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {\n        unchecked {\n            success = b > 0;\n            assembly (\"memory-safe\") {\n                // The `MOD` opcode returns zero when the denominator is 0.\n                result := mod(a, b)\n            }\n        }\n    }\n\n    /**\n     * @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.\n     */\n    function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {\n        (bool success, uint256 result) = tryAdd(a, b);\n        return ternary(success, result, type(uint256).max);\n    }\n\n    /**\n     * @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.\n     */\n    function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {\n        (, uint256 result) = trySub(a, b);\n        return result;\n    }\n\n    /**\n     * @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.\n     */\n    function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {\n        (bool success, uint256 result) = tryMul(a, b);\n        return ternary(success, result, type(uint256).max);\n    }\n\n    /**\n     * @dev Branchless ternary evaluation for `condition ? a : b`. Gas costs are constant.\n     *\n     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.\n     * However, the compiler may optimize Solidity ternary operations (i.e. `condition ? a : b`) to only compute\n     * one branch when needed, making this function more expensive.\n     */\n    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {\n        unchecked {\n            // branchless ternary works because:\n            // b ^ (a ^ b) == a\n            // b ^ 0 == b\n            return b ^ ((a ^ b) * SafeCast.toUint(condition));\n        }\n    }\n\n    /**\n     * @dev Returns the largest of two numbers.\n     */\n    function max(uint256 a, uint256 b) internal pure returns (uint256) {\n        return ternary(a > b, a, b);\n    }\n\n    /**\n     * @dev Returns the smallest of two numbers.\n     */\n    function min(uint256 a, uint256 b) internal pure returns (uint256) {\n        return ternary(a < b, a, b);\n    }\n\n    /**\n     * @dev Returns the average of two numbers. The result is rounded towards\n     * zero.\n     */\n    function average(uint256 a, uint256 b) internal pure returns (uint256) {\n        unchecked {\n            // (a + b) / 2 can overflow.\n            return (a & b) + (a ^ b) / 2;\n        }\n    }\n\n    /**\n     * @dev Returns the ceiling of the division of two numbers.\n     *\n     * This differs from standard division with `/` in that it rounds towards infinity instead\n     * of rounding towards zero.\n     */\n    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\n        if (b == 0) {\n            // Guarantee the same behavior as in a regular Solidity division.\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n\n        // The following calculation ensures accurate ceiling division without overflow.\n        // Since a is non-zero, (a - 1) / b will not overflow.\n        // The largest possible result occurs when (a - 1) / b is type(uint256).max,\n        // but the largest value we can obtain is type(uint256).max - 1, which happens\n        // when a = type(uint256).max and b = 1.\n        unchecked {\n            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);\n        }\n    }\n\n    /**\n     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or\n     * denominator == 0.\n     *\n     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by\n     * Uniswap Labs also under MIT license.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {\n        unchecked {\n            (uint256 high, uint256 low) = mul512(x, y);\n\n            // Handle non-overflow cases, 256 by 256 division.\n            if (high == 0) {\n                // Solidity will revert if denominator == 0, unlike the div opcode on its own.\n                // The surrounding unchecked block does not change this fact.\n                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.\n                return low / denominator;\n            }\n\n            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.\n            if (denominator <= high) {\n                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));\n            }\n\n            ///////////////////////////////////////////////\n            // 512 by 256 division.\n            ///////////////////////////////////////////////\n\n            // Make division exact by subtracting the remainder from [high low].\n            uint256 remainder;\n            assembly (\"memory-safe\") {\n                // Compute remainder using mulmod.\n                remainder := mulmod(x, y, denominator)\n\n                // Subtract 256 bit number from 512 bit number.\n                high := sub(high, gt(remainder, low))\n                low := sub(low, remainder)\n            }\n\n            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.\n            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.\n\n            uint256 twos = denominator & (0 - denominator);\n            assembly (\"memory-safe\") {\n                // Divide denominator by twos.\n                denominator := div(denominator, twos)\n\n                // Divide [high low] by twos.\n                low := div(low, twos)\n\n                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.\n                twos := add(div(sub(0, twos), twos), 1)\n            }\n\n            // Shift in bits from high into low.\n            low |= high * twos;\n\n            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such\n            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for\n            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.\n            uint256 inverse = (3 * denominator) ^ 2;\n\n            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also\n            // works in modular arithmetic, doubling the correct bits in each step.\n            inverse *= 2 - denominator * inverse; // inverse mod 2⁸\n            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶\n            inverse *= 2 - denominator * inverse; // inverse mod 2³²\n            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴\n            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸\n            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶\n\n            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.\n            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is\n            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and high\n            // is no longer required.\n            result = low * inverse;\n            return result;\n        }\n    }\n\n    /**\n     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {\n        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);\n    }\n\n    /**\n     * @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.\n     */\n    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {\n        unchecked {\n            (uint256 high, uint256 low) = mul512(x, y);\n            if (high >= 1 << n) {\n                Panic.panic(Panic.UNDER_OVERFLOW);\n            }\n            return (high << (256 - n)) | (low >> n);\n        }\n    }\n\n    /**\n     * @dev Calculates x * y >> n with full precision, following the selected rounding direction.\n     */\n    function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {\n        return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 0);\n    }\n\n    /**\n     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.\n     *\n     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.\n     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.\n     *\n     * If the input value is not inversible, 0 is returned.\n     *\n     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the\n     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.\n     */\n    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {\n        unchecked {\n            if (n == 0) return 0;\n\n            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)\n            // Used to compute integers x and y such that: ax + ny = gcd(a, n).\n            // When the gcd is 1, then the inverse of a modulo n exists and it's x.\n            // ax + ny = 1\n            // ax = 1 + (-y)n\n            // ax ≡ 1 (mod n) # x is the inverse of a modulo n\n\n            // If the remainder is 0 the gcd is n right away.\n            uint256 remainder = a % n;\n            uint256 gcd = n;\n\n            // Therefore the initial coefficients are:\n            // ax + ny = gcd(a, n) = n\n            // 0a + 1n = n\n            int256 x = 0;\n            int256 y = 1;\n\n            while (remainder != 0) {\n                uint256 quotient = gcd / remainder;\n\n                (gcd, remainder) = (\n                    // The old remainder is the next gcd to try.\n                    remainder,\n                    // Compute the next remainder.\n                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd\n                    // where gcd is at most n (capped to type(uint256).max)\n                    gcd - remainder * quotient\n                );\n\n                (x, y) = (\n                    // Increment the coefficient of a.\n                    y,\n                    // Decrement the coefficient of n.\n                    // Can overflow, but the result is casted to uint256 so that the\n                    // next value of y is \"wrapped around\" to a value between 0 and n - 1.\n                    x - y * int256(quotient)\n                );\n            }\n\n            if (gcd != 1) return 0; // No inverse exists.\n            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.\n        }\n    }\n\n    /**\n     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.\n     *\n     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is\n     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that\n     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.\n     *\n     * NOTE: this function does NOT check that `p` is a prime greater than `2`.\n     */\n    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {\n        unchecked {\n            return Math.modExp(a, p - 2, p);\n        }\n    }\n\n    /**\n     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)\n     *\n     * Requirements:\n     * - modulus can't be zero\n     * - underlying staticcall to precompile must succeed\n     *\n     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make\n     * sure the chain you're using it on supports the precompiled contract for modular exponentiation\n     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,\n     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly\n     * interpreted as 0.\n     */\n    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {\n        (bool success, uint256 result) = tryModExp(b, e, m);\n        if (!success) {\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n        return result;\n    }\n\n    /**\n     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).\n     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying\n     * to operate modulo 0 or if the underlying precompile reverted.\n     *\n     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain\n     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in\n     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack\n     * of a revert, but the result may be incorrectly interpreted as 0.\n     */\n    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {\n        if (m == 0) return (false, 0);\n        assembly (\"memory-safe\") {\n            let ptr := mload(0x40)\n            // | Offset    | Content    | Content (Hex)                                                      |\n            // |-----------|------------|--------------------------------------------------------------------|\n            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |\n            // | 0x60:0x7f | value of b | 0x<.............................................................b> |\n            // | 0x80:0x9f | value of e | 0x<.............................................................e> |\n            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |\n            mstore(ptr, 0x20)\n            mstore(add(ptr, 0x20), 0x20)\n            mstore(add(ptr, 0x40), 0x20)\n            mstore(add(ptr, 0x60), b)\n            mstore(add(ptr, 0x80), e)\n            mstore(add(ptr, 0xa0), m)\n\n            // Given the result < m, it's guaranteed to fit in 32 bytes,\n            // so we can use the memory scratch space located at offset 0.\n            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)\n            result := mload(0x00)\n        }\n    }\n\n    /**\n     * @dev Variant of {modExp} that supports inputs of arbitrary length.\n     */\n    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {\n        (bool success, bytes memory result) = tryModExp(b, e, m);\n        if (!success) {\n            Panic.panic(Panic.DIVISION_BY_ZERO);\n        }\n        return result;\n    }\n\n    /**\n     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.\n     */\n    function tryModExp(\n        bytes memory b,\n        bytes memory e,\n        bytes memory m\n    ) internal view returns (bool success, bytes memory result) {\n        if (_zeroBytes(m)) return (false, new bytes(0));\n\n        uint256 mLen = m.length;\n\n        // Encode call args in result and move the free memory pointer\n        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);\n\n        assembly (\"memory-safe\") {\n            let dataPtr := add(result, 0x20)\n            // Write result on top of args to avoid allocating extra memory.\n            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)\n            // Overwrite the length.\n            // result.length > returndatasize() is guaranteed because returndatasize() == m.length\n            mstore(result, mLen)\n            // Set the memory pointer after the returned data.\n            mstore(0x40, add(dataPtr, mLen))\n        }\n    }\n\n    /**\n     * @dev Returns whether the provided byte array is zero.\n     */\n    function _zeroBytes(bytes memory buffer) private pure returns (bool) {\n        uint256 chunk;\n        for (uint256 i = 0; i < buffer.length; i += 0x20) {\n            // See _unsafeReadBytesOffset from utils/Bytes.sol\n            assembly (\"memory-safe\") {\n                chunk := mload(add(add(buffer, 0x20), i))\n            }\n            if (chunk >> (8 * saturatingSub(i + 0x20, buffer.length)) != 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    /**\n     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded\n     * towards zero.\n     *\n     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only\n     * using integer operations.\n     */\n    function sqrt(uint256 a) internal pure returns (uint256) {\n        unchecked {\n            // Take care of easy edge cases when a == 0 or a == 1\n            if (a <= 1) {\n                return a;\n            }\n\n            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a\n            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between\n            // the current value as `ε_n = | x_n - sqrt(a) |`.\n            //\n            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root\n            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is\n            // bigger than any uint256.\n            //\n            // By noticing that\n            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`\n            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar\n            // to the msb function.\n            uint256 aa = a;\n            uint256 xn = 1;\n\n            if (aa >= (1 << 128)) {\n                aa >>= 128;\n                xn <<= 64;\n            }\n            if (aa >= (1 << 64)) {\n                aa >>= 64;\n                xn <<= 32;\n            }\n            if (aa >= (1 << 32)) {\n                aa >>= 32;\n                xn <<= 16;\n            }\n            if (aa >= (1 << 16)) {\n                aa >>= 16;\n                xn <<= 8;\n            }\n            if (aa >= (1 << 8)) {\n                aa >>= 8;\n                xn <<= 4;\n            }\n            if (aa >= (1 << 4)) {\n                aa >>= 4;\n                xn <<= 2;\n            }\n            if (aa >= (1 << 2)) {\n                xn <<= 1;\n            }\n\n            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).\n            //\n            // We can refine our estimation by noticing that the middle of that interval minimizes the error.\n            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).\n            // This is going to be our x_0 (and ε_0)\n            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)\n\n            // From here, Newton's method give us:\n            // x_{n+1} = (x_n + a / x_n) / 2\n            //\n            // One should note that:\n            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a\n            //              = ((x_n² + a) / (2 * x_n))² - a\n            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a\n            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)\n            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)\n            //              = (x_n² - a)² / (2 * x_n)²\n            //              = ((x_n² - a) / (2 * x_n))²\n            //              ≥ 0\n            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n\n            //\n            // This gives us the proof of quadratic convergence of the sequence:\n            // ε_{n+1} = | x_{n+1} - sqrt(a) |\n            //         = | (x_n + a / x_n) / 2 - sqrt(a) |\n            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |\n            //         = | (x_n - sqrt(a))² / (2 * x_n) |\n            //         = | ε_n² / (2 * x_n) |\n            //         = ε_n² / | (2 * x_n) |\n            //\n            // For the first iteration, we have a special case where x_0 is known:\n            // ε_1 = ε_0² / | (2 * x_0) |\n            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))\n            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))\n            //     ≤ 2**(e-3) / 3\n            //     ≤ 2**(e-3-log2(3))\n            //     ≤ 2**(e-4.5)\n            //\n            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:\n            // ε_{n+1} = ε_n² / | (2 * x_n) |\n            //         ≤ (2**(e-k))² / (2 * 2**(e-1))\n            //         ≤ 2**(2*e-2*k) / 2**e\n            //         ≤ 2**(e-2*k)\n            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above\n            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5\n            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9\n            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18\n            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36\n            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72\n\n            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision\n            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either\n            // sqrt(a) or sqrt(a) + 1.\n            return xn - SafeCast.toUint(xn > a / xn);\n        }\n    }\n\n    /**\n     * @dev Calculates sqrt(a), following the selected rounding direction.\n     */\n    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = sqrt(a);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 2 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 x) internal pure returns (uint256 r) {\n        // If value has upper 128 bits set, log2 result is at least 128\n        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;\n        // If upper 64 bits of 128-bit half set, add 64 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;\n        // If upper 32 bits of 64-bit half set, add 32 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;\n        // If upper 16 bits of 32-bit half set, add 16 to result\n        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;\n        // If upper 8 bits of 16-bit half set, add 8 to result\n        r |= SafeCast.toUint((x >> r) > 0xff) << 3;\n        // If upper 4 bits of 8-bit half set, add 4 to result\n        r |= SafeCast.toUint((x >> r) > 0xf) << 2;\n\n        // Shifts value right by the current result and use it as an index into this lookup table:\n        //\n        // | x (4 bits) |  index  | table[index] = MSB position |\n        // |------------|---------|-----------------------------|\n        // |    0000    |    0    |        table[0] = 0         |\n        // |    0001    |    1    |        table[1] = 0         |\n        // |    0010    |    2    |        table[2] = 1         |\n        // |    0011    |    3    |        table[3] = 1         |\n        // |    0100    |    4    |        table[4] = 2         |\n        // |    0101    |    5    |        table[5] = 2         |\n        // |    0110    |    6    |        table[6] = 2         |\n        // |    0111    |    7    |        table[7] = 2         |\n        // |    1000    |    8    |        table[8] = 3         |\n        // |    1001    |    9    |        table[9] = 3         |\n        // |    1010    |   10    |        table[10] = 3        |\n        // |    1011    |   11    |        table[11] = 3        |\n        // |    1100    |   12    |        table[12] = 3        |\n        // |    1101    |   13    |        table[13] = 3        |\n        // |    1110    |   14    |        table[14] = 3        |\n        // |    1111    |   15    |        table[15] = 3        |\n        //\n        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the first 16 bytes (most significant half).\n        assembly (\"memory-safe\") {\n            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))\n        }\n    }\n\n    /**\n     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log2(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 10 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value) internal pure returns (uint256) {\n        uint256 result = 0;\n        unchecked {\n            if (value >= 10 ** 64) {\n                value /= 10 ** 64;\n                result += 64;\n            }\n            if (value >= 10 ** 32) {\n                value /= 10 ** 32;\n                result += 32;\n            }\n            if (value >= 10 ** 16) {\n                value /= 10 ** 16;\n                result += 16;\n            }\n            if (value >= 10 ** 8) {\n                value /= 10 ** 8;\n                result += 8;\n            }\n            if (value >= 10 ** 4) {\n                value /= 10 ** 4;\n                result += 4;\n            }\n            if (value >= 10 ** 2) {\n                value /= 10 ** 2;\n                result += 2;\n            }\n            if (value >= 10 ** 1) {\n                result += 1;\n            }\n        }\n        return result;\n    }\n\n    /**\n     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log10(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 256 of a positive value rounded towards zero.\n     * Returns 0 if given 0.\n     *\n     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.\n     */\n    function log256(uint256 x) internal pure returns (uint256 r) {\n        // If value has upper 128 bits set, log2 result is at least 128\n        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;\n        // If upper 64 bits of 128-bit half set, add 64 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;\n        // If upper 32 bits of 64-bit half set, add 32 to result\n        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;\n        // If upper 16 bits of 32-bit half set, add 16 to result\n        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;\n        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8\n        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);\n    }\n\n    /**\n     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log256(value);\n            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);\n        }\n    }\n\n    /**\n     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.\n     */\n    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {\n        return uint8(rounding) % 2 == 1;\n    }\n\n    /**\n     * @dev Counts the number of leading zero bits in a uint256.\n     */\n    function clz(uint256 x) internal pure returns (uint256) {\n        return ternary(x == 0, 256, 255 - log2(x));\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/Comparators.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/Comparators.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Provides a set of functions to compare values.\n *\n * _Available since v5.1._\n */\nlibrary Comparators {\n    function lt(uint256 a, uint256 b) internal pure returns (bool) {\n        return a < b;\n    }\n\n    function gt(uint256 a, uint256 b) internal pure returns (bool) {\n        return a > b;\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/StorageSlot.sol)\n// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Library for reading and writing primitive types to specific storage slots.\n *\n * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.\n * This library helps with reading and writing to such slots without the need for inline assembly.\n *\n * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.\n *\n * Example usage to set ERC-1967 implementation slot:\n * ```solidity\n * contract ERC1967 {\n *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.\n *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\n *\n *     function _getImplementation() internal view returns (address) {\n *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;\n *     }\n *\n *     function _setImplementation(address newImplementation) internal {\n *         require(newImplementation.code.length > 0);\n *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;\n *     }\n * }\n * ```\n *\n * TIP: Consider using this library along with {SlotDerivation}.\n */\nlibrary StorageSlot {\n    struct AddressSlot {\n        address value;\n    }\n\n    struct BooleanSlot {\n        bool value;\n    }\n\n    struct Bytes32Slot {\n        bytes32 value;\n    }\n\n    struct Uint256Slot {\n        uint256 value;\n    }\n\n    struct Int256Slot {\n        int256 value;\n    }\n\n    struct StringSlot {\n        string value;\n    }\n\n    struct BytesSlot {\n        bytes value;\n    }\n\n    /**\n     * @dev Returns an `AddressSlot` with member `value` located at `slot`.\n     */\n    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `BooleanSlot` with member `value` located at `slot`.\n     */\n    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Bytes32Slot` with member `value` located at `slot`.\n     */\n    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Uint256Slot` with member `value` located at `slot`.\n     */\n    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `Int256Slot` with member `value` located at `slot`.\n     */\n    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns a `StringSlot` with member `value` located at `slot`.\n     */\n    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.\n     */\n    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := store.slot\n        }\n    }\n\n    /**\n     * @dev Returns a `BytesSlot` with member `value` located at `slot`.\n     */\n    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.\n     */\n    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {\n        assembly (\"memory-safe\") {\n            r.slot := store.slot\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-20 standard as defined in the ERC.\n */\ninterface IERC20 {\n    /**\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\n     * another (`to`).\n     *\n     * Note that `value` may be zero.\n     */\n    event Transfer(address indexed from, address indexed to, uint256 value);\n\n    /**\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\n     * a call to {approve}. `value` is the new allowance.\n     */\n    event Approval(address indexed owner, address indexed spender, uint256 value);\n\n    /**\n     * @dev Returns the value of tokens in existence.\n     */\n    function totalSupply() external view returns (uint256);\n\n    /**\n     * @dev Returns the value of tokens owned by `account`.\n     */\n    function balanceOf(address account) external view returns (uint256);\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transfer(address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Returns the remaining number of tokens that `spender` will be\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\n     * zero by default.\n     *\n     * This value changes when {approve} or {transferFrom} are called.\n     */\n    function allowance(address owner, address spender) external view returns (uint256);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\n     * that someone may use both the old and the new allowance by unfortunate\n     * transaction ordering. One possible solution to mitigate this race\n     * condition is to first reduce the spender's allowance to 0 and set the\n     * desired value afterwards:\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\n     *\n     * Emits an {Approval} event.\n     */\n    function approve(address spender, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\n     * allowance mechanism. `value` is then deducted from the caller's\n     * allowance.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\n}\n"},"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC5267.sol)\n\npragma solidity >=0.4.16;\n\ninterface IERC5267 {\n    /**\n     * @dev MAY be emitted to signal that the domain could have changed.\n     */\n    event EIP712DomainChanged();\n\n    /**\n     * @dev returns the fields and values that describe the domain separator used by this contract for EIP-712\n     * signature.\n     */\n    function eip712Domain()\n        external\n        view\n        returns (\n            bytes1 fields,\n            string memory name,\n            string memory version,\n            uint256 chainId,\n            address verifyingContract,\n            bytes32 salt,\n            uint256[] memory extensions\n        );\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/math/SafeCast.sol)\n// This file was procedurally generated from scripts/generate/templates/SafeCast.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow\n * checks.\n *\n * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can\n * easily result in undesired exploitation or bugs, since developers usually\n * assume that overflows raise errors. `SafeCast` restores this intuition by\n * reverting the transaction when such an operation overflows.\n *\n * Using this library instead of the unchecked operations eliminates an entire\n * class of bugs, so it's recommended to use it always.\n */\nlibrary SafeCast {\n    /**\n     * @dev Value doesn't fit in a uint of `bits` size.\n     */\n    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);\n\n    /**\n     * @dev An int value doesn't fit in a uint of `bits` size.\n     */\n    error SafeCastOverflowedIntToUint(int256 value);\n\n    /**\n     * @dev Value doesn't fit in an int of `bits` size.\n     */\n    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);\n\n    /**\n     * @dev A uint value doesn't fit in an int of `bits` size.\n     */\n    error SafeCastOverflowedUintToInt(uint256 value);\n\n    /**\n     * @dev Returns the downcasted uint248 from uint256, reverting on\n     * overflow (when the input is greater than largest uint248).\n     *\n     * Counterpart to Solidity's `uint248` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 248 bits\n     */\n    function toUint248(uint256 value) internal pure returns (uint248) {\n        if (value > type(uint248).max) {\n            revert SafeCastOverflowedUintDowncast(248, value);\n        }\n        return uint248(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint240 from uint256, reverting on\n     * overflow (when the input is greater than largest uint240).\n     *\n     * Counterpart to Solidity's `uint240` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 240 bits\n     */\n    function toUint240(uint256 value) internal pure returns (uint240) {\n        if (value > type(uint240).max) {\n            revert SafeCastOverflowedUintDowncast(240, value);\n        }\n        return uint240(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint232 from uint256, reverting on\n     * overflow (when the input is greater than largest uint232).\n     *\n     * Counterpart to Solidity's `uint232` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 232 bits\n     */\n    function toUint232(uint256 value) internal pure returns (uint232) {\n        if (value > type(uint232).max) {\n            revert SafeCastOverflowedUintDowncast(232, value);\n        }\n        return uint232(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint224 from uint256, reverting on\n     * overflow (when the input is greater than largest uint224).\n     *\n     * Counterpart to Solidity's `uint224` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 224 bits\n     */\n    function toUint224(uint256 value) internal pure returns (uint224) {\n        if (value > type(uint224).max) {\n            revert SafeCastOverflowedUintDowncast(224, value);\n        }\n        return uint224(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint216 from uint256, reverting on\n     * overflow (when the input is greater than largest uint216).\n     *\n     * Counterpart to Solidity's `uint216` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 216 bits\n     */\n    function toUint216(uint256 value) internal pure returns (uint216) {\n        if (value > type(uint216).max) {\n            revert SafeCastOverflowedUintDowncast(216, value);\n        }\n        return uint216(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint208 from uint256, reverting on\n     * overflow (when the input is greater than largest uint208).\n     *\n     * Counterpart to Solidity's `uint208` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 208 bits\n     */\n    function toUint208(uint256 value) internal pure returns (uint208) {\n        if (value > type(uint208).max) {\n            revert SafeCastOverflowedUintDowncast(208, value);\n        }\n        return uint208(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint200 from uint256, reverting on\n     * overflow (when the input is greater than largest uint200).\n     *\n     * Counterpart to Solidity's `uint200` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 200 bits\n     */\n    function toUint200(uint256 value) internal pure returns (uint200) {\n        if (value > type(uint200).max) {\n            revert SafeCastOverflowedUintDowncast(200, value);\n        }\n        return uint200(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint192 from uint256, reverting on\n     * overflow (when the input is greater than largest uint192).\n     *\n     * Counterpart to Solidity's `uint192` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 192 bits\n     */\n    function toUint192(uint256 value) internal pure returns (uint192) {\n        if (value > type(uint192).max) {\n            revert SafeCastOverflowedUintDowncast(192, value);\n        }\n        return uint192(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint184 from uint256, reverting on\n     * overflow (when the input is greater than largest uint184).\n     *\n     * Counterpart to Solidity's `uint184` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 184 bits\n     */\n    function toUint184(uint256 value) internal pure returns (uint184) {\n        if (value > type(uint184).max) {\n            revert SafeCastOverflowedUintDowncast(184, value);\n        }\n        return uint184(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint176 from uint256, reverting on\n     * overflow (when the input is greater than largest uint176).\n     *\n     * Counterpart to Solidity's `uint176` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 176 bits\n     */\n    function toUint176(uint256 value) internal pure returns (uint176) {\n        if (value > type(uint176).max) {\n            revert SafeCastOverflowedUintDowncast(176, value);\n        }\n        return uint176(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint168 from uint256, reverting on\n     * overflow (when the input is greater than largest uint168).\n     *\n     * Counterpart to Solidity's `uint168` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 168 bits\n     */\n    function toUint168(uint256 value) internal pure returns (uint168) {\n        if (value > type(uint168).max) {\n            revert SafeCastOverflowedUintDowncast(168, value);\n        }\n        return uint168(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint160 from uint256, reverting on\n     * overflow (when the input is greater than largest uint160).\n     *\n     * Counterpart to Solidity's `uint160` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 160 bits\n     */\n    function toUint160(uint256 value) internal pure returns (uint160) {\n        if (value > type(uint160).max) {\n            revert SafeCastOverflowedUintDowncast(160, value);\n        }\n        return uint160(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint152 from uint256, reverting on\n     * overflow (when the input is greater than largest uint152).\n     *\n     * Counterpart to Solidity's `uint152` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 152 bits\n     */\n    function toUint152(uint256 value) internal pure returns (uint152) {\n        if (value > type(uint152).max) {\n            revert SafeCastOverflowedUintDowncast(152, value);\n        }\n        return uint152(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint144 from uint256, reverting on\n     * overflow (when the input is greater than largest uint144).\n     *\n     * Counterpart to Solidity's `uint144` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 144 bits\n     */\n    function toUint144(uint256 value) internal pure returns (uint144) {\n        if (value > type(uint144).max) {\n            revert SafeCastOverflowedUintDowncast(144, value);\n        }\n        return uint144(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint136 from uint256, reverting on\n     * overflow (when the input is greater than largest uint136).\n     *\n     * Counterpart to Solidity's `uint136` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 136 bits\n     */\n    function toUint136(uint256 value) internal pure returns (uint136) {\n        if (value > type(uint136).max) {\n            revert SafeCastOverflowedUintDowncast(136, value);\n        }\n        return uint136(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint128 from uint256, reverting on\n     * overflow (when the input is greater than largest uint128).\n     *\n     * Counterpart to Solidity's `uint128` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 128 bits\n     */\n    function toUint128(uint256 value) internal pure returns (uint128) {\n        if (value > type(uint128).max) {\n            revert SafeCastOverflowedUintDowncast(128, value);\n        }\n        return uint128(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint120 from uint256, reverting on\n     * overflow (when the input is greater than largest uint120).\n     *\n     * Counterpart to Solidity's `uint120` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 120 bits\n     */\n    function toUint120(uint256 value) internal pure returns (uint120) {\n        if (value > type(uint120).max) {\n            revert SafeCastOverflowedUintDowncast(120, value);\n        }\n        return uint120(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint112 from uint256, reverting on\n     * overflow (when the input is greater than largest uint112).\n     *\n     * Counterpart to Solidity's `uint112` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 112 bits\n     */\n    function toUint112(uint256 value) internal pure returns (uint112) {\n        if (value > type(uint112).max) {\n            revert SafeCastOverflowedUintDowncast(112, value);\n        }\n        return uint112(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint104 from uint256, reverting on\n     * overflow (when the input is greater than largest uint104).\n     *\n     * Counterpart to Solidity's `uint104` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 104 bits\n     */\n    function toUint104(uint256 value) internal pure returns (uint104) {\n        if (value > type(uint104).max) {\n            revert SafeCastOverflowedUintDowncast(104, value);\n        }\n        return uint104(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint96 from uint256, reverting on\n     * overflow (when the input is greater than largest uint96).\n     *\n     * Counterpart to Solidity's `uint96` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 96 bits\n     */\n    function toUint96(uint256 value) internal pure returns (uint96) {\n        if (value > type(uint96).max) {\n            revert SafeCastOverflowedUintDowncast(96, value);\n        }\n        return uint96(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint88 from uint256, reverting on\n     * overflow (when the input is greater than largest uint88).\n     *\n     * Counterpart to Solidity's `uint88` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 88 bits\n     */\n    function toUint88(uint256 value) internal pure returns (uint88) {\n        if (value > type(uint88).max) {\n            revert SafeCastOverflowedUintDowncast(88, value);\n        }\n        return uint88(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint80 from uint256, reverting on\n     * overflow (when the input is greater than largest uint80).\n     *\n     * Counterpart to Solidity's `uint80` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 80 bits\n     */\n    function toUint80(uint256 value) internal pure returns (uint80) {\n        if (value > type(uint80).max) {\n            revert SafeCastOverflowedUintDowncast(80, value);\n        }\n        return uint80(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint72 from uint256, reverting on\n     * overflow (when the input is greater than largest uint72).\n     *\n     * Counterpart to Solidity's `uint72` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 72 bits\n     */\n    function toUint72(uint256 value) internal pure returns (uint72) {\n        if (value > type(uint72).max) {\n            revert SafeCastOverflowedUintDowncast(72, value);\n        }\n        return uint72(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint64 from uint256, reverting on\n     * overflow (when the input is greater than largest uint64).\n     *\n     * Counterpart to Solidity's `uint64` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 64 bits\n     */\n    function toUint64(uint256 value) internal pure returns (uint64) {\n        if (value > type(uint64).max) {\n            revert SafeCastOverflowedUintDowncast(64, value);\n        }\n        return uint64(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint56 from uint256, reverting on\n     * overflow (when the input is greater than largest uint56).\n     *\n     * Counterpart to Solidity's `uint56` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 56 bits\n     */\n    function toUint56(uint256 value) internal pure returns (uint56) {\n        if (value > type(uint56).max) {\n            revert SafeCastOverflowedUintDowncast(56, value);\n        }\n        return uint56(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint48 from uint256, reverting on\n     * overflow (when the input is greater than largest uint48).\n     *\n     * Counterpart to Solidity's `uint48` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 48 bits\n     */\n    function toUint48(uint256 value) internal pure returns (uint48) {\n        if (value > type(uint48).max) {\n            revert SafeCastOverflowedUintDowncast(48, value);\n        }\n        return uint48(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint40 from uint256, reverting on\n     * overflow (when the input is greater than largest uint40).\n     *\n     * Counterpart to Solidity's `uint40` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 40 bits\n     */\n    function toUint40(uint256 value) internal pure returns (uint40) {\n        if (value > type(uint40).max) {\n            revert SafeCastOverflowedUintDowncast(40, value);\n        }\n        return uint40(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint32 from uint256, reverting on\n     * overflow (when the input is greater than largest uint32).\n     *\n     * Counterpart to Solidity's `uint32` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 32 bits\n     */\n    function toUint32(uint256 value) internal pure returns (uint32) {\n        if (value > type(uint32).max) {\n            revert SafeCastOverflowedUintDowncast(32, value);\n        }\n        return uint32(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint24 from uint256, reverting on\n     * overflow (when the input is greater than largest uint24).\n     *\n     * Counterpart to Solidity's `uint24` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 24 bits\n     */\n    function toUint24(uint256 value) internal pure returns (uint24) {\n        if (value > type(uint24).max) {\n            revert SafeCastOverflowedUintDowncast(24, value);\n        }\n        return uint24(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint16 from uint256, reverting on\n     * overflow (when the input is greater than largest uint16).\n     *\n     * Counterpart to Solidity's `uint16` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 16 bits\n     */\n    function toUint16(uint256 value) internal pure returns (uint16) {\n        if (value > type(uint16).max) {\n            revert SafeCastOverflowedUintDowncast(16, value);\n        }\n        return uint16(value);\n    }\n\n    /**\n     * @dev Returns the downcasted uint8 from uint256, reverting on\n     * overflow (when the input is greater than largest uint8).\n     *\n     * Counterpart to Solidity's `uint8` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 8 bits\n     */\n    function toUint8(uint256 value) internal pure returns (uint8) {\n        if (value > type(uint8).max) {\n            revert SafeCastOverflowedUintDowncast(8, value);\n        }\n        return uint8(value);\n    }\n\n    /**\n     * @dev Converts a signed int256 into an unsigned uint256.\n     *\n     * Requirements:\n     *\n     * - input must be greater than or equal to 0.\n     */\n    function toUint256(int256 value) internal pure returns (uint256) {\n        if (value < 0) {\n            revert SafeCastOverflowedIntToUint(value);\n        }\n        return uint256(value);\n    }\n\n    /**\n     * @dev Returns the downcasted int248 from int256, reverting on\n     * overflow (when the input is less than smallest int248 or\n     * greater than largest int248).\n     *\n     * Counterpart to Solidity's `int248` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 248 bits\n     */\n    function toInt248(int256 value) internal pure returns (int248 downcasted) {\n        downcasted = int248(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(248, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int240 from int256, reverting on\n     * overflow (when the input is less than smallest int240 or\n     * greater than largest int240).\n     *\n     * Counterpart to Solidity's `int240` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 240 bits\n     */\n    function toInt240(int256 value) internal pure returns (int240 downcasted) {\n        downcasted = int240(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(240, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int232 from int256, reverting on\n     * overflow (when the input is less than smallest int232 or\n     * greater than largest int232).\n     *\n     * Counterpart to Solidity's `int232` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 232 bits\n     */\n    function toInt232(int256 value) internal pure returns (int232 downcasted) {\n        downcasted = int232(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(232, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int224 from int256, reverting on\n     * overflow (when the input is less than smallest int224 or\n     * greater than largest int224).\n     *\n     * Counterpart to Solidity's `int224` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 224 bits\n     */\n    function toInt224(int256 value) internal pure returns (int224 downcasted) {\n        downcasted = int224(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(224, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int216 from int256, reverting on\n     * overflow (when the input is less than smallest int216 or\n     * greater than largest int216).\n     *\n     * Counterpart to Solidity's `int216` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 216 bits\n     */\n    function toInt216(int256 value) internal pure returns (int216 downcasted) {\n        downcasted = int216(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(216, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int208 from int256, reverting on\n     * overflow (when the input is less than smallest int208 or\n     * greater than largest int208).\n     *\n     * Counterpart to Solidity's `int208` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 208 bits\n     */\n    function toInt208(int256 value) internal pure returns (int208 downcasted) {\n        downcasted = int208(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(208, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int200 from int256, reverting on\n     * overflow (when the input is less than smallest int200 or\n     * greater than largest int200).\n     *\n     * Counterpart to Solidity's `int200` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 200 bits\n     */\n    function toInt200(int256 value) internal pure returns (int200 downcasted) {\n        downcasted = int200(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(200, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int192 from int256, reverting on\n     * overflow (when the input is less than smallest int192 or\n     * greater than largest int192).\n     *\n     * Counterpart to Solidity's `int192` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 192 bits\n     */\n    function toInt192(int256 value) internal pure returns (int192 downcasted) {\n        downcasted = int192(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(192, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int184 from int256, reverting on\n     * overflow (when the input is less than smallest int184 or\n     * greater than largest int184).\n     *\n     * Counterpart to Solidity's `int184` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 184 bits\n     */\n    function toInt184(int256 value) internal pure returns (int184 downcasted) {\n        downcasted = int184(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(184, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int176 from int256, reverting on\n     * overflow (when the input is less than smallest int176 or\n     * greater than largest int176).\n     *\n     * Counterpart to Solidity's `int176` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 176 bits\n     */\n    function toInt176(int256 value) internal pure returns (int176 downcasted) {\n        downcasted = int176(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(176, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int168 from int256, reverting on\n     * overflow (when the input is less than smallest int168 or\n     * greater than largest int168).\n     *\n     * Counterpart to Solidity's `int168` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 168 bits\n     */\n    function toInt168(int256 value) internal pure returns (int168 downcasted) {\n        downcasted = int168(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(168, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int160 from int256, reverting on\n     * overflow (when the input is less than smallest int160 or\n     * greater than largest int160).\n     *\n     * Counterpart to Solidity's `int160` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 160 bits\n     */\n    function toInt160(int256 value) internal pure returns (int160 downcasted) {\n        downcasted = int160(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(160, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int152 from int256, reverting on\n     * overflow (when the input is less than smallest int152 or\n     * greater than largest int152).\n     *\n     * Counterpart to Solidity's `int152` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 152 bits\n     */\n    function toInt152(int256 value) internal pure returns (int152 downcasted) {\n        downcasted = int152(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(152, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int144 from int256, reverting on\n     * overflow (when the input is less than smallest int144 or\n     * greater than largest int144).\n     *\n     * Counterpart to Solidity's `int144` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 144 bits\n     */\n    function toInt144(int256 value) internal pure returns (int144 downcasted) {\n        downcasted = int144(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(144, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int136 from int256, reverting on\n     * overflow (when the input is less than smallest int136 or\n     * greater than largest int136).\n     *\n     * Counterpart to Solidity's `int136` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 136 bits\n     */\n    function toInt136(int256 value) internal pure returns (int136 downcasted) {\n        downcasted = int136(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(136, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int128 from int256, reverting on\n     * overflow (when the input is less than smallest int128 or\n     * greater than largest int128).\n     *\n     * Counterpart to Solidity's `int128` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 128 bits\n     */\n    function toInt128(int256 value) internal pure returns (int128 downcasted) {\n        downcasted = int128(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(128, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int120 from int256, reverting on\n     * overflow (when the input is less than smallest int120 or\n     * greater than largest int120).\n     *\n     * Counterpart to Solidity's `int120` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 120 bits\n     */\n    function toInt120(int256 value) internal pure returns (int120 downcasted) {\n        downcasted = int120(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(120, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int112 from int256, reverting on\n     * overflow (when the input is less than smallest int112 or\n     * greater than largest int112).\n     *\n     * Counterpart to Solidity's `int112` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 112 bits\n     */\n    function toInt112(int256 value) internal pure returns (int112 downcasted) {\n        downcasted = int112(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(112, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int104 from int256, reverting on\n     * overflow (when the input is less than smallest int104 or\n     * greater than largest int104).\n     *\n     * Counterpart to Solidity's `int104` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 104 bits\n     */\n    function toInt104(int256 value) internal pure returns (int104 downcasted) {\n        downcasted = int104(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(104, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int96 from int256, reverting on\n     * overflow (when the input is less than smallest int96 or\n     * greater than largest int96).\n     *\n     * Counterpart to Solidity's `int96` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 96 bits\n     */\n    function toInt96(int256 value) internal pure returns (int96 downcasted) {\n        downcasted = int96(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(96, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int88 from int256, reverting on\n     * overflow (when the input is less than smallest int88 or\n     * greater than largest int88).\n     *\n     * Counterpart to Solidity's `int88` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 88 bits\n     */\n    function toInt88(int256 value) internal pure returns (int88 downcasted) {\n        downcasted = int88(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(88, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int80 from int256, reverting on\n     * overflow (when the input is less than smallest int80 or\n     * greater than largest int80).\n     *\n     * Counterpart to Solidity's `int80` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 80 bits\n     */\n    function toInt80(int256 value) internal pure returns (int80 downcasted) {\n        downcasted = int80(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(80, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int72 from int256, reverting on\n     * overflow (when the input is less than smallest int72 or\n     * greater than largest int72).\n     *\n     * Counterpart to Solidity's `int72` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 72 bits\n     */\n    function toInt72(int256 value) internal pure returns (int72 downcasted) {\n        downcasted = int72(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(72, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int64 from int256, reverting on\n     * overflow (when the input is less than smallest int64 or\n     * greater than largest int64).\n     *\n     * Counterpart to Solidity's `int64` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 64 bits\n     */\n    function toInt64(int256 value) internal pure returns (int64 downcasted) {\n        downcasted = int64(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(64, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int56 from int256, reverting on\n     * overflow (when the input is less than smallest int56 or\n     * greater than largest int56).\n     *\n     * Counterpart to Solidity's `int56` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 56 bits\n     */\n    function toInt56(int256 value) internal pure returns (int56 downcasted) {\n        downcasted = int56(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(56, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int48 from int256, reverting on\n     * overflow (when the input is less than smallest int48 or\n     * greater than largest int48).\n     *\n     * Counterpart to Solidity's `int48` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 48 bits\n     */\n    function toInt48(int256 value) internal pure returns (int48 downcasted) {\n        downcasted = int48(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(48, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int40 from int256, reverting on\n     * overflow (when the input is less than smallest int40 or\n     * greater than largest int40).\n     *\n     * Counterpart to Solidity's `int40` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 40 bits\n     */\n    function toInt40(int256 value) internal pure returns (int40 downcasted) {\n        downcasted = int40(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(40, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int32 from int256, reverting on\n     * overflow (when the input is less than smallest int32 or\n     * greater than largest int32).\n     *\n     * Counterpart to Solidity's `int32` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 32 bits\n     */\n    function toInt32(int256 value) internal pure returns (int32 downcasted) {\n        downcasted = int32(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(32, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int24 from int256, reverting on\n     * overflow (when the input is less than smallest int24 or\n     * greater than largest int24).\n     *\n     * Counterpart to Solidity's `int24` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 24 bits\n     */\n    function toInt24(int256 value) internal pure returns (int24 downcasted) {\n        downcasted = int24(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(24, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int16 from int256, reverting on\n     * overflow (when the input is less than smallest int16 or\n     * greater than largest int16).\n     *\n     * Counterpart to Solidity's `int16` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 16 bits\n     */\n    function toInt16(int256 value) internal pure returns (int16 downcasted) {\n        downcasted = int16(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(16, value);\n        }\n    }\n\n    /**\n     * @dev Returns the downcasted int8 from int256, reverting on\n     * overflow (when the input is less than smallest int8 or\n     * greater than largest int8).\n     *\n     * Counterpart to Solidity's `int8` operator.\n     *\n     * Requirements:\n     *\n     * - input must fit into 8 bits\n     */\n    function toInt8(int256 value) internal pure returns (int8 downcasted) {\n        downcasted = int8(value);\n        if (downcasted != value) {\n            revert SafeCastOverflowedIntDowncast(8, value);\n        }\n    }\n\n    /**\n     * @dev Converts an unsigned uint256 into a signed int256.\n     *\n     * Requirements:\n     *\n     * - input must be less than or equal to maxInt256.\n     */\n    function toInt256(uint256 value) internal pure returns (int256) {\n        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive\n        if (value > uint256(type(int256).max)) {\n            revert SafeCastOverflowedUintToInt(value);\n        }\n        return int256(value);\n    }\n\n    /**\n     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.\n     */\n    function toUint(bool b) internal pure returns (uint256 u) {\n        assembly (\"memory-safe\") {\n            u := iszero(iszero(b))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/SlotDerivation.sol)\n// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots\n * corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by\n * the solidity language / compiler.\n *\n * See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].\n *\n * Example usage:\n * ```solidity\n * contract Example {\n *     // Add the library methods\n *     using StorageSlot for bytes32;\n *     using SlotDerivation for *;\n *\n *     // Declare a namespace\n *     string private constant _NAMESPACE = \"<namespace>\"; // eg. OpenZeppelin.Slot\n *\n *     function setValueInNamespace(uint256 key, address newValue) internal {\n *         _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;\n *     }\n *\n *     function getValueInNamespace(uint256 key) internal view returns (address) {\n *         return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;\n *     }\n * }\n * ```\n *\n * TIP: Consider using this library along with {StorageSlot}.\n *\n * NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking\n * upgrade safety will ignore the slots accessed through this library.\n *\n * _Available since v5.1._\n */\nlibrary SlotDerivation {\n    /**\n     * @dev Derive an ERC-7201 slot from a string (namespace).\n     */\n    function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))\n            slot := and(keccak256(0x00, 0x20), not(0xff))\n        }\n    }\n\n    /**\n     * @dev Add an offset to a slot to get the n-th element of a structure or an array.\n     */\n    function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {\n        unchecked {\n            return bytes32(uint256(slot) + pos);\n        }\n    }\n\n    /**\n     * @dev Derive the location of the first element in an array from the slot where the length is stored.\n     */\n    function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, slot)\n            result := keccak256(0x00, 0x20)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, and(key, shr(96, not(0))))\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, iszero(iszero(key)))\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, key)\n            mstore(0x20, slot)\n            result := keccak256(0x00, 0x40)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            let length := mload(key)\n            let begin := add(key, 0x20)\n            let end := add(begin, length)\n            let cache := mload(end)\n            mstore(end, slot)\n            result := keccak256(begin, add(length, 0x20))\n            mstore(end, cache)\n        }\n    }\n\n    /**\n     * @dev Derive the location of a mapping element from the key.\n     */\n    function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {\n        assembly (\"memory-safe\") {\n            let length := mload(key)\n            let begin := add(key, 0x20)\n            let end := add(begin, length)\n            let cache := mload(end)\n            mstore(end, slot)\n            result := keccak256(begin, add(length, 0x20))\n            mstore(end, cache)\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/access/IAccessControl.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (access/IAccessControl.sol)\n\npragma solidity >=0.8.4;\n\n/**\n * @dev External interface of AccessControl declared to support ERC-165 detection.\n */\ninterface IAccessControl {\n    /**\n     * @dev The `account` is missing a role.\n     */\n    error AccessControlUnauthorizedAccount(address account, bytes32 neededRole);\n\n    /**\n     * @dev The caller of a function is not the expected one.\n     *\n     * NOTE: Don't confuse with {AccessControlUnauthorizedAccount}.\n     */\n    error AccessControlBadConfirmation();\n\n    /**\n     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`\n     *\n     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite\n     * {RoleAdminChanged} not being emitted to signal this.\n     */\n    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);\n\n    /**\n     * @dev Emitted when `account` is granted `role`.\n     *\n     * `sender` is the account that originated the contract call. This account bears the admin role (for the granted role).\n     * Expected in cases where the role was granted using the internal {AccessControl-_grantRole}.\n     */\n    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);\n\n    /**\n     * @dev Emitted when `account` is revoked `role`.\n     *\n     * `sender` is the account that originated the contract call:\n     *   - if using `revokeRole`, it is the admin role bearer\n     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)\n     */\n    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);\n\n    /**\n     * @dev Returns `true` if `account` has been granted `role`.\n     */\n    function hasRole(bytes32 role, address account) external view returns (bool);\n\n    /**\n     * @dev Returns the admin role that controls `role`. See {grantRole} and\n     * {revokeRole}.\n     *\n     * To change a role's admin, use {AccessControl-_setRoleAdmin}.\n     */\n    function getRoleAdmin(bytes32 role) external view returns (bytes32);\n\n    /**\n     * @dev Grants `role` to `account`.\n     *\n     * If `account` had not been already granted `role`, emits a {RoleGranted}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     */\n    function grantRole(bytes32 role, address account) external;\n\n    /**\n     * @dev Revokes `role` from `account`.\n     *\n     * If `account` had been granted `role`, emits a {RoleRevoked} event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     */\n    function revokeRole(bytes32 role, address account) external;\n\n    /**\n     * @dev Revokes `role` from the calling account.\n     *\n     * Roles are often managed via {grantRole} and {revokeRole}: this function's\n     * purpose is to provide a mechanism for accounts to lose their privileges\n     * if they are compromised (such as when a trusted device is misplaced).\n     *\n     * If the calling account had been granted `role`, emits a {RoleRevoked}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must be `callerConfirmation`.\n     */\n    function renounceRole(bytes32 role, address callerConfirmation) external;\n}\n"},"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)\n\npragma solidity ^0.8.20;\n\nimport {SafeCast} from \"./SafeCast.sol\";\n\n/**\n * @dev Standard signed math utilities missing in the Solidity language.\n */\nlibrary SignedMath {\n    /**\n     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.\n     *\n     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.\n     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute\n     * one branch when needed, making this function more expensive.\n     */\n    function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {\n        unchecked {\n            // branchless ternary works because:\n            // b ^ (a ^ b) == a\n            // b ^ 0 == b\n            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));\n        }\n    }\n\n    /**\n     * @dev Returns the largest of two signed numbers.\n     */\n    function max(int256 a, int256 b) internal pure returns (int256) {\n        return ternary(a > b, a, b);\n    }\n\n    /**\n     * @dev Returns the smallest of two signed numbers.\n     */\n    function min(int256 a, int256 b) internal pure returns (int256) {\n        return ternary(a < b, a, b);\n    }\n\n    /**\n     * @dev Returns the average of two signed numbers without overflow.\n     * The result is rounded towards zero.\n     */\n    function average(int256 a, int256 b) internal pure returns (int256) {\n        // Formula from the book \"Hacker's Delight\"\n        int256 x = (a & b) + ((a ^ b) >> 1);\n        return x + (int256(uint256(x) >> 255) & (a ^ b));\n    }\n\n    /**\n     * @dev Returns the absolute unsigned value of a signed value.\n     */\n    function abs(int256 n) internal pure returns (uint256) {\n        unchecked {\n            // Formula from the \"Bit Twiddling Hacks\" by Sean Eron Anderson.\n            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,\n            // taking advantage of the most significant (or \"sign\" bit) in two's complement representation.\n            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,\n            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).\n            int256 mask = n >> 255;\n\n            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.\n            return uint256((n + mask) ^ mask);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/ECDSA.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.\n *\n * These functions can be used to verify that a message was signed by the holder\n * of the private keys of a given address.\n */\nlibrary ECDSA {\n    enum RecoverError {\n        NoError,\n        InvalidSignature,\n        InvalidSignatureLength,\n        InvalidSignatureS\n    }\n\n    /**\n     * @dev The signature is invalid.\n     */\n    error ECDSAInvalidSignature();\n\n    /**\n     * @dev The signature has an invalid length.\n     */\n    error ECDSAInvalidSignatureLength(uint256 length);\n\n    /**\n     * @dev The signature has an S value that is in the upper half order.\n     */\n    error ECDSAInvalidSignatureS(bytes32 s);\n\n    /**\n     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not\n     * return address(0) without also returning an error description. Errors are documented using an enum (error type)\n     * and a bytes32 providing additional information about the error.\n     *\n     * If no error is returned, then the address can be used for verification purposes.\n     *\n     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:\n     * this function rejects them by requiring the `s` value to be in the lower\n     * half order, and the `v` value to be either 27 or 28.\n     *\n     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction\n     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash\n     * invalidation or nonces for replay protection.\n     *\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\n     * verification to be secure: it is possible to craft signatures that\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\n     * this is by receiving a hash of the original message (which may otherwise\n     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.\n     *\n     * Documentation for signature generation:\n     *\n     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]\n     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]\n     */\n    function tryRecover(\n        bytes32 hash,\n        bytes memory signature\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        if (signature.length == 65) {\n            bytes32 r;\n            bytes32 s;\n            uint8 v;\n            // ecrecover takes the signature parameters, and the only way to get them\n            // currently is to use assembly.\n            assembly (\"memory-safe\") {\n                r := mload(add(signature, 0x20))\n                s := mload(add(signature, 0x40))\n                v := byte(0, mload(add(signature, 0x60)))\n            }\n            return tryRecover(hash, v, r, s);\n        } else {\n            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));\n        }\n    }\n\n    /**\n     * @dev Variant of {tryRecover} that takes a signature in calldata\n     */\n    function tryRecoverCalldata(\n        bytes32 hash,\n        bytes calldata signature\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        if (signature.length == 65) {\n            bytes32 r;\n            bytes32 s;\n            uint8 v;\n            // ecrecover takes the signature parameters, calldata slices would work here, but are\n            // significantly more expensive (length check) than using calldataload in assembly.\n            assembly (\"memory-safe\") {\n                r := calldataload(signature.offset)\n                s := calldataload(add(signature.offset, 0x20))\n                v := byte(0, calldataload(add(signature.offset, 0x40)))\n            }\n            return tryRecover(hash, v, r, s);\n        } else {\n            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));\n        }\n    }\n\n    /**\n     * @dev Returns the address that signed a hashed message (`hash`) with\n     * `signature`. This address can then be used for verification purposes.\n     *\n     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:\n     * this function rejects them by requiring the `s` value to be in the lower\n     * half order, and the `v` value to be either 27 or 28.\n     *\n     * NOTE: This function only supports 65-byte signatures. ERC-2098 short signatures are rejected. This restriction\n     * is DEPRECATED and will be removed in v6.0. Developers SHOULD NOT use signatures as unique identifiers; use hash\n     * invalidation or nonces for replay protection.\n     *\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\n     * verification to be secure: it is possible to craft signatures that\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\n     * this is by receiving a hash of the original message (which may otherwise\n     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.\n     */\n    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Variant of {recover} that takes a signature in calldata\n     */\n    function recoverCalldata(bytes32 hash, bytes calldata signature) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecoverCalldata(hash, signature);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.\n     *\n     * See https://eips.ethereum.org/EIPS/eip-2098[ERC-2098 short signatures]\n     */\n    function tryRecover(\n        bytes32 hash,\n        bytes32 r,\n        bytes32 vs\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        unchecked {\n            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);\n            // We do not check for an overflow here since the shift operation results in 0 or 1.\n            uint8 v = uint8((uint256(vs) >> 255) + 27);\n            return tryRecover(hash, v, r, s);\n        }\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `r` and `vs` short-signature fields separately.\n     */\n    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     */\n    function tryRecover(\n        bytes32 hash,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {\n        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature\n        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines\n        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most\n        // signatures from current libraries generate a unique signature with an s-value in the lower half order.\n        //\n        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value\n        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or\n        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept\n        // these malleable signatures as well.\n        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {\n            return (address(0), RecoverError.InvalidSignatureS, s);\n        }\n\n        // If the signature is valid (and not malleable), return the signer address\n        address signer = ecrecover(hash, v, r, s);\n        if (signer == address(0)) {\n            return (address(0), RecoverError.InvalidSignature, bytes32(0));\n        }\n\n        return (signer, RecoverError.NoError, bytes32(0));\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     */\n    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {\n        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);\n        _throwError(error, errorArg);\n        return recovered;\n    }\n\n    /**\n     * @dev Parse a signature into its `v`, `r` and `s` components. Supports 65-byte and 64-byte (ERC-2098)\n     * formats. Returns (0,0,0) for invalid signatures.\n     *\n     * For 64-byte signatures, `v` is automatically normalized to 27 or 28.\n     * For 65-byte signatures, `v` is returned as-is and MUST already be 27 or 28 for use with ecrecover.\n     *\n     * Consider validating the result before use, or use {tryRecover}/{recover} which perform full validation.\n     */\n    function parse(bytes memory signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {\n        assembly (\"memory-safe\") {\n            // Check the signature length\n            switch mload(signature)\n            // - case 65: r,s,v signature (standard)\n            case 65 {\n                r := mload(add(signature, 0x20))\n                s := mload(add(signature, 0x40))\n                v := byte(0, mload(add(signature, 0x60)))\n            }\n            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)\n            case 64 {\n                let vs := mload(add(signature, 0x40))\n                r := mload(add(signature, 0x20))\n                s := and(vs, shr(1, not(0)))\n                v := add(shr(255, vs), 27)\n            }\n            default {\n                r := 0\n                s := 0\n                v := 0\n            }\n        }\n    }\n\n    /**\n     * @dev Variant of {parse} that takes a signature in calldata\n     */\n    function parseCalldata(bytes calldata signature) internal pure returns (uint8 v, bytes32 r, bytes32 s) {\n        assembly (\"memory-safe\") {\n            // Check the signature length\n            switch signature.length\n            // - case 65: r,s,v signature (standard)\n            case 65 {\n                r := calldataload(signature.offset)\n                s := calldataload(add(signature.offset, 0x20))\n                v := byte(0, calldataload(add(signature.offset, 0x40)))\n            }\n            // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098)\n            case 64 {\n                let vs := calldataload(add(signature.offset, 0x20))\n                r := calldataload(signature.offset)\n                s := and(vs, shr(1, not(0)))\n                v := add(shr(255, vs), 27)\n            }\n            default {\n                r := 0\n                s := 0\n                v := 0\n            }\n        }\n    }\n\n    /**\n     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.\n     */\n    function _throwError(RecoverError error, bytes32 errorArg) private pure {\n        if (error == RecoverError.NoError) {\n            return; // no error: do nothing\n        } else if (error == RecoverError.InvalidSignature) {\n            revert ECDSAInvalidSignature();\n        } else if (error == RecoverError.InvalidSignatureLength) {\n            revert ECDSAInvalidSignatureLength(uint256(errorArg));\n        } else if (error == RecoverError.InvalidSignatureS) {\n            revert ECDSAInvalidSignatureS(errorArg);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (interfaces/draft-IERC6093.sol)\n\npragma solidity >=0.8.4;\n\n/**\n * @dev Standard ERC-20 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.\n */\ninterface IERC20Errors {\n    /**\n     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param balance Current balance for the interacting account.\n     * @param needed Minimum amount required to perform a transfer.\n     */\n    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC20InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC20InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.\n     * @param spender Address that may be allowed to operate on tokens without being their owner.\n     * @param allowance Amount of tokens a `spender` is allowed to operate with.\n     * @param needed Minimum amount required to perform a transfer.\n     */\n    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC20InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.\n     * @param spender Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC20InvalidSpender(address spender);\n}\n\n/**\n * @dev Standard ERC-721 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.\n */\ninterface IERC721Errors {\n    /**\n     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-721.\n     * Used in balance queries.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC721InvalidOwner(address owner);\n\n    /**\n     * @dev Indicates a `tokenId` whose `owner` is the zero address.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC721NonexistentToken(uint256 tokenId);\n\n    /**\n     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param tokenId Identifier number of a token.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC721InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC721InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC721InsufficientApproval(address operator, uint256 tokenId);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC721InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC721InvalidOperator(address operator);\n}\n\n/**\n * @dev Standard ERC-1155 Errors\n * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.\n */\ninterface IERC1155Errors {\n    /**\n     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     * @param balance Current balance for the interacting account.\n     * @param needed Minimum amount required to perform a transfer.\n     * @param tokenId Identifier number of a token.\n     */\n    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);\n\n    /**\n     * @dev Indicates a failure with the token `sender`. Used in transfers.\n     * @param sender Address whose tokens are being transferred.\n     */\n    error ERC1155InvalidSender(address sender);\n\n    /**\n     * @dev Indicates a failure with the token `receiver`. Used in transfers.\n     * @param receiver Address to which tokens are being transferred.\n     */\n    error ERC1155InvalidReceiver(address receiver);\n\n    /**\n     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     * @param owner Address of the current owner of a token.\n     */\n    error ERC1155MissingApprovalForAll(address operator, address owner);\n\n    /**\n     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.\n     * @param approver Address initiating an approval operation.\n     */\n    error ERC1155InvalidApprover(address approver);\n\n    /**\n     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.\n     * @param operator Address that may be allowed to operate on tokens without being their owner.\n     */\n    error ERC1155InvalidOperator(address operator);\n\n    /**\n     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.\n     * Used in batch transfers.\n     * @param idsLength Length of the array of token identifiers\n     * @param valuesLength Length of the array of token amounts\n     */\n    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);\n}\n"},"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.3.0) (proxy/utils/Initializable.sol)\n\npragma solidity ^0.8.20;\n\n/**\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\n *\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\n * reused. This mechanism prevents re-execution of each \"step\" but allows the creation of new initialization steps in\n * case an upgrade adds a module that needs to be initialized.\n *\n * For example:\n *\n * [.hljs-theme-light.nopadding]\n * ```solidity\n * contract MyToken is ERC20Upgradeable {\n *     function initialize() initializer public {\n *         __ERC20_init(\"MyToken\", \"MTK\");\n *     }\n * }\n *\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\n *     function initializeV2() reinitializer(2) public {\n *         __ERC20Permit_init(\"MyToken\");\n *     }\n * }\n * ```\n *\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\n *\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\n *\n * [CAUTION]\n * ====\n * Avoid leaving a contract uninitialized.\n *\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\n *\n * [.hljs-theme-light.nopadding]\n * ```\n * /// @custom:oz-upgrades-unsafe-allow constructor\n * constructor() {\n *     _disableInitializers();\n * }\n * ```\n * ====\n */\nabstract contract Initializable {\n    /**\n     * @dev Storage of the initializable contract.\n     *\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\n     * when using with upgradeable contracts.\n     *\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\n     */\n    struct InitializableStorage {\n        /**\n         * @dev Indicates that the contract has been initialized.\n         */\n        uint64 _initialized;\n        /**\n         * @dev Indicates that the contract is in the process of being initialized.\n         */\n        bool _initializing;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.Initializable\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;\n\n    /**\n     * @dev The contract is already initialized.\n     */\n    error InvalidInitialization();\n\n    /**\n     * @dev The contract is not initializing.\n     */\n    error NotInitializing();\n\n    /**\n     * @dev Triggered when the contract has been initialized or reinitialized.\n     */\n    event Initialized(uint64 version);\n\n    /**\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\n     * `onlyInitializing` functions can be used to initialize parent contracts.\n     *\n     * Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any\n     * number of times. This behavior in the constructor can be useful during testing and is not expected to be used in\n     * production.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier initializer() {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        // Cache values to avoid duplicated sloads\n        bool isTopLevelCall = !$._initializing;\n        uint64 initialized = $._initialized;\n\n        // Allowed calls:\n        // - initialSetup: the contract is not in the initializing state and no previous version was\n        //                 initialized\n        // - construction: the contract is initialized at version 1 (no reinitialization) and the\n        //                 current contract is just being deployed\n        bool initialSetup = initialized == 0 && isTopLevelCall;\n        bool construction = initialized == 1 && address(this).code.length == 0;\n\n        if (!initialSetup && !construction) {\n            revert InvalidInitialization();\n        }\n        $._initialized = 1;\n        if (isTopLevelCall) {\n            $._initializing = true;\n        }\n        _;\n        if (isTopLevelCall) {\n            $._initializing = false;\n            emit Initialized(1);\n        }\n    }\n\n    /**\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\n     * used to initialize parent contracts.\n     *\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\n     * are added through upgrades and that require initialization.\n     *\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\n     *\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\n     * a contract, executing them in the right order is up to the developer or operator.\n     *\n     * WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier reinitializer(uint64 version) {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        if ($._initializing || $._initialized >= version) {\n            revert InvalidInitialization();\n        }\n        $._initialized = version;\n        $._initializing = true;\n        _;\n        $._initializing = false;\n        emit Initialized(version);\n    }\n\n    /**\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\n     */\n    modifier onlyInitializing() {\n        _checkInitializing();\n        _;\n    }\n\n    /**\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\n     */\n    function _checkInitializing() internal view virtual {\n        if (!_isInitializing()) {\n            revert NotInitializing();\n        }\n    }\n\n    /**\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\n     * through proxies.\n     *\n     * Emits an {Initialized} event the first time it is successfully executed.\n     */\n    function _disableInitializers() internal virtual {\n        // solhint-disable-next-line var-name-mixedcase\n        InitializableStorage storage $ = _getInitializableStorage();\n\n        if ($._initializing) {\n            revert InvalidInitialization();\n        }\n        if ($._initialized != type(uint64).max) {\n            $._initialized = type(uint64).max;\n            emit Initialized(type(uint64).max);\n        }\n    }\n\n    /**\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\n     */\n    function _getInitializedVersion() internal view returns (uint64) {\n        return _getInitializableStorage()._initialized;\n    }\n\n    /**\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\n     */\n    function _isInitializing() internal view returns (bool) {\n        return _getInitializableStorage()._initializing;\n    }\n\n    /**\n     * @dev Pointer to storage slot. Allows integrators to override it with a custom storage location.\n     *\n     * NOTE: Consider following the ERC-7201 formula to derive storage locations.\n     */\n    function _initializableStorageSlot() internal pure virtual returns (bytes32) {\n        return INITIALIZABLE_STORAGE;\n    }\n\n    /**\n     * @dev Returns a pointer to the storage namespace.\n     */\n    // solhint-disable-next-line var-name-mixedcase\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\n        bytes32 slot = _initializableStorageSlot();\n        assembly {\n            $.slot := slot\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/IERC165.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-165 standard, as defined in the\n * https://eips.ethereum.org/EIPS/eip-165[ERC].\n *\n * Implementers can declare support of contract interfaces, which can then be\n * queried by others ({ERC165Checker}).\n *\n * For an implementation, see {ERC165}.\n */\ninterface IERC165 {\n    /**\n     * @dev Returns true if this contract implements the interface defined by\n     * `interfaceId`. See the corresponding\n     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]\n     * to learn more about how these ids are created.\n     *\n     * This function call must use less than 30 000 gas.\n     */\n    function supportsInterface(bytes4 interfaceId) external view returns (bool);\n}\n"},"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/structs/EnumerableSet.sol)\n// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.\n\npragma solidity ^0.8.24;\n\nimport {Arrays} from \"../Arrays.sol\";\nimport {Math} from \"../math/Math.sol\";\n\n/**\n * @dev Library for managing\n * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive\n * types.\n *\n * Sets have the following properties:\n *\n * - Elements are added, removed, and checked for existence in constant time\n * (O(1)).\n * - Elements are enumerated in O(n). No guarantees are made on the ordering.\n * - Set can be cleared (all elements removed) in O(n).\n *\n * ```solidity\n * contract Example {\n *     // Add the library methods\n *     using EnumerableSet for EnumerableSet.AddressSet;\n *\n *     // Declare a set state variable\n *     EnumerableSet.AddressSet private mySet;\n * }\n * ```\n *\n * The following types are supported:\n *\n * - `bytes32` (`Bytes32Set`) since v3.3.0\n * - `address` (`AddressSet`) since v3.3.0\n * - `uint256` (`UintSet`) since v3.3.0\n * - `string` (`StringSet`) since v5.4.0\n * - `bytes` (`BytesSet`) since v5.4.0\n * - `bytes4` (`Bytes4Set`) since v5.6.0\n *\n * [WARNING]\n * ====\n * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure\n * unusable.\n * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.\n *\n * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an\n * array of EnumerableSet.\n * ====\n */\nlibrary EnumerableSet {\n    // To implement this library for multiple types with as little code\n    // repetition as possible, we write it in terms of a generic Set type with\n    // bytes32 values.\n    // The Set implementation uses private functions, and user-facing\n    // implementations (such as AddressSet) are just wrappers around the\n    // underlying Set.\n    // This means that we can only create new EnumerableSets for types that fit\n    // in bytes32.\n\n    struct Set {\n        // Storage of set values\n        bytes32[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(bytes32 value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function _add(Set storage set, bytes32 value) private returns (bool) {\n        if (!_contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function _remove(Set storage set, bytes32 value) private returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                bytes32 lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: This function has an unbounded cost that scales with set size. Developers should keep in mind that\n     * using it may render the function uncallable if the set grows to the point where clearing it consumes too much\n     * gas to fit in a block.\n     */\n    function _clear(Set storage set) private {\n        uint256 len = _length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function _contains(Set storage set, bytes32 value) private view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function _length(Set storage set) private view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function _at(Set storage set, uint256 index) private view returns (bytes32) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function _values(Set storage set) private view returns (bytes32[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function _values(Set storage set, uint256 start, uint256 end) private view returns (bytes32[] memory) {\n        unchecked {\n            end = Math.min(end, _length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            bytes32[] memory result = new bytes32[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n\n    // Bytes32Set\n\n    struct Bytes32Set {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n        return _add(set._inner, value);\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n        return _remove(set._inner, value);\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(Bytes32Set storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {\n        return _contains(set._inner, value);\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(Bytes32Set storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {\n        return _at(set._inner, index);\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        bytes32[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes32Set storage set, uint256 start, uint256 end) internal view returns (bytes32[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        bytes32[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // Bytes4Set\n\n    struct Bytes4Set {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(Bytes4Set storage set, bytes4 value) internal returns (bool) {\n        return _add(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(Bytes4Set storage set, bytes4 value) internal returns (bool) {\n        return _remove(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(Bytes4Set storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(Bytes4Set storage set, bytes4 value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(Bytes4Set storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(Bytes4Set storage set, uint256 index) internal view returns (bytes4) {\n        return bytes4(_at(set._inner, index));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes4Set storage set) internal view returns (bytes4[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        bytes4[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(Bytes4Set storage set, uint256 start, uint256 end) internal view returns (bytes4[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        bytes4[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // AddressSet\n\n    struct AddressSet {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(AddressSet storage set, address value) internal returns (bool) {\n        return _add(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(AddressSet storage set, address value) internal returns (bool) {\n        return _remove(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(AddressSet storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(AddressSet storage set, address value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(uint256(uint160(value))));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(AddressSet storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(AddressSet storage set, uint256 index) internal view returns (address) {\n        return address(uint160(uint256(_at(set._inner, index))));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(AddressSet storage set) internal view returns (address[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        address[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(AddressSet storage set, uint256 start, uint256 end) internal view returns (address[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        address[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    // UintSet\n\n    struct UintSet {\n        Set _inner;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(UintSet storage set, uint256 value) internal returns (bool) {\n        return _add(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(UintSet storage set, uint256 value) internal returns (bool) {\n        return _remove(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(UintSet storage set) internal {\n        _clear(set._inner);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(UintSet storage set, uint256 value) internal view returns (bool) {\n        return _contains(set._inner, bytes32(value));\n    }\n\n    /**\n     * @dev Returns the number of values in the set. O(1).\n     */\n    function length(UintSet storage set) internal view returns (uint256) {\n        return _length(set._inner);\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(UintSet storage set, uint256 index) internal view returns (uint256) {\n        return uint256(_at(set._inner, index));\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(UintSet storage set) internal view returns (uint256[] memory) {\n        bytes32[] memory store = _values(set._inner);\n        uint256[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(UintSet storage set, uint256 start, uint256 end) internal view returns (uint256[] memory) {\n        bytes32[] memory store = _values(set._inner, start, end);\n        uint256[] memory result;\n\n        assembly (\"memory-safe\") {\n            result := store\n        }\n\n        return result;\n    }\n\n    struct StringSet {\n        // Storage of set values\n        string[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(string value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(StringSet storage set, string memory value) internal returns (bool) {\n        if (!contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(StringSet storage set, string memory value) internal returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                string memory lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(StringSet storage set) internal {\n        uint256 len = length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(StringSet storage set, string memory value) internal view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function length(StringSet storage set) internal view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(StringSet storage set, uint256 index) internal view returns (string memory) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(StringSet storage set) internal view returns (string[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(StringSet storage set, uint256 start, uint256 end) internal view returns (string[] memory) {\n        unchecked {\n            end = Math.min(end, length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            string[] memory result = new string[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n\n    struct BytesSet {\n        // Storage of set values\n        bytes[] _values;\n        // Position is the index of the value in the `values` array plus 1.\n        // Position 0 is used to mean a value is not in the set.\n        mapping(bytes value => uint256) _positions;\n    }\n\n    /**\n     * @dev Add a value to a set. O(1).\n     *\n     * Returns true if the value was added to the set, that is if it was not\n     * already present.\n     */\n    function add(BytesSet storage set, bytes memory value) internal returns (bool) {\n        if (!contains(set, value)) {\n            set._values.push(value);\n            // The value is stored at length-1, but we add 1 to all indexes\n            // and use 0 as a sentinel value\n            set._positions[value] = set._values.length;\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes a value from a set. O(1).\n     *\n     * Returns true if the value was removed from the set, that is if it was\n     * present.\n     */\n    function remove(BytesSet storage set, bytes memory value) internal returns (bool) {\n        // We cache the value's position to prevent multiple reads from the same storage slot\n        uint256 position = set._positions[value];\n\n        if (position != 0) {\n            // Equivalent to contains(set, value)\n            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n            // the array, and then remove the last element (sometimes called as 'swap and pop').\n            // This modifies the order of the array, as noted in {at}.\n\n            uint256 valueIndex = position - 1;\n            uint256 lastIndex = set._values.length - 1;\n\n            if (valueIndex != lastIndex) {\n                bytes memory lastValue = set._values[lastIndex];\n\n                // Move the lastValue to the index where the value to delete is\n                set._values[valueIndex] = lastValue;\n                // Update the tracked position of the lastValue (that was just moved)\n                set._positions[lastValue] = position;\n            }\n\n            // Delete the slot where the moved value was stored\n            set._values.pop();\n\n            // Delete the tracked position for the deleted slot\n            delete set._positions[value];\n\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Removes all the values from a set. O(n).\n     *\n     * WARNING: Developers should keep in mind that this function has an unbounded cost and using it may render the\n     * function uncallable if the set grows to the point where clearing it consumes too much gas to fit in a block.\n     */\n    function clear(BytesSet storage set) internal {\n        uint256 len = length(set);\n        for (uint256 i = 0; i < len; ++i) {\n            delete set._positions[set._values[i]];\n        }\n        Arrays.unsafeSetLength(set._values, 0);\n    }\n\n    /**\n     * @dev Returns true if the value is in the set. O(1).\n     */\n    function contains(BytesSet storage set, bytes memory value) internal view returns (bool) {\n        return set._positions[value] != 0;\n    }\n\n    /**\n     * @dev Returns the number of values on the set. O(1).\n     */\n    function length(BytesSet storage set) internal view returns (uint256) {\n        return set._values.length;\n    }\n\n    /**\n     * @dev Returns the value stored at position `index` in the set. O(1).\n     *\n     * Note that there are no guarantees on the ordering of values inside the\n     * array, and it may change when more values are added or removed.\n     *\n     * Requirements:\n     *\n     * - `index` must be strictly less than {length}.\n     */\n    function at(BytesSet storage set, uint256 index) internal view returns (bytes memory) {\n        return set._values[index];\n    }\n\n    /**\n     * @dev Return the entire set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(BytesSet storage set) internal view returns (bytes[] memory) {\n        return set._values;\n    }\n\n    /**\n     * @dev Return a slice of the set in an array\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function values(BytesSet storage set, uint256 start, uint256 end) internal view returns (bytes[] memory) {\n        unchecked {\n            end = Math.min(end, length(set));\n            start = Math.min(start, end);\n\n            uint256 len = end - start;\n            bytes[] memory result = new bytes[](len);\n            for (uint256 i = 0; i < len; ++i) {\n                result[i] = Arrays.unsafeAccess(set._values, start + i).value;\n            }\n            return result;\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.0) (utils/Nonces.sol)\npragma solidity ^0.8.20;\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Provides tracking nonces for addresses. Nonces will only increment.\n */\nabstract contract NoncesUpgradeable is Initializable {\n    /**\n     * @dev The nonce used for an `account` is not the expected current nonce.\n     */\n    error InvalidAccountNonce(address account, uint256 currentNonce);\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.Nonces\n    struct NoncesStorage {\n        mapping(address account => uint256) _nonces;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.Nonces\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant NoncesStorageLocation = 0x5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00;\n\n    function _getNoncesStorage() private pure returns (NoncesStorage storage $) {\n        assembly {\n            $.slot := NoncesStorageLocation\n        }\n    }\n\n    function __Nonces_init() internal onlyInitializing {\n    }\n\n    function __Nonces_init_unchained() internal onlyInitializing {\n    }\n    /**\n     * @dev Returns the next unused nonce for an address.\n     */\n    function nonces(address owner) public view virtual returns (uint256) {\n        NoncesStorage storage $ = _getNoncesStorage();\n        return $._nonces[owner];\n    }\n\n    /**\n     * @dev Consumes a nonce.\n     *\n     * Returns the current value and increments nonce.\n     */\n    function _useNonce(address owner) internal virtual returns (uint256) {\n        NoncesStorage storage $ = _getNoncesStorage();\n        // For each account, the nonce has an initial value of 0, can only be incremented by one, and cannot be\n        // decremented or reset. This guarantees that the nonce never overflows.\n        unchecked {\n            // It is important to do x++ and not ++x here.\n            return $._nonces[owner]++;\n        }\n    }\n\n    /**\n     * @dev Same as {_useNonce} but checking that `nonce` is the next valid for `owner`.\n     */\n    function _useCheckedNonce(address owner, uint256 nonce) internal virtual {\n        uint256 current = _useNonce(owner);\n        if (nonce != current) {\n            revert InvalidAccountNonce(owner, current);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/extensions/IERC20Permit.sol)\n\npragma solidity >=0.4.16;\n\n/**\n * @dev Interface of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].\n *\n * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n *\n * ==== Security Considerations\n *\n * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature\n * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be\n * considered as an intention to spend the allowance in any specific way. The second is that because permits have\n * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should\n * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be\n * generally recommended is:\n *\n * ```solidity\n * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {\n *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}\n *     doThing(..., value);\n * }\n *\n * function doThing(..., uint256 value) public {\n *     token.safeTransferFrom(msg.sender, address(this), value);\n *     ...\n * }\n * ```\n *\n * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of\n * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also\n * {SafeERC20-safeTransferFrom}).\n *\n * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so\n * contracts should have entry points that don't rely on permit.\n */\ninterface IERC20Permit {\n    /**\n     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,\n     * given ``owner``'s signed approval.\n     *\n     * IMPORTANT: The same issues {IERC20-approve} has related to transaction\n     * ordering also applies here.\n     *\n     * Emits an {Approval} event.\n     *\n     * Requirements:\n     *\n     * - `spender` cannot be the zero address.\n     * - `deadline` must be a timestamp in the future.\n     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`\n     * over the EIP712-formatted function arguments.\n     * - the signature must use ``owner``'s current nonce (see {nonces}).\n     *\n     * For more information on the signature format, see the\n     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP\n     * section].\n     *\n     * CAUTION: See Security Considerations above.\n     */\n    function permit(\n        address owner,\n        address spender,\n        uint256 value,\n        uint256 deadline,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) external;\n\n    /**\n     * @dev Returns the current nonce for `owner`. This value must be\n     * included whenever a signature is generated for {permit}.\n     *\n     * Every successful call to {permit} increases ``owner``'s nonce by one. This\n     * prevents a signature from being used multiple times.\n     */\n    function nonces(address owner) external view returns (uint256);\n\n    /**\n     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function DOMAIN_SEPARATOR() external view returns (bytes32);\n}\n"},"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/MessageHashUtils.sol)\n\npragma solidity ^0.8.24;\n\nimport {Strings} from \"../Strings.sol\";\n\n/**\n * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.\n *\n * The library provides methods for generating a hash of a message that conforms to the\n * https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]\n * specifications.\n */\nlibrary MessageHashUtils {\n    error ERC5267ExtensionsNotSupported();\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x45` (`personal_sign` messages).\n     *\n     * The digest is calculated by prefixing a bytes32 `messageHash` with\n     * `\"\\x19Ethereum Signed Message:\\n32\"` and hashing the result. It corresponds with the\n     * hash signed when using the https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_sign[`eth_sign`] JSON-RPC method.\n     *\n     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with\n     * keccak256, although any bytes32 value can be safely used because the final digest will\n     * be re-hashed.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, \"\\x19Ethereum Signed Message:\\n32\") // 32 is the bytes-length of messageHash\n            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix\n            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)\n        }\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x45` (`personal_sign` messages).\n     *\n     * The digest is calculated by prefixing an arbitrary `message` with\n     * `\"\\x19Ethereum Signed Message:\\n\" + len(message)` and hashing the result. It corresponds with the\n     * hash signed when using the https://ethereum.org/en/developers/docs/apis/json-rpc/#eth_sign[`eth_sign`] JSON-RPC method.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {\n        return\n            keccak256(bytes.concat(\"\\x19Ethereum Signed Message:\\n\", bytes(Strings.toString(message.length)), message));\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an ERC-191 signed data with version\n     * `0x00` (data with intended validator).\n     *\n     * The digest is calculated by prefixing an arbitrary `data` with `\"\\x19\\x00\"` and the intended\n     * `validator` address. Then hashing the result.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {\n        return keccak256(abi.encodePacked(hex\"19_00\", validator, data));\n    }\n\n    /**\n     * @dev Variant of {toDataWithIntendedValidatorHash-address-bytes} optimized for cases where `data` is a bytes32.\n     */\n    function toDataWithIntendedValidatorHash(\n        address validator,\n        bytes32 messageHash\n    ) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            mstore(0x00, hex\"19_00\")\n            mstore(0x02, shl(96, validator))\n            mstore(0x16, messageHash)\n            digest := keccak256(0x00, 0x36)\n        }\n    }\n\n    /**\n     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).\n     *\n     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with\n     * `\\x19\\x01` and hashing the result. It corresponds to the hash signed by the\n     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.\n     *\n     * See {ECDSA-recover}.\n     */\n    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {\n        assembly (\"memory-safe\") {\n            let ptr := mload(0x40)\n            mstore(ptr, hex\"19_01\")\n            mstore(add(ptr, 0x02), domainSeparator)\n            mstore(add(ptr, 0x22), structHash)\n            digest := keccak256(ptr, 0x42)\n        }\n    }\n\n    /**\n     * @dev Returns the EIP-712 domain separator constructed from an `eip712Domain`. See {IERC5267-eip712Domain}\n     *\n     * This function dynamically constructs the domain separator based on which fields are present in the\n     * `fields` parameter. It contains flags that indicate which domain fields are present:\n     *\n     * * Bit 0 (0x01): name\n     * * Bit 1 (0x02): version\n     * * Bit 2 (0x04): chainId\n     * * Bit 3 (0x08): verifyingContract\n     * * Bit 4 (0x10): salt\n     *\n     * Arguments that correspond to fields which are not present in `fields` are ignored. For example, if `fields` is\n     * `0x0f` (`0b01111`), then the `salt` parameter is ignored.\n     */\n    function toDomainSeparator(\n        bytes1 fields,\n        string memory name,\n        string memory version,\n        uint256 chainId,\n        address verifyingContract,\n        bytes32 salt\n    ) internal pure returns (bytes32 hash) {\n        return\n            toDomainSeparator(\n                fields,\n                keccak256(bytes(name)),\n                keccak256(bytes(version)),\n                chainId,\n                verifyingContract,\n                salt\n            );\n    }\n\n    /// @dev Variant of {toDomainSeparator-bytes1-string-string-uint256-address-bytes32} that uses hashed name and version.\n    function toDomainSeparator(\n        bytes1 fields,\n        bytes32 nameHash,\n        bytes32 versionHash,\n        uint256 chainId,\n        address verifyingContract,\n        bytes32 salt\n    ) internal pure returns (bytes32 hash) {\n        bytes32 domainTypeHash = toDomainTypeHash(fields);\n\n        assembly (\"memory-safe\") {\n            // align fields to the right for easy processing\n            fields := shr(248, fields)\n\n            // FMP used as scratch space\n            let fmp := mload(0x40)\n            mstore(fmp, domainTypeHash)\n\n            let ptr := add(fmp, 0x20)\n            if and(fields, 0x01) {\n                mstore(ptr, nameHash)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x02) {\n                mstore(ptr, versionHash)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x04) {\n                mstore(ptr, chainId)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x08) {\n                mstore(ptr, verifyingContract)\n                ptr := add(ptr, 0x20)\n            }\n            if and(fields, 0x10) {\n                mstore(ptr, salt)\n                ptr := add(ptr, 0x20)\n            }\n\n            hash := keccak256(fmp, sub(ptr, fmp))\n        }\n    }\n\n    /// @dev Builds an EIP-712 domain type hash depending on the `fields` provided, following https://eips.ethereum.org/EIPS/eip-5267[ERC-5267]\n    function toDomainTypeHash(bytes1 fields) internal pure returns (bytes32 hash) {\n        if (fields & 0x20 == 0x20) revert ERC5267ExtensionsNotSupported();\n\n        assembly (\"memory-safe\") {\n            // align fields to the right for easy processing\n            fields := shr(248, fields)\n\n            // FMP used as scratch space\n            let fmp := mload(0x40)\n            mstore(fmp, \"EIP712Domain(\")\n\n            let ptr := add(fmp, 0x0d)\n            // name field\n            if and(fields, 0x01) {\n                mstore(ptr, \"string name,\")\n                ptr := add(ptr, 0x0c)\n            }\n            // version field\n            if and(fields, 0x02) {\n                mstore(ptr, \"string version,\")\n                ptr := add(ptr, 0x0f)\n            }\n            // chainId field\n            if and(fields, 0x04) {\n                mstore(ptr, \"uint256 chainId,\")\n                ptr := add(ptr, 0x10)\n            }\n            // verifyingContract field\n            if and(fields, 0x08) {\n                mstore(ptr, \"address verifyingContract,\")\n                ptr := add(ptr, 0x1a)\n            }\n            // salt field\n            if and(fields, 0x10) {\n                mstore(ptr, \"bytes32 salt,\")\n                ptr := add(ptr, 0x0d)\n            }\n            // if any field is enabled, remove the trailing comma\n            ptr := sub(ptr, iszero(iszero(and(fields, 0x1f))))\n            // add the closing brace\n            mstore8(ptr, 0x29) // add closing brace\n            ptr := add(ptr, 1)\n\n            hash := keccak256(fmp, sub(ptr, fmp))\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)\n\npragma solidity ^0.8.20;\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Provides information about the current execution context, including the\n * sender of the transaction and its data. While these are generally available\n * via msg.sender and msg.data, they should not be accessed in such a direct\n * manner, since when dealing with meta-transactions the account sending and\n * paying for execution may not be the actual sender (as far as an application\n * is concerned).\n *\n * This contract is only required for intermediate, library-like contracts.\n */\nabstract contract ContextUpgradeable is Initializable {\n    function __Context_init() internal onlyInitializing {\n    }\n\n    function __Context_init_unchained() internal onlyInitializing {\n    }\n    function _msgSender() internal view virtual returns (address) {\n        return msg.sender;\n    }\n\n    function _msgData() internal view virtual returns (bytes calldata) {\n        return msg.data;\n    }\n\n    function _contextSuffixLength() internal view virtual returns (uint256) {\n        return 0;\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol":{"content":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.20;\n\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n"},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/extensions/IERC20Metadata.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20} from \"../IERC20.sol\";\n\n/**\n * @dev Interface for the optional metadata functions from the ERC-20 standard.\n */\ninterface IERC20Metadata is IERC20 {\n    /**\n     * @dev Returns the name of the token.\n     */\n    function name() external view returns (string memory);\n\n    /**\n     * @dev Returns the symbol of the token.\n     */\n    function symbol() external view returns (string memory);\n\n    /**\n     * @dev Returns the decimals places of the token.\n     */\n    function decimals() external view returns (uint8);\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IPause\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `Pause` contract.\n */\ninterface IPause {\n    /**\n     * @notice Emitted when the pause status is set.\n     * @param paused Pause status\n     */\n    event PauseSet(bool paused);\n\n    /**\n     * @notice Thrown when attempting to perform an action while paused.\n     */\n    error Paused();\n\n    /**\n     * @notice Thrown when setting pause state is idempotent (no change).\n     * @param isPaused Whether system is paused\n     */\n    error PauseStateIdempotent(bool isPaused);\n\n    /**\n     * @notice Checks if the system is paused.\n     * @return paused Whether the system is paused\n     */\n    function isPaused() external view returns (bool paused);\n\n    /**\n     * @notice Pauses the system.\n     */\n    function pause() external;\n\n    /**\n     * @notice Unpauses the system.\n     */\n    function unpause() external;\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/ERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {IERC20Metadata} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport {ContextUpgradeable} from \"../../utils/ContextUpgradeable.sol\";\nimport {IERC20Errors} from \"@openzeppelin/contracts/interfaces/draft-IERC6093.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the {IERC20} interface.\n *\n * This implementation is agnostic to the way tokens are created. This means\n * that a supply mechanism has to be added in a derived contract using {_mint}.\n *\n * TIP: For a detailed writeup see our guide\n * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How\n * to implement supply mechanisms].\n *\n * The default value of {decimals} is 18. To change this, you should override\n * this function so it returns a different value.\n *\n * We have followed general OpenZeppelin Contracts guidelines: functions revert\n * instead returning `false` on failure. This behavior is nonetheless\n * conventional and does not conflict with the expectations of ERC-20\n * applications.\n */\nabstract contract ERC20Upgradeable is Initializable, ContextUpgradeable, IERC20, IERC20Metadata, IERC20Errors {\n    /// @custom:storage-location erc7201:openzeppelin.storage.ERC20\n    struct ERC20Storage {\n        mapping(address account => uint256) _balances;\n\n        mapping(address account => mapping(address spender => uint256)) _allowances;\n\n        uint256 _totalSupply;\n\n        string _name;\n        string _symbol;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.ERC20\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ERC20StorageLocation = 0x52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00;\n\n    function _getERC20Storage() private pure returns (ERC20Storage storage $) {\n        assembly {\n            $.slot := ERC20StorageLocation\n        }\n    }\n\n    /**\n     * @dev Sets the values for {name} and {symbol}.\n     *\n     * Both values are immutable: they can only be set once during construction.\n     */\n    function __ERC20_init(string memory name_, string memory symbol_) internal onlyInitializing {\n        __ERC20_init_unchained(name_, symbol_);\n    }\n\n    function __ERC20_init_unchained(string memory name_, string memory symbol_) internal onlyInitializing {\n        ERC20Storage storage $ = _getERC20Storage();\n        $._name = name_;\n        $._symbol = symbol_;\n    }\n\n    /**\n     * @dev Returns the name of the token.\n     */\n    function name() public view virtual returns (string memory) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._name;\n    }\n\n    /**\n     * @dev Returns the symbol of the token, usually a shorter version of the\n     * name.\n     */\n    function symbol() public view virtual returns (string memory) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._symbol;\n    }\n\n    /**\n     * @dev Returns the number of decimals used to get its user representation.\n     * For example, if `decimals` equals `2`, a balance of `505` tokens should\n     * be displayed to a user as `5.05` (`505 / 10 ** 2`).\n     *\n     * Tokens usually opt for a value of 18, imitating the relationship between\n     * Ether and Wei. This is the default value returned by this function, unless\n     * it's overridden.\n     *\n     * NOTE: This information is only used for _display_ purposes: it in\n     * no way affects any of the arithmetic of the contract, including\n     * {IERC20-balanceOf} and {IERC20-transfer}.\n     */\n    function decimals() public view virtual returns (uint8) {\n        return 18;\n    }\n\n    /// @inheritdoc IERC20\n    function totalSupply() public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._totalSupply;\n    }\n\n    /// @inheritdoc IERC20\n    function balanceOf(address account) public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._balances[account];\n    }\n\n    /**\n     * @dev See {IERC20-transfer}.\n     *\n     * Requirements:\n     *\n     * - `to` cannot be the zero address.\n     * - the caller must have a balance of at least `value`.\n     */\n    function transfer(address to, uint256 value) public virtual returns (bool) {\n        address owner = _msgSender();\n        _transfer(owner, to, value);\n        return true;\n    }\n\n    /// @inheritdoc IERC20\n    function allowance(address owner, address spender) public view virtual returns (uint256) {\n        ERC20Storage storage $ = _getERC20Storage();\n        return $._allowances[owner][spender];\n    }\n\n    /**\n     * @dev See {IERC20-approve}.\n     *\n     * NOTE: If `value` is the maximum `uint256`, the allowance is not updated on\n     * `transferFrom`. This is semantically equivalent to an infinite approval.\n     *\n     * Requirements:\n     *\n     * - `spender` cannot be the zero address.\n     */\n    function approve(address spender, uint256 value) public virtual returns (bool) {\n        address owner = _msgSender();\n        _approve(owner, spender, value);\n        return true;\n    }\n\n    /**\n     * @dev See {IERC20-transferFrom}.\n     *\n     * Skips emitting an {Approval} event indicating an allowance update. This is not\n     * required by the ERC. See {xref-ERC20-_approve-address-address-uint256-bool-}[_approve].\n     *\n     * NOTE: Does not update the allowance if the current allowance\n     * is the maximum `uint256`.\n     *\n     * Requirements:\n     *\n     * - `from` and `to` cannot be the zero address.\n     * - `from` must have a balance of at least `value`.\n     * - the caller must have allowance for ``from``'s tokens of at least\n     * `value`.\n     */\n    function transferFrom(address from, address to, uint256 value) public virtual returns (bool) {\n        address spender = _msgSender();\n        _spendAllowance(from, spender, value);\n        _transfer(from, to, value);\n        return true;\n    }\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to`.\n     *\n     * This internal function is equivalent to {transfer}, and can be used to\n     * e.g. implement automatic token fees, slashing mechanisms, etc.\n     *\n     * Emits a {Transfer} event.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead.\n     */\n    function _transfer(address from, address to, uint256 value) internal {\n        if (from == address(0)) {\n            revert ERC20InvalidSender(address(0));\n        }\n        if (to == address(0)) {\n            revert ERC20InvalidReceiver(address(0));\n        }\n        _update(from, to, value);\n    }\n\n    /**\n     * @dev Transfers a `value` amount of tokens from `from` to `to`, or alternatively mints (or burns) if `from`\n     * (or `to`) is the zero address. All customizations to transfers, mints, and burns should be done by overriding\n     * this function.\n     *\n     * Emits a {Transfer} event.\n     */\n    function _update(address from, address to, uint256 value) internal virtual {\n        ERC20Storage storage $ = _getERC20Storage();\n        if (from == address(0)) {\n            // Overflow check required: The rest of the code assumes that totalSupply never overflows\n            $._totalSupply += value;\n        } else {\n            uint256 fromBalance = $._balances[from];\n            if (fromBalance < value) {\n                revert ERC20InsufficientBalance(from, fromBalance, value);\n            }\n            unchecked {\n                // Overflow not possible: value <= fromBalance <= totalSupply.\n                $._balances[from] = fromBalance - value;\n            }\n        }\n\n        if (to == address(0)) {\n            unchecked {\n                // Overflow not possible: value <= totalSupply or value <= fromBalance <= totalSupply.\n                $._totalSupply -= value;\n            }\n        } else {\n            unchecked {\n                // Overflow not possible: balance + value is at most totalSupply, which we know fits into a uint256.\n                $._balances[to] += value;\n            }\n        }\n\n        emit Transfer(from, to, value);\n    }\n\n    /**\n     * @dev Creates a `value` amount of tokens and assigns them to `account`, by transferring it from address(0).\n     * Relies on the `_update` mechanism\n     *\n     * Emits a {Transfer} event with `from` set to the zero address.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead.\n     */\n    function _mint(address account, uint256 value) internal {\n        if (account == address(0)) {\n            revert ERC20InvalidReceiver(address(0));\n        }\n        _update(address(0), account, value);\n    }\n\n    /**\n     * @dev Destroys a `value` amount of tokens from `account`, lowering the total supply.\n     * Relies on the `_update` mechanism.\n     *\n     * Emits a {Transfer} event with `to` set to the zero address.\n     *\n     * NOTE: This function is not virtual, {_update} should be overridden instead\n     */\n    function _burn(address account, uint256 value) internal {\n        if (account == address(0)) {\n            revert ERC20InvalidSender(address(0));\n        }\n        _update(account, address(0), value);\n    }\n\n    /**\n     * @dev Sets `value` as the allowance of `spender` over the `owner`'s tokens.\n     *\n     * This internal function is equivalent to `approve`, and can be used to\n     * e.g. set automatic allowances for certain subsystems, etc.\n     *\n     * Emits an {Approval} event.\n     *\n     * Requirements:\n     *\n     * - `owner` cannot be the zero address.\n     * - `spender` cannot be the zero address.\n     *\n     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.\n     */\n    function _approve(address owner, address spender, uint256 value) internal {\n        _approve(owner, spender, value, true);\n    }\n\n    /**\n     * @dev Variant of {_approve} with an optional flag to enable or disable the {Approval} event.\n     *\n     * By default (when calling {_approve}) the flag is set to true. On the other hand, approval changes made by\n     * `_spendAllowance` during the `transferFrom` operation sets the flag to false. This saves gas by not emitting any\n     * `Approval` event during `transferFrom` operations.\n     *\n     * Anyone who wishes to continue emitting `Approval` events on the `transferFrom` operation can force the flag to\n     * true using the following override:\n     *\n     * ```solidity\n     * function _approve(address owner, address spender, uint256 value, bool) internal virtual override {\n     *     super._approve(owner, spender, value, true);\n     * }\n     * ```\n     *\n     * Requirements are the same as {_approve}.\n     */\n    function _approve(address owner, address spender, uint256 value, bool emitEvent) internal virtual {\n        ERC20Storage storage $ = _getERC20Storage();\n        if (owner == address(0)) {\n            revert ERC20InvalidApprover(address(0));\n        }\n        if (spender == address(0)) {\n            revert ERC20InvalidSpender(address(0));\n        }\n        $._allowances[owner][spender] = value;\n        if (emitEvent) {\n            emit Approval(owner, spender, value);\n        }\n    }\n\n    /**\n     * @dev Updates `owner`'s allowance for `spender` based on spent `value`.\n     *\n     * Does not update the allowance value in case of infinite allowance.\n     * Revert if not enough allowance is available.\n     *\n     * Does not emit an {Approval} event.\n     */\n    function _spendAllowance(address owner, address spender, uint256 value) internal virtual {\n        uint256 currentAllowance = allowance(owner, spender);\n        if (currentAllowance < type(uint256).max) {\n            if (currentAllowance < value) {\n                revert ERC20InsufficientAllowance(spender, currentAllowance, value);\n            }\n            unchecked {\n                _approve(owner, spender, currentAllowance - value, false);\n            }\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IAllowlist\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `Allowlist` contract.\n */\ninterface IAllowlist {\n    /**\n     * @notice Available allowlist modes.\n     *         - `Open`: No restrictions.\n     *         - `Blacklist`: Users in the blacklist are not allowed.\n     *         - `Whitelist`: Only users in the whitelist are allowed.\n     */\n    enum AllowlistMode {\n        Open,\n        Blacklist,\n        Whitelist\n    }\n\n    /**\n     * @notice Parameters for setting the allowlist state for a user.\n     * @param user User address\n     * @param isEnabled Whether the user is whitelisted or blacklisted, depends on function context\n     */\n    struct SetAllowlistParam {\n        address user;\n        bool isEnabled;\n    }\n\n    /**\n     * @notice Emitted when the allowlist mode is updated.\n     * @param newMode New mode\n     */\n    event AllowlistModeUpdated(AllowlistMode newMode);\n\n    /**\n     * @notice Emitted when a user's blacklist state is updated.\n     * @param user User address\n     * @param isBlacklisted Whether the user is now blacklisted\n     */\n    event BlacklistUpdated(address indexed user, bool isBlacklisted);\n\n    /**\n     * @notice Emitted when a user's whitelist state is updated.\n     * @param user User address\n     * @param isWhitelisted Whether the user is now whitelisted\n     */\n    event WhitelistUpdated(address indexed user, bool isWhitelisted);\n\n    /**\n     * @notice Thrown when the intended allowlist mode is already set.\n     * @param mode Current mode\n     */\n    error ModeAlreadySet(AllowlistMode mode);\n\n    /**\n     * @notice Thrown when a user is already in the desired state (blacklist or whitelist).\n     * @param user User address\n     * @param isEnabled The desired state that the user is already in\n     */\n    error AllowlistStateIdempotent(address user, bool isEnabled);\n\n    /**\n     * @notice Thrown when a user is not allowlisted.\n     * @param user User address\n     * @param mode Current mode\n     */\n    error NotAllowlisted(address user, AllowlistMode mode);\n\n    /**\n     * @notice Returns the current allowlist mode.\n     * @return mode Current mode\n     */\n    function allowlistMode() external view returns (AllowlistMode mode);\n\n    /**\n     * @notice Returns the blacklist state for a user.\n     * @param _user User address\n     * @return isUserBlacklisted Whether the user is blacklisted\n     */\n    function isBlacklisted(address _user) external view returns (bool isUserBlacklisted);\n\n    /**\n     * @notice Returns the whitelist state for a user.\n     * @param _user User address\n     * @return isUserWhitelisted Whether the user is whitelisted\n     */\n    function isWhitelisted(address _user) external view returns (bool isUserWhitelisted);\n\n    /**\n     * @notice Checks if a user is allowlisted under the current mode.\n     * @param _user User address\n     * @return isUserAllowlisted Whether the user is allowlisted\n     */\n    function isAllowlisted(address _user) external view returns (bool isUserAllowlisted);\n\n    /**\n     * @notice Returns the total count of blacklisted addresses.\n     * @return count Total number of blacklisted addresses\n     */\n    function blacklistedCount() external view returns (uint256 count);\n\n    /**\n     * @notice Returns the total count of whitelisted addresses.\n     * @return count Total number of whitelisted addresses\n     */\n    function whitelistedCount() external view returns (uint256 count);\n\n    /**\n     * @notice Returns a paginated list of blacklisted addresses.\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of blacklisted addresses\n     */\n    function getBlacklist(uint256 _offset, uint256 _limit) external view returns (address[] memory addresses);\n\n    /**\n     * @notice Returns a paginated list of whitelisted addresses.\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of whitelisted addresses\n     */\n    function getWhitelist(uint256 _offset, uint256 _limit) external view returns (address[] memory addresses);\n\n    /**\n     * @notice Sets the allowlist mode.\n     * @param _mode New allowlist mode\n     */\n    function setAllowlistMode(AllowlistMode _mode) external;\n\n    /**\n     * @notice Sets the blacklist state for an array of users.\n     * @param _params Array of users and blacklist states\n     */\n    function setBlacklisted(SetAllowlistParam[] calldata _params) external;\n\n    /**\n     * @notice Sets the whitelist state for an array of users.\n     * @param _params Array of users and whitelist states\n     */\n    function setWhitelisted(SetAllowlistParam[] calldata _params) external;\n}\n"},"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (access/extensions/IAccessControlEnumerable.sol)\n\npragma solidity >=0.8.4;\n\nimport {IAccessControl} from \"../IAccessControl.sol\";\n\n/**\n * @dev External interface of AccessControlEnumerable declared to support ERC-165 detection.\n */\ninterface IAccessControlEnumerable is IAccessControl {\n    /**\n     * @dev Returns one of the accounts that have `role`. `index` must be a\n     * value between 0 and {getRoleMemberCount}, non-inclusive.\n     *\n     * Role bearers are not sorted in any particular way, and their ordering may\n     * change at any point.\n     *\n     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n     * you perform all queries on the same block. See the following\n     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n     * for more information.\n     */\n    function getRoleMember(bytes32 role, uint256 index) external view returns (address);\n\n    /**\n     * @dev Returns the number of accounts that have `role`. Can be used\n     * together with {getRoleMember} to enumerate all bearers of a role.\n     */\n    function getRoleMemberCount(bytes32 role) external view returns (uint256);\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (access/AccessControl.sol)\n\npragma solidity ^0.8.20;\n\nimport {IAccessControl} from \"@openzeppelin/contracts/access/IAccessControl.sol\";\nimport {ContextUpgradeable} from \"../utils/ContextUpgradeable.sol\";\nimport {ERC165Upgradeable} from \"../utils/introspection/ERC165Upgradeable.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module that allows children to implement role-based access\n * control mechanisms. This is a lightweight version that doesn't allow enumerating role\n * members except through off-chain means by accessing the contract event logs. Some\n * applications may benefit from on-chain enumerability, for those cases see\n * {AccessControlEnumerable}.\n *\n * Roles are referred to by their `bytes32` identifier. These should be exposed\n * in the external API and be unique. The best way to achieve this is by\n * using `public constant` hash digests:\n *\n * ```solidity\n * bytes32 public constant MY_ROLE = keccak256(\"MY_ROLE\");\n * ```\n *\n * Roles can be used to represent a set of permissions. To restrict access to a\n * function call, use {hasRole}:\n *\n * ```solidity\n * function foo() public {\n *     require(hasRole(MY_ROLE, msg.sender));\n *     ...\n * }\n * ```\n *\n * Roles can be granted and revoked dynamically via the {grantRole} and\n * {revokeRole} functions. Each role has an associated admin role, and only\n * accounts that have a role's admin role can call {grantRole} and {revokeRole}.\n *\n * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means\n * that only accounts with this role will be able to grant or revoke other\n * roles. More complex role relationships can be created by using\n * {_setRoleAdmin}.\n *\n * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to\n * grant and revoke this role. Extra precautions should be taken to secure\n * accounts that have been granted it. We recommend using {AccessControlDefaultAdminRules}\n * to enforce additional security measures for this role.\n */\nabstract contract AccessControlUpgradeable is Initializable, ContextUpgradeable, IAccessControl, ERC165Upgradeable {\n    struct RoleData {\n        mapping(address account => bool) hasRole;\n        bytes32 adminRole;\n    }\n\n    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;\n\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.AccessControl\n    struct AccessControlStorage {\n        mapping(bytes32 role => RoleData) _roles;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.AccessControl\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant AccessControlStorageLocation = 0x02dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800;\n\n    function _getAccessControlStorage() private pure returns (AccessControlStorage storage $) {\n        assembly {\n            $.slot := AccessControlStorageLocation\n        }\n    }\n\n    /**\n     * @dev Modifier that checks that an account has a specific role. Reverts\n     * with an {AccessControlUnauthorizedAccount} error including the required role.\n     */\n    modifier onlyRole(bytes32 role) {\n        _checkRole(role);\n        _;\n    }\n\n    function __AccessControl_init() internal onlyInitializing {\n    }\n\n    function __AccessControl_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc ERC165Upgradeable\n    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);\n    }\n\n    /**\n     * @dev Returns `true` if `account` has been granted `role`.\n     */\n    function hasRole(bytes32 role, address account) public view virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        return $._roles[role].hasRole[account];\n    }\n\n    /**\n     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `_msgSender()`\n     * is missing `role`. Overriding this function changes the behavior of the {onlyRole} modifier.\n     */\n    function _checkRole(bytes32 role) internal view virtual {\n        _checkRole(role, _msgSender());\n    }\n\n    /**\n     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `account`\n     * is missing `role`.\n     */\n    function _checkRole(bytes32 role, address account) internal view virtual {\n        if (!hasRole(role, account)) {\n            revert AccessControlUnauthorizedAccount(account, role);\n        }\n    }\n\n    /**\n     * @dev Returns the admin role that controls `role`. See {grantRole} and\n     * {revokeRole}.\n     *\n     * To change a role's admin, use {_setRoleAdmin}.\n     */\n    function getRoleAdmin(bytes32 role) public view virtual returns (bytes32) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        return $._roles[role].adminRole;\n    }\n\n    /**\n     * @dev Grants `role` to `account`.\n     *\n     * If `account` had not been already granted `role`, emits a {RoleGranted}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     *\n     * May emit a {RoleGranted} event.\n     */\n    function grantRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {\n        _grantRole(role, account);\n    }\n\n    /**\n     * @dev Revokes `role` from `account`.\n     *\n     * If `account` had been granted `role`, emits a {RoleRevoked} event.\n     *\n     * Requirements:\n     *\n     * - the caller must have ``role``'s admin role.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function revokeRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {\n        _revokeRole(role, account);\n    }\n\n    /**\n     * @dev Revokes `role` from the calling account.\n     *\n     * Roles are often managed via {grantRole} and {revokeRole}: this function's\n     * purpose is to provide a mechanism for accounts to lose their privileges\n     * if they are compromised (such as when a trusted device is misplaced).\n     *\n     * If the calling account had been revoked `role`, emits a {RoleRevoked}\n     * event.\n     *\n     * Requirements:\n     *\n     * - the caller must be `callerConfirmation`.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function renounceRole(bytes32 role, address callerConfirmation) public virtual {\n        if (callerConfirmation != _msgSender()) {\n            revert AccessControlBadConfirmation();\n        }\n\n        _revokeRole(role, callerConfirmation);\n    }\n\n    /**\n     * @dev Sets `adminRole` as ``role``'s admin role.\n     *\n     * Emits a {RoleAdminChanged} event.\n     */\n    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        bytes32 previousAdminRole = getRoleAdmin(role);\n        $._roles[role].adminRole = adminRole;\n        emit RoleAdminChanged(role, previousAdminRole, adminRole);\n    }\n\n    /**\n     * @dev Attempts to grant `role` to `account` and returns a boolean indicating if `role` was granted.\n     *\n     * Internal function without access restriction.\n     *\n     * May emit a {RoleGranted} event.\n     */\n    function _grantRole(bytes32 role, address account) internal virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        if (!hasRole(role, account)) {\n            $._roles[role].hasRole[account] = true;\n            emit RoleGranted(role, account, _msgSender());\n            return true;\n        } else {\n            return false;\n        }\n    }\n\n    /**\n     * @dev Attempts to revoke `role` from `account` and returns a boolean indicating if `role` was revoked.\n     *\n     * Internal function without access restriction.\n     *\n     * May emit a {RoleRevoked} event.\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual returns (bool) {\n        AccessControlStorage storage $ = _getAccessControlStorage();\n        if (hasRole(role, account)) {\n            $._roles[role].hasRole[account] = false;\n            emit RoleRevoked(role, account, _msgSender());\n            return true;\n        } else {\n            return false;\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/**\n * @title IFundRecovery\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for ERC20 contracts implementing fund recovery functionality.\n */\ninterface IFundRecovery {\n    /**\n     * @notice Recovers funds from a non-allowlisted address.\n     * @dev Only recovers from non-allowlisted `_from` address.\n     * @param _from Address to recover funds from\n     * @param _to Address to send the recovered funds to\n     * @param _amount Amount of funds to recover\n     */\n    function recoverFunds(address _from, address _to, uint256 _amount) external;\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/cryptography/EIP712.sol)\n\npragma solidity ^0.8.24;\n\nimport {MessageHashUtils} from \"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol\";\nimport {IERC5267} from \"@openzeppelin/contracts/interfaces/IERC5267.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev https://eips.ethereum.org/EIPS/eip-712[EIP-712] is a standard for hashing and signing of typed structured data.\n *\n * The encoding scheme specified in the EIP requires a domain separator and a hash of the typed structured data, whose\n * encoding is very generic and therefore its implementation in Solidity is not feasible, thus this contract\n * does not implement the encoding itself. Protocols need to implement the type-specific encoding they need in order to\n * produce the hash of their typed data using a combination of `abi.encode` and `keccak256`.\n *\n * This contract implements the EIP-712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding\n * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA\n * ({_hashTypedDataV4}).\n *\n * The implementation of the domain separator was designed to be as efficient as possible while still properly updating\n * the chain id to protect against replay attacks on an eventual fork of the chain.\n *\n * NOTE: This contract implements the version of the encoding known as \"v4\", as implemented by the JSON RPC method\n * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].\n *\n * NOTE: The upgradeable version of this contract does not use an immutable cache and recomputes the domain separator\n * each time {_domainSeparatorV4} is called. This is cheaper than accessing a cached version in cold storage.\n */\nabstract contract EIP712Upgradeable is Initializable, IERC5267 {\n    bytes32 private constant TYPE_HASH =\n        keccak256(\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\");\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.EIP712\n    struct EIP712Storage {\n        bytes32 _hashedName;\n        bytes32 _hashedVersion;\n\n        string _name;\n        string _version;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.EIP712\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant EIP712StorageLocation = 0xa16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d100;\n\n    function _getEIP712Storage() private pure returns (EIP712Storage storage $) {\n        assembly {\n            $.slot := EIP712StorageLocation\n        }\n    }\n\n    /**\n     * @dev Initializes the domain separator and parameter caches.\n     *\n     * The meaning of `name` and `version` is specified in\n     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP-712]:\n     *\n     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.\n     * - `version`: the current major version of the signing domain.\n     *\n     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart\n     * contract upgrade].\n     */\n    function __EIP712_init(string memory name, string memory version) internal onlyInitializing {\n        __EIP712_init_unchained(name, version);\n    }\n\n    function __EIP712_init_unchained(string memory name, string memory version) internal onlyInitializing {\n        EIP712Storage storage $ = _getEIP712Storage();\n        $._name = name;\n        $._version = version;\n    }\n\n    /**\n     * @dev Returns the domain separator for the current chain.\n     */\n    function _domainSeparatorV4() internal view returns (bytes32) {\n        return _buildDomainSeparator();\n    }\n\n    function _buildDomainSeparator() private view returns (bytes32) {\n        return keccak256(abi.encode(TYPE_HASH, _EIP712NameHash(), _EIP712VersionHash(), block.chainid, address(this)));\n    }\n\n    /**\n     * @dev Given an already https://eips.ethereum.org/EIPS/eip-712#definition-of-hashstruct[hashed struct], this\n     * function returns the hash of the fully encoded EIP712 message for this domain.\n     *\n     * This hash can be used together with {ECDSA-recover} to obtain the signer of a message. For example:\n     *\n     * ```solidity\n     * bytes32 digest = _hashTypedDataV4(keccak256(abi.encode(\n     *     keccak256(\"Mail(address to,string contents)\"),\n     *     mailTo,\n     *     keccak256(bytes(mailContents))\n     * )));\n     * address signer = ECDSA.recover(digest, signature);\n     * ```\n     */\n    function _hashTypedDataV4(bytes32 structHash) internal view virtual returns (bytes32) {\n        return MessageHashUtils.toTypedDataHash(_domainSeparatorV4(), structHash);\n    }\n\n    /// @inheritdoc IERC5267\n    function eip712Domain()\n        public\n        view\n        virtual\n        returns (\n            bytes1 fields,\n            string memory name,\n            string memory version,\n            uint256 chainId,\n            address verifyingContract,\n            bytes32 salt,\n            uint256[] memory extensions\n        )\n    {\n        return (\n            hex\"0f\", // 01111\n            _EIP712Name(),\n            _EIP712Version(),\n            block.chainid,\n            address(this),\n            bytes32(0),\n            new uint256[](0)\n        );\n    }\n\n    /**\n     * @dev The name parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs\n     * are a concern.\n     */\n    function _EIP712Name() internal view virtual returns (string memory) {\n        EIP712Storage storage $ = _getEIP712Storage();\n        return $._name;\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads from storage by default, but can be redefined to return a constant value if gas costs\n     * are a concern.\n     */\n    function _EIP712Version() internal view virtual returns (string memory) {\n        EIP712Storage storage $ = _getEIP712Storage();\n        return $._version;\n    }\n\n    /**\n     * @dev The hash of the name parameter for the EIP712 domain.\n     *\n     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Name` instead.\n     */\n    function _EIP712NameHash() internal view returns (bytes32) {\n        return keccak256(bytes(_EIP712Name()));\n    }\n\n    /**\n     * @dev The hash of the version parameter for the EIP712 domain.\n     *\n     * NOTE: In previous versions this function was virtual. In this version you should override `_EIP712Version` instead.\n     */\n    function _EIP712VersionHash() internal view returns (bytes32) {\n        return keccak256(bytes(_EIP712Version()));\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\n/// @title Interface for burnable and mintable tokens\ninterface IBurnableMintable {\n    /**\n     * @notice Burns tokens from a specified account\n     * @param _from Address from which tokens will be burned\n     * @param _amount Amount of tokens to be burned\n     * @return success Indicates whether the operation was successful\n     */\n    function burn(address _from, uint256 _amount) external returns (bool success);\n\n    /**\n     * @notice Mints tokens to a specified account\n     * @param _to Address to which tokens will be minted\n     * @param _amount Amount of tokens to be minted\n     * @return success Indicates whether the operation was successful\n     */\n    function mint(address _to, uint256 _amount) external returns (bool success);\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/ERC165.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC165} from \"@openzeppelin/contracts/utils/introspection/IERC165.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the {IERC165} interface.\n *\n * Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check\n * for the additional interface id that will be supported. For example:\n *\n * ```solidity\n * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);\n * }\n * ```\n */\nabstract contract ERC165Upgradeable is Initializable, IERC165 {\n    function __ERC165_init() internal onlyInitializing {\n    }\n\n    function __ERC165_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc IERC165\n    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {\n        return interfaceId == type(IERC165).interfaceId;\n    }\n}\n"},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAccessControlEnumerable } from \"@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol\";\n\n/**\n * @title IAccessControl2Step\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Interface for the `AccessControl2Step` contract.\n */\ninterface IAccessControl2Step is IAccessControlEnumerable {\n    /**\n     * @notice Thrown when the intended default admin is invalid.\n     * @param defaultAdmin Invalid default admin address\n     */\n    error InvalidDefaultAdmin(address defaultAdmin);\n\n    /**\n     * @notice Thrown when one of the following rules is violated:\n     *         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.\n     *         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.\n     *         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps.\n     */\n    error AccessControlEnforcedDefaultAdminRules();\n\n    /**\n     * @notice Thrown when the caller is not the pending admin.\n     * @param pendingAdmin Address of the pending admin\n     */\n    error CallerNotPendingAdmin(address pendingAdmin);\n\n    /**\n     * @notice Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started.\n     * @param newAdmin Address of the new pending default admin\n     */\n    event DefaultAdminTransferStarted(address indexed newAdmin);\n\n    /**\n     * @notice Returns the address of the current `DEFAULT_ADMIN_ROLE` holder.\n     * @return defaultAdminAddress Address of the current `DEFAULT_ADMIN_ROLE` holder\n     */\n    function defaultAdmin() external view returns (address defaultAdminAddress);\n\n    /**\n     * @notice Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling\n     *         `acceptDefaultAdminTransfer`.\n     * @return pendingDefaultAdminAddress Address of the pending `DEFAULT_ADMIN_ROLE` account\n     */\n    function pendingDefaultAdmin() external view returns (address pendingDefaultAdminAddress);\n\n    /**\n     * @notice Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`.\n     * @dev It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`.\n     * @param newAdmin Address of the new pending default admin\n     */\n    function beginDefaultAdminTransfer(address newAdmin) external;\n\n    /**\n     * @notice Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`.\n     */\n    function acceptDefaultAdminTransfer() external;\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/extensions/ERC20Permit.sol)\n\npragma solidity ^0.8.24;\n\nimport {IERC20Permit} from \"@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\";\nimport {ERC20Upgradeable} from \"../ERC20Upgradeable.sol\";\nimport {ECDSA} from \"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\";\nimport {EIP712Upgradeable} from \"../../../utils/cryptography/EIP712Upgradeable.sol\";\nimport {NoncesUpgradeable} from \"../../../utils/NoncesUpgradeable.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Implementation of the ERC-20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[ERC-2612].\n *\n * Adds the {permit} method, which can be used to change an account's ERC-20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n */\nabstract contract ERC20PermitUpgradeable is Initializable, ERC20Upgradeable, IERC20Permit, EIP712Upgradeable, NoncesUpgradeable {\n    bytes32 private constant PERMIT_TYPEHASH =\n        keccak256(\"Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)\");\n\n    /**\n     * @dev Permit deadline has expired.\n     */\n    error ERC2612ExpiredSignature(uint256 deadline);\n\n    /**\n     * @dev Mismatched signature.\n     */\n    error ERC2612InvalidSigner(address signer, address owner);\n\n    /**\n     * @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `\"1\"`.\n     *\n     * It's a good idea to use the same `name` that is defined as the ERC-20 token name.\n     */\n    function __ERC20Permit_init(string memory name) internal onlyInitializing {\n        __EIP712_init_unchained(name, \"1\");\n    }\n\n    function __ERC20Permit_init_unchained(string memory) internal onlyInitializing {}\n\n    /// @inheritdoc IERC20Permit\n    function permit(\n        address owner,\n        address spender,\n        uint256 value,\n        uint256 deadline,\n        uint8 v,\n        bytes32 r,\n        bytes32 s\n    ) public virtual {\n        if (block.timestamp > deadline) {\n            revert ERC2612ExpiredSignature(deadline);\n        }\n\n        bytes32 structHash = keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, _useNonce(owner), deadline));\n\n        bytes32 hash = _hashTypedDataV4(structHash);\n\n        address signer = ECDSA.recover(hash, v, r, s);\n        if (signer != owner) {\n            revert ERC2612InvalidSigner(signer, owner);\n        }\n\n        _approve(owner, spender, value);\n    }\n\n    /// @inheritdoc IERC20Permit\n    function nonces(address owner) public view virtual override(IERC20Permit, NoncesUpgradeable) returns (uint256) {\n        return super.nonces(owner);\n    }\n\n    /// @inheritdoc IERC20Permit\n    // solhint-disable-next-line func-name-mixedcase\n    function DOMAIN_SEPARATOR() external view returns (bytes32) {\n        return _domainSeparatorV4();\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IPause } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport { Initializable } from \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\n\n/**\n * @title PauseBaseUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that implements pause configuration and enforcement.\n * @dev No public management functions are exposed by this contract, wrappers should be used with access control.\n *      Alternatively, refer to `PauseRBACUpgradeable` for a permissioned implementation.\n */\nabstract contract PauseBaseUpgradeable is IPause, Initializable {\n    /// @custom:storage-location erc7201:layerzerov2.storage.pause\n    struct PauseStorage {\n        bool paused;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.pause\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant PAUSE_STORAGE_LOCATION =\n        0x27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000;\n\n    /**\n     * @notice Internal function to get the pause storage.\n     * @return $ Storage pointer\n     */\n    function _getPauseStorage() internal pure returns (PauseStorage storage $) {\n        assembly {\n            $.slot := PAUSE_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseBase_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseBase_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @notice Modifier that reverts if the system is paused.\n     */\n    modifier whenNotPaused() {\n        if (_getPaused()) revert Paused();\n        _;\n    }\n\n    /**\n     * @inheritdoc IPause\n     */\n    function isPaused() public view virtual returns (bool paused) {\n        return _getPaused();\n    }\n\n    /**\n     * @notice Retrieves the pause status.\n     * @return paused Whether the system is paused\n     */\n    function _getPaused() internal view virtual returns (bool) {\n        PauseStorage storage $ = _getPauseStorage();\n        return $.paused;\n    }\n\n    /**\n     * @notice Enforces that the system is not paused.\n     * @dev Reverts with `Paused` error if the system is paused.\n     */\n    function _assertNotPaused() internal view virtual {\n        if (_getPaused()) revert Paused();\n    }\n\n    /**\n     * @notice Internal function to set the pause status.\n     * @param _paused New pause status\n     */\n    function _setPaused(bool _paused) internal virtual {\n        PauseStorage storage $ = _getPauseStorage();\n        if ($.paused == _paused) revert PauseStateIdempotent(_paused);\n        $.paused = _paused;\n        emit PauseSet(_paused);\n    }\n\n    // ============ Internal Functions to Wrap with Access Control ============\n\n    /**\n     * @notice Internal function to set the pause status to true.\n     * @dev To be wrapped with access control.\n     */\n    function _pause() internal virtual {\n        _setPaused(true);\n    }\n\n    /**\n     * @notice Internal function to set the pause status to false.\n     * @dev To be wrapped with access control.\n     */\n    function _unpause() internal virtual {\n        _setPaused(false);\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IPause } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\";\nimport { AccessControl2StepUpgradeable } from \"./../access/AccessControl2StepUpgradeable.sol\";\nimport { PauseBaseUpgradeable } from \"./PauseBaseUpgradeable.sol\";\n\n/**\n * @title PauseRBACUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides pause functionality.\n * @dev Exposes public management functions through `AccessControl2StepUpgradeable`.\n */\nabstract contract PauseRBACUpgradeable is PauseBaseUpgradeable, AccessControl2StepUpgradeable {\n    /// @notice Role for pausing the contract.\n    bytes32 public constant PAUSER_ROLE = keccak256(\"PAUSER_ROLE\");\n\n    /// @notice Role for unpausing the contract.\n    bytes32 public constant UNPAUSER_ROLE = keccak256(\"UNPAUSER_ROLE\");\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseRBAC_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __PauseRBAC_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @inheritdoc IPause\n     */\n    function pause() public virtual onlyRole(PAUSER_ROLE) {\n        _pause();\n    }\n\n    /**\n     * @inheritdoc IPause\n     */\n    function unpause() public virtual onlyRole(UNPAUSER_ROLE) {\n        _unpause();\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { EnumerableSet } from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\n\n/**\n * @title EnumerableSetPagination\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Library providing pagination utilities for `EnumerableSet.AddressSet` and `EnumerableSet.UintSet`.\n */\nlibrary EnumerableSetPagination {\n    using EnumerableSet for EnumerableSet.AddressSet;\n    using EnumerableSet for EnumerableSet.UintSet;\n\n    /**\n     * @notice Returns a paginated subset of addresses from an `EnumerableSet`.\n     * @param _set `EnumerableSet.AddressSet` to paginate\n     * @param _offset Starting index\n     * @param _limit Maximum number of addresses to return\n     * @return addresses Array of addresses in the specified range\n     */\n    function paginate(\n        EnumerableSet.AddressSet storage _set,\n        uint256 _offset,\n        uint256 _limit\n    ) internal view returns (address[] memory addresses) {\n        uint256 total = _set.length();\n\n        if (_offset >= total) {\n            return new address[](0);\n        }\n\n        uint256 end = _offset + _limit;\n        if (end > total) {\n            end = total;\n        }\n\n        uint256 resultLength = end - _offset;\n        addresses = new address[](resultLength);\n\n        for (uint256 i = 0; i < resultLength; i++) {\n            addresses[i] = _set.at(_offset + i);\n        }\n    }\n\n    /**\n     * @notice Returns a paginated subset of `uint256` values from an `EnumerableSet`.\n     * @param _set `EnumerableSet.UintSet` to paginate\n     * @param _offset Starting index\n     * @param _limit Maximum number of values to return\n     * @return values Array of `uint256` values in the specified range\n     */\n    function paginate(\n        EnumerableSet.UintSet storage _set,\n        uint256 _offset,\n        uint256 _limit\n    ) internal view returns (uint256[] memory values) {\n        uint256 total = _set.length();\n\n        if (_offset >= total) {\n            return new uint256[](0);\n        }\n\n        uint256 end = _offset + _limit;\n        if (end > total) {\n            end = total;\n        }\n\n        uint256 resultLength = end - _offset;\n        values = new uint256[](resultLength);\n\n        for (uint256 i = 0; i < resultLength; i++) {\n            values[i] = _set.at(_offset + i);\n        }\n    }\n}\n"},"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (access/extensions/AccessControlEnumerable.sol)\n\npragma solidity ^0.8.24;\n\nimport {IAccessControlEnumerable} from \"@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol\";\nimport {AccessControlUpgradeable} from \"../AccessControlUpgradeable.sol\";\nimport {EnumerableSet} from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\nimport {IERC165} from \"@openzeppelin/contracts/utils/introspection/IERC165.sol\";\nimport {Initializable} from \"@openzeppelin/contracts/proxy/utils/Initializable.sol\";\n\n/**\n * @dev Extension of {AccessControl} that allows enumerating the members of each role.\n */\nabstract contract AccessControlEnumerableUpgradeable is Initializable, IAccessControlEnumerable, AccessControlUpgradeable {\n    using EnumerableSet for EnumerableSet.AddressSet;\n\n    /// @custom:storage-location erc7201:openzeppelin.storage.AccessControlEnumerable\n    struct AccessControlEnumerableStorage {\n        mapping(bytes32 role => EnumerableSet.AddressSet) _roleMembers;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.AccessControlEnumerable\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant AccessControlEnumerableStorageLocation = 0xc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000;\n\n    function _getAccessControlEnumerableStorage() private pure returns (AccessControlEnumerableStorage storage $) {\n        assembly {\n            $.slot := AccessControlEnumerableStorageLocation\n        }\n    }\n\n    function __AccessControlEnumerable_init() internal onlyInitializing {\n    }\n\n    function __AccessControlEnumerable_init_unchained() internal onlyInitializing {\n    }\n    /// @inheritdoc IERC165\n    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n        return interfaceId == type(IAccessControlEnumerable).interfaceId || super.supportsInterface(interfaceId);\n    }\n\n    /**\n     * @dev Returns one of the accounts that have `role`. `index` must be a\n     * value between 0 and {getRoleMemberCount}, non-inclusive.\n     *\n     * Role bearers are not sorted in any particular way, and their ordering may\n     * change at any point.\n     *\n     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n     * you perform all queries on the same block. See the following\n     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n     * for more information.\n     */\n    function getRoleMember(bytes32 role, uint256 index) public view virtual returns (address) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].at(index);\n    }\n\n    /**\n     * @dev Returns the number of accounts that have `role`. Can be used\n     * together with {getRoleMember} to enumerate all bearers of a role.\n     */\n    function getRoleMemberCount(bytes32 role) public view virtual returns (uint256) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].length();\n    }\n\n    /**\n     * @dev Return all accounts that have `role`\n     *\n     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n     * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n     */\n    function getRoleMembers(bytes32 role) public view virtual returns (address[] memory) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        return $._roleMembers[role].values();\n    }\n\n    /**\n     * @dev Overload {AccessControl-_grantRole} to track enumerable memberships\n     */\n    function _grantRole(bytes32 role, address account) internal virtual override returns (bool) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        bool granted = super._grantRole(role, account);\n        if (granted) {\n            $._roleMembers[role].add(account);\n        }\n        return granted;\n    }\n\n    /**\n     * @dev Overload {AccessControl-_revokeRole} to track enumerable memberships\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual override returns (bool) {\n        AccessControlEnumerableStorage storage $ = _getAccessControlEnumerableStorage();\n        bool revoked = super._revokeRole(role, account);\n        if (revoked) {\n            $._roleMembers[role].remove(account);\n        }\n        return revoked;\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAllowlist } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport { Initializable } from \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\nimport { EnumerableSet } from \"@openzeppelin/contracts/utils/structs/EnumerableSet.sol\";\nimport { EnumerableSetPagination } from \"./../libs/EnumerableSetPagination.sol\";\n\n/**\n * @title AllowlistBaseUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides toggleable allowlist functionality between open, blacklist, and\n *         whitelist modes.\n * @dev No public management functions are exposed by this contract, wrappers should be used with access control.\n *      Alternatively, refer to `AllowlistRBACUpgradeable` for a permissioned implementation.\n */\nabstract contract AllowlistBaseUpgradeable is IAllowlist, Initializable {\n    using EnumerableSet for EnumerableSet.AddressSet;\n    using EnumerableSetPagination for EnumerableSet.AddressSet;\n\n    /// @custom:storage-location erc7201:layerzerov2.storage.allowlist\n    struct AllowlistStorage {\n        AllowlistMode mode;\n        EnumerableSet.AddressSet blacklistedSet;\n        EnumerableSet.AddressSet whitelistedSet;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.allowlist\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ALLOWLIST_STORAGE_LOCATION =\n        0xa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00;\n\n    /**\n     * @notice Internal function to get the allowlist storage.\n     * @return $ Storage pointer\n     */\n    function _getAllowlistStorage() internal pure returns (AllowlistStorage storage $) {\n        assembly {\n            $.slot := ALLOWLIST_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @param _mode Initial mode\n     */\n    function __AllowlistBase_init(AllowlistMode _mode) internal onlyInitializing {\n        __AllowlistBase_init_unchained(_mode);\n    }\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @param _mode Initial mode\n     */\n    function __AllowlistBase_init_unchained(AllowlistMode _mode) internal onlyInitializing {\n        /// @dev Not using `_setAllowlistMode` to avoid reverting if the mode is open.\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        $.mode = _mode;\n        emit AllowlistModeUpdated(_mode);\n    }\n\n    /**\n     * @notice Modifier that reverts if the user is not allowlisted.\n     * @param _user User address\n     */\n    modifier onlyAllowlisted(address _user) {\n        if (!isAllowlisted(_user)) revert NotAllowlisted(_user, allowlistMode());\n        _;\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function allowlistMode() public view virtual returns (AllowlistMode mode) {\n        return _getAllowlistStorage().mode;\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isBlacklisted(address _user) public view virtual returns (bool isUserBlacklisted) {\n        return _getAllowlistStorage().blacklistedSet.contains(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isWhitelisted(address _user) public view virtual returns (bool isUserWhitelisted) {\n        return _getAllowlistStorage().whitelistedSet.contains(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function isAllowlisted(address _user) public view virtual returns (bool isUserAllowlisted) {\n        AllowlistMode currentMode = allowlistMode();\n        if (currentMode == AllowlistMode.Open) return true;\n        if (currentMode == AllowlistMode.Blacklist) return !isBlacklisted(_user);\n        /// @dev `currentMode == AllowlistMode.Whitelist`.\n        return isWhitelisted(_user);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function blacklistedCount() public view virtual returns (uint256 count) {\n        return _getAllowlistStorage().blacklistedSet.length();\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function whitelistedCount() public view virtual returns (uint256 count) {\n        return _getAllowlistStorage().whitelistedSet.length();\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function getBlacklist(uint256 _offset, uint256 _limit) public view virtual returns (address[] memory addresses) {\n        return _getAllowlistStorage().blacklistedSet.paginate(_offset, _limit);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function getWhitelist(uint256 _offset, uint256 _limit) public view virtual returns (address[] memory addresses) {\n        return _getAllowlistStorage().whitelistedSet.paginate(_offset, _limit);\n    }\n\n    // ============ Internal Functions to Wrap with Access Control ============\n\n    /**\n     * @notice Internal function to set the allowlist mode.\n     * @dev To be wrapped with access control.\n     * @param _mode New mode\n     */\n    function _setAllowlistMode(AllowlistMode _mode) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        if ($.mode == _mode) revert ModeAlreadySet(_mode);\n        $.mode = _mode;\n        emit AllowlistModeUpdated(_mode);\n    }\n\n    /**\n     * @notice Internal function to set the whitelist state for an array of users.\n     * @dev To be wrapped with access control.\n     * @param _params Array of users and whitelist states\n     */\n    function _setWhitelisted(SetAllowlistParam[] calldata _params) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        for (uint256 i = 0; i < _params.length; i++) {\n            SetAllowlistParam calldata param = _params[i];\n            bool addedOrRemoved;\n            if (param.isEnabled) {\n                addedOrRemoved = $.whitelistedSet.add(param.user);\n            } else {\n                addedOrRemoved = $.whitelistedSet.remove(param.user);\n            }\n            if (!addedOrRemoved) revert AllowlistStateIdempotent(param.user, param.isEnabled);\n            emit WhitelistUpdated(param.user, param.isEnabled);\n        }\n    }\n\n    /**\n     * @notice Internal function to set the blacklist state for an array of users.\n     * @dev To be wrapped with access control.\n     * @param _params Array of users and blacklist states\n     */\n    function _setBlacklisted(SetAllowlistParam[] calldata _params) internal virtual {\n        AllowlistStorage storage $ = _getAllowlistStorage();\n        for (uint256 i = 0; i < _params.length; i++) {\n            SetAllowlistParam calldata param = _params[i];\n            bool addedOrRemoved;\n            if (param.isEnabled) {\n                addedOrRemoved = $.blacklistedSet.add(param.user);\n            } else {\n                addedOrRemoved = $.blacklistedSet.remove(param.user);\n            }\n            if (!addedOrRemoved) revert AllowlistStateIdempotent(param.user, param.isEnabled);\n            emit BlacklistUpdated(param.user, param.isEnabled);\n        }\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAllowlist } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\";\nimport { AccessControl2StepUpgradeable } from \"./../access/AccessControl2StepUpgradeable.sol\";\nimport { AllowlistBaseUpgradeable } from \"./AllowlistBaseUpgradeable.sol\";\n\n/**\n * @title AllowlistRBACUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that provides toggleable allowlist functionality between open, blacklist, and\n *         whitelist modes.\n * @dev Exposes public management functions through `AccessControl2StepUpgradeable`.\n */\nabstract contract AllowlistRBACUpgradeable is AllowlistBaseUpgradeable, AccessControl2StepUpgradeable {\n    /// @notice Role for setting the blacklist state for users.\n    bytes32 public constant BLACKLISTER_ROLE = keccak256(\"BLACKLISTER_ROLE\");\n\n    /// @notice Role for setting the whitelist state for users.\n    bytes32 public constant WHITELISTER_ROLE = keccak256(\"WHITELISTER_ROLE\");\n\n    /**\n     * @notice Initializes the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __AllowlistRBAC_init() internal onlyInitializing {}\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @dev This function is empty on purpose, as no custom logic is needed.\n     */\n    function __AllowlistRBAC_init_unchained() internal onlyInitializing {}\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setAllowlistMode(AllowlistMode _mode) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        _setAllowlistMode(_mode);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setBlacklisted(SetAllowlistParam[] calldata _params) public virtual onlyRole(BLACKLISTER_ROLE) {\n        _setBlacklisted(_params);\n    }\n\n    /**\n     * @inheritdoc IAllowlist\n     */\n    function setWhitelisted(SetAllowlistParam[] calldata _params) public virtual onlyRole(WHITELISTER_ROLE) {\n        _setWhitelisted(_params);\n    }\n}\n"},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.22;\n\nimport { IAccessControl2Step } from \"@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol\";\nimport { AccessControlUpgradeable } from \"@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol\";\nimport { AccessControlEnumerableUpgradeable } from \"@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol\";\n\n/**\n * @title AccessControl2StepUpgradeable\n * @author LayerZero Labs (tinom.eth)\n * @custom:version 1.0.0\n * @notice Abstract upgradeable contract that extends `AccessControlEnumerable` with a two-step transfer mechanism for\n *         the `DEFAULT_ADMIN_ROLE`, similar to `AccessControlDefaultAdminRules`. It does not enforce delayed transfers.\n * @dev The `DEFAULT_ADMIN_ROLE` cannot be granted or revoked through the standard `grantRole` and `revokeRole`\n *      functions. Instead, a two-step process is enforced:\n *      1. The current admin calls `beginDefaultAdminTransfer(newAdmin)`.\n *      2. The pending admin calls `acceptDefaultAdminTransfer()`.\n *      The current default admin can cancel a pending transfer via `beginDefaultAdminTransfer(address(0))`.\n *      Renouncing the `DEFAULT_ADMIN_ROLE` is not permitted.\n */\nabstract contract AccessControl2StepUpgradeable is IAccessControl2Step, AccessControlEnumerableUpgradeable {\n    /// @custom:storage-location erc7201:layerzerov2.storage.accesscontrol2step\n    struct AccessControl2StepStorage {\n        address _pendingDefaultAdmin;\n        address _currentDefaultAdmin;\n    }\n\n    // keccak256(abi.encode(uint256(keccak256(\"layerzerov2.storage.accesscontrol2step\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant ACCESS_CONTROL_2_STEP_STORAGE_LOCATION =\n        0x9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400;\n\n    /**\n     * @notice Internal function to get the contract storage.\n     * @return $ Storage pointer\n     */\n    function _getAccessControl2StepStorage() internal pure returns (AccessControl2StepStorage storage $) {\n        assembly {\n            $.slot := ACCESS_CONTROL_2_STEP_STORAGE_LOCATION\n        }\n    }\n\n    /**\n     * @notice Initializes the contract.\n     * @param _initialDefaultAdmin Default admin address\n     */\n    function __AccessControl2Step_init(address _initialDefaultAdmin) internal onlyInitializing {\n        __AccessControl2Step_init_unchained(_initialDefaultAdmin);\n    }\n\n    /**\n     * @notice Unchained initialization function for the contract.\n     * @param _initialDefaultAdmin Default admin address\n     */\n    function __AccessControl2Step_init_unchained(address _initialDefaultAdmin) internal onlyInitializing {\n        if (_initialDefaultAdmin == address(0)) {\n            revert InvalidDefaultAdmin(address(0));\n        }\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n        $._currentDefaultAdmin = _initialDefaultAdmin;\n        /// @dev Bypass `DEFAULT_ADMIN_ROLE` check.\n        super._grantRole(DEFAULT_ADMIN_ROLE, _initialDefaultAdmin);\n    }\n\n    // ============ Getters ============\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function defaultAdmin() public view virtual returns (address defaultAdminAddress) {\n        return _getAccessControl2StepStorage()._currentDefaultAdmin;\n    }\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function pendingDefaultAdmin() public view virtual returns (address pendingDefaultAdminAddress) {\n        return _getAccessControl2StepStorage()._pendingDefaultAdmin;\n    }\n\n    // ============ Setters ============\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function beginDefaultAdminTransfer(address _newAdmin) public virtual onlyRole(DEFAULT_ADMIN_ROLE) {\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n        $._pendingDefaultAdmin = _newAdmin;\n        emit DefaultAdminTransferStarted(_newAdmin);\n    }\n\n    /**\n     * @inheritdoc IAccessControl2Step\n     */\n    function acceptDefaultAdminTransfer() public virtual {\n        AccessControl2StepStorage storage $ = _getAccessControl2StepStorage();\n\n        address pendingAdmin = $._pendingDefaultAdmin;\n        if (pendingAdmin != _msgSender()) {\n            revert CallerNotPendingAdmin(pendingAdmin);\n        }\n\n        /// @dev Bypass `DEFAULT_ADMIN_ROLE` check.\n        super._revokeRole(DEFAULT_ADMIN_ROLE, $._currentDefaultAdmin);\n        super._grantRole(DEFAULT_ADMIN_ROLE, pendingAdmin);\n\n        $._currentDefaultAdmin = pendingAdmin;\n        delete $._pendingDefaultAdmin;\n    }\n\n    // ============ Overrides ============\n\n    /**\n     * @dev Override to prevent granting `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlEnumerableUpgradeable\n     */\n    function _grantRole(bytes32 role, address account) internal virtual override returns (bool) {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        return super._grantRole(role, account);\n    }\n\n    /**\n     * @dev Override to prevent revoking `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlEnumerableUpgradeable\n     */\n    function _revokeRole(bytes32 role, address account) internal virtual override returns (bool) {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        return super._revokeRole(role, account);\n    }\n\n    /**\n     * @dev Override to prevent updating the admin of the `DEFAULT_ADMIN_ROLE`.\n     * @inheritdoc AccessControlUpgradeable\n     */\n    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual override {\n        if (role == DEFAULT_ADMIN_ROLE) {\n            revert AccessControlEnforcedDefaultAdminRules();\n        }\n        super._setRoleAdmin(role, adminRole);\n    }\n}\n"}},"language":"Solidity","settings":{"viaIR":true,"metadata":{"appendCBOR":true,"bytecodeHash":"ipfs","useLiteralContent":false},"libraries":{},"optimizer":{"runs":750,"enabled":true},"evmVersion":"cancun","remappings":["@layerzerolabs/=node_modules/@layerzerolabs/","@openzeppelin/=node_modules/@openzeppelin/","forge-std/=lib/forge-std/src/","@axelar-network/=node_modules/@axelar-network/","@chainlink/=node_modules/@chainlink/","@eth-optimism/=node_modules/@eth-optimism/","hardhat-deploy/=node_modules/hardhat-deploy/","solidity-bytes-utils/=node_modules/solidity-bytes-utils/"]}},"stdJsonOutput":{"sources":{"contracts/evm/SaturnOFT.sol":{"id":0},"contracts/evm/interfaces/IERC20Plus.sol":{"id":1},"node_modules/@openzeppelin/contracts/utils/Bytes.sol":{"id":31},"node_modules/@openzeppelin/contracts/utils/Panic.sol":{"id":33},"node_modules/@openzeppelin/contracts/utils/Arrays.sol":{"id":30},"node_modules/@openzeppelin/contracts/utils/Strings.sol":{"id":36},"node_modules/@openzeppelin/contracts/utils/math/Math.sol":{"id":40},"node_modules/@openzeppelin/contracts/utils/Comparators.sol":{"id":32},"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol":{"id":35},"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol":{"id":27},"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol":{"id":24},"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol":{"id":41},"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol":{"id":34},"node_modules/@openzeppelin/contracts/access/IAccessControl.sol":{"id":22},"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol":{"id":42},"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"id":37},"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"id":25},"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol":{"id":26},"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol":{"id":39},"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol":{"id":43},"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol":{"id":19},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol":{"id":29},"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"id":38},"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol":{"id":18},"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol":{"id":15},"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":28},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol":{"id":6},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol":{"id":16},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol":{"id":3},"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol":{"id":23},"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol":{"id":13},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol":{"id":5},"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol":{"id":20},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol":{"id":4},"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol":{"id":21},"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol":{"id":2},"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol":{"id":17},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol":{"id":11},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol":{"id":12},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol":{"id":10},"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol":{"id":14},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol":{"id":8},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol":{"id":9},"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol":{"id":7}},"contracts":{"contracts/evm/SaturnOFT.sol":{"SaturnOFT":{"abi":[{"type":"constructor","inputs":[{"name":"_decimals","type":"uint8","internalType":"uint8"}],"stateMutability":"nonpayable"},{"name":"AccessControlBadConfirmation","type":"error","inputs":[]},{"name":"AccessControlEnforcedDefaultAdminRules","type":"error","inputs":[]},{"name":"AccessControlUnauthorizedAccount","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"},{"name":"neededRole","type":"bytes32","internalType":"bytes32"}]},{"name":"AllowlistStateIdempotent","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}]},{"name":"CallerNotPendingAdmin","type":"error","inputs":[{"name":"pendingAdmin","type":"address","internalType":"address"}]},{"name":"CannotRecoverFromAllowlisted","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"}]},{"name":"ECDSAInvalidSignature","type":"error","inputs":[]},{"name":"ECDSAInvalidSignatureLength","type":"error","inputs":[{"name":"length","type":"uint256","internalType":"uint256"}]},{"name":"ECDSAInvalidSignatureS","type":"error","inputs":[{"name":"s","type":"bytes32","internalType":"bytes32"}]},{"name":"ERC20InsufficientAllowance","type":"error","inputs":[{"name":"spender","type":"address","internalType":"address"},{"name":"allowance","type":"uint256","internalType":"uint256"},{"name":"needed","type":"uint256","internalType":"uint256"}]},{"name":"ERC20InsufficientBalance","type":"error","inputs":[{"name":"sender","type":"address","internalType":"address"},{"name":"balance","type":"uint256","internalType":"uint256"},{"name":"needed","type":"uint256","internalType":"uint256"}]},{"name":"ERC20InvalidApprover","type":"error","inputs":[{"name":"approver","type":"address","internalType":"address"}]},{"name":"ERC20InvalidReceiver","type":"error","inputs":[{"name":"receiver","type":"address","internalType":"address"}]},{"name":"ERC20InvalidSender","type":"error","inputs":[{"name":"sender","type":"address","internalType":"address"}]},{"name":"ERC20InvalidSpender","type":"error","inputs":[{"name":"spender","type":"address","internalType":"address"}]},{"name":"ERC2612ExpiredSignature","type":"error","inputs":[{"name":"deadline","type":"uint256","internalType":"uint256"}]},{"name":"ERC2612InvalidSigner","type":"error","inputs":[{"name":"signer","type":"address","internalType":"address"},{"name":"owner","type":"address","internalType":"address"}]},{"name":"InvalidAccountNonce","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"},{"name":"currentNonce","type":"uint256","internalType":"uint256"}]},{"name":"InvalidDefaultAdmin","type":"error","inputs":[{"name":"defaultAdmin","type":"address","internalType":"address"}]},{"name":"InvalidInitialization","type":"error","inputs":[]},{"name":"ModeAlreadySet","type":"error","inputs":[{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}]},{"name":"NotAllowlisted","type":"error","inputs":[{"name":"user","type":"address","internalType":"address"},{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}]},{"name":"NotInitializing","type":"error","inputs":[]},{"name":"PauseStateIdempotent","type":"error","inputs":[{"name":"isPaused","type":"bool","internalType":"bool"}]},{"name":"Paused","type":"error","inputs":[]},{"name":"AllowlistModeUpdated","type":"event","inputs":[{"name":"newMode","type":"uint8","indexed":false,"internalType":"enum IAllowlist.AllowlistMode"}],"anonymous":false},{"name":"Approval","type":"event","inputs":[{"name":"owner","type":"address","indexed":true,"internalType":"address"},{"name":"spender","type":"address","indexed":true,"internalType":"address"},{"name":"value","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"BlacklistUpdated","type":"event","inputs":[{"name":"user","type":"address","indexed":true,"internalType":"address"},{"name":"isBlacklisted","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"DefaultAdminTransferStarted","type":"event","inputs":[{"name":"newAdmin","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"Initialized","type":"event","inputs":[{"name":"version","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"PauseSet","type":"event","inputs":[{"name":"paused","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"RoleAdminChanged","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"previousAdminRole","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"newAdminRole","type":"bytes32","indexed":true,"internalType":"bytes32"}],"anonymous":false},{"name":"RoleGranted","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"account","type":"address","indexed":true,"internalType":"address"},{"name":"sender","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"RoleRevoked","type":"event","inputs":[{"name":"role","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"account","type":"address","indexed":true,"internalType":"address"},{"name":"sender","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"Transfer","type":"event","inputs":[{"name":"from","type":"address","indexed":true,"internalType":"address"},{"name":"to","type":"address","indexed":true,"internalType":"address"},{"name":"value","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"WhitelistUpdated","type":"event","inputs":[{"name":"user","type":"address","indexed":true,"internalType":"address"},{"name":"isWhitelisted","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"BLACKLISTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"BURNER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"DEFAULT_ADMIN_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"DOMAIN_SEPARATOR","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"MINTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"PAUSER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"UNPAUSER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"WHITELISTER_ROLE","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"acceptDefaultAdminTransfer","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"allowance","type":"function","inputs":[{"name":"owner","type":"address","internalType":"address"},{"name":"spender","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"allowlistMode","type":"function","inputs":[],"outputs":[{"name":"mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}],"stateMutability":"view"},{"name":"approve","type":"function","inputs":[{"name":"spender","type":"address","internalType":"address"},{"name":"value","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"balanceOf","type":"function","inputs":[{"name":"account","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"beginDefaultAdminTransfer","type":"function","inputs":[{"name":"_newAdmin","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"blacklistedCount","type":"function","inputs":[],"outputs":[{"name":"count","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"burn","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"decimals","type":"function","inputs":[],"outputs":[{"name":"tokenDecimals","type":"uint8","internalType":"uint8"}],"stateMutability":"view"},{"name":"defaultAdmin","type":"function","inputs":[],"outputs":[{"name":"defaultAdminAddress","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"eip712Domain","type":"function","inputs":[],"outputs":[{"name":"fields","type":"bytes1","internalType":"bytes1"},{"name":"name","type":"string","internalType":"string"},{"name":"version","type":"string","internalType":"string"},{"name":"chainId","type":"uint256","internalType":"uint256"},{"name":"verifyingContract","type":"address","internalType":"address"},{"name":"salt","type":"bytes32","internalType":"bytes32"},{"name":"extensions","type":"uint256[]","internalType":"uint256[]"}],"stateMutability":"view"},{"name":"getBlacklist","type":"function","inputs":[{"name":"_offset","type":"uint256","internalType":"uint256"},{"name":"_limit","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"addresses","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"getRoleAdmin","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"getRoleMember","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"index","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"getRoleMemberCount","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"getRoleMembers","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"getWhitelist","type":"function","inputs":[{"name":"_offset","type":"uint256","internalType":"uint256"},{"name":"_limit","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"addresses","type":"address[]","internalType":"address[]"}],"stateMutability":"view"},{"name":"grantRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"hasRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"initialize","type":"function","inputs":[{"name":"_name","type":"string","internalType":"string"},{"name":"_symbol","type":"string","internalType":"string"},{"name":"_initialAdmin","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"isAllowlisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserAllowlisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isBlacklisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserBlacklisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isPaused","type":"function","inputs":[],"outputs":[{"name":"paused","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"isWhitelisted","type":"function","inputs":[{"name":"_user","type":"address","internalType":"address"}],"outputs":[{"name":"isUserWhitelisted","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"mint","type":"function","inputs":[{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"name","type":"function","inputs":[],"outputs":[{"name":"","type":"string","internalType":"string"}],"stateMutability":"view"},{"name":"nonces","type":"function","inputs":[{"name":"_owner","type":"address","internalType":"address"}],"outputs":[{"name":"nonce","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"pause","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"pendingDefaultAdmin","type":"function","inputs":[],"outputs":[{"name":"pendingDefaultAdminAddress","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"permit","type":"function","inputs":[{"name":"owner","type":"address","internalType":"address"},{"name":"spender","type":"address","internalType":"address"},{"name":"value","type":"uint256","internalType":"uint256"},{"name":"deadline","type":"uint256","internalType":"uint256"},{"name":"v","type":"uint8","internalType":"uint8"},{"name":"r","type":"bytes32","internalType":"bytes32"},{"name":"s","type":"bytes32","internalType":"bytes32"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"recoverFunds","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"renounceRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"callerConfirmation","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"revokeRole","type":"function","inputs":[{"name":"role","type":"bytes32","internalType":"bytes32"},{"name":"account","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setAllowlistMode","type":"function","inputs":[{"name":"_mode","type":"uint8","internalType":"enum IAllowlist.AllowlistMode"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setBlacklisted","type":"function","inputs":[{"name":"_params","type":"tuple[]","components":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setWhitelisted","type":"function","inputs":[{"name":"_params","type":"tuple[]","components":[{"name":"user","type":"address","internalType":"address"},{"name":"isEnabled","type":"bool","internalType":"bool"}],"internalType":"struct IAllowlist.SetAllowlistParam[]"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"supportsInterface","type":"function","inputs":[{"name":"interfaceId","type":"bytes4","internalType":"bytes4"}],"outputs":[{"name":"","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"symbol","type":"function","inputs":[],"outputs":[{"name":"","type":"string","internalType":"string"}],"stateMutability":"view"},{"name":"totalSupply","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"transfer","type":"function","inputs":[{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"transferFrom","type":"function","inputs":[{"name":"_from","type":"address","internalType":"address"},{"name":"_to","type":"address","internalType":"address"},{"name":"_amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"success","type":"bool","internalType":"bool"}],"stateMutability":"nonpayable"},{"name":"unpause","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"whitelistedCount","type":"function","inputs":[],"outputs":[{"name":"count","type":"uint256","internalType":"uint256"}],"stateMutability":"view"}],"metadata":"{\"compiler\":{\"version\":\"0.8.26+commit.8a97fa7a\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"uint8\",\"name\":\"_decimals\",\"type\":\"uint8\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AccessControlBadConfirmation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AccessControlEnforcedDefaultAdminRules\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"neededRole\",\"type\":\"bytes32\"}],\"name\":\"AccessControlUnauthorizedAccount\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"isEnabled\",\"type\":\"bool\"}],\"name\":\"AllowlistStateIdempotent\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"pendingAdmin\",\"type\":\"address\"}],\"name\":\"CallerNotPendingAdmin\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"}],\"name\":\"CannotRecoverFromAllowlisted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ECDSAInvalidSignature\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"length\",\"type\":\"uint256\"}],\"name\":\"ECDSAInvalidSignatureLength\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"s\",\"type\":\"bytes32\"}],\"name\":\"ECDSAInvalidSignatureS\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"allowance\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"needed\",\"type\":\"uint256\"}],\"name\":\"ERC20InsufficientAllowance\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"sender\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"balance\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"needed\",\"type\":\"uint256\"}],\"name\":\"ERC20InsufficientBalance\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"approver\",\"type\":\"address\"}],\"name\":\"ERC20InvalidApprover\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"receiver\",\"type\":\"address\"}],\"name\":\"ERC20InvalidReceiver\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"sender\",\"type\":\"address\"}],\"name\":\"ERC20InvalidSender\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"}],\"name\":\"ERC20InvalidSpender\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"deadline\",\"type\":\"uint256\"}],\"name\":\"ERC2612ExpiredSignature\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"signer\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"owner\",\"type\":\"address\"}],\"name\":\"ERC2612InvalidSigner\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"currentNonce\",\"type\":\"uint256\"}],\"name\":\"InvalidAccountNonce\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"defaultAdmin\",\"type\":\"address\"}],\"name\":\"InvalidDefaultAdmin\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidInitialization\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"enum IAllowlist.AllowlistMode\",\"name\":\"mode\",\"type\":\"uint8\"}],\"name\":\"ModeAlreadySet\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"internalType\":\"enum IAllowlist.AllowlistMode\",\"name\":\"mode\",\"type\":\"uint8\"}],\"name\":\"NotAllowlisted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bool\",\"name\":\"isPaused\",\"type\":\"bool\"}],\"name\":\"PauseStateIdempotent\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"Paused\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"enum IAllowlist.AllowlistMode\",\"name\":\"newMode\",\"type\":\"uint8\"}],\"name\":\"AllowlistModeUpdated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"owner\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"}],\"name\":\"Approval\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"isBlacklisted\",\"type\":\"bool\"}],\"name\":\"BlacklistUpdated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newAdmin\",\"type\":\"address\"}],\"name\":\"DefaultAdminTransferStarted\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[],\"name\":\"EIP712DomainChanged\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"paused\",\"type\":\"bool\"}],\"name\":\"PauseSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"previousAdminRole\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"newAdminRole\",\"type\":\"bytes32\"}],\"name\":\"RoleAdminChanged\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"sender\",\"type\":\"address\"}],\"name\":\"RoleGranted\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"sender\",\"type\":\"address\"}],\"name\":\"RoleRevoked\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"from\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"}],\"name\":\"Transfer\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"isWhitelisted\",\"type\":\"bool\"}],\"name\":\"WhitelistUpdated\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"BLACKLISTER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"BURNER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"DEFAULT_ADMIN_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"DOMAIN_SEPARATOR\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"MINTER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"PAUSER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"UNPAUSER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"WHITELISTER_ROLE\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"acceptDefaultAdminTransfer\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"owner\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"}],\"name\":\"allowance\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"allowlistMode\",\"outputs\":[{\"internalType\":\"enum IAllowlist.AllowlistMode\",\"name\":\"mode\",\"type\":\"uint8\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"}],\"name\":\"approve\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"balanceOf\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_newAdmin\",\"type\":\"address\"}],\"name\":\"beginDefaultAdminTransfer\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"blacklistedCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"count\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_from\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"burn\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"success\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"decimals\",\"outputs\":[{\"internalType\":\"uint8\",\"name\":\"tokenDecimals\",\"type\":\"uint8\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"defaultAdmin\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"defaultAdminAddress\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"eip712Domain\",\"outputs\":[{\"internalType\":\"bytes1\",\"name\":\"fields\",\"type\":\"bytes1\"},{\"internalType\":\"string\",\"name\":\"name\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"version\",\"type\":\"string\"},{\"internalType\":\"uint256\",\"name\":\"chainId\",\"type\":\"uint256\"},{\"internalType\":\"address\",\"name\":\"verifyingContract\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"salt\",\"type\":\"bytes32\"},{\"internalType\":\"uint256[]\",\"name\":\"extensions\",\"type\":\"uint256[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_offset\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_limit\",\"type\":\"uint256\"}],\"name\":\"getBlacklist\",\"outputs\":[{\"internalType\":\"address[]\",\"name\":\"addresses\",\"type\":\"address[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"}],\"name\":\"getRoleAdmin\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"internalType\":\"uint256\",\"name\":\"index\",\"type\":\"uint256\"}],\"name\":\"getRoleMember\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"}],\"name\":\"getRoleMemberCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"}],\"name\":\"getRoleMembers\",\"outputs\":[{\"internalType\":\"address[]\",\"name\":\"\",\"type\":\"address[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_offset\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_limit\",\"type\":\"uint256\"}],\"name\":\"getWhitelist\",\"outputs\":[{\"internalType\":\"address[]\",\"name\":\"addresses\",\"type\":\"address[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"grantRole\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"hasRole\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"string\",\"name\":\"_name\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"_symbol\",\"type\":\"string\"},{\"internalType\":\"address\",\"name\":\"_initialAdmin\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_user\",\"type\":\"address\"}],\"name\":\"isAllowlisted\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"isUserAllowlisted\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_user\",\"type\":\"address\"}],\"name\":\"isBlacklisted\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"isUserBlacklisted\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"isPaused\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"paused\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_user\",\"type\":\"address\"}],\"name\":\"isWhitelisted\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"isUserWhitelisted\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_to\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"mint\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"success\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"name\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"nonces\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"nonce\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"pause\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"pendingDefaultAdmin\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"pendingDefaultAdminAddress\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"owner\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"spender\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"value\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"deadline\",\"type\":\"uint256\"},{\"internalType\":\"uint8\",\"name\":\"v\",\"type\":\"uint8\"},{\"internalType\":\"bytes32\",\"name\":\"r\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"s\",\"type\":\"bytes32\"}],\"name\":\"permit\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_from\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_to\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"recoverFunds\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"callerConfirmation\",\"type\":\"address\"}],\"name\":\"renounceRole\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"role\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"revokeRole\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"enum IAllowlist.AllowlistMode\",\"name\":\"_mode\",\"type\":\"uint8\"}],\"name\":\"setAllowlistMode\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"components\":[{\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"isEnabled\",\"type\":\"bool\"}],\"internalType\":\"struct IAllowlist.SetAllowlistParam[]\",\"name\":\"_params\",\"type\":\"tuple[]\"}],\"name\":\"setBlacklisted\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"components\":[{\"internalType\":\"address\",\"name\":\"user\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"isEnabled\",\"type\":\"bool\"}],\"internalType\":\"struct IAllowlist.SetAllowlistParam[]\",\"name\":\"_params\",\"type\":\"tuple[]\"}],\"name\":\"setWhitelisted\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes4\",\"name\":\"interfaceId\",\"type\":\"bytes4\"}],\"name\":\"supportsInterface\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"symbol\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"totalSupply\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_to\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"transfer\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"success\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_from\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_to\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"transferFrom\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"success\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"unpause\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"whitelistedCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"count\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"author\":\"LayerZero Labs (@TRileySchwarz, tinom.eth)\",\"custom:version\":\"1.0.0\",\"details\":\"Roles are handled through `AccessControl2StepUpgradeable`.\",\"errors\":{\"AccessControlBadConfirmation()\":[{\"details\":\"The caller of a function is not the expected one. NOTE: Don't confuse with {AccessControlUnauthorizedAccount}.\"}],\"AccessControlUnauthorizedAccount(address,bytes32)\":[{\"details\":\"The `account` is missing a role.\"}],\"AllowlistStateIdempotent(address,bool)\":[{\"params\":{\"isEnabled\":\"The desired state that the user is already in\",\"user\":\"User address\"}}],\"CallerNotPendingAdmin(address)\":[{\"params\":{\"pendingAdmin\":\"Address of the pending admin\"}}],\"CannotRecoverFromAllowlisted(address)\":[{\"params\":{\"user\":\"Address that is allowlisted\"}}],\"ECDSAInvalidSignature()\":[{\"details\":\"The signature is invalid.\"}],\"ECDSAInvalidSignatureLength(uint256)\":[{\"details\":\"The signature has an invalid length.\"}],\"ECDSAInvalidSignatureS(bytes32)\":[{\"details\":\"The signature has an S value that is in the upper half order.\"}],\"ERC20InsufficientAllowance(address,uint256,uint256)\":[{\"details\":\"Indicates a failure with the `spender`’s `allowance`. Used in transfers.\",\"params\":{\"allowance\":\"Amount of tokens a `spender` is allowed to operate with.\",\"needed\":\"Minimum amount required to perform a transfer.\",\"spender\":\"Address that may be allowed to operate on tokens without being their owner.\"}}],\"ERC20InsufficientBalance(address,uint256,uint256)\":[{\"details\":\"Indicates an error related to the current `balance` of a `sender`. Used in transfers.\",\"params\":{\"balance\":\"Current balance for the interacting account.\",\"needed\":\"Minimum amount required to perform a transfer.\",\"sender\":\"Address whose tokens are being transferred.\"}}],\"ERC20InvalidApprover(address)\":[{\"details\":\"Indicates a failure with the `approver` of a token to be approved. Used in approvals.\",\"params\":{\"approver\":\"Address initiating an approval operation.\"}}],\"ERC20InvalidReceiver(address)\":[{\"details\":\"Indicates a failure with the token `receiver`. Used in transfers.\",\"params\":{\"receiver\":\"Address to which tokens are being transferred.\"}}],\"ERC20InvalidSender(address)\":[{\"details\":\"Indicates a failure with the token `sender`. Used in transfers.\",\"params\":{\"sender\":\"Address whose tokens are being transferred.\"}}],\"ERC20InvalidSpender(address)\":[{\"details\":\"Indicates a failure with the `spender` to be approved. Used in approvals.\",\"params\":{\"spender\":\"Address that may be allowed to operate on tokens without being their owner.\"}}],\"ERC2612ExpiredSignature(uint256)\":[{\"details\":\"Permit deadline has expired.\"}],\"ERC2612InvalidSigner(address,address)\":[{\"details\":\"Mismatched signature.\"}],\"InvalidAccountNonce(address,uint256)\":[{\"details\":\"The nonce used for an `account` is not the expected current nonce.\"}],\"InvalidDefaultAdmin(address)\":[{\"params\":{\"defaultAdmin\":\"Invalid default admin address\"}}],\"InvalidInitialization()\":[{\"details\":\"The contract is already initialized.\"}],\"ModeAlreadySet(uint8)\":[{\"params\":{\"mode\":\"Current mode\"}}],\"NotAllowlisted(address,uint8)\":[{\"params\":{\"mode\":\"Current mode\",\"user\":\"User address\"}}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}],\"PauseStateIdempotent(bool)\":[{\"params\":{\"isPaused\":\"Whether system is paused\"}}]},\"events\":{\"AllowlistModeUpdated(uint8)\":{\"params\":{\"newMode\":\"New mode\"}},\"Approval(address,address,uint256)\":{\"details\":\"Emitted when the allowance of a `spender` for an `owner` is set by a call to {approve}. `value` is the new allowance.\"},\"BlacklistUpdated(address,bool)\":{\"params\":{\"isBlacklisted\":\"Whether the user is now blacklisted\",\"user\":\"User address\"}},\"DefaultAdminTransferStarted(address)\":{\"params\":{\"newAdmin\":\"Address of the new pending default admin\"}},\"EIP712DomainChanged()\":{\"details\":\"MAY be emitted to signal that the domain could have changed.\"},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"PauseSet(bool)\":{\"params\":{\"paused\":\"Pause status\"}},\"RoleAdminChanged(bytes32,bytes32,bytes32)\":{\"details\":\"Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole` `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite {RoleAdminChanged} not being emitted to signal this.\"},\"RoleGranted(bytes32,address,address)\":{\"details\":\"Emitted when `account` is granted `role`. `sender` is the account that originated the contract call. This account bears the admin role (for the granted role). Expected in cases where the role was granted using the internal {AccessControl-_grantRole}.\"},\"RoleRevoked(bytes32,address,address)\":{\"details\":\"Emitted when `account` is revoked `role`. `sender` is the account that originated the contract call:   - if using `revokeRole`, it is the admin role bearer   - if using `renounceRole`, it is the role bearer (i.e. `account`)\"},\"Transfer(address,address,uint256)\":{\"details\":\"Emitted when `value` tokens are moved from one account (`from`) to another (`to`). Note that `value` may be zero.\"},\"WhitelistUpdated(address,bool)\":{\"params\":{\"isWhitelisted\":\"Whether the user is now whitelisted\",\"user\":\"User address\"}}},\"kind\":\"dev\",\"methods\":{\"DOMAIN_SEPARATOR()\":{\"details\":\"Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\"},\"allowance(address,address)\":{\"details\":\"Returns the remaining number of tokens that `spender` will be allowed to spend on behalf of `owner` through {transferFrom}. This is zero by default. This value changes when {approve} or {transferFrom} are called.\"},\"allowlistMode()\":{\"returns\":{\"mode\":\"Current mode\"}},\"approve(address,uint256)\":{\"details\":\"See {IERC20-approve}. NOTE: If `value` is the maximum `uint256`, the allowance is not updated on `transferFrom`. This is semantically equivalent to an infinite approval. Requirements: - `spender` cannot be the zero address.\"},\"balanceOf(address)\":{\"details\":\"Returns the value of tokens owned by `account`.\"},\"beginDefaultAdminTransfer(address)\":{\"details\":\"It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`.\",\"params\":{\"newAdmin\":\"Address of the new pending default admin\"}},\"blacklistedCount()\":{\"returns\":{\"count\":\"Total number of blacklisted addresses\"}},\"burn(address,uint256)\":{\"params\":{\"_amount\":\"Amount of tokens to burn\",\"_from\":\"Address to burn tokens from\"},\"returns\":{\"success\":\"Always returns true\"}},\"constructor\":{\"details\":\"Sets immutable variables.\",\"params\":{\"_decimals\":\"Decimals of the token\"}},\"decimals()\":{\"details\":\"Override to set immutable decimals.\"},\"defaultAdmin()\":{\"returns\":{\"defaultAdminAddress\":\"Address of the current `DEFAULT_ADMIN_ROLE` holder\"}},\"eip712Domain()\":{\"details\":\"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature.\"},\"getBlacklist(uint256,uint256)\":{\"params\":{\"_limit\":\"Maximum number of addresses to return\",\"_offset\":\"Starting index\"},\"returns\":{\"addresses\":\"Array of blacklisted addresses\"}},\"getRoleAdmin(bytes32)\":{\"details\":\"Returns the admin role that controls `role`. See {grantRole} and {revokeRole}. To change a role's admin, use {_setRoleAdmin}.\"},\"getRoleMember(bytes32,uint256)\":{\"details\":\"Returns one of the accounts that have `role`. `index` must be a value between 0 and {getRoleMemberCount}, non-inclusive. Role bearers are not sorted in any particular way, and their ordering may change at any point. WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure you perform all queries on the same block. See the following https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] for more information.\"},\"getRoleMemberCount(bytes32)\":{\"details\":\"Returns the number of accounts that have `role`. Can be used together with {getRoleMember} to enumerate all bearers of a role.\"},\"getRoleMembers(bytes32)\":{\"details\":\"Return all accounts that have `role` WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that this function has an unbounded cost, and using it as part of a state-changing function may render the function uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\"},\"getWhitelist(uint256,uint256)\":{\"params\":{\"_limit\":\"Maximum number of addresses to return\",\"_offset\":\"Starting index\"},\"returns\":{\"addresses\":\"Array of whitelisted addresses\"}},\"grantRole(bytes32,address)\":{\"details\":\"Grants `role` to `account`. If `account` had not been already granted `role`, emits a {RoleGranted} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleGranted} event.\"},\"hasRole(bytes32,address)\":{\"details\":\"Returns `true` if `account` has been granted `role`.\"},\"initialize(string,string,address)\":{\"params\":{\"_initialAdmin\":\"Address to be granted `DEFAULT_ADMIN_ROLE`\",\"_name\":\"Name of the token\",\"_symbol\":\"Symbol of the token\"}},\"isAllowlisted(address)\":{\"params\":{\"_user\":\"User address\"},\"returns\":{\"isUserAllowlisted\":\"Whether the user is allowlisted\"}},\"isBlacklisted(address)\":{\"params\":{\"_user\":\"User address\"},\"returns\":{\"isUserBlacklisted\":\"Whether the user is blacklisted\"}},\"isPaused()\":{\"returns\":{\"paused\":\"Whether the system is paused\"}},\"isWhitelisted(address)\":{\"params\":{\"_user\":\"User address\"},\"returns\":{\"isUserWhitelisted\":\"Whether the user is whitelisted\"}},\"mint(address,uint256)\":{\"details\":\"It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.\",\"params\":{\"_amount\":\"Amount of tokens to mint\",\"_to\":\"Address to mint tokens to\"},\"returns\":{\"success\":\"Always returns true\"}},\"name()\":{\"details\":\"Returns the name of the token.\"},\"nonces(address)\":{\"details\":\"Returns the current nonce for `owner`. This value must be included whenever a signature is generated for {permit}. Every successful call to {permit} increases ``owner``'s nonce by one. This prevents a signature from being used multiple times.\"},\"pendingDefaultAdmin()\":{\"returns\":{\"pendingDefaultAdminAddress\":\"Address of the pending `DEFAULT_ADMIN_ROLE` account\"}},\"permit(address,address,uint256,uint256,uint8,bytes32,bytes32)\":{\"details\":\"Sets `value` as the allowance of `spender` over ``owner``'s tokens, given ``owner``'s signed approval. IMPORTANT: The same issues {IERC20-approve} has related to transaction ordering also applies here. Emits an {Approval} event. Requirements: - `spender` cannot be the zero address. - `deadline` must be a timestamp in the future. - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner` over the EIP712-formatted function arguments. - the signature must use ``owner``'s current nonce (see {nonces}). For more information on the signature format, see the https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP section]. CAUTION: See Security Considerations above.\"},\"recoverFunds(address,address,uint256)\":{\"details\":\"Only recovers from non-allowlisted `_from` address.\",\"params\":{\"_amount\":\"Amount of funds to recover\",\"_from\":\"Address to recover funds from\",\"_to\":\"Address to send the recovered funds to\"}},\"renounceRole(bytes32,address)\":{\"details\":\"Revokes `role` from the calling account. Roles are often managed via {grantRole} and {revokeRole}: this function's purpose is to provide a mechanism for accounts to lose their privileges if they are compromised (such as when a trusted device is misplaced). If the calling account had been revoked `role`, emits a {RoleRevoked} event. Requirements: - the caller must be `callerConfirmation`. May emit a {RoleRevoked} event.\"},\"revokeRole(bytes32,address)\":{\"details\":\"Revokes `role` from `account`. If `account` had been granted `role`, emits a {RoleRevoked} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleRevoked} event.\"},\"setAllowlistMode(uint8)\":{\"params\":{\"_mode\":\"New allowlist mode\"}},\"setBlacklisted((address,bool)[])\":{\"params\":{\"_params\":\"Array of users and blacklist states\"}},\"setWhitelisted((address,bool)[])\":{\"params\":{\"_params\":\"Array of users and whitelist states\"}},\"supportsInterface(bytes4)\":{\"details\":\"Returns true if this contract implements the interface defined by `interfaceId`. See the corresponding https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section] to learn more about how these ids are created. This function call must use less than 30 000 gas.\"},\"symbol()\":{\"details\":\"Returns the symbol of the token, usually a shorter version of the name.\"},\"totalSupply()\":{\"details\":\"Returns the value of tokens in existence.\"},\"transfer(address,uint256)\":{\"details\":\"Override to add allowlist checks.\"},\"transferFrom(address,address,uint256)\":{\"details\":\"Override to add allowlist checks.\"},\"whitelistedCount()\":{\"returns\":{\"count\":\"Total number of whitelisted addresses\"}}},\"stateVariables\":{\"DECIMALS\":{\"details\":\"Immutable decimals of the token.\"}},\"title\":\"SaturnOFT\",\"version\":1},\"userdoc\":{\"errors\":{\"AccessControlEnforcedDefaultAdminRules()\":[{\"notice\":\"Thrown when one of the following rules is violated:         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps.\"}],\"AllowlistStateIdempotent(address,bool)\":[{\"notice\":\"Thrown when a user is already in the desired state (blacklist or whitelist).\"}],\"CallerNotPendingAdmin(address)\":[{\"notice\":\"Thrown when the caller is not the pending admin.\"}],\"CannotRecoverFromAllowlisted(address)\":[{\"notice\":\"Thrown when trying to recover funds from an allowlisted address.\"}],\"InvalidDefaultAdmin(address)\":[{\"notice\":\"Thrown when the intended default admin is invalid.\"}],\"ModeAlreadySet(uint8)\":[{\"notice\":\"Thrown when the intended allowlist mode is already set.\"}],\"NotAllowlisted(address,uint8)\":[{\"notice\":\"Thrown when a user is not allowlisted.\"}],\"PauseStateIdempotent(bool)\":[{\"notice\":\"Thrown when setting pause state is idempotent (no change).\"}],\"Paused()\":[{\"notice\":\"Thrown when attempting to perform an action while paused.\"}]},\"events\":{\"AllowlistModeUpdated(uint8)\":{\"notice\":\"Emitted when the allowlist mode is updated.\"},\"BlacklistUpdated(address,bool)\":{\"notice\":\"Emitted when a user's blacklist state is updated.\"},\"DefaultAdminTransferStarted(address)\":{\"notice\":\"Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started.\"},\"PauseSet(bool)\":{\"notice\":\"Emitted when the pause status is set.\"},\"WhitelistUpdated(address,bool)\":{\"notice\":\"Emitted when a user's whitelist state is updated.\"}},\"kind\":\"user\",\"methods\":{\"BLACKLISTER_ROLE()\":{\"notice\":\"Role for setting the blacklist state for users.\"},\"BURNER_ROLE()\":{\"notice\":\"Role for burning tokens.\"},\"MINTER_ROLE()\":{\"notice\":\"Role for minting tokens.\"},\"PAUSER_ROLE()\":{\"notice\":\"Role for pausing the contract.\"},\"UNPAUSER_ROLE()\":{\"notice\":\"Role for unpausing the contract.\"},\"WHITELISTER_ROLE()\":{\"notice\":\"Role for setting the whitelist state for users.\"},\"acceptDefaultAdminTransfer()\":{\"notice\":\"Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`.\"},\"allowlistMode()\":{\"notice\":\"Returns the current allowlist mode.\"},\"beginDefaultAdminTransfer(address)\":{\"notice\":\"Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`.\"},\"blacklistedCount()\":{\"notice\":\"Returns the total count of blacklisted addresses.\"},\"burn(address,uint256)\":{\"notice\":\"Burns tokens from address without approval.\"},\"defaultAdmin()\":{\"notice\":\"Returns the address of the current `DEFAULT_ADMIN_ROLE` holder.\"},\"getBlacklist(uint256,uint256)\":{\"notice\":\"Returns a paginated list of blacklisted addresses.\"},\"getWhitelist(uint256,uint256)\":{\"notice\":\"Returns a paginated list of whitelisted addresses.\"},\"initialize(string,string,address)\":{\"notice\":\"Initializes the contract with a name, symbol, and default admin.\"},\"isAllowlisted(address)\":{\"notice\":\"Checks if a user is allowlisted under the current mode.\"},\"isBlacklisted(address)\":{\"notice\":\"Returns the blacklist state for a user.\"},\"isPaused()\":{\"notice\":\"Checks if the system is paused.\"},\"isWhitelisted(address)\":{\"notice\":\"Returns the whitelist state for a user.\"},\"mint(address,uint256)\":{\"notice\":\"Mints tokens to address.\"},\"pause()\":{\"notice\":\"Pauses the system.\"},\"pendingDefaultAdmin()\":{\"notice\":\"Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling         `acceptDefaultAdminTransfer`.\"},\"recoverFunds(address,address,uint256)\":{\"notice\":\"Recovers funds from a non-allowlisted address.\"},\"setAllowlistMode(uint8)\":{\"notice\":\"Sets the allowlist mode.\"},\"setBlacklisted((address,bool)[])\":{\"notice\":\"Sets the blacklist state for an array of users.\"},\"setWhitelisted((address,bool)[])\":{\"notice\":\"Sets the whitelist state for an array of users.\"},\"unpause()\":{\"notice\":\"Unpauses the system.\"},\"whitelistedCount()\":{\"notice\":\"Returns the total count of whitelisted addresses.\"}},\"notice\":\"Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/evm/SaturnOFT.sol\":\"SaturnOFT\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\"},\"optimizer\":{\"enabled\":true,\"runs\":750},\"remappings\":[\":@axelar-network/=node_modules/@axelar-network/\",\":@chainlink/=node_modules/@chainlink/\",\":@eth-optimism/=node_modules/@eth-optimism/\",\":@layerzerolabs/=node_modules/@layerzerolabs/\",\":@openzeppelin/=node_modules/@openzeppelin/\",\":forge-std/=lib/forge-std/src/\",\":hardhat-deploy/=node_modules/hardhat-deploy/\",\":solidity-bytes-utils/=node_modules/solidity-bytes-utils/\"],\"viaIR\":true},\"sources\":{\"contracts/evm/SaturnOFT.sol\":{\"keccak256\":\"0x1c867b09d30364dbcd4ac3623b2c77c168b2e9d785cadea9fbaed573d4db4a49\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://de5ed006bf72c334abb4be1e639ece22f3b2629fb65332e460e5af316522f648\",\"dweb:/ipfs/QmTDMhe4eEiaa51E4P79fmw3WVXbuw5b3kwKmQUanj6riW\"]},\"contracts/evm/interfaces/IERC20Plus.sol\":{\"keccak256\":\"0x29b872b47b10724dac5d6102161f6f9fb5a6cd4a6ccc047b4b334f70be7e1d5c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://bcd9e4b98d4d6f2a339d3917268f821337fb38af0a26d5a61fee97afc625db73\",\"dweb:/ipfs/QmWczcgzgUv1ykjfmuS2tnCE921gPb4mXFXGVGZWWWnXk2\"]},\"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAccessControl2Step.sol\":{\"keccak256\":\"0x97c5800d918f21faa1599728d07a726643437f2744930567addfddd962338507\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://f4ad0d138f2a9ee852d3d21c396bd6b4a5157cd9c67158e7dc108bad8f11c6cb\",\"dweb:/ipfs/QmZMgQqJtHQPJkV1R3amYXHmMPHRbQfbgXA3dqmqFonjrH\"]},\"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IAllowlist.sol\":{\"keccak256\":\"0x8eb3b1ab7135ad0ab6af2382336923ea4bbdc166be0ac4b26362c358c7b47e4d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://87d50a2cbe5164be9479740a8f4305ea29dc0373f57ca50bc292d822eb9d8210\",\"dweb:/ipfs/QmbWV3XD5fqKCPEsE97szdCt9YwuuEbiP3VepDfqC4Ti47\"]},\"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IBurnableMintable.sol\":{\"keccak256\":\"0x3f65bb879652c2263aa42dbb71cd919e6622ceaac68e2eb94a08b073d0bf2d4b\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://f38cd755df8e6a7bfe6b56c4c9a49ab33f1f1716d93452e57131645a7ae344a9\",\"dweb:/ipfs/QmY2KmFvNYZJAMNU13uQVmMgjQuYyGTfNRPCiqq2w299Vv\"]},\"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IFundRecovery.sol\":{\"keccak256\":\"0x6334069fdbb0857f33a25c9d6cb2730a670e317d0057e014fb9db812104c8ad6\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://cf327cec0bb87af4737ac4d6ed1aa0896c4d192de765dd95bbb9f104475f2924\",\"dweb:/ipfs/QmYe8AaEtYED27ut6hVaF28JQQYV8RMXVa4KaQ2qs7ZJx9\"]},\"node_modules/@layerzerolabs/utils-evm-contracts/contracts/interfaces/IPause.sol\":{\"keccak256\":\"0xdbf9112508e836469eaa25e27828efe1ef37233e14a2494aeaa0c953856f5e25\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ef0de4f3cb423772523fe908bf2f647bd78306021e2c63429ea859f2317ebfba\",\"dweb:/ipfs/QmP4HSLZSSZrK816J8in3BtXZbfbAzKJ24SMmKZRLKKuHD\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/access/AccessControl2StepUpgradeable.sol\":{\"keccak256\":\"0xedbdd0eda025c2455d16f6f6551b1c93e3a41eb8d00ee4cb8a530b45d8818cc4\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://e50a28b34bd9808fc497b13bd4b3a3fcf0acc2df4eb4b578e67ecaa2be4730cf\",\"dweb:/ipfs/QmUovTphKRAiPX2XqH4mxSoei2imekQfKwnxce6sJbSqwL\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistBaseUpgradeable.sol\":{\"keccak256\":\"0x6854c032eff37100c1dd8eca325cfeefe2825ac17b54bfeef254b7f845b736ef\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://5271ec59efa1675eb643a352f72e38a12f541c6e20c4db3101edf6411981f9b3\",\"dweb:/ipfs/QmRhsQknMiy3fBcKUh3UEgWN39UKtfszw8PT6NteSbYeXM\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/allowlist/AllowlistRBACUpgradeable.sol\":{\"keccak256\":\"0x65e3a96d05da05311112ac6e53bca28e2cb9a2b0e1f5908052afc7da843f2b98\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://33b9251dd6a7f5d6f9a6cd8dbfa30c2226eefbf008580bdae64e42a67c3a106d\",\"dweb:/ipfs/QmdyFyJdvg6kxoLHhGUbP8ZLPEehSKvYBRxrz2mZK7JNpQ\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/libs/EnumerableSetPagination.sol\":{\"keccak256\":\"0x6287aa20cbf7d64e8721ecf490767c7ac96fe81730aee1351944d3e58df9c415\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://b8bfaf291795f2960566ca52f2b37565b36e613d7a81e33887191d3240cf706b\",\"dweb:/ipfs/QmdA5jvfXZcA2d8P5b5YJrJFmmsokj78Pv7aH99CEFb8ST\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseBaseUpgradeable.sol\":{\"keccak256\":\"0xeeefcf141f9fdd6ca36f302cd3374a42cdf99680293df01bd42fcffaa36bcfa8\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://b5652e21bba9d72ead138e2daafe14f38e3b5c19e928c4d0d2d11aa8d65f814a\",\"dweb:/ipfs/Qmf3MFUrfuJSa2LXrC2Ho6AQuDCTYY2CfctPeR2q29xnKe\"]},\"node_modules/@layerzerolabs/utils-upgradeable-evm-contracts/contracts/pause/PauseRBACUpgradeable.sol\":{\"keccak256\":\"0x44409bb3c2ade83957c63c655d3becf2b054cccad52bbd05987f3252c26f867f\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://a87c6afad5797ac99a5e0803ed765a94f47657b90b833a82a0670e337f5a340e\",\"dweb:/ipfs/QmRHBDFCSrUoMmLmgHLQmQLTj38gEZ4DWepND2CHN2UGu2\"]},\"node_modules/@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol\":{\"keccak256\":\"0xe3a2cff969716ebedd6f9fc7f4cbc499449e9bd0377afa49dab9e9c21212a50e\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://b14eb6728d660a790b2c49df0e96fe31e467ec30fc02ae41944b5d5a628610d8\",\"dweb:/ipfs/QmSP2j6xhEbCRzDyv5HTwvJV14vBtyZFog3LUh7wp94YHc\"]},\"node_modules/@openzeppelin/contracts-upgradeable/access/extensions/AccessControlEnumerableUpgradeable.sol\":{\"keccak256\":\"0x330e7d8f3e5ada1545f79e293731092705e27177eb1a79605f8938a925828997\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://2a522cc0fcda63a508a40a5f438d28dbd51581bfdf841ff948e31fd8bc090127\",\"dweb:/ipfs/QmXZrGyomqrLtvV417EUT3XBTm8zN4fY26AHBxGVEarXjc\"]},\"node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\":{\"keccak256\":\"0x30d125b8417684dbfea3e8d57284b353a86b22077237b4aaf098c0b54b153e16\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://2813775a6326190e75dfa9005c1abbdb1e541c195c0bf5656dd4199e8c66fd8d\",\"dweb:/ipfs/QmYDKANBezQXNrEDyJ69RVXkgypW1hWj7MAvjfdNHTZY8L\"]},\"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/ERC20Upgradeable.sol\":{\"keccak256\":\"0xd518def45c722a6e803e1e26e625db25e01497f672ca566cca585d234ec903b0\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://6e7de3fccd96783244790cde282435ce0fd3a44ab4ccb10f17005c743202882f\",\"dweb:/ipfs/QmYSepstTqs5UPJvjeJXkWU5R659yReqrSgSGGh65hkbdK\"]},\"node_modules/@openzeppelin/contracts-upgradeable/token/ERC20/extensions/ERC20PermitUpgradeable.sol\":{\"keccak256\":\"0x2abba89aa289a6c0e38404a5b2e0020ca133e1ae0c790bdfc4cc99a1e2af93ba\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://babdfa68f728f6063f378692ac75dc086d3a7d7a4c04f53779c4365d0b2d1124\",\"dweb:/ipfs/QmNZe3zu6FvpN9xBMadQsxip11VAUyqJWHTbrBGCqes9SC\"]},\"node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol\":{\"keccak256\":\"0xad316bdc3ee64a0e29773256245045dc57b92660799ff14f668f7c0da9456a9d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://66463434d266816fca2a3a2734ceee88544e61b7cc3899c50333b46e8e771455\",\"dweb:/ipfs/QmPYCzHjki1HQLvBub3uUqoUKGrwdgR3xP9Zpya14YTdXS\"]},\"node_modules/@openzeppelin/contracts-upgradeable/utils/NoncesUpgradeable.sol\":{\"keccak256\":\"0xe82a34ce4440f4c0a144fcd5c837c05bcd6bfbd947ba184f3e9904c14ed280ad\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://f05905d8f1f2941589c625b74f2ca7fb3f2a8d8b9e55c0b31072404720a1cb95\",\"dweb:/ipfs/QmVCzDUqSaUYGLSqwkeEQHBMTrJQtUMjEsBBEsGYBdyazE\"]},\"node_modules/@openzeppelin/contracts-upgradeable/utils/cryptography/EIP712Upgradeable.sol\":{\"keccak256\":\"0xf415d9f93e322a9fe3682712ffb72cfd3daf8f4c4acfa1bb4fea8f5fb7e1cf0d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://7ce394d9dd8bd6902a4d529ad3a1f3529918f26aafd4740d2f739712d89bebdd\",\"dweb:/ipfs/QmSgrefNY63FEpgWQAsnn46VwcrP2ShEY3mtB58x7pAiuN\"]},\"node_modules/@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol\":{\"keccak256\":\"0x16b88aca1f1c3aa38783416d86207ce6fe574fcd1993dfe54403b5c8b6c74224\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://29f3c5c687fe0d87742b013872f495e67656910530c916a69873860dc8fea812\",\"dweb:/ipfs/QmbspfQXmbhCANqqiunUFm9fiVVQwPet2YKQoJ58km442Y\"]},\"node_modules/@openzeppelin/contracts/access/IAccessControl.sol\":{\"keccak256\":\"0xbff9f59c84e5337689161ce7641c0ef8e872d6a7536fbc1f5133f128887aba3c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://b308f882e796f7b79c9502deacb0a62983035c6f6f4e962b319ba6a1f4a77d3d\",\"dweb:/ipfs/QmaWCW7ahEQqFjwhSUhV7Ae7WhfNvzSpE7DQ58hvEooqPL\"]},\"node_modules/@openzeppelin/contracts/access/extensions/IAccessControlEnumerable.sol\":{\"keccak256\":\"0xbc97d8c0d67d4d7eba1e662f0a8671712ace9e060ab03af547c4bb321aec1d8c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://890d156f50630d52c7be57d7e0499132d6fd92b2e1365b81531f4463b3304377\",\"dweb:/ipfs/QmUHe9uL1ciePH2pQg7wdrgTAFRZWjcpBEAg8V1UNtXutd\"]},\"node_modules/@openzeppelin/contracts/interfaces/IERC5267.sol\":{\"keccak256\":\"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae\",\"dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1\"]},\"node_modules/@openzeppelin/contracts/interfaces/draft-IERC6093.sol\":{\"keccak256\":\"0x1b88b3fb3d85ba5496d7d5f396f83ee1fddcdd6762059ff65992655b67920998\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://89393bb3212da1c0889601b9706a07b39419ddc4d2faab9eaf6e7f9152cf6a1c\",\"dweb:/ipfs/QmcCfzzxv1Bkdz1c1yF4gQCeYb6Us5BJANnzTFqawfd1HL\"]},\"node_modules/@openzeppelin/contracts/proxy/utils/Initializable.sol\":{\"keccak256\":\"0xdb4d24ee2c087c391d587cd17adfe5b3f9d93b3110b1388c2ab6c7c0ad1dcd05\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ab7b6d5b9e2b88176312967fe0f0e78f3d9a1422fa5e4b64e2440c35869b5d08\",\"dweb:/ipfs/QmXKYWWyzcLg1B2k7Sb1qkEXgLCYfXecR9wYW5obRzWP1Q\"]},\"node_modules/@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303\",\"dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV\"]},\"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\":{\"keccak256\":\"0xd6fa4088198f04eef10c5bce8a2f4d60554b7ec4b987f684393c01bf79b94d9f\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://f95ee0bbd4dd3ac730d066ba3e785ded4565e890dbec2fa7d3b9fe3bad9d0d6e\",\"dweb:/ipfs/QmSLr6bHkPFWT7ntj34jmwfyskpwo97T9jZUrk5sz3sdtR\"]},\"node_modules/@openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol\":{\"keccak256\":\"0x53befc41288eaa87edcd3a7be7e8475a32e44c6a29f9bf52fae789781301d9ff\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://a1d7fab53c4ceaf42391b83d9b36d7e9cc524a8da125cffdcd32c56560f9d1c9\",\"dweb:/ipfs/QmaRZdVhQdqNXofeimibkBG65q9GVcXVZEGpycwwX3znC6\"]},\"node_modules/@openzeppelin/contracts/utils/Arrays.sol\":{\"keccak256\":\"0xb3b81029526a4c3acf39e57cc446407141ebce338cc99585942af1340e1a69e0\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://3857ce97e8f7a51ad78ea5419b3386e18fcc8af73b65803eedd8193ab7abc9df\",\"dweb:/ipfs/QmSQi6x2cYsUy76mfMNwuq151bVmh4kAND141kjume51Aq\"]},\"node_modules/@openzeppelin/contracts/utils/Bytes.sol\":{\"keccak256\":\"0xf80e4b96b6849936ea0fabd76cf81b13d7276295fddb1e1c07afb3ddf650b0ac\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://6430007255ac11c6e9c4331a418f3af52ff66fbbae959f645301d025b20aeb08\",\"dweb:/ipfs/QmQE5fjmBBRw9ndnzJuC2uskYss1gbaR7JdazoCf1FGoBj\"]},\"node_modules/@openzeppelin/contracts/utils/Comparators.sol\":{\"keccak256\":\"0x302eecd8cf323b4690e3494a7d960b3cbce077032ab8ef655b323cdd136cec58\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://49ba706f1bc476d68fe6c1fad75517acea4e9e275be0989b548e292eb3a3eacd\",\"dweb:/ipfs/QmeBpvcdGWzWMKTQESUCEhHgnEQYYATVwPxLMxa6vMT7jC\"]},\"node_modules/@openzeppelin/contracts/utils/Panic.sol\":{\"keccak256\":\"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a\",\"dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG\"]},\"node_modules/@openzeppelin/contracts/utils/SlotDerivation.sol\":{\"keccak256\":\"0x94045fd4f268edf2b2d01ef119268548c320366d6f5294ad30c1b8f9d4f5225f\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://edfda81f426f8948b3834115c21e83c48180e6db0d2a8cd2debb2185ed349337\",\"dweb:/ipfs/QmdYZneFyDAux1BuWQxLAdqtABrGS2k9WYCa7C9dvpKkWv\"]},\"node_modules/@openzeppelin/contracts/utils/StorageSlot.sol\":{\"keccak256\":\"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b\",\"dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM\"]},\"node_modules/@openzeppelin/contracts/utils/Strings.sol\":{\"keccak256\":\"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc\",\"dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS\"]},\"node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol\":{\"keccak256\":\"0xbeb5cad8aaabe0d35d2ec1a8414d91e81e5a8ca679add4cf57e2f33476861f40\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ebb272a5ee2da4e8bd5551334e0ce8dce4e9c56a04570d6bf046d260fab3116a\",\"dweb:/ipfs/QmNw6RyM769qcqFocDq6HJMG2WiEnQbvizpRaUXsACHho2\"]},\"node_modules/@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol\":{\"keccak256\":\"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c\",\"dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL\"]},\"node_modules/@openzeppelin/contracts/utils/introspection/IERC165.sol\":{\"keccak256\":\"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617\",\"dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u\"]},\"node_modules/@openzeppelin/contracts/utils/math/Math.sol\":{\"keccak256\":\"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5\",\"dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y\"]},\"node_modules/@openzeppelin/contracts/utils/math/SafeCast.sol\":{\"keccak256\":\"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9\",\"dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif\"]},\"node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol\":{\"keccak256\":\"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03\",\"dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ\"]},\"node_modules/@openzeppelin/contracts/utils/structs/EnumerableSet.sol\":{\"keccak256\":\"0x5c298e834696707e274a71a224969d36faecd928a8076603210d67d091adb4ae\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://a93fe967b4d55b31157164cbb7e3e1ebaf3535fc1d3f8d0156da7abb9b565d90\",\"dweb:/ipfs/QmXH7nyxwEUeMPFDDmkdUwqxLEcezaSmVyunyMAuck1WqR\"]}},\"version\":1}","userdoc":{"kind":"user","errors":{"Paused()":[{"notice":"Thrown when attempting to perform an action while paused."}],"ModeAlreadySet(uint8)":[{"notice":"Thrown when the intended allowlist mode is already set."}],"PauseStateIdempotent(bool)":[{"notice":"Thrown when setting pause state is idempotent (no change)."}],"InvalidDefaultAdmin(address)":[{"notice":"Thrown when the intended default admin is invalid."}],"NotAllowlisted(address,uint8)":[{"notice":"Thrown when a user is not allowlisted."}],"CallerNotPendingAdmin(address)":[{"notice":"Thrown when the caller is not the pending admin."}],"CannotRecoverFromAllowlisted(address)":[{"notice":"Thrown when trying to recover funds from an allowlisted address."}],"AllowlistStateIdempotent(address,bool)":[{"notice":"Thrown when a user is already in the desired state (blacklist or whitelist)."}],"AccessControlEnforcedDefaultAdminRules()":[{"notice":"Thrown when one of the following rules is violated:         - The `DEFAULT_ADMIN_ROLE` must only be managed by itself.         - The `DEFAULT_ADMIN_ROLE` must only be held by one account at the time.         - Any `DEFAULT_ADMIN_ROLE` transfer must be in two steps."}]},"events":{"PauseSet(bool)":{"notice":"Emitted when the pause status is set."},"AllowlistModeUpdated(uint8)":{"notice":"Emitted when the allowlist mode is updated."},"BlacklistUpdated(address,bool)":{"notice":"Emitted when a user's blacklist state is updated."},"WhitelistUpdated(address,bool)":{"notice":"Emitted when a user's whitelist state is updated."},"DefaultAdminTransferStarted(address)":{"notice":"Emitted when a `DEFAULT_ADMIN_ROLE` transfer is started."}},"notice":"Upgradeable ERC20 token with burn-mint interface, permit, pause, toggleable allowlist, and fund recovery.         Single implementation reused across Saturn stablecoins (USDat, sUSDat) — name/symbol set per proxy via initialize.","methods":{"pause()":{"notice":"Pauses the system."},"unpause()":{"notice":"Unpauses the system."},"isPaused()":{"notice":"Checks if the system is paused."},"BURNER_ROLE()":{"notice":"Role for burning tokens."},"MINTER_ROLE()":{"notice":"Role for minting tokens."},"PAUSER_ROLE()":{"notice":"Role for pausing the contract."},"defaultAdmin()":{"notice":"Returns the address of the current `DEFAULT_ADMIN_ROLE` holder."},"UNPAUSER_ROLE()":{"notice":"Role for unpausing the contract."},"allowlistMode()":{"notice":"Returns the current allowlist mode."},"BLACKLISTER_ROLE()":{"notice":"Role for setting the blacklist state for users."},"WHITELISTER_ROLE()":{"notice":"Role for setting the whitelist state for users."},"blacklistedCount()":{"notice":"Returns the total count of blacklisted addresses."},"whitelistedCount()":{"notice":"Returns the total count of whitelisted addresses."},"burn(address,uint256)":{"notice":"Burns tokens from address without approval."},"mint(address,uint256)":{"notice":"Mints tokens to address."},"pendingDefaultAdmin()":{"notice":"Returns the address of the account that can claim the `DEFAULT_ADMIN_ROLE` by calling         `acceptDefaultAdminTransfer`."},"isAllowlisted(address)":{"notice":"Checks if a user is allowlisted under the current mode."},"isBlacklisted(address)":{"notice":"Returns the blacklist state for a user."},"isWhitelisted(address)":{"notice":"Returns the whitelist state for a user."},"setAllowlistMode(uint8)":{"notice":"Sets the allowlist mode."},"acceptDefaultAdminTransfer()":{"notice":"Completes a `DEFAULT_ADMIN_ROLE` transfer previously started with `beginDefaultAdminTransfer`."},"getBlacklist(uint256,uint256)":{"notice":"Returns a paginated list of blacklisted addresses."},"getWhitelist(uint256,uint256)":{"notice":"Returns a paginated list of whitelisted addresses."},"setBlacklisted((address,bool)[])":{"notice":"Sets the blacklist state for an array of users."},"setWhitelisted((address,bool)[])":{"notice":"Sets the whitelist state for an array of users."},"initialize(string,string,address)":{"notice":"Initializes the contract with a name, symbol, and default admin."},"beginDefaultAdminTransfer(address)":{"notice":"Starts a `DEFAULT_ADMIN_ROLE` transfer by setting a `pendingDefaultAdmin`."},"recoverFunds(address,address,uint256)":{"notice":"Recovers funds from a non-allowlisted address."}},"version":1},"devdoc":{"kind":"dev","title":"SaturnOFT","author":"LayerZero Labs (@TRileySchwarz, tinom.eth)","errors":{"NotInitializing()":[{"details":"The contract is not initializing."}],"ModeAlreadySet(uint8)":[{"params":{"mode":"Current mode"}}],"ECDSAInvalidSignature()":[{"details":"The signature is invalid."}],"InvalidInitialization()":[{"details":"The contract is already initialized."}],"PauseStateIdempotent(bool)":[{"params":{"isPaused":"Whether system is paused"}}],"ERC20InvalidSender(address)":[{"params":{"sender":"Address whose tokens are being transferred."},"details":"Indicates a failure with the token `sender`. Used in transfers."}],"ERC20InvalidSpender(address)":[{"params":{"spender":"Address that may be allowed to operate on tokens without being their owner."},"details":"Indicates a failure with the `spender` to be approved. Used in approvals."}],"InvalidDefaultAdmin(address)":[{"params":{"defaultAdmin":"Invalid default admin address"}}],"ERC20InvalidApprover(address)":[{"params":{"approver":"Address initiating an approval operation."},"details":"Indicates a failure with the `approver` of a token to be approved. Used in approvals."}],"ERC20InvalidReceiver(address)":[{"params":{"receiver":"Address to which tokens are being transferred."},"details":"Indicates a failure with the token `receiver`. Used in transfers."}],"NotAllowlisted(address,uint8)":[{"params":{"mode":"Current mode","user":"User address"}}],"AccessControlBadConfirmation()":[{"details":"The caller of a function is not the expected one. NOTE: Don't confuse with {AccessControlUnauthorizedAccount}."}],"CallerNotPendingAdmin(address)":[{"params":{"pendingAdmin":"Address of the pending admin"}}],"ECDSAInvalidSignatureS(bytes32)":[{"details":"The signature has an S value that is in the upper half order."}],"ERC2612ExpiredSignature(uint256)":[{"details":"Permit deadline has expired."}],"ECDSAInvalidSignatureLength(uint256)":[{"details":"The signature has an invalid length."}],"InvalidAccountNonce(address,uint256)":[{"details":"The nonce used for an `account` is not the expected current nonce."}],"CannotRecoverFromAllowlisted(address)":[{"params":{"user":"Address that is allowlisted"}}],"ERC2612InvalidSigner(address,address)":[{"details":"Mismatched signature."}],"AllowlistStateIdempotent(address,bool)":[{"params":{"user":"User address","isEnabled":"The desired state that the user is already in"}}],"AccessControlUnauthorizedAccount(address,bytes32)":[{"details":"The `account` is missing a role."}],"ERC20InsufficientBalance(address,uint256,uint256)":[{"params":{"needed":"Minimum amount required to perform a transfer.","sender":"Address whose tokens are being transferred.","balance":"Current balance for the interacting account."},"details":"Indicates an error related to the current `balance` of a `sender`. Used in transfers."}],"ERC20InsufficientAllowance(address,uint256,uint256)":[{"params":{"needed":"Minimum amount required to perform a transfer.","spender":"Address that may be allowed to operate on tokens without being their owner.","allowance":"Amount of tokens a `spender` is allowed to operate with."},"details":"Indicates a failure with the `spender`’s `allowance`. Used in transfers."}]},"events":{"PauseSet(bool)":{"params":{"paused":"Pause status"}},"Initialized(uint64)":{"details":"Triggered when the contract has been initialized or reinitialized."},"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."},"AllowlistModeUpdated(uint8)":{"params":{"newMode":"New mode"}},"BlacklistUpdated(address,bool)":{"params":{"user":"User address","isBlacklisted":"Whether the user is now blacklisted"}},"WhitelistUpdated(address,bool)":{"params":{"user":"User address","isWhitelisted":"Whether the user is now whitelisted"}},"Approval(address,address,uint256)":{"details":"Emitted when the allowance of a `spender` for an `owner` is set by a call to {approve}. `value` is the new allowance."},"Transfer(address,address,uint256)":{"details":"Emitted when `value` tokens are moved from one account (`from`) to another (`to`). Note that `value` may be zero."},"DefaultAdminTransferStarted(address)":{"params":{"newAdmin":"Address of the new pending default admin"}},"RoleGranted(bytes32,address,address)":{"details":"Emitted when `account` is granted `role`. `sender` is the account that originated the contract call. This account bears the admin role (for the granted role). Expected in cases where the role was granted using the internal {AccessControl-_grantRole}."},"RoleRevoked(bytes32,address,address)":{"details":"Emitted when `account` is revoked `role`. `sender` is the account that originated the contract call:   - if using `revokeRole`, it is the admin role bearer   - if using `renounceRole`, it is the role bearer (i.e. `account`)"},"RoleAdminChanged(bytes32,bytes32,bytes32)":{"details":"Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole` `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite {RoleAdminChanged} not being emitted to signal this."}},"details":"Roles are handled through `AccessControl2StepUpgradeable`.","methods":{"name()":{"details":"Returns the name of the token."},"symbol()":{"details":"Returns the symbol of the token, usually a shorter version of the name."},"decimals()":{"details":"Override to set immutable decimals."},"isPaused()":{"returns":{"paused":"Whether the system is paused"}},"constructor":{"params":{"_decimals":"Decimals of the token"},"details":"Sets immutable variables."},"totalSupply()":{"details":"Returns the value of tokens in existence."},"defaultAdmin()":{"returns":{"defaultAdminAddress":"Address of the current `DEFAULT_ADMIN_ROLE` holder"}},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"allowlistMode()":{"returns":{"mode":"Current mode"}},"nonces(address)":{"details":"Returns the current nonce for `owner`. This value must be included whenever a signature is generated for {permit}. Every successful call to {permit} increases ``owner``'s nonce by one. This prevents a signature from being used multiple times."},"DOMAIN_SEPARATOR()":{"details":"Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}."},"balanceOf(address)":{"details":"Returns the value of tokens owned by `account`."},"blacklistedCount()":{"returns":{"count":"Total number of blacklisted addresses"}},"whitelistedCount()":{"returns":{"count":"Total number of whitelisted addresses"}},"burn(address,uint256)":{"params":{"_from":"Address to burn tokens from","_amount":"Amount of tokens to burn"},"returns":{"success":"Always returns true"}},"getRoleAdmin(bytes32)":{"details":"Returns the admin role that controls `role`. See {grantRole} and {revokeRole}. To change a role's admin, use {_setRoleAdmin}."},"mint(address,uint256)":{"params":{"_to":"Address to mint tokens to","_amount":"Amount of tokens to mint"},"details":"It does not revert if the recipient is not allowlisted, as funds cannot be debited in that state.","returns":{"success":"Always returns true"}},"pendingDefaultAdmin()":{"returns":{"pendingDefaultAdminAddress":"Address of the pending `DEFAULT_ADMIN_ROLE` account"}},"isAllowlisted(address)":{"params":{"_user":"User address"},"returns":{"isUserAllowlisted":"Whether the user is allowlisted"}},"isBlacklisted(address)":{"params":{"_user":"User address"},"returns":{"isUserBlacklisted":"Whether the user is blacklisted"}},"isWhitelisted(address)":{"params":{"_user":"User address"},"returns":{"isUserWhitelisted":"Whether the user is whitelisted"}},"getRoleMembers(bytes32)":{"details":"Return all accounts that have `role` WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that this function has an unbounded cost, and using it as part of a state-changing function may render the function uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block."},"setAllowlistMode(uint8)":{"params":{"_mode":"New allowlist mode"}},"approve(address,uint256)":{"details":"See {IERC20-approve}. NOTE: If `value` is the maximum `uint256`, the allowance is not updated on `transferFrom`. This is semantically equivalent to an infinite approval. Requirements: - `spender` cannot be the zero address."},"hasRole(bytes32,address)":{"details":"Returns `true` if `account` has been granted `role`."},"supportsInterface(bytes4)":{"details":"Returns true if this contract implements the interface defined by `interfaceId`. See the corresponding https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section] to learn more about how these ids are created. This function call must use less than 30 000 gas."},"transfer(address,uint256)":{"details":"Override to add allowlist checks."},"allowance(address,address)":{"details":"Returns the remaining number of tokens that `spender` will be allowed to spend on behalf of `owner` through {transferFrom}. This is zero by default. This value changes when {approve} or {transferFrom} are called."},"grantRole(bytes32,address)":{"details":"Grants `role` to `account`. If `account` had not been already granted `role`, emits a {RoleGranted} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleGranted} event."},"getRoleMemberCount(bytes32)":{"details":"Returns the number of accounts that have `role`. Can be used together with {getRoleMember} to enumerate all bearers of a role."},"revokeRole(bytes32,address)":{"details":"Revokes `role` from `account`. If `account` had been granted `role`, emits a {RoleRevoked} event. Requirements: - the caller must have ``role``'s admin role. May emit a {RoleRevoked} event."},"getBlacklist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of blacklisted addresses"}},"getWhitelist(uint256,uint256)":{"params":{"_limit":"Maximum number of addresses to return","_offset":"Starting index"},"returns":{"addresses":"Array of whitelisted addresses"}},"renounceRole(bytes32,address)":{"details":"Revokes `role` from the calling account. Roles are often managed via {grantRole} and {revokeRole}: this function's purpose is to provide a mechanism for accounts to lose their privileges if they are compromised (such as when a trusted device is misplaced). If the calling account had been revoked `role`, emits a {RoleRevoked} event. Requirements: - the caller must be `callerConfirmation`. May emit a {RoleRevoked} event."},"getRoleMember(bytes32,uint256)":{"details":"Returns one of the accounts that have `role`. `index` must be a value between 0 and {getRoleMemberCount}, non-inclusive. Role bearers are not sorted in any particular way, and their ordering may change at any point. WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure you perform all queries on the same block. See the following https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] for more information."},"setBlacklisted((address,bool)[])":{"params":{"_params":"Array of users and blacklist states"}},"setWhitelisted((address,bool)[])":{"params":{"_params":"Array of users and whitelist states"}},"initialize(string,string,address)":{"params":{"_name":"Name of the token","_symbol":"Symbol of the token","_initialAdmin":"Address to be granted `DEFAULT_ADMIN_ROLE`"}},"beginDefaultAdminTransfer(address)":{"params":{"newAdmin":"Address of the new pending default admin"},"details":"It can cancel an existing pending transfer by setting the `newAdmin` to `address(0)`."},"recoverFunds(address,address,uint256)":{"params":{"_to":"Address to send the recovered funds to","_from":"Address to recover funds from","_amount":"Amount of funds to recover"},"details":"Only recovers from non-allowlisted `_from` address."},"transferFrom(address,address,uint256)":{"details":"Override to add allowlist checks."},"permit(address,address,uint256,uint256,uint8,bytes32,bytes32)":{"details":"Sets `value` as the allowance of `spender` over ``owner``'s tokens, given ``owner``'s signed approval. IMPORTANT: The same issues {IERC20-approve} has related to transaction ordering also applies here. Emits an {Approval} event. Requirements: - `spender` cannot be the zero address. - `deadline` must be a timestamp in the future. - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner` over the EIP712-formatted function arguments. - the signature must use ``owner``'s current nonce (see {nonces}). For more information on the signature format, see the https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP section]. CAUTION: See Security Considerations above."}},"version":1,"custom:version":"1.0.0","stateVariables":{"DECIMALS":{"details":"Immutable decimals of the token."}}},"storageLayout":{"types":null,"storage":[]},"transientStorageLayout":null,"evm":{"bytecode":{"object":"60a03461012357601f613e5638819003918201601f19168301916001600160401b0383118484101761012757808492602094604052833981010312610123575160ff81168103610123577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16610114576002600160401b03196001600160401b038216016100ab575b50608052604051613d1a908161013c823960805181611ad90152f35b6001600160401b0319166001600160401b039081177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f61008f565b63f92ee8a960e01b5f5260045ffd5b5f80fd5b634e487b7160e01b5f52604160045260245ffdfe6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","sourceMap":"1413:3876:0:-:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3147:66:26;1413:3876:0;;;;;;7894:76:26;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;7983:34:26;7979:146;;-1:-1:-1;2002:20:0;;;1413:3876;;;;;;;;2002:20;1413:3876;;;;;;7979:146:26;-1:-1:-1;;;;;;1413:3876:0;-1:-1:-1;;;;;1413:3876:0;;;3147:66:26;1413:3876:0;;;;;;8085:29:26;;1413:3876:0;;8085:29:26;7979:146;;;7894:76;7936:23;;;-1:-1:-1;7936:23:26;;-1:-1:-1;7936:23:26;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0","linkReferences":{}},"deployedBytecode":{"object":"6080806040526004361015610012575f80fd5b5f3560e01c90816301ffc9a7146128dc5750806305a3b809146128b957806306fdde03146127d6578063077f224a14611ddd578063095ea7b314611db757806318160ddd14611d7b57806323b872dd14611bcd578063248a9ca314611b96578063282c51f314611b5c5780632f2ff15d14611afd578063313ce56714611ac05780633644e51514611a9e57806336568abe14611a5a5780633af32abf14611a035780633f4ba83a146118f657806340c10f1914611794578063570618e11461175a5780635d3590d514611711578063634e93da1461167157806370a082311461161a57806379f38738146116005780637ecebe00146115a95780638456cb591461149257806384b0196e1461125257806384ef8ffc1461120d5780638d22b8fa146110de5780639010d07c1461107157806391d148541461101b57806394d2485914610eb357806395d89b4114610d975780639c059a3514610cc55780639dc29fac14610aea578063a217fddf14610ad0578063a3246ad314610a4d578063a9059cbb14610966578063b187bd2614610925578063b2a1de22146108fc578063ca15c873146108b3578063cefc142914610685578063cf6eefb714610640578063d505accf146104ea578063d5391393146104b0578063d547741f1461045f578063da6207db1461042c578063db7db9c114610403578063dd62ed3e1461038a578063e63ab1e914610350578063f1c0c37314610326578063f515e6f2146102ec578063fb1bb9de146102b25763fe575a871461024d575f80fd5b346102ae5760203660031901126102ae5760206102a461026b612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b6040519015158152f35b5f80fd5b346102ae575f3660031901126102ae5760206040517f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a8152f35b346102ae575f3660031901126102ae5760206040517f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e98152f35b346102ae5761034c61034061033a36612a01565b90612f55565b60405191829182612a17565b0390f35b346102ae575f3660031901126102ae5760206040517f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a8152f35b346102ae5760403660031901126102ae576103a3612949565b6001600160a01b036103ed6103b661295f565b926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b91165f52602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c2583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff5f80516020613cc5833981519152541661045d6040518092612abb565bf35b346102ae5760403660031901126102ae576104ae60043561047e61295f565b906104a96104a4825f525f80516020613ca5833981519152602052600160405f20015490565b612c7f565b612ccc565b005b346102ae575f3660031901126102ae5760206040517f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a68152f35b346102ae5760e03660031901126102ae57610503612949565b61050b61295f565b604435906064359260843560ff811681036102ae5784421161062d576106036105fa6001600160a01b039283851697885f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb0060205260405f20908154916001830190556040519060208201927f6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c984528b6040840152878a1660608401528a608084015260a083015260c082015260c081526105c860e082612bb0565b5190206105d3613139565b906040519161190160f01b83526002830152602282015260c43591604260a43592206135e4565b90929192613671565b1684810361061657506104ae93506130a5565b84906325c0072360e11b5f5260045260245260445ffd5b8463313c898160e11b5f5260045260245ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416604051908152f35b346102ae575f3660031901126102ae576001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040054163381036108a15761076c906001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040154166106ff81613349565b610849575b5061070e81613499565b61079d576001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b7f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040080546001600160a01b0319169055005b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526107ee817f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd44613bd2565b506001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b5f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205261089a907f615f0f9e84155bea8cc509fe18befeb1baf65611e38a6ba60964480fb29dfd4461399b565b5082610704565b63bc07fead60e01b5f5260045260245ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052602060405f2054604051908152f35b346102ae575f3660031901126102ae5760205f80516020613c4583398151915254604051908152f35b346102ae575f3660031901126102ae57602060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054166040519015158152f35b346102ae5760403660031901126102ae5761097f612949565b60ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e576109b133612ac8565b15610a15576109bf81612ac8565b156109dd576109d2906024359033612d29565b602060405160018152f35b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b03909116600452610a109060ff16612aad565b60445ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f5233600452610a109060ff16612aad565b6313d0ff5960e31b5f5260045ffd5b346102ae5760203660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260405f206040519081602082549182815201915f5260205f20905f5b818110610aba5761034c8561034081870382612bb0565b8254845260209093019260019283019201610aa3565b346102ae575f3660031901126102ae5760206040515f8152f35b346102ae5760403660031901126102ae57610b03612949565b335f9081527ffcf1b2032b1187d9f2a29150c4a608b3b6f0bdf8dd007801f86a276af50cad926020526040902054602435919060ff1615610c8e5760ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57610b7081612ac8565b156109dd576001600160a01b03168015610c7b57805f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054828110610c62576020835f947fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef938587527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace008452036040862055807f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254037f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0255604051908152a3602060405160018152f35b9063391434e360e21b5f5260045260245260445260645ffd5b634b637e8f60e11b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a84860245260445ffd5b346102ae5760203660031901126102ae576004356003811080156102ae57610ceb612c30565b60ff5f80516020613cc583398151915254166003811015610d6c578214610d805715610d6c5760207fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd9160ff195f80516020613cc5833981519152541660ff8216175f80516020613cc583398151915255610d696040518092612abb565ba1005b634e487b7160e01b5f52602160045260245ffd5b6306379f7d60e21b5f5215610d6c5760045260245ffd5b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454610dd681612b78565b8084529060018116908115610e8f5750600114610e12575b61034c83610dfe81850382612bb0565b604051918291602083526020830190612975565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f9081527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa939250905b808210610e7557509091508101602001610dfe610dee565b919260018160209254838588010152019101909291610e5d565b60ff191660208086019190915291151560051b84019091019150610dfe9050610dee565b346102ae57610ec136612a59565b335f9081527f9e55e7b9c223644eee376bcbcf651816b24106427c658526e048949da61b2c08602052604090205460ff1615610fe4575f5b818110610f0257005b610f0d818385612fe3565b6020810190610f1b82612ff3565b15610fc557610f3a6001600160a01b03610f3483613000565b16613b0f565b15610f9257907ff93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d60206001600160a01b03610f80610f7a60019796613000565b94612ff3565b9360405194151585521692a201610ef9565b610fac610fa66001600160a01b0392613000565b92612ff3565b9163028bc2a160e41b5f5216600452151560245260445ffd5b610fdf6001600160a01b03610fd983613000565b1661384b565b610f3a565b63e2517d3f60e01b5f52336004527f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a60245260445ffd5b346102ae5760403660031901126102ae5761103461295f565b6004355f525f80516020613ca58339815191526020526001600160a01b0360405f2091165f52602052602060ff60405f2054166040519015158152f35b346102ae5760403660031901126102ae576004355f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e8237170593200060205260206001600160a01b036110c560405f2060243590613334565b90549060031b1c166001600160a01b0360405191168152f35b346102ae576110ec36612a59565b335f9081527fba39ff88303b67403ef6ce215a3cb34436a2cd98e55dc83fb141a9b583782051602052604090205460ff16156111d6575f5b81811061112d57005b611138818385612fe3565b602081019061114682612ff3565b156111b7576111656001600160a01b0361115f83613000565b16613a4c565b15610f9257907f6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac60206001600160a01b036111a5610f7a60019796613000565b9360405194151585521692a201611124565b6111d16001600160a01b036111cb83613000565b166136d1565b611165565b63e2517d3f60e01b5f52336004527f98db8a220cd0f09badce9f22d0ba7e93edb3d404448cc3560d391ab096ad16e960245260445ffd5b346102ae575f3660031901126102ae5760206001600160a01b037f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416604051908152f35b346102ae575f3660031901126102ae576040515f80516020613c6583398151915254815f61127f83612b78565b80835292600181169081156114735750600114611408575b6112a392500382612bb0565b6040515f80516020613c8583398151915254815f6112c083612b78565b80835292600181169081156113e9575060011461137e575b6112eb9192509261132294930382612bb0565b6020611330604051926112fe8385612bb0565b5f84525f368137604051958695600f60f81b875260e08588015260e0870190612975565b908582036040870152612975565b4660608501523060808501525f60a085015283810360c08501528180845192838152019301915f5b82811061136757505050500390f35b835185528695509381019392810192600101611358565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106113cd5750509060206112eb928201016112d8565b60209193508060019154838588010152019101909183926113b5565b602092506112eb94915060ff191682840152151560051b8201016112d8565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106114575750509060206112a392820101611297565b602091935080600191548385880101520191019091839261143f565b602092506112a394915060ff191682840152151560051b820101611297565b346102ae575f3660031901126102ae57335f9081527f75442b0a96088b5456bc4ed01394c96a4feec0f883c9494257d76b96ab1c9b6b602052604090205460ff1615611572577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec00054600160ff821615151461155e5760019060ff1916177f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb602060405160018152a1005b631318eb8f60e01b5f52600160045260245ffd5b63e2517d3f60e01b5f52336004527f65d7a28e3265b37a6474929f336521b332c1681b933f6cb9f3376673440d862a60245260445ffd5b346102ae5760203660031901126102ae576001600160a01b036115ca612949565b165f527f5ab42ced628888259c08ac98db1eb0cf702fc1501344311d8b100cd1bfe4bb00602052602060405f2054604051908152f35b346102ae5761034c61034061161436612a01565b90612e80565b346102ae5760203660031901126102ae576001600160a01b0361163b612949565b165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00602052602060405f2054604051908152f35b346102ae5760203660031901126102ae576001600160a01b03611692612949565b61169a612c30565b16806001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604005416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac60400557fd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b5f80a2005b346102ae5761171f366129c7565b90611728612c30565b61173183612ac8565b61173e576104ae92612d29565b6001600160a01b038363ee43699160e01b5f521660045260245ffd5b346102ae575f3660031901126102ae5760206040517f8619cecd8b9e095ab43867f5b69d492180450fe862e6b50bfbfb24b75dd84c8a8152f35b346102ae5760403660031901126102ae576117ad612949565b335f9081527f549fe2656c81d2947b3b913f0a53b9ea86c71e049f3a1b8aa23c09a8a05cb8d46020526040902054602435919060ff16156118bf576001600160a01b03169081156118ac577fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6020826118485f947f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254612e52565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace02558484527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260408420818154019055604051908152a3602060405160018152f35b63ec442f0560e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f9f2df0fed2c77648de5860a4cc508cd0818c85b8b8a1ab4ceeef8d981c8956a660245260445ffd5b346102ae575f3660031901126102ae57335f9081527f475b312747b0505dfd322c59063ca43b615bb2e6d10fdf52fb58877bbcde4011602052604090205460ff16156119cc577f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005460ff8116156119b95760ff19167f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec000557f878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb60206040515f8152a1005b631318eb8f60e01b5f525f60045260245ffd5b63e2517d3f60e01b5f52336004527f427da25fe773164f88948d3e215c94b6554e2ed5e5f203a821c9f2f6131cf75a60245260445ffd5b346102ae5760203660031901126102ae5760206102a4611a21612949565b6001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b346102ae5760403660031901126102ae57611a7361295f565b336001600160a01b03821603611a8f576104ae90600435612ccc565b63334bd91960e11b5f5260045ffd5b346102ae575f3660031901126102ae576020611ab8613139565b604051908152f35b346102ae575f3660031901126102ae57602060405160ff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346102ae5760403660031901126102ae57600435611b1961295f565b611b3e6104a4835f525f80516020613ca5833981519152602052600160405f20015490565b8115611b4d576104ae91613014565b631fe1e13d60e11b5f5260045ffd5b346102ae575f3660031901126102ae5760206040517f3c11d16cbaffd01df69ce1c404f6340ee057498f5f00246190ea54220576a8488152f35b346102ae5760203660031901126102ae576020611ab86004355f525f80516020613ca5833981519152602052600160405f20015490565b346102ae57611bdb366129c7565b9060ff7f27be0a968b102c71096101138efa2fc0db00aea7b287f10fdc298bfd2d4ec0005416610a3e57611c0e33612ac8565b15610a1557611c1c83612ac8565b15611d4957611c2a81612ac8565b156109dd57611c69836001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f5260205260405f2054925f198410611c91575b6109d29350612d29565b828410611d2e576001600160a01b03811615611d1b573315611d08576109d293611ceb826001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b6001600160a01b0333165f526020528360405f2091039055611c87565b634a1406b160e11b5f525f60045260245ffd5b63e602df0560e01b5f525f60045260245ffd5b8284637dc7a0d960e11b5f523360045260245260445260645ffd5b5f80516020613cc58339815191525463f29c5dc760e01b5f526001600160a01b038416600452610a109060ff16612aad565b346102ae575f3660031901126102ae5760207f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0254604051908152f35b346102ae5760403660031901126102ae576109d2611dd3612949565b60243590336130a5565b346102ae5760603660031901126102ae5760043567ffffffffffffffff81116102ae57611e0e903690600401612999565b9060243567ffffffffffffffff81116102ae57611e2f903690600401612999565b9091604435936001600160a01b038516928386036102ae577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460ff8160401c16159567ffffffffffffffff8216801590816127ce575b60011490816127c4575b1590816127bb575b506127ac5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0055611eec918761276d575b50611ee4368587612bd2565b923691612bd2565b90611ef5613067565b611efd613067565b80519067ffffffffffffffff82116123e5578190611f3b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0354612b78565b601f81116126e0575b50602090601f831160011461263c575f92612631575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace03555b80519067ffffffffffffffff82116123e557611fca7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0454612b78565b601f81116125af575b50602090601f83116001146125075761202c949392915f91836124fc575b50508160011b915f199060031b1c1916177f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace04555b3691612bd2565b92612035613067565b6040938451906120458683612bb0565b60018252603160f81b602083015261205b613067565b80519067ffffffffffffffff82116123e55781906120865f80516020613c6583398151915254612b78565b601f8111612482575b50602090601f8311600114612404575f926123f9575b50508160011b915f199060031b1c1916175f80516020613c65833981519152555b80519067ffffffffffffffff82116123e55781906120f15f80516020613c8583398151915254612b78565b601f811161236b575b50602090601f83116001146122ed575f926122e2575b50508160011b915f199060031b1c1916175f80516020613c85833981519152555b612139613067565b612141613067565b81156122cf57806121a96121ae926001600160a01b03166001600160a01b03197f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac604015416177f9ab055b8fb8e38b861ceee93a65f20f7a2382a86570a6abe934fe7edfac6040155565b613499565b612295575b506121bc613067565b6121c4613067565b600160ff195f80516020613cc58339815191525416175f80516020613cc5833981519152557fe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd6020835160018152a161221957005b60207fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29168ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0054167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00555160018152a1005b6122c8905f80527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e82371705932000602052835f20613bd2565b50826121b3565b63f0aa091960e01b5f525f60045260245ffd5b015190508680612110565b5f80516020613c858339815191525f9081528281209350601f198516905b818110612353575090846001959493921061233b575b505050811b015f80516020613c8583398151915255612131565b01515f1960f88460031b161c19169055868080612321565b9293602060018192878601518155019501930161230b565b5f80516020613c858339815191525f529091507f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b75601f840160051c810191602085106123db575b90601f859493920160051c01905b8181106123cd57506120fa565b5f81558493506001016123c0565b90915081906123b2565b634e487b7160e01b5f52604160045260245ffd5b0151905087806120a5565b5f80516020613c658339815191525f9081528281209350601f198516905b81811061246a5750908460019594939210612452575b505050811b015f80516020613c65833981519152556120c6565b01515f1960f88460031b161c19169055878080612438565b92936020600181928786015181550195019301612422565b5f80516020613c658339815191525f529091507f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d601f840160051c810191602085106124f2575b90601f859493920160051c01905b8181106124e4575061208f565b5f81558493506001016124d7565b90915081906124c9565b015190508880611ff1565b90601f198316917f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f52815f20925f5b818110612597575091600193918561202c989796941061257f575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0455612025565b01515f1960f88460031b161c19169055888080612552565b92936020600181928786015181550195019301612537565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace045f527f46a2803e59a4de4e7a4c574b1243f25977ac4c77d5a1a4a609b5394cebb4a2aa601f840160051c81019160208510612627575b601f0160051c01905b81811061261c5750611fd3565b5f815560010161260f565b9091508190612606565b015190508880611f5a565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081528281209350601f198516905b8181106126c857509084600195949392106126b0575b505050811b017f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0355611f8e565b01515f1960f88460031b161c19169055888080612683565b9293602060018192878601518155019501930161266d565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f529091507f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0601f840160051c81019160208510612763575b90601f859493920160051c01905b8181106127555750611f44565b5f8155849350600101612748565b909150819061273a565b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005588611ed8565b63f92ee8a960e01b5f5260045ffd5b90501589611e98565b303b159150611e90565b889150611e86565b346102ae575f3660031901126102ae576040515f7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035461281581612b78565b8084529060018116908115610e8f575060011461283c5761034c83610dfe81850382612bb0565b7f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace035f9081527f2ae08a8e29253f69ac5d979a101956ab8f8d9d7ded63fa7a83b16fc47648eab0939250905b80821061289f57509091508101602001610dfe610dee565b919260018160209254838588010152019101909291612887565b346102ae5760203660031901126102ae5760206102a46128d7612949565b612ac8565b346102ae5760203660031901126102ae576004359063ffffffff60e01b82168092036102ae57602091635a05180f60e01b811490811561291e575b5015158152f35b637965db0b60e01b811491508115612938575b5083612917565b6301ffc9a760e01b14905083612931565b600435906001600160a01b03821682036102ae57565b602435906001600160a01b03821682036102ae57565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156102ae5782359167ffffffffffffffff83116102ae57602083818601950101116102ae57565b60609060031901126102ae576004356001600160a01b03811681036102ae57906024356001600160a01b03811681036102ae579060443590565b60409060031901126102ae576004359060243590565b60206040818301928281528451809452019201905f5b818110612a3a5750505090565b82516001600160a01b0316845260209384019390920191600101612a2d565b9060206003198301126102ae5760043567ffffffffffffffff81116102ae57826023820112156102ae5780600401359267ffffffffffffffff84116102ae5760248460061b830101116102ae576024019190565b6003811015610d6c57602452565b906003821015610d6c5752565b60ff5f80516020613cc583398151915254166003811015610d6c578015612b7157600114612b3057612b2d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054151590565b90565b612b6d906001600160a01b03165f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054151590565b1590565b5050600190565b90600182811c92168015612ba6575b6020831014612b9257565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612b87565b90601f8019910116810190811067ffffffffffffffff8211176123e557604052565b92919267ffffffffffffffff82116123e55760405191612bfc601f8201601f191660200184612bb0565b8294818452818301116102ae578281602093845f960137010152565b67ffffffffffffffff81116123e55760051b60200190565b335f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff1615612c6857565b63e2517d3f60e01b5f52336004525f60245260445ffd5b805f525f80516020613ca583398151915260205260405f206001600160a01b0333165f5260205260ff60405f20541615612cb65750565b63e2517d3f60e01b5f523360045260245260445ffd5b8015611b4d57612cdc82826133f6565b9182612ce757505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f2091169061399b565b5090565b6001600160a01b0316908115610c7b576001600160a01b03169182156118ac57815f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0060205260405f2054818110612e0757817fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef92602092855f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0084520360405f2055845f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace00825260405f20818154019055604051908152a3565b8263391434e360e21b5f5260045260245260445260645ffd5b90612e2a82612c18565b612e376040519182612bb0565b8281528092612e48601f1991612c18565b0190602036910137565b91908201809211612e5f57565b634e487b7160e01b5f52601160045260245ffd5b91908203918211612e5f57565b91905f80516020613c45833981519152549081841015612f3957612eb891612ea9859283612e52565b90808211612f31575b50612e73565b612ec181612e20565b925f5b828110612ed057505050565b6001600160a01b03612ef8612ee58385612e52565b5f80516020613c45833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612ec4565b634e487b7160e01b5f52603260045260245ffd5b90505f612eb2565b50509050604051612f4b602082612bb0565b5f81525f36813790565b91905f80516020613c25833981519152549081841015612f3957612f7e91612ea9859283612e52565b612f8781612e20565b925f5b828110612f9657505050565b6001600160a01b03612fbe612fab8385612e52565b5f80516020613c25833981519152613334565b90549060031b1c16908551811015612f1d5760019160208260051b8801015201612f8a565b9190811015612f1d5760061b0190565b3580151581036102ae5790565b356001600160a01b03811681036102ae5790565b61301e8282613543565b918261302957505090565b612d25915f527fc1f6fe24621ce81ec5827caf0253cadb74709b061630e6b55e823717059320006020526001600160a01b0360405f20911690613bd2565b60ff7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005460401c161561309657565b631afcd79f60e31b5f5260045ffd5b916001600160a01b038316918215611d1b576001600160a01b0316928315611d08577f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925916131256020926001600160a01b03165f527f52c63247e1f47db19d5ce0460030c497f067ca4cebf71ba98eeadabe20bace0160205260405f2090565b855f5282528060405f2055604051908152a3565b6040515f80516020613c6583398151915254905f8161315784612b78565b9182825260208201946001811690815f1461331857506001146132ad575b61318192500382612bb0565b5190206040515f80516020613c8583398151915254905f816131a284612b78565b9182825260208201946001811690815f146132915750600114613226575b6131cc92500382612bb0565b5190206040519060208201927f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f8452604083015260608201524660808201523060a082015260a0815261322060c082612bb0565b51902090565b505f80516020613c858339815191525f90815290917f5f9ce34815f8e11431c7bb75a8e6886a91478f7ffc1dbb0a98dc240fddd76b755b8183106132755750509060206131cc928201016131c0565b602091935080600191548385880101520191019091839261325d565b60ff19168652506131cc92151560051b820160200190506131c0565b505f80516020613c658339815191525f90815290917f42ad5d3e1f2e6e70edcf6d991b8a3023d3fca8047a131592f9edb9fd9b89d57d5b8183106132fc57505090602061318192820101613175565b60209193508060019154838588010152019101909183926132e4565b60ff191686525061318192151560051b82016020019050613175565b8054821015612f1d575f5260205f2001905f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff16156133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191690553391907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b8180a4600190565b505f90565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f2054165f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f2060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b5f80a4600190565b50505f90565b6001600160a01b0381165f9081527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d602052604090205460ff166133f1576001600160a01b03165f8181527fb7db2dd08fcb62d0c9e08c51941cae53c267786a0b75803fb7960902fc8ef97d60205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260ff60405f205416155f1461349357805f525f80516020613ca583398151915260205260405f206001600160a01b0383165f5260205260405f20600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d5f80a4600190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411613666579160209360809260ff5f9560405194855216868401526040830152606082015282805260015afa1561365b575f516001600160a01b0381161561365157905f905f90565b505f906001905f90565b6040513d5f823e3d90fd5b5050505f9160039190565b6004811015610d6c5780613683575050565b6001810361369a5763f645eedf60e01b5f5260045ffd5b600281036136b5575063fce698f760e01b5f5260045260245ffd5b6003146136bf5750565b6335e2f38360e21b5f5260045260245ffd5b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260409020548015613493575f198101818111612e5f575f80516020613c25833981519152545f19810191908211612e5f578181036137c6575b5050505f80516020613c258339815191525480156137b2575f1901613764815f80516020613c25833981519152613334565b8154905f199060031b1b191690555f80516020613c25833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e026020525f6040812055600190565b634e487b7160e01b5f52603160045260245ffd5b6138166137e3613800935f80516020613c25833981519152613334565b90549060031b1c9283925f80516020613c25833981519152613334565b819391549060031b91821b915f19901b19161790565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f20555f8080613732565b5f8181527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260409020548015613493575f198101818111612e5f575f80516020613c45833981519152545f19810191908211612e5f5781810361392c575b5050505f80516020613c458339815191525480156137b2575f19016138de815f80516020613c45833981519152613334565b8154905f199060031b1b191690555f80516020613c45833981519152555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e046020525f6040812055600190565b613966613949613800935f80516020613c45833981519152613334565b90549060031b1c9283925f80516020613c45833981519152613334565b90555f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f20555f80806138ac565b906001820191815f528260205260405f20548015155f14613a44575f198101818111612e5f5782545f19810191908211612e5f57818103613a0f575b505050805480156137b2575f1901906139f08282613334565b8154905f199060031b1b19169055555f526020525f6040812055600190565b613a2f613a1f6138009386613334565b90549060031b1c92839286613334565b90555f528360205260405f20555f80806139d7565b505050505f90565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2054155f146133f1575f80516020613c2583398151915254680100000000000000008110156123e557613acd6138008260018594015f80516020613c25833981519152555f80516020613c25833981519152613334565b90555f80516020613c2583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0260205260405f2055600190565b805f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2054155f146133f1575f80516020613c4583398151915254680100000000000000008110156123e557613b906138008260018594015f80516020613c45833981519152555f80516020613c45833981519152613334565b90555f80516020613c4583398151915254905f527fa9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e0460205260405f2055600190565b5f82815260018201602052604090205461349357805490680100000000000000008210156123e55782613c0f613800846001809601855584613334565b90558054925f520160205260405f205560019056fea9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e01a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e03a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d102a16a46d94261c7517cc8ff89f61c0ce93598e3c849801011dee649a6a557d10302dd7bc7dec4dceedda775e58dd541e08a116c6c53815c0bd028192f7b626800a9f917c522fb3fd8673bbc655e92a5c1f1ee3df7bf7ad06a1821b937d0205e00a26469706673582212202a6f192d544d3dc80bce592a3e00a6807d9ecd56cf2d4868e60e26b05a8ffcc664736f6c634300081a0033","sourceMap":"1413:3876:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;2998:168:8;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;882:26:12;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;883:29:9;1413:3876:0;;;;;;;;4396:63:8;1413:3876:0;;;:::i;:::-;4396:63:8;;:::i;:::-;1413:3876:0;;;;;;;:::i;:::-;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;762:24:12;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;-1:-1:-1;;;;;4789:20:16;1413:3876:0;;:::i;:::-;4789:20:16;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;4789:20:16;:29;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;:::i;:::-;;;;;;;;-1:-1:-1;;1413:3876:0;;;;5765:26:13;1413:3876:0;;;;:::i;:::-;5735:18:13;3223:4;5735:18;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;5735:18;3223:4;:::i;:::-;5765:26;:::i;:::-;1413:3876:0;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1689:24;1413:3876;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;:::i;:::-;;;;;;;;;;;;;;;;2301:15:17;;:26;2297:97;;9031:8:37;8977:25;-1:-1:-1;;;;;1413:3876:0;;;;;;;;993:64:19;1413:3876:0;;;;;;;;;;;;;;;;2435:78:17;1413:3876:0;2435:78:17;;1413:3876:0;1294:95:17;1413:3876:0;;1294:95:17;1413:3876:0;1294:95:17;;1413:3876:0;;;;;1294:95:17;;1413:3876:0;1294:95:17;1413:3876:0;1294:95:17;;1413:3876:0;;1294:95:17;;1413:3876:0;;1294:95:17;;1413:3876:0;;2435:78:17;;;1413:3876:0;2435:78:17;;:::i;:::-;1413:3876:0;2425:89:17;;3785:23:20;;:::i;:::-;4037:249:38;1413:3876:0;4037:249:38;;-1:-1:-1;;;4037:249:38;;;;;;;;;;1413:3876:0;;;4037:249:38;1413:3876:0;;4037:249:38;;8977:25:37;:::i;:::-;9031:8;;;;;:::i;:::-;1413:3876:0;2638:15:17;;;2634:88;;10039:4:16;;;;;:::i;2634:88:17:-;2676:35;;;;;1413:3876:0;2676:35:17;1413:3876:0;;;;;;2676:35:17;2297:97;2350:33;;;;1413:3876:0;2350:33:17;1413:3876:0;;;;2350:33:17;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;2081:81:7;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;2081:81:7;1413:3876:0;;987:10:18;4214:28:7;;4210:101;;4505:37;1413:3876:0;-1:-1:-1;;;;;4411:22:7;1413:3876:0;;4711:32:14;;;:::i;:::-;4753:74;;1413:3876:0;4259:31:14;;;;:::i;:::-;4300:71;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;4505:37:7;2081:81;1413:3876:0;;-1:-1:-1;;;;;;1413:3876:0;;;;4300:71:14;1413:3876:0;;;1469:81:14;1413:3876:0;;15182:50:43;1413:3876:0;;15182:50:43;:::i;:::-;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;4753:74:14;1413:3876:0;;;1469:81:14;1413:3876:0;;15503:53:43;;1413:3876:0;15503:53:43;:::i;:::-;;4753:74:14;;;4210:101:7;4265:35;;;1413:3876:0;4265:35:7;1413:3876:0;;;;4265:35:7;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;1274:65:11;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;4088:10:0;2684:20:8;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;4563:5:16;1413:3876:0;;;4088:10;;4563:5:16;:::i;:::-;1413:3876:0;;;;;;;2679:72:8;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;:::i;:::-;;;2713:38:8;2679:72;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;4088:10:0;1413:3876;;;;;;;:::i;1892:33:11:-;1917:8;;;1413:3876:0;1917:8:11;1413:3876:0;;1917:8:11;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;;;:::i;:::-;2683:21;2679:72;;-1:-1:-1;;;;;1413:3876:0;9251:21:16;;9247:89;;1413:3876:0;;;2049:63:16;1413:3876:0;;;;;;7531:19:16;;;7527:115;;1413:3876:0;;;;8280:25:16;1413:3876:0;;;;2049:63:16;1413:3876:0;;;;;;;;8003:14:16;1413:3876:0;;8003:14:16;1413:3876:0;;;;;;8280:25:16;1413:3876:0;;;;;;;7527:115:16;7577:50;;;;1413:3876:0;7577:50:16;1413:3876:0;;;;;;;;7577:50:16;9247:89;9295:30;;;1413:3876:0;9295:30:16;1413:3876:0;;;;;9295:30:16;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1799:24;1413:3876;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;3223:4:13;;:::i;:::-;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;5096:15:8;;5092:49;;1413:3876:0;;;;5180:27:8;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;:::i;:::-;5180:27:8;1413:3876:0;;;;;;;;;;;;;5092:49:8;-1:-1:-1;;;1413:3876:0;5120:21:8;1413:3876:0;;;;;;;5120:21:8;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;3104:9:16;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;:::i;:::-;3104:9:16;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;5595:18:8;;;;;;1413:3876:0;5615:3:8;5669:10;;;;;:::i;:::-;1413:3876:0;5730:15:8;;;;;;:::i;:::-;;;;15182:50:43;-1:-1:-1;;;;;5803:10:8;;;:::i;:::-;1413:3876:0;15182:50:43;:::i;:::-;5937:15:8;5933:81;;6050:10;6033:45;1413:3876:0;-1:-1:-1;;;;;6062:15:8;6050:10;1413:3876:0;6050:10:8;;;:::i;:::-;6062:15;;:::i;:::-;1413:3876:0;;;;;;;;;6033:45:8;;1413:3876:0;5580:13:8;;5933:81;5998:15;5986:10;-1:-1:-1;;;;;5986:10:8;;:::i;:::-;5998:15;;:::i;:::-;6842:53;;;;1413:3876:0;5961:53:8;1413:3876:0;;;;;;;;;5961:53:8;5726:194;15503:53:43;-1:-1:-1;;;;;5894:10:8;;;:::i;:::-;1413:3876:0;15503:53:43;:::i;:::-;5726:194:8;;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1026:29:9;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;;;3899:31:13;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;1469:81:14;1413:3876:0;;;-1:-1:-1;;;;;5894:18:43;1413:3876:0;;;;;5894:18:43;;:::i;:::-;1413:3876:0;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1413:3876:0;6476:18:8;;;;;;1413:3876:0;6496:3:8;6550:10;;;;;:::i;:::-;1413:3876:0;6611:15:8;;;;;;:::i;:::-;;;;15182:50:43;-1:-1:-1;;;;;6684:10:8;;;:::i;:::-;1413:3876:0;15182:50:43;:::i;:::-;6818:15:8;6814:81;;6931:10;6914:45;1413:3876:0;-1:-1:-1;;;;;6943:15:8;6931:10;1413:3876:0;6931:10:8;;;:::i;6943:15::-;1413:3876:0;;;;;;;;;6914:45:8;;1413:3876:0;6461:13:8;;6607:194;15503:53:43;-1:-1:-1;;;;;6775:10:8;;;:::i;:::-;1413:3876:0;15503:53:43;:::i;:::-;6607:194:8;;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;883:29:9;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;-1:-1:-1;;;;;3275:52:7;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;:::i;:::-;5294:13:20;1413:3876:0;;;;5329:4:20;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1274:65:11;1413:3876:0;3224:4:11;1413:3876:0;;;;;2828:19:11;2824:61;;3224:4;1413:3876:0;;;;;1274:65:11;1413:3876:0;2928:17:11;1413:3876:0;;;3224:4:11;1413:3876:0;;2928:17:11;1413:3876:0;2824:61:11;2856:29;;;1413:3876:0;2856:29:11;3224:4;1413:3876:0;;;;2856:29:11;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;762:24:12;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;;;;993:64:19;1413:3876:0;;;;;;;;;;;;;;;;;;4647:63:8;1413:3876:0;;;:::i;:::-;4647:63:8;;:::i;1413:3876:0:-;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;;;;2049:63:16;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;:::i;:::-;3223:4:13;;:::i;:::-;1413:3876:0;;-1:-1:-1;;;;;;2081:81:7;1413:3876:0;;;2081:81:7;1413:3876:0;3906:38:7;1413:3876:0;3906:38:7;;1413:3876:0;;;;;;;;:::i;:::-;3223:4:13;;;:::i;:::-;5170:20:0;;;:::i;:::-;5166:68;;5272:7;;;:::i;5166:68::-;-1:-1:-1;;;;;5199:35:0;;;;1413:3876;5199:35;1413:3876;;;;;5199:35;1413:3876;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1026:29:9;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;1413:3876:0;;;;;;;;;;;;;;;;;4466:23:13;4462:108;;-1:-1:-1;;;;;1413:3876:0;8725:21:16;;;8721:91;;8280:25;1413:3876:0;;7420:23:16;1413:3876:0;;7420:14:16;1413:3876:0;7420:23:16;:::i;:::-;:14;1413:3876:0;;;;2049:63:16;1413:3876:0;;;;;;;;;;;;;;;;8280:25:16;1413:3876:0;;;;;;;8721:91:16;8769:32;;;1413:3876:0;8769:32:16;1413:3876:0;;;;;8769:32:16;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;1689:24;1413:3876;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;1274:65:11;1413:3876:0;;;;;2824:61:11;;1413:3876:0;;;1274:65:11;1413:3876:0;2928:17:11;1413:3876:0;;;;;;2928:17:11;1413:3876:0;2824:61:11;2856:29;;;1413:3876:0;2856:29:11;1413:3876:0;;;;;2856:29:11;4462:108:13;4512:47;;;1413:3876:0;4512:47:13;987:10:18;1413:3876:0;;882:26:12;1413:3876:0;;;;4512:47:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;3218:168:8;;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;987:10:18;-1:-1:-1;;;;;1413:3876:0;;6439:34:13;6435:102;;6547:37;1413:3876:0;;;6547:37:13;:::i;6435:102::-;6496:30;;;1413:3876:0;6496:30:13;1413:3876:0;;6496:30:13;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;3785:23:20;;:::i;:::-;1413:3876:0;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;3801:8;1413:3876;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;3223:4:13;5318:18;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;3223:4;4877:26:7;;4873:104;;4993:31;;;:::i;4873:104::-;4926:40;;;1413:3876:0;4926:40:7;1413:3876:0;;4926:40:7;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;1799:24;1413:3876;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;4917:24:13;1413:3876:0;-1:-1:-1;1413:3876:0;4917:24:13;1413:3876:0;4757:191:13;;1413:3876:0;;;;;;;:::i;:::-;;;1274:65:11;1413:3876:0;;1892:33:11;;2684:20:8;4507:10:0;2684:20:8;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;2684:20;;;:::i;:::-;2683:21;2679:72;;4789:20:16;;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;4789:20:16;-1:-1:-1;;;;;4507:10:0;1413:3876;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;11834:36:16;;11830:309;;1413:3876:0;6120:5:16;;;;:::i;11830:309::-;11890:24;;;11886:130;;-1:-1:-1;;;;;1413:3876:0;;11065:19:16;11061:89;;4507:10:0;11163:21:16;11159:90;;6120:5;11258:20;;;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;11258:20:16;-1:-1:-1;;;;;4507:10:0;1413:3876;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;11830:309:16;;11159:90;11207:31;;;1413:3876:0;11207:31:16;1413:3876:0;;;;;11207:31:16;11061:89;11107:32;;;1413:3876:0;11107:32:16;1413:3876:0;;;;;11107:32:16;11886:130;11941:60;;;;;1413:3876:0;11941:60:16;4507:10:0;1413:3876;;;;;;;;11941:60:16;2679:72:8;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;1413:3876:0;2713:38:8;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;:::i;:::-;;;;;;-1:-1:-1;;1413:3876:0;;;;;3999:14:16;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;10039:4:16;1413:3876:0;;:::i;:::-;;;987:10:18;;10039:4:16;:::i;1413:3876:0:-;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;:::i;:::-;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;3147:66:26;1413:3876:0;;;;;;4301:16:26;1413:3876:0;;;;4724:16:26;;:34;;;;1413:3876:0;4803:1:26;4788:16;:50;;;;1413:3876:0;4853:13:26;:30;;;;1413:3876:0;4849:91:26;;;-1:-1:-1;;1413:3876:0;;4803:1:26;1413:3876:0;3147:66:26;1413:3876:0;;;;4977:67:26;;1413:3876:0;;;;;;;:::i;:::-;;;;;:::i;:::-;6891:76:26;;;:::i;:::-;;;:::i;:::-;1413:3876:0;;;;;;;;;;;2599:7:16;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;2624:9:16;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;2624:9:16;1413:3876:0;;;;;:::i;:::-;6891:76:26;;;:::i;:::-;1413:3876:0;;;;;;;;;:::i;:::-;4803:1:26;1413:3876:0;;-1:-1:-1;;;1413:3876:0;;;;6891:76:26;;:::i;:::-;1413:3876:0;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;6891:76:26;;:::i;:::-;;;:::i;:::-;2714:34:7;;2710:103;;2901:45;;4259:31:14;2901:45:7;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;;;;;;2901:22:7;1413:3876:0;;;2901:22:7;1413:3876:0;;2901:45:7;4259:31:14;:::i;:::-;4300:71;;1413:3876:0;6891:76:26;;;:::i;:::-;;;:::i;:::-;4803:1;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;2471:27:8;1413:3876:0;;;4803:1:26;1413:3876:0;;2471:27:8;5064:101:26;;1413:3876:0;5064:101:26;1413:3876:0;5140:14:26;1413:3876:0;;;3147:66:26;1413:3876:0;;3147:66:26;1413:3876:0;;4803:1:26;1413:3876:0;;5140:14:26;1413:3876:0;4300:71:14;15182:50:43;1413:3876:0;;;;1469:81:14;1413:3876:0;;;;;15182:50:43;:::i;:::-;;4300:71:14;;;2710:103:7;2771:31;;;1413:3876:0;2771:31:7;1413:3876:0;;;;;2771:31:7;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;2624:9:16;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;1413:3876:0;;;;;2599:7:16;1413:3876:0;;;;;;;;-1:-1:-1;;;1413:3876:0;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;2599:7:16;1413:3876:0;;;;;;;;;;;;;;;;4803:1:26;1413:3876:0;;;;;;;;;;;;;;;;2599:7:16;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;4803:1:26;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;4977:67:26;-1:-1:-1;;1413:3876:0;;;3147:66:26;1413:3876:0;4977:67:26;;;4849:91;4906:23;;;1413:3876:0;4906:23:26;1413:3876:0;;4906:23:26;4853:30;4870:13;;;4853:30;;;4788:50;4816:4;4808:25;:30;;-1:-1:-1;4788:50:26;;4724:34;;;-1:-1:-1;4724:34:26;;1413:3876:0;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;2845:7:16;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;2845:7:16;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;1869:57:14;;;:97;;;;1413:3876:0;;;;;;;1869:97:14;-1:-1:-1;;;3549:47:13;;;-1:-1:-1;3549:87:13;;;;1869:97:14;;;;;3549:87:13;-1:-1:-1;;;1119:40:21;;-1:-1:-1;3549:87:13;;;1413:3876:0;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;:::o;:::-;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;;1413:3876:0;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;:::o;:::-;;;;;;;;;:::o;3438:389:8:-;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;3596:33:8;;3592:50;;1413:3876:0;3656:38:8;3652:72;;3800:20;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;3218:168:8;;3800:20;3438:389;:::o;3652:72::-;3704:20;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;5238:14:43;1413:3876:0;;;-1:-1:-1;1413:3876:0;;5238:26:43;;2998:168:8;;3704:20;3703:21;3696:28;:::o;3592:50::-;3631:11;;1413:3876:0;3631:11:8;:::o;1413:3876:0:-;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;:::o;:::-;;;;;;;;;;;:::o;4146:103:13:-;987:10:18;1413:3876:0;;;;;;;;;;;;;4466:23:13;4462:108;;4146:103::o;4462:108::-;4512:47;;;1413:3876:0;4512:47:13;987:10:18;4512:47:13;1413:3876:0;;;;;;4512:47:13;4146:103;1413:3876:0;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;-1:-1:-1;1413:3876:0;-1:-1:-1;;;;;987:10:18;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;4466:23:13;4462:108;;4146:103;:::o;4462:108::-;4512:47;;;-1:-1:-1;4512:47:13;987:10:18;4512:47:13;1413:3876:0;;;;-1:-1:-1;4512:47:13;5170:262:7;5277:26;;5273:104;;4711:32:14;;;;:::i;:::-;4753:74;;;;4836:14;;5170:262:7;:::o;4753:74:14:-;15503:53:43;1413:3876:0;2383:4:13;1413:3876:0;1469:81:14;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;2383:4:13;1413:3876:0;;;15503:53:43;;:::i;:::-;;5170:262:7;:::o;6527:300:16:-;-1:-1:-1;;;;;1413:3876:0;6610:18:16;;;6606:86;;-1:-1:-1;;;;;1413:3876:0;6705:16:16;;;6701:86;;1413:3876:0;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;6626:1:16;1413:3876:0;;7531:19:16;;;7527:115;;1413:3876:0;8280:25:16;1413:3876:0;;;;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;;6626:1:16;1413:3876:0;;;6626:1:16;1413:3876:0;2049:63:16;1413:3876:0;;;6626:1:16;1413:3876:0;;;;;;;;;;;;8280:25:16;6527:300::o;7527:115::-;7577:50;;;;6626:1;7577:50;;1413:3876:0;;;;;;6626:1:16;7577:50;1413:3876:0;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;;;;:::i;:::-;;;;;;;;:::o;:::-;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;:::o;824:609:10:-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;1049:16:10;;;;;1045:70;;1251:13;1139:16;;;;;;:::i;:::-;1169:11;;;;1165:53;;824:609;1251:13;;:::i;:::-;1286:27;;;:::i;:::-;1329:13;-1:-1:-1;1344:16:10;;;;;;824:609;;;:::o;1362:3::-;-1:-1:-1;;;;;5894:18:43;1404:11:10;;;;:::i;:::-;-1:-1:-1;;;;;;;;;;;5894:18:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;1329:13:10;;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;1165:53:10;1196:11;;1165:53;;;1045:70;1413:3876:0;;;;;;;;;;:::i;:::-;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;1081:23:10;:::o;824:609::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;1049:16:10;;;;;1045:70;;1251:13;1139:16;;;;;;:::i;1251:13::-;1286:27;;;:::i;:::-;1329:13;-1:-1:-1;1344:16:10;;;;;;824:609;;;:::o;1362:3::-;-1:-1:-1;;;;;5894:18:43;1404:11:10;;;;:::i;:::-;-1:-1:-1;;;;;;;;;;;5894:18:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;1329:13:10;;1413:3876:0;;;;;;;;;;;;:::o;:::-;;;;;;;;;;:::o;:::-;;-1:-1:-1;;;;;1413:3876:0;;;;;;;:::o;4053:348:14:-;4259:31;;;;:::i;:::-;4300:71;;;;4380:14;;4053:348;:::o;4300:71::-;15182:50:43;1413:3876:0;-1:-1:-1;1413:3876:0;1469:81:14;1413:3876:0;;-1:-1:-1;;;;;1413:3876:0;-1:-1:-1;1413:3876:0;;;15182:50:43;;:::i;7082:141:26:-;1413:3876:0;3147:66:26;1413:3876:0;;;;7148:18:26;7144:73;;7082:141::o;7144:73::-;7189:17;;;-1:-1:-1;7189:17:26;;-1:-1:-1;7189:17:26;10900:487:16;;-1:-1:-1;;;;;1413:3876:0;;11065:19:16;;;11061:89;;-1:-1:-1;;;;;1413:3876:0;11163:21:16;;;11159:90;;11339:31;11258:20;;1413:3876:0;11258:20:16;-1:-1:-1;;;;;1413:3876:0;;;4789:13:16;1413:3876:0;;;;;;;11258:20:16;1413:3876:0;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;;;;;11339:31:16;10900:487::o;3821:191:20:-;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;6463:31:20;;1413:3876:0;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;6801:34:20;;1413:3876:0;;3912:92:20;1413:3876:0;3912:92:20;;1413:3876:0;1977:95:20;1413:3876:0;;;1977:95:20;;1413:3876:0;1977:95:20;;;1413:3876:0;3975:13:20;1977:95;;;1413:3876:0;3998:4:20;1977:95;;;1413:3876:0;1977:95:20;3912:92;;;;;;:::i;:::-;1413:3876:0;3902:103:20;;3821:191;:::o;1413:3876:0:-;-1:-1:-1;;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;-1:-1:-1;1413:3876:0;;-1:-1:-1;1413:3876:0;;;-1:-1:-1;1413:3876:0;:::o;7892:388:13:-;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;;;987:10:18;;1413:3876:0;8155:40:13;1413:3876:0;;8155:40:13;1413:3876:0;8209:11:13;:::o;8055:219::-;8251:12;1413:3876:0;8251:12:13;:::o;7892:388::-;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;8055:219:13;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;;;;;;;;-1:-1:-1;;;;;987:10:18;1413:3876:0;;8155:40:13;;1413:3876:0;8155:40:13;;1413:3876:0;8209:11:13;:::o;8055:219::-;8251:12;;1413:3876:0;8251:12:13;:::o;7268:387::-;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;1413:3876:0;;;;;;;;;;;;;-1:-1:-1;;1413:3876:0;7507:4:13;1413:3876:0;;;987:10:18;;1413:3876:0;7530:40:13;1413:3876:0;;7530:40:13;7507:4;7584:11;:::o;7268:387::-;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;;-1:-1:-1;1413:3876:0;;;7434:23:13;7430:219;1413:3876:0;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;;;;1413:3876:0;;-1:-1:-1;1413:3876:0;;;;-1:-1:-1;1413:3876:0;7507:4:13;1413:3876:0;;;;;;;;-1:-1:-1;;;;;987:10:18;1413:3876:0;;7530:40:13;;1413:3876:0;7530:40:13;;7507:4;7584:11;:::o;7129:1551:37:-;;;8209:66;8196:79;;8192:164;;1413:3876:0;;;;;;-1:-1:-1;1413:3876:0;;;;;;;;;;;;;;;;;;;8467:24:37;;;;;;;;;-1:-1:-1;8467:24:37;-1:-1:-1;;;;;1413:3876:0;;8505:20:37;8501:113;;8624:49;-1:-1:-1;8624:49:37;-1:-1:-1;7129:1551:37;:::o;8501:113::-;8541:62;-1:-1:-1;8541:62:37;8467:24;8541:62;-1:-1:-1;8541:62:37;:::o;8467:24::-;1413:3876:0;;;-1:-1:-1;1413:3876:0;;;;;8192:164:37;8291:54;;;8307:1;8291:54;8311:30;8291:54;;:::o;11617:532::-;1413:3876:0;;;;;;11703:29:37;;;11748:7;;:::o;11699:444::-;1413:3876:0;11799:38:37;;1413:3876:0;;11860:23:37;;;11712:20;11860:23;1413:3876:0;11712:20:37;11860:23;11795:348;11913:35;11904:44;;11913:35;;11971:46;;;;11712:20;11971:46;1413:3876:0;;;11712:20:37;11971:46;11900:243;12047:30;12038:39;12034:109;;11900:243;11617:532::o;12034:109::-;12100:32;;;11712:20;12100:32;1413:3876:0;;;11712:20:37;12100:32;3112:1368:43;1413:3876:0;;;;3307:14:43;1413:3876:0;;;;;;3343:13:43;;;;-1:-1:-1;;1413:3876:0;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;3307:14:43;1413:3876:0;;;;;;;3307:14:43;4409:11;:::o;1413:3876:0:-;;;;;;;;;;;;3814:378:43;1413:3876:0;3881:22:43;4002:23;3881:22;-1:-1:-1;;;;;;;;;;;3881:22:43;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;-1:-1:-1;;;;;;;;;;;4002:23:43;:::i;:::-;1413:3876:0;;;;;;;;;;;;;;;;;;;;;;;;;3307:14:43;1413:3876:0;;;;;;3814:378:43;;;;;3112:1368;1413:3876:0;;;;3307:14:43;1413:3876:0;;;;;;3343:13:43;;;;-1:-1:-1;;1413:3876:0;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;-1:-1:-1;;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;;;;;;;;;;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;3307:14:43;1413:3876:0;;;;;;;3307:14:43;4409:11;:::o;3814:378::-;1413:3876:0;3881:22:43;4002:23;3881:22;-1:-1:-1;;;;;;;;;;;3881:22:43;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;-1:-1:-1;;;;;;;;;;;4002:23:43;:::i;1413:3876:0:-;;;;;3307:14:43;1413:3876:0;;;;;;3814:378:43;;;;;3112:1368;;3307:14;;;1413:3876:0;;;;;;;;;;;3343:13:43;;;3339:1135;3343:13;;;-1:-1:-1;;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;;;3818:23:43;;;3814:378;;3339:1135;1413:3876:0;;;;;;;;;-1:-1:-1;;1413:3876:0;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;3307:14:43;4409:11;:::o;3814:378::-;1413:3876:0;3881:22:43;4002:23;3881:22;;;:::i;:::-;1413:3876:0;;;;;;4002:23:43;;;;;:::i;1413:3876:0:-;;;;;;;;;;;;3814:378:43;;;;;3339:1135;4451:12;;;;1413:3876:0;4451:12:43;:::o;2538:406::-;1413:3876:0;;;5238:14:43;1413:3876:0;;;;;;5238:26:43;2617:321;2621:22;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;5238:14:43;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;5238:14:43;1413:3876:0;;;;;;5238:14:43;2873:11;:::o;2538:406::-;1413:3876:0;;;5238:14:43;1413:3876:0;;;;;;5238:26:43;2617:321;2621:22;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;;;;;;;5238:14:43;1413:3876:0;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;-1:-1:-1;;;;;;;;;;;1413:3876:0;:::i;:::-;;;-1:-1:-1;;;;;;;;;;;1413:3876:0;;;;5238:14:43;1413:3876:0;;;;;;5238:14:43;2873:11;:::o;2538:406::-;-1:-1:-1;1413:3876:0;;;5238:14:43;;;1413:3876:0;;;;;;2622:21:43;;1413:3876:0;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;2817:14:43;1413:3876:0;;;;;;;2873:11:43;:::o","linkReferences":{},"immutableReferences":{"31":[{"start":6873,"length":32}]}}}}}}},"signatures":{"function":[{"signature":"acceptDefaultAdminTransfer()","signatureHash4":"0xcefc1429","signatureHash32":"0xcefc14296c3e78fbeac43bee8f9f43ba37eb6ea27e8e8cb22c4e95c0dd29f090"},{"signature":"allowance(address,address)","signatureHash4":"0xdd62ed3e","signatureHash32":"0xdd62ed3e90e97b3d417db9c0c7522647811bafca5afc6694f143588d255fdfb4"},{"signature":"allowlistMode()","signatureHash4":"0xda6207db","signatureHash32":"0xda6207db6e19a298e956c160fbc998a7aa58a3fb8f4dff9b3997e77ef5af562b"},{"signature":"approve(address,uint256)","signatureHash4":"0x095ea7b3","signatureHash32":"0x095ea7b334ae44009aa867bfb386f5c3b4b443ac6f0ee573fa91c4608fbadfba"},{"signature":"balanceOf(address)","signatureHash4":"0x70a08231","signatureHash32":"0x70a08231b98ef4ca268c9cc3f6b4590e4bfec28280db06bb5d45e689f2a360be"},{"signature":"beginDefaultAdminTransfer(address)","signatureHash4":"0x634e93da","signatureHash32":"0x634e93da731de1ab508773ee1ad3f938ffe9d5c79121d39076b3f2a7abd13177"},{"signature":"blacklistedCount()","signatureHash4":"0xdb7db9c1","signatureHash32":"0xdb7db9c126dae0b68e8a1a1ee249b91af20f4268bd9a767e362e94dced4d101d"},{"signature":"BLACKLISTER_ROLE()","signatureHash4":"0xf515e6f2","signatureHash32":"0xf515e6f24c3a9cf39a23945e66fbf431cf35c670fa47b17527a7258312af5c75"},{"signature":"burn(address,uint256)","signatureHash4":"0x9dc29fac","signatureHash32":"0x9dc29fac0ba6d4fc521c69c2b0c636d612e3343bc39ed934429b8876b0d12cba"},{"signature":"BURNER_ROLE()","signatureHash4":"0x282c51f3","signatureHash32":"0x282c51f3af86cf09008c9091065d100aa2091c794e99c4010c59f726e11c7aeb"},{"signature":"decimals()","signatureHash4":"0x313ce567","signatureHash32":"0x313ce567add4d438edf58b94ff345d7d38c45b17dfc0f947988d7819dca364f9"},{"signature":"defaultAdmin()","signatureHash4":"0x84ef8ffc","signatureHash32":"0x84ef8ffcff676669515a1e6c698710ea9197a6572d3d3f8678aa7a93ccce9576"},{"signature":"DEFAULT_ADMIN_ROLE()","signatureHash4":"0xa217fddf","signatureHash32":"0xa217fddfde7807bb766525e432eeeecaaf4de889a05e8df9fb827257fb978cf4"},{"signature":"DOMAIN_SEPARATOR()","signatureHash4":"0x3644e515","signatureHash32":"0x3644e5157256d68e3eeedd2ead302507a9c4ffaff665547d2c3623a1e9e7edf4"},{"signature":"eip712Domain()","signatureHash4":"0x84b0196e","signatureHash32":"0x84b0196e4b78e1918928c3b71e1f57a2bfc6d4a368fe07990ccc1367172719fb"},{"signature":"getBlacklist(uint256,uint256)","signatureHash4":"0xf1c0c373","signatureHash32":"0xf1c0c373be4b3cfb09f16ece756ec7cb3f7d67cb94c24ec2b102391b2fdf5114"},{"signature":"getRoleAdmin(bytes32)","signatureHash4":"0x248a9ca3","signatureHash32":"0x248a9ca39e7e298ea3bbd193e7d36b87492efea84ff513fd03940aaa5bc0d98f"},{"signature":"getRoleMember(bytes32,uint256)","signatureHash4":"0x9010d07c","signatureHash32":"0x9010d07c35d39c6d4cd0e3e64f2d5224175be836ce7811540697d664e50bd5b0"},{"signature":"getRoleMemberCount(bytes32)","signatureHash4":"0xca15c873","signatureHash32":"0xca15c87324184fe11fcfd1b62f305b0106b501a357855ca24a74263983ccd675"},{"signature":"getRoleMembers(bytes32)","signatureHash4":"0xa3246ad3","signatureHash32":"0xa3246ad3dae02b9b03b7aa5c057223d8a342d49c7de04bf22643dd30b3b5dc09"},{"signature":"getWhitelist(uint256,uint256)","signatureHash4":"0x79f38738","signatureHash32":"0x79f38738c0548e82286a1238b66dedfe78172206f368875be3cbc97d635bdadc"},{"signature":"grantRole(bytes32,address)","signatureHash4":"0x2f2ff15d","signatureHash32":"0x2f2ff15deca029b64bbc0874ae59c8f39be024a95aa718b4c13ca407db350be8"},{"signature":"hasRole(bytes32,address)","signatureHash4":"0x91d14854","signatureHash32":"0x91d1485424b278bc736d5d34907ed48280c7188845bc82b33370da2b4dc1194e"},{"signature":"initialize(string,string,address)","signatureHash4":"0x077f224a","signatureHash32":"0x077f224a02e7ca9721fb7a2239b3a23eba32164d715415baee1d176294042d09"},{"signature":"isAllowlisted(address)","signatureHash4":"0x05a3b809","signatureHash32":"0x05a3b809a0795fd50455d7da1d4801e26e113ad40d065d9017fbca5a375d04c2"},{"signature":"isBlacklisted(address)","signatureHash4":"0xfe575a87","signatureHash32":"0xfe575a87aab505e234db2b42c812533d8e3bd159f25615abf29ce636184a6cb4"},{"signature":"isPaused()","signatureHash4":"0xb187bd26","signatureHash32":"0xb187bd2625dabf471d1f3bd50a44225753699aa87d046d3b53bf00dfebd06f94"},{"signature":"isWhitelisted(address)","signatureHash4":"0x3af32abf","signatureHash32":"0x3af32abf6dd58f324dd88f0cedc69529dd503406094dc24662635caa70d9a021"},{"signature":"mint(address,uint256)","signatureHash4":"0x40c10f19","signatureHash32":"0x40c10f19c047ae7dfa66d6312b683d2ea3dfbcb4159e96b967c5f4b0a86f2842"},{"signature":"MINTER_ROLE()","signatureHash4":"0xd5391393","signatureHash32":"0xd5391393148b83454a7ce0feba5669f1be31824be5022ab68df7b94c6f764c96"},{"signature":"name()","signatureHash4":"0x06fdde03","signatureHash32":"0x06fdde0383f15d582d1a74511486c9ddf862a882fb7904b3d9fe9b8b8e58a796"},{"signature":"nonces(address)","signatureHash4":"0x7ecebe00","signatureHash32":"0x7ecebe00bc8d5df94a191da8e29b79e67a22b668e14b756a81ef2f5fa215cb0c"},{"signature":"pause()","signatureHash4":"0x8456cb59","signatureHash32":"0x8456cb591a934d53f6ccc6332123a165a1f3562907bf11330d847a29ca49eb89"},{"signature":"PAUSER_ROLE()","signatureHash4":"0xe63ab1e9","signatureHash32":"0xe63ab1e9105047561658ac3165e1299fe26595759c1b0c4013fb9a4343523ad1"},{"signature":"pendingDefaultAdmin()","signatureHash4":"0xcf6eefb7","signatureHash32":"0xcf6eefb70924435b69c880ecc747ce469058b0afd8c200587463709fc51db3a9"},{"signature":"permit(address,address,uint256,uint256,uint8,bytes32,bytes32)","signatureHash4":"0xd505accf","signatureHash32":"0xd505accfee7b46ac3ce97322c21f328b64073d188137e16f7ef87f8de076b51c"},{"signature":"recoverFunds(address,address,uint256)","signatureHash4":"0x5d3590d5","signatureHash32":"0x5d3590d572a3f76b031de806bd2c4eae5448bfb459133bc8b52a6ba8ba91e42e"},{"signature":"renounceRole(bytes32,address)","signatureHash4":"0x36568abe","signatureHash32":"0x36568abe2c7e6c1d662bad0fe1760ac72cf2f9478a86be824d68ec83895c49e9"},{"signature":"revokeRole(bytes32,address)","signatureHash4":"0xd547741f","signatureHash32":"0xd547741fd8d55981251e167708119763c372f2b41e85a1468b0a759b055a009f"},{"signature":"setAllowlistMode(uint8)","signatureHash4":"0x9c059a35","signatureHash32":"0x9c059a35bdbe9f64a011a2452c7f3329e3966cdd32e9143b612353d2762e7307"},{"signature":"setBlacklisted((address,bool)[])","signatureHash4":"0x8d22b8fa","signatureHash32":"0x8d22b8fa1073c09814c0fe4ce4a4e55dda45e6f1e3e470219900aa95df616d70"},{"signature":"setWhitelisted((address,bool)[])","signatureHash4":"0x94d24859","signatureHash32":"0x94d24859a7847a141d1a9907751d214d703a57dfbb63c00a1a90a5c9cdc0476f"},{"signature":"supportsInterface(bytes4)","signatureHash4":"0x01ffc9a7","signatureHash32":"0x01ffc9a7a5cef8baa21ed3c5c0d7e23accb804b619e9333b597f47a0d84076e2"},{"signature":"symbol()","signatureHash4":"0x95d89b41","signatureHash32":"0x95d89b41e2f5f391a79ec54e9d87c79d6e777c63e32c28da95b4e9e4a79250ec"},{"signature":"totalSupply()","signatureHash4":"0x18160ddd","signatureHash32":"0x18160ddd7f15c72528c2f94fd8dfe3c8d5aa26e2c50c7d81f4bc7bee8d4b7932"},{"signature":"transfer(address,uint256)","signatureHash4":"0xa9059cbb","signatureHash32":"0xa9059cbb2ab09eb219583f4a59a5d0623ade346d962bcd4e46b11da047c9049b"},{"signature":"transferFrom(address,address,uint256)","signatureHash4":"0x23b872dd","signatureHash32":"0x23b872dd7302113369cda2901243429419bec145408fa8b352b3dd92b66c680b"},{"signature":"unpause()","signatureHash4":"0x3f4ba83a","signatureHash32":"0x3f4ba83af89dc9793996d9e56b8abe6dc88cd97c9c2bb23027806e9c1ffd54dc"},{"signature":"UNPAUSER_ROLE()","signatureHash4":"0xfb1bb9de","signatureHash32":"0xfb1bb9deb26a3c692418358c98b278daecf3c2e17dd030303a645645e7472ab6"},{"signature":"whitelistedCount()","signatureHash4":"0xb2a1de22","signatureHash32":"0xb2a1de22bf31aae3bcb7266f0443ed348bd5bf42eb303a77c472cadfd2b3c4da"},{"signature":"WHITELISTER_ROLE()","signatureHash4":"0x570618e1","signatureHash32":"0x570618e166d8b1eae06aca0ccc1199ba11f50b7950ad0bdd2f4849c1dfde9677"}],"event":[{"signature":"AllowlistModeUpdated(uint8)","signatureHash4":"0xe07f4552","signatureHash32":"0xe07f4552e6ad675be92fecd50a6b8d4f52ba2547bc4417568720edded60441cd"},{"signature":"Approval(address,address,uint256)","signatureHash4":"0x8c5be1e5","signatureHash32":"0x8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925"},{"signature":"BlacklistUpdated(address,bool)","signatureHash4":"0x6a12b3df","signatureHash32":"0x6a12b3df6cba4203bd7fd06b816789f87de8c594299aed5717ae070fac781bac"},{"signature":"DefaultAdminTransferStarted(address)","signatureHash4":"0xd847de1c","signatureHash32":"0xd847de1c1fb5bc6de906c2be6e56ca4294adca98850098f037ab041d5f64395b"},{"signature":"EIP712DomainChanged()","signatureHash4":"0x0a6387c9","signatureHash32":"0x0a6387c9ea3628b88a633bb4f3b151770f70085117a15f9bf3787cda53f13d31"},{"signature":"Initialized(uint64)","signatureHash4":"0xc7f505b2","signatureHash32":"0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"},{"signature":"PauseSet(bool)","signatureHash4":"0x878ac8a2","signatureHash32":"0x878ac8a2ca79520471f8f3c8494fa802c03ce3bf034252aad7f22318984fdbdb"},{"signature":"RoleAdminChanged(bytes32,bytes32,bytes32)","signatureHash4":"0xbd79b86f","signatureHash32":"0xbd79b86ffe0ab8e8776151514217cd7cacd52c909f66475c3af44e129f0b00ff"},{"signature":"RoleGranted(bytes32,address,address)","signatureHash4":"0x2f878811","signatureHash32":"0x2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d"},{"signature":"RoleRevoked(bytes32,address,address)","signatureHash4":"0xf6391f5c","signatureHash32":"0xf6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b"},{"signature":"Transfer(address,address,uint256)","signatureHash4":"0xddf252ad","signatureHash32":"0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef"},{"signature":"WhitelistUpdated(address,bool)","signatureHash4":"0xf93f9a76","signatureHash32":"0xf93f9a76c1bf3444d22400a00cb9fe990e6abe9dbb333fda48859cfee864543d"}],"error":[{"signature":"AccessControlBadConfirmation()","signatureHash4":"0x6697b232","signatureHash32":"0x6697b23232a647058342c0724fe7c415cab25915b54e5dbc03f233173d37b41c"},{"signature":"AccessControlEnforcedDefaultAdminRules()","signatureHash4":"0x3fc3c27a","signatureHash32":"0x3fc3c27ae3db78c81b8f6e685172134623efa268ee8cd8d54be38ad2a74fc13b"},{"signature":"AccessControlUnauthorizedAccount(address,bytes32)","signatureHash4":"0xe2517d3f","signatureHash32":"0xe2517d3fbfae6f8515ef5ff1ccedc3933ab0cbbda0b492c06eb54ad10ef03b3e"},{"signature":"AllowlistStateIdempotent(address,bool)","signatureHash4":"0x28bc2a10","signatureHash32":"0x28bc2a10961ca25a70154614958ddb3422e35167d0f470c0eaf85ec7d59ee70f"},{"signature":"CallerNotPendingAdmin(address)","signatureHash4":"0xbc07fead","signatureHash32":"0xbc07feadd018433d5ddda13efbfa669d1167b2a464eaf3df8aed54d7793f5bbb"},{"signature":"CannotRecoverFromAllowlisted(address)","signatureHash4":"0xee436991","signatureHash32":"0xee436991650f30e54468295405d8b973da9d33d8854697333a43cae2ca1e2a59"},{"signature":"ECDSAInvalidSignature()","signatureHash4":"0xf645eedf","signatureHash32":"0xf645eedf0193584640b6b90cb9477e4c95b98636c148a891d4c0a146dc46e75a"},{"signature":"ECDSAInvalidSignatureLength(uint256)","signatureHash4":"0xfce698f7","signatureHash32":"0xfce698f7e8e5342cd615f641317bc45fe7e1e4a8b0a14dd1383ff8dc9c41917f"},{"signature":"ECDSAInvalidSignatureS(bytes32)","signatureHash4":"0xd78bce0c","signatureHash32":"0xd78bce0cccb935155ed6428d1c13e50b7f3550fd2b66b9fe266006fea4a5e1eb"},{"signature":"ERC20InsufficientAllowance(address,uint256,uint256)","signatureHash4":"0xfb8f41b2","signatureHash32":"0xfb8f41b23e99d2101d86da76cdfa87dd51c82ed07d3cb62cbc473e469dbc75c3"},{"signature":"ERC20InsufficientBalance(address,uint256,uint256)","signatureHash4":"0xe450d38c","signatureHash32":"0xe450d38cd8d9f7d95077d567d60ed49c7254716e6ad08fc9872816c97e0ffec6"},{"signature":"ERC20InvalidApprover(address)","signatureHash4":"0xe602df05","signatureHash32":"0xe602df05cc75712490294c6c104ab7c17f4030363910a7a2626411c6d3118847"},{"signature":"ERC20InvalidReceiver(address)","signatureHash4":"0xec442f05","signatureHash32":"0xec442f055133b72f3b2f9f0bb351c406b178527de2040a7d1feb4e058771f613"},{"signature":"ERC20InvalidSender(address)","signatureHash4":"0x96c6fd1e","signatureHash32":"0x96c6fd1edd0cd6ef7ff0ecc0facdf53148dc0048b57fe58af65755250a7a96bd"},{"signature":"ERC20InvalidSpender(address)","signatureHash4":"0x94280d62","signatureHash32":"0x94280d62c347d8d9f4d59a76ea321452406db88df38e0c9da304f58b57b373a2"},{"signature":"ERC2612ExpiredSignature(uint256)","signatureHash4":"0x62791302","signatureHash32":"0x627913023c184eaad13735d5a3d2657ae76ec9a872a70e0fc57522ef1a114d58"},{"signature":"ERC2612InvalidSigner(address,address)","signatureHash4":"0x4b800e46","signatureHash32":"0x4b800e463b323b1d856edf9dec70329a639d13874a57f5c28219ff57128756db"},{"signature":"InvalidAccountNonce(address,uint256)","signatureHash4":"0x752d88c0","signatureHash32":"0x752d88c0de02638abf10e8e31861e4c68dc1f3a1e7d840e580683f2c282bfc7a"},{"signature":"InvalidDefaultAdmin(address)","signatureHash4":"0xf0aa0919","signatureHash32":"0xf0aa091937478d2582779ca210123256e0bea533e032c343eda8742e5f06c787"},{"signature":"InvalidInitialization()","signatureHash4":"0xf92ee8a9","signatureHash32":"0xf92ee8a957075833165f68c320933b1a1294aafc84ee6e0dd3fb178008f9aaf5"},{"signature":"ModeAlreadySet(uint8)","signatureHash4":"0x18de7df4","signatureHash32":"0x18de7df46cc2c6296748ccab737399e3a988772e92066bca939776ee7f78cd78"},{"signature":"NotAllowlisted(address,uint8)","signatureHash4":"0xf29c5dc7","signatureHash32":"0xf29c5dc7c1f2e840952ad63f2e711adf5329b4f5e0509dd85c5cc909f255663b"},{"signature":"NotInitializing()","signatureHash4":"0xd7e6bcf8","signatureHash32":"0xd7e6bcf8597daa127dc9f0048d2f08d5ef140a2cb659feabd700beff1f7a8302"},{"signature":"Paused()","signatureHash4":"0x9e87fac8","signatureHash32":"0x9e87fac88ff661f02d44f95383c817fece4bce600a3dab7a54406878b965e752"},{"signature":"PauseStateIdempotent(bool)","signatureHash4":"0x1318eb8f","signatureHash32":"0x1318eb8fd82938e06d8fd79d096bfe0e4989deba962dc9226e0808f0ce9ce5e2"}]},"proxyResolution":{"isProxy":false,"proxyType":null,"implementations":[]},"match":"exact_match","chainId":"143","address":"0x79EdA68D227eaA4B6431B123aa89f31F4bC70e5d"}