{"matchId":"43572019","creationMatch":"exact_match","runtimeMatch":"exact_match","verifiedAt":"2026-08-12T16:30:29Z","creationBytecode":{"onchainBytecode":"0x610220604052348015610010575f5ffd5b50604051612c9c380380612c9c83398101604081905261002f916102b5565b604080518082018252601581527f63756c747572652e736273204152432054727573740000000000000000000000602080830191909152825180840190935260018352603160f81b9083015290610086825f610226565b61012052610095816001610226565b61014052815160208084019190912060e052815190820120610100524660a05261012160e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c05260017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00556001600160a01b038616158061016b57506001600160a01b038516155b8061017d57506001600160a01b038416155b1561019b5760405163d92e233d60e01b815260040160405180910390fd5b8215806101a6575081155b156101c45760405163e334302b60e01b815260040160405180910390fd5b8015806101d35750624c243081115b156101f157604051630757bfc960e21b815260040160405180910390fd5b6001600160a01b039586166101605293851661018052919093166101a0526101c0929092526101e091909152610200526104d4565b5f6020835110156102415761023a83610258565b9050610252565b8161024c84826103be565b5060ff90505b92915050565b5f5f829050601f8151111561028b578260405163305a27a960e01b8152600401610282919061047c565b60405180910390fd5b8051610296826104b1565b179392505050565b6001600160a01b03811681146102b2575f5ffd5b50565b5f5f5f5f5f5f60c087890312156102ca575f5ffd5b86516102d58161029e565b60208801519096506102e68161029e565b60408801519095506102f78161029e565b6060880151608089015160a090990151979a96995090979096909590945092505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061034357607f821691505b60208210810361036157634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156103b957828211156103b957805f5260205f20601f840160051c602085101561039257505f5b90810190601f840160051c035f5b818110156103b5575f838201556001016103a0565b5050505b505050565b81516001600160401b038111156103d7576103d761031b565b6103eb816103e5845461032f565b84610367565b6020601f82116001811461041d575f83156104065750848201515b5f19600385901b1c1916600184901b178455610475565b5f84815260208120601f198516915b8281101561044c578785015182556020948501946001909201910161042c565b508482101561046957868401515f19600387901b60f8161c191681555b505060018360011b0184555b5050505050565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b80516020808301519190811015610361575f1960209190910360031b1b16919050565b60805160a05160c05160e05161010051610120516101405161016051610180516101a0516101c0516101e051610200516126936106095f395f818161032601528181610bed015281816116f30152818161174501526118b901525f81816102ec015281816107b301528181610a1901528181610b210152610e7d01525f81816104740152610fc501525f81816103eb0152610aa401525f818161041201528181611238015281816112c70152818161154a015281816116d1015261192f01525f81816102a001528181611176015281816112160152818161128d0152818161144901528181611615015281816116af0152818161177e015281816118f50152611b1801525f611c7601525f611c4a01525f611f7d01525f611f5501525f611eb001525f611eda01525f611f0401526126935ff3fe608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61020861031c3660046123a2565b611342565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000083604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f00000000000000000000000000000000000000000000000000000000000000001490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f00000000000000000000000000000000000000000000000000000000000000008287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f00000000000000000000000000000000000000000000000000000000000000008214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f00000000000000000000000000000000000000000000000000000000000000008214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f000000000000000000000000000000000000000000000000000000000000000086868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f000000000000000000000000000000000000000000000000000000000000000083611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116927f0000000000000000000000000000000000000000000000000000000000000000909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f0000000000000000000000000000000000000000000000000000000000000000307f0000000000000000000000000000000000000000000000000000000000000000611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f000000000000000000000000000000000000000000000000000000000000000090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000000000008152938616928616929092176020840152909204909216908201527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116917f0000000000000000000000000000000000000000000000000000000000000000909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f00000000000000000000000000000000000000000000000000000000000000005f611fcd565b60606114c77f00000000000000000000000000000000000000000000000000000000000000006001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016148015611efc57507f000000000000000000000000000000000000000000000000000000000000000046145b15611f2657507f000000000000000000000000000000000000000000000000000000000000000090565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1000000000000000000000000c63f89f87cb15680fe52ad29b32e9c25f443ee1d377de099a1c2fcaf53e0e5daa0edb2312edc2429ee6e5db670ccaecbf914556d136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d00000000000000000000000000000000000000000000000000000000004c2430","recompiledBytecode":"0x610220604052348015610010575f5ffd5b50604051612c9c380380612c9c83398101604081905261002f916102b5565b604080518082018252601581527f63756c747572652e736273204152432054727573740000000000000000000000602080830191909152825180840190935260018352603160f81b9083015290610086825f610226565b61012052610095816001610226565b61014052815160208084019190912060e052815190820120610100524660a05261012160e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c05260017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00556001600160a01b038616158061016b57506001600160a01b038516155b8061017d57506001600160a01b038416155b1561019b5760405163d92e233d60e01b815260040160405180910390fd5b8215806101a6575081155b156101c45760405163e334302b60e01b815260040160405180910390fd5b8015806101d35750624c243081115b156101f157604051630757bfc960e21b815260040160405180910390fd5b6001600160a01b039586166101605293851661018052919093166101a0526101c0929092526101e091909152610200526104d4565b5f6020835110156102415761023a83610258565b9050610252565b8161024c84826103be565b5060ff90505b92915050565b5f5f829050601f8151111561028b578260405163305a27a960e01b8152600401610282919061047c565b60405180910390fd5b8051610296826104b1565b179392505050565b6001600160a01b03811681146102b2575f5ffd5b50565b5f5f5f5f5f5f60c087890312156102ca575f5ffd5b86516102d58161029e565b60208801519096506102e68161029e565b60408801519095506102f78161029e565b6060880151608089015160a090990151979a96995090979096909590945092505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061034357607f821691505b60208210810361036157634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156103b957828211156103b957805f5260205f20601f840160051c602085101561039257505f5b90810190601f840160051c035f5b818110156103b5575f838201556001016103a0565b5050505b505050565b81516001600160401b038111156103d7576103d761031b565b6103eb816103e5845461032f565b84610367565b6020601f82116001811461041d575f83156104065750848201515b5f19600385901b1c1916600184901b178455610475565b5f84815260208120601f198516915b8281101561044c578785015182556020948501946001909201910161042c565b508482101561046957868401515f19600387901b60f8161c191681555b505060018360011b0184555b5050505050565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b80516020808301519190811015610361575f1960209190910360031b1b16919050565b60805160a05160c05160e05161010051610120516101405161016051610180516101a0516101c0516101e051610200516126936106095f395f818161032601528181610bed015281816116f30152818161174501526118b901525f81816102ec015281816107b301528181610a1901528181610b210152610e7d01525f81816104740152610fc501525f81816103eb0152610aa401525f818161041201528181611238015281816112c70152818161154a015281816116d1015261192f01525f81816102a001528181611176015281816112160152818161128d0152818161144901528181611615015281816116af0152818161177e015281816118f50152611b1801525f611c7601525f611c4a01525f611f7d01525f611f5501525f611eb001525f611eda01525f611f0401526126935ff3fe608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61020861031c3660046123a2565b611342565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000083604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f00000000000000000000000000000000000000000000000000000000000000001490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f00000000000000000000000000000000000000000000000000000000000000008287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f00000000000000000000000000000000000000000000000000000000000000008214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f00000000000000000000000000000000000000000000000000000000000000008214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f000000000000000000000000000000000000000000000000000000000000000086868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f000000000000000000000000000000000000000000000000000000000000000083611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116927f0000000000000000000000000000000000000000000000000000000000000000909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f0000000000000000000000000000000000000000000000000000000000000000307f0000000000000000000000000000000000000000000000000000000000000000611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f000000000000000000000000000000000000000000000000000000000000000090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000000000008152938616928616929092176020840152909204909216908201527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116917f0000000000000000000000000000000000000000000000000000000000000000909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f00000000000000000000000000000000000000000000000000000000000000005f611fcd565b60606114c77f00000000000000000000000000000000000000000000000000000000000000006001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016148015611efc57507f000000000000000000000000000000000000000000000000000000000000000046145b15611f2657507f000000000000000000000000000000000000000000000000000000000000000090565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","sourceMap":"871:10809:26:-:0;;;4327:780;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;3428:431:19;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;3428:431:19;;;;;3501:45;3428:431;-1:-1:-1;3501:30:19;:45::i;:::-;3493:53;;3567:51;:7;3601:16;3567:33;:51::i;:::-;3556:62;;3642:22;;;;;;;;;;3628:36;;3691:25;;;;;;3674:42;;3744:13;3727:30;;3792:23;4326:11;;4339:14;;4304:80;;;2079:95;4304:80;;;4084:25:28;4125:18;;;4118:34;;;;4168:18;;;4161:34;4355:13:19;4211:18:28;;;4204:34;4378:4:19;4254:19:28;;;4247:61;4268:7:19;;4056:19:28;;4304:80:19;;;;;;;;;;;;4294:91;;;;;;4287:98;;4213:179;;3792:23;3767:48;;-1:-1:-1;;3847:4:19;3825:27;;2365:1:14;1505:66;2539;-1:-1:-1;;;;;4562:29:26;::::1;::::0;;:54:::1;;-1:-1:-1::0;;;;;;4595:21:26;::::1;::::0;4562:54:::1;:78;;;-1:-1:-1::0;;;;;;4620:20:26;::::1;::::0;4562:78:::1;4558:129;;;4663:13;;-1:-1:-1::0;;;4663:13:26::1;;;;;;;;;;;4558:129;4700:25:::0;;;:55:::1;;-1:-1:-1::0;4729:26:26;;4700:55:::1;4696:84;;;4764:16;;-1:-1:-1::0;;;4764:16:26::1;;;;;;;;;;;4696:84;4794:22:::0;;;:67:::1;;;1300:9;4820:17;:41;4794:67;4790:120;;;4884:15;;-1:-1:-1::0;;;4884:15:26::1;;;;;;;;;;;4790:120;-1:-1:-1::0;;;;;4920:14:26;;::::1;;::::0;4944:16;;::::1;;::::0;4970:14;;;::::1;;::::0;4994:24:::1;::::0;;;;5028:26:::1;::::0;;;;5064:36:::1;::::0;871:10809;;2893:342:15;2989:11;3038:4;3022:5;3016:19;:26;3012:217;;;3065:20;3079:5;3065:13;:20::i;:::-;3058:27;;;;3012:217;3142:5;3116:46;3157:5;3142;3116:46;:::i;:::-;-1:-1:-1;1390:66:15;;-1:-1:-1;3012:217:15;2893:342;;;;:::o;1708:288::-;1773:11;1796:17;1822:3;1796:30;;1854:4;1840;:11;:18;1836:74;;;1895:3;1881:18;;-1:-1:-1;;;1881:18:15;;;;;;;;:::i;:::-;;;;;;;;1836:74;1976:11;;1959:13;1976:4;1959:13;:::i;:::-;1951:36;;1708:288;-1:-1:-1;;;1708:288:15:o;14:139:28:-;-1:-1:-1;;;;;97:31:28;;87:42;;77:70;;143:1;140;133:12;77:70;14:139;:::o;158:847::-;287:6;295;303;311;319;327;380:3;368:9;359:7;355:23;351:33;348:53;;;397:1;394;387:12;348:53;429:9;423:16;448:39;481:5;448:39;:::i;:::-;556:2;541:18;;535:25;506:5;;-1:-1:-1;569:41:28;535:25;569:41;:::i;:::-;681:2;666:18;;660:25;629:7;;-1:-1:-1;694:41:28;660:25;694:41;:::i;:::-;827:2;812:18;;806:25;923:3;908:19;;902:26;994:3;979:19;;;973:26;158:847;;;;-1:-1:-1;754:7:28;;806:25;;902:26;;973;;-1:-1:-1;158:847:28;-1:-1:-1;;;158:847:28:o;1010:127::-;1071:10;1066:3;1062:20;1059:1;1052:31;1102:4;1099:1;1092:15;1126:4;1123:1;1116:15;1142:380;1221:1;1217:12;;;;1264;;;1285:61;;1339:4;1331:6;1327:17;1317:27;;1285:61;1392:2;1384:6;1381:14;1361:18;1358:38;1355:161;;1438:10;1433:3;1429:20;1426:1;1419:31;1473:4;1470:1;1463:15;1501:4;1498:1;1491:15;1355:161;;1142:380;;;:::o;1653:692::-;1755:2;1750:3;1747:11;1744:595;;;1792:10;1787:3;1784:19;1781:548;;;1844:5;1841:1;1834:16;1892:4;1889:1;1879:18;1957:2;1945:10;1941:19;1938:1;1934:27;1996:4;1984:10;1981:20;1978:45;;;-1:-1:-1;2020:1:28;1978:45;2059:23;;;;2129:2;2120:12;;2117:1;2113:20;2109:39;2174:1;2192:123;2206:2;2203:1;2200:9;2192:123;;;2295:1;2274:19;;;2267:30;2224:1;2217:9;2192:123;;;2196:3;;;1781:548;1653:692;;;:::o;2521:1299::-;2641:10;;-1:-1:-1;;;;;2663:30:28;;2660:56;;;2696:18;;:::i;:::-;2725:97;2815:6;2775:38;2807:4;2801:11;2775:38;:::i;:::-;2769:4;2725:97;:::i;:::-;2871:4;2902:2;2891:14;;2919:1;2914:649;;;;3607:1;3624:6;3621:89;;;-1:-1:-1;3676:19:28;;;3670:26;3621:89;-1:-1:-1;;2478:1:28;2474:11;;;2470:24;2466:29;2456:40;2502:1;2498:11;;;2453:57;3723:81;;2884:930;;2914:649;1600:1;1593:14;;;1637:4;1624:18;;-1:-1:-1;;2950:20:28;;;3068:222;3082:7;3079:1;3076:14;3068:222;;;3164:19;;;3158:26;3143:42;;3271:4;3256:20;;;;3224:1;3212:14;;;;3098:12;3068:222;;;3072:3;3318:6;3309:7;3306:19;3303:201;;;3379:19;;;3373:26;-1:-1:-1;;3462:1:28;3458:14;;;3474:3;3454:24;3450:37;3446:42;3431:58;3416:74;;3303:201;;;3550:1;3541:6;3538:1;3534:14;3530:22;3524:4;3517:36;2884:930;;;;2521:1299;;:::o;4319:418::-;4468:2;4457:9;4450:21;4431:4;4500:6;4494:13;4543:6;4538:2;4527:9;4523:18;4516:34;4602:6;4597:2;4589:6;4585:15;4580:2;4569:9;4565:18;4559:50;4658:1;4653:2;4644:6;4633:9;4629:22;4625:31;4618:42;4728:2;4721;4717:7;4712:2;4704:6;4700:15;4696:29;4685:9;4681:45;4677:54;4669:62;;;4319:418;;;;:::o;4742:297::-;4860:12;;4907:4;4896:16;;;4890:23;;4860:12;4925:16;;4922:111;;;-1:-1:-1;;4999:4:28;4995:17;;;;4992:1;4988:25;4984:38;4973:50;;4742:297;-1:-1:-1;4742:297:28:o;:::-;871:10809:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","offset":11367}},"transformations":[{"type":"insert","offset":11420,"reason":"constructorArguments"}],"transformationValues":{"constructorArguments":"0x000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1000000000000000000000000c63f89f87cb15680fe52ad29b32e9c25f443ee1d377de099a1c2fcaf53e0e5daa0edb2312edc2429ee6e5db670ccaecbf914556d136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d00000000000000000000000000000000000000000000000000000000004c2430"}},"runtimeBytecode":{"onchainBytecode":"0x608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291381565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d81565b61020861031c3660046123a2565b611342565b6102087f00000000000000000000000000000000000000000000000000000000004c243081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000c63f89f87cb15680fe52ad29b32e9c25f443ee1d81565b6102c27f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d181565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f377de099a1c2fcaf53e0e5daa0edb2312edc2429ee6e5db670ccaecbf914556d81565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d83604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d1490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f000000000000000000000000c63f89f87cb15680fe52ad29b32e9c25f443ee1d8287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d8214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f00000000000000000000000000000000000000000000000000000000004c243081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d8214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f377de099a1c2fcaf53e0e5daa0edb2312edc2429ee6e5db670ccaecbf914556d86868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291373ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913167f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d183611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291373ffffffffffffffffffffffffffffffffffffffff908116927f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291373ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d116146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291373ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913167f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1307f00000000000000000000000000000000000000000000000000000000004c2430611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f00000000000000000000000000000000000000000000000000000000004c243090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291316906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000004c24308152938616928616929092176020840152909204909216908201527f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda0291373ffffffffffffffffffffffffffffffffffffffff908116917f000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f63756c747572652e7362732041524320547275737400000000000000000000155f611fcd565b60606114c77f31000000000000000000000000000000000000000000000000000000000000016001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000075b282ef9af829a0bb4bd937eb82ab8c02d636ef16148015611efc57507f000000000000000000000000000000000000000000000000000000000000210546145b15611f2657507ff339d15719f3f5d214c9080e3ee6406c2a9d0a673b1e6e7f13068b832f71138990565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f9077fab79d3108c6ec25d8eeaf9b0379b1679f6737df2d4e3538e2a6814da58a918101919091527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc660608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","recompiledBytecode":"0x608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61020861031c3660046123a2565b611342565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000083604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f00000000000000000000000000000000000000000000000000000000000000001490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f00000000000000000000000000000000000000000000000000000000000000008287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f00000000000000000000000000000000000000000000000000000000000000008214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f00000000000000000000000000000000000000000000000000000000000000008214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f000000000000000000000000000000000000000000000000000000000000000086868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f000000000000000000000000000000000000000000000000000000000000000083611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116927f0000000000000000000000000000000000000000000000000000000000000000909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f0000000000000000000000000000000000000000000000000000000000000000307f0000000000000000000000000000000000000000000000000000000000000000611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f000000000000000000000000000000000000000000000000000000000000000090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000000000008152938616928616929092176020840152909204909216908201527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116917f0000000000000000000000000000000000000000000000000000000000000000909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f00000000000000000000000000000000000000000000000000000000000000005f611fcd565b60606114c77f00000000000000000000000000000000000000000000000000000000000000006001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016148015611efc57507f000000000000000000000000000000000000000000000000000000000000000046145b15611f2657507f000000000000000000000000000000000000000000000000000000000000000090565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","sourceMap":"871:10809:26:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6074:3472;;;;;;:::i;:::-;;:::i;:::-;;10647:331;;;;;;:::i;:::-;;:::i;:::-;;;1975:25:28;;;1963:2;1948:18;10647:331:26;;;;;;;;1315:50;;1358:7;1315:50;;;;;2185:18:28;2173:31;;;2155:50;;2143:2;2128:18;1315:50:26;2011:200:28;1198:48:26;;1243:3;1198:48;;2434:29;;;;;;1139:53;;1186:6;1139:53;;1022:50;;1066:6;1022:50;;9718:410;;;:::i;2741:57::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;2794:14:28;;2787:22;2769:41;;2757:2;2742:18;2741:57:26;2629:187:28;2072:29:26;;;;;;;;3011:42:28;2999:55;;;2981:74;;2969:2;2954:18;2072:29:26;2821:240:28;2221:36:26;;;;;10134:507;;;;;;:::i;:::-;;:::i;2263:41::-;;;;;10984:117;;;:::i;2470:71::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3581:42:28;3569:55;;;3551:74;;3656:2;3641:18;;3634:34;;;;3684:18;;;3677:34;3759:18;3747:31;3742:2;3727:18;;3720:59;3538:3;3523:19;2470:71:26;3322:463:28;2144:30:26;;;;;2107:31;;;;;5228:557:19;;;:::i;:::-;;;;;;;;;;;;;:::i;2339:23:26:-;;;;;;;;;;;;2180:35;;;;;2678:57;;;;;;:::i;:::-;;;;;;;;;;;;;;;;2311:22;;;;;;;;;5287:608;;;:::i;1078:55::-;;1127:6;1078:55;;1372:229;;1421:180;1372:229;;1252:57;;1300:9;1252:57;;2368:21;;;;;;;;;;;;2547:64;;;;;;:::i;:::-;;;;;;;;;;;;;;2395:33;;;;;;2617:55;;;;;;:::i;:::-;;;;;;;;;;;;;;;;6074:3472;3023:21:14;:19;:21::i;:::-;6210:8:26::1;::::0;::::1;;;:13:::0;6206:37:::1;;6232:11;;;;;;;;;;;;;;6206:37;6276:9;::::0;;;::::1;;;6257:15;:28;6253:58;;6294:17;;;;;;;;;;;;;;6253:58;1243:3;6325:18;;:40;6321:80;;6374:27;;;;;;;;;;;;;;6321:80;6428:9:::0;::::1;:23:::0;;:51:::1;;-1:-1:-1::0;6455:10:26::1;::::0;::::1;;:24:::0;6428:51:::1;:101;;;-1:-1:-1::0;6499:16:26::1;::::0;::::1;;:30:::0;6428:101:::1;:133;;;-1:-1:-1::0;6533:14:26::1;::::0;::::1;;:28:::0;6428:133:::1;6411:184;;;6579:16;;;;;;;;;;;;;;6411:184;6636:1;6609:15;::::0;;;::::1;::::0;::::1;;:::i;:::-;:29;;::::0;6605:55:::1;;6647:13;;;;;;;;;;;;;;6605:55;6685:9:::0;::::1;6674:21;::::0;;;:10:::1;:21;::::0;;;;;::::1;;6670:52;;;6704:18;;;;;;;;;;;;;;6670:52;6748:10;::::0;;::::1;;6736:23;::::0;;;:11:::1;:23:::0;;;;;;;::::1;;6732:55;;;6768:19;;;;;;;;;;;;;;6732:55;6821:11;6801:1;:16;;;:31:::0;6797:63:::1;;6841:19;;;;;;;;;;;;;;6797:63;6890:16;::::0;;::::1;;6926:1;6874:33:::0;;;:15:::1;:33;::::0;;:40;:54:::1;:40;:54:::0;6870:90:::1;;6937:23;;;;;;;;;;;;;;6870:90;7017:1;6974:14;7017:1:::0;6989:15:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;6974:31;;;;;;;;;;;;;;;;:45;6970:77;;7028:19;;;;;;;;;;;;;;6970:77;7081:1;:15;;;7061:1;:16;;;:35:::0;7057:60:::1;;7105:12;;;;;;;;;;;;;;7057:60;7146:8;::::0;::::1;;7131:12;::::0;;;::::1;::::0;::::1;;:::i;:::-;:23;;;:57;;;-1:-1:-1::0;7173:15:26::1;7158:12;::::0;;;::::1;::::0;::::1;;:::i;:::-;:30;;;7131:57;7127:91;;;7197:21;;;;;;;;;;;;;;7127:91;7249:15;::::0;;::::1;;7229:17;7320:32:::0;;;:15:::1;:32;::::0;;;;;;;;7289:63;;;;::::1;::::0;;;;::::1;;::::0;;;;::::1;::::0;;;::::1;::::0;;;;::::1;::::0;::::1;::::0;;;;;;;;::::1;;::::0;::::1;;::::0;;;;7268:11:::1;7249:30;::::0;7366:13;::::1;7249:30:::0;7366:44:::1;;-1:-1:-1::0;7383:13:26;;:27:::1;;::::0;7366:44:::1;7362:72;;;7419:15;;;;;;;;;;;;;;7362:72;7445:14;7462:22;7482:1;7462:19;:22::i;:::-;7445:39;;7499:70;7544:5;7551:6;7559:9;;7499:44;:70::i;:::-;7494:132;;7592:23;;;;;;;;;;;;;;7494:132;7636:26;1010:6;7735:12:::0;7730:363:::1;;7763:36;1066:6;7763:36:::0;::::1;:::i;:::-;;;7834:6;:20;;;7813:41;;7894:11;7872:18;:33;7868:215;;7983:1;7929:35:::0;;;:15:::1;:35;::::0;;;;:42;:56:::1;:42;7925:84;;7994:15;;;;;;;;;;;;;;7925:84;8027:41;1127:6;8027:41:::0;::::1;:::i;:::-;;;7868:215;1186:6;8106:15;:38;8102:67;;;8153:16;;;;;;;;;;;;;;8102:67;8218:16;8200:15;8183:14;;:32;;;;:::i;:::-;:51;8179:80;;;8243:16;;;;;;;;;;;;;;8179:80;8281:9:::0;::::1;8270:21;::::0;;;:10:::1;:21;::::0;;;;;;;:28;;8294:4:::1;8270:28:::0;;;::::1;::::0;::::1;::::0;;;8320:10;;::::1;;8308:23:::0;;:11:::1;:23:::0;;;;;;;:30;;;;::::1;::::0;;::::1;::::0;;8384:177;;::::1;::::0;;::::1;::::0;;;;;;8421:15:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;8384:177;;::::0;;8465:15:::1;::::0;::::1;;8384:177;::::0;::::1;::::0;8503:9;::::1;8384:177:::0;;;;;;8538:12:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;8384:177;::::0;;::::1;::::0;;;8364:16:::1;::::0;;::::1;;8348:33;::::0;;;:15:::1;:33;::::0;;;;;;:213;;;;;::::1;;::::0;;::::1;;::::0;;;;::::1;::::0;-1:-1:-1;8348:213:26;::::1;::::0;;;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;;8364:16;;8571:14:::1;::::0;8348:33;8586:15:::1;::::0;;;;;;::::1;;:::i;:::-;8571:31;;;;;;;;;;;;;;;:50;;;;8653:1;8631:18;;:23;;;;;;;:::i;:::-;;;;;;;;8682:15;8664:14;;:33;;;;;;;:::i;:::-;::::0;;;-1:-1:-1;8708:86:26::1;::::0;-1:-1:-1;8713:9:26;::::1;8724:10;::::0;::::1;;8736:16;::::0;::::1;;8754:15;::::0;;;::::1;::::0;::::1;;:::i;:::-;8771:22;8708:4;:86::i;:::-;8809:12;8804:440;;8837:78;8842:1;:9;;;8853:1;:10;;;8865:1;:15;;;8882:6;:13;;;8897:17;8837:4;:78::i;:::-;8955:11;8933:18;:33;8929:305;;9012:9;9115:35:::0;;;:15:::1;9043:10;9115:35:::0;;;;;;;:42;8986:233:::1;::::0;9012:9;::::1;::::0;9043:10;;::::1;;::::0;9075:18;;9115:42:::1;;9179:22;8986:4;:233::i;:::-;9340:1;:16;;;9316:1;:10;;;9293:1;:9;;;9259:280;9370:1;:15;;;9399:18;9431:1;:15;;;;;;;;;;:::i;:::-;9460:1;:14;;;9488:1;:12;;;;;;;;;;:::i;:::-;9259:280;::::0;;6777:25:28;;;6833:2;6818:18;;6811:34;;;;6893:42;6881:55;;;;6861:18;;;6854:83;6968:2;6953:18;;6946:34;7029:18;7017:31;7011:3;6996:19;;6989:60;7080:3;7065:19;;7058:35;;;9259:280:26;;;;;6764:3:28;9259:280:26;;::::1;6196:3350;;;;;3065:20:14::0;2365:1;1505:66;3972:62;3749:292;3065:20;6074:3472:26;;;:::o;10647:331::-;10829:7;10889:10;10901:7;10910:8;10920:16;10938:9;10955:4;10949:11;;;;;;;;:::i;:::-;10878:83;;;;;;7576:25:28;;;;7617:18;;7610:34;;;;7660:18;;;7653:34;;;;7703:18;;;7696:34;7779:42;7767:55;7746:19;;;7739:84;7872:4;7860:17;7839:19;;;7832:46;7548:19;;10878:83:26;;;;;;;;;;;;10855:116;;;;;;10848:123;;10647:331;;;;;;;:::o;9718:410::-;3023:21:14;:19;:21::i;:::-;9778:8:26::1;::::0;::::1;;;:13:::0;9774:37:::1;;9800:11;;;;;;;;;;;;;;9774:37;9843:9;::::0;;;::::1;;;9825:15;:27;9821:61;;;9861:21;;;;;;;;;;;;;;9821:61;9892:7;:33:::0;;;::::1;::::0;9909:15:::1;9892:33;;;;::::0;;9952:30:::1;::::0;;;;9976:4:::1;9952:30;::::0;::::1;2981:74:28::0;-1:-1:-1;;9952:5:26::1;:15;;::::0;::::1;::::0;2954:18:28;;9952:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;9935:47:::0;-1:-1:-1;9996:11:26;;9992:51:::1;;10009:34;:18;:5;:18;10028:6;10036::::0;10009:18:::1;:34::i;:::-;10113:7;::::0;10058:63:::1;::::0;;8250:25:28;;;10113:7:26;;;::::1;;;8306:2:28::0;8291:18;;8284:59;10097:5:26::1;10058:63;::::0;;::::1;::::0;10081:6:::1;10058:63:::0;;::::1;::::0;::::1;::::0;8223:18:28;10058:63:26::1;;;;;;;;9764:364;3065:20:14::0;2365:1;1505:66;3972:62;3749:292;3065:20;9718:410:26:o;10134:507::-;10210:7;10236:398;1421:180;10369:9;;10400:10;;;;10432:16;;;;10470:15;;;;;;;;:::i;:::-;10507;;;;10544:14;;;;10580:12;;;;;;;;:::i;:::-;10293:317;;;;;;8695:25:28;;;;8736:18;;8729:34;;;;8779:18;;;8772:34;;;;8822:18;;;8815:34;;;;8898:42;8886:55;8865:19;;;8858:84;8958:19;;;8951:35;9002:19;;;8995:35;9079:18;9067:31;9046:19;;;9039:60;8667:19;;10293:317:26;;;;;;;;;;;;10266:358;;;;;;10236:16;:398::i;:::-;10229:405;10134:507;-1:-1:-1;;10134:507:26:o;10984:117::-;11064:30;;;;;11088:4;11064:30;;;2981:74:28;11038:7:26;;11064:5;:15;;;;;2954:18:28;;11064:30:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;11057:37;;10984:117;:::o;5228:557:19:-;5326:13;5353:18;5385:21;5420:15;5449:25;5488:12;5514:27;5617:13;:11;:13::i;:::-;5644:16;:14;:16::i;:::-;5752;;;5736:1;5752:16;;;;;;;;;5566:212;;;;-1:-1:-1;5566:212:19;;-1:-1:-1;5674:13:19;;-1:-1:-1;5709:4:19;;-1:-1:-1;5736:1:19;-1:-1:-1;5752:16:19;-1:-1:-1;5566:212:19;-1:-1:-1;5228:557:19:o;5287:608:26:-;3023:21:14;:19;:21::i;:::-;5339:10:26::1;:20;5353:6;5339:20;;5335:45;;5368:12;;;;;;;;;;;;;;5335:45;5394:8;::::0;::::1;;:13:::0;5390:41:::1;;5416:15;;;;;;;;;;;;;;5390:41;5466:30;::::0;;;;5490:4:::1;5466:30;::::0;::::1;2981:74:28::0;5442:21:26::1;::::0;5466:5:::1;:15;;::::0;::::1;::::0;2954:18:28;;5466:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;5442:54:::0;-1:-1:-1;5506:63:26::1;:22;:5;:22;5529:6;5545:4;5552:16;5506:22;:63::i;:::-;5583:30;::::0;;;;5607:4:::1;5583:30;::::0;::::1;2981:74:28::0;5633:16:26::1;::::0;5616:13;;5583:15:::1;:5;:15;::::0;::::1;::::0;2954:18:28;;5583:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;:46;;;;:::i;:::-;:66;5579:126;;5672:22;;;;;;;;;;;;;;5579:126;5714:8;:34:::0;;;::::1;5732:15;5714:34;;::::0;;::::1;::::0;;;5770:28:::1;::::0;1358:7:::1;::::0;5770:28:::1;:::i;:::-;5758:9;:40:::0;;;;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;::::1;::::0;;;;5813:75:::1;::::0;;5850:16:::1;9826:25:28::0;;5868:8:26;;;;;;;;;;9882:2:28;9867:18;;9860:59;5878:9:26;;::::1;::::0;;::::1;9935:18:28::0;;;9928:59;5842:5:26::1;5813:75;::::0;;::::1;::::0;5826:6:::1;5813:75:::0;;::::1;::::0;::::1;::::0;9814:2:28;9799:18;5813:75:26::1;9628:365:28::0;3749:292:14;3872:25;:23;:25::i;:::-;2407:1;1505:66;3972:62;3749:292::o;2016:485:21:-;2162:4;2182:6;:18;;;2204:1;2182:23;2178:317;;2222:17;2241:22;2269:41;2294:4;2300:9;;2269:24;:41::i;:::-;-1:-1:-1;2221:89:21;;-1:-1:-1;2221:89:21;-1:-1:-1;2338:26:21;2331:3;:33;;;;;;;;:::i;:::-;;:56;;;;;2381:6;2368:19;;:9;:19;;;2331:56;2324:63;;;;;;2178:317;2425:59;2460:6;2468:4;2474:9;;2425:34;:59::i;:::-;2418:66;;2178:317;2016:485;;;;;;:::o;11107:571:26:-;11282:14;11307:17;11299:4;:25;;;;;;;;:::i;:::-;;:70;;1010:6;11299:70;;;1066:6;11299:70;11282:87;;11379:10;11392:62;11401:7;11410:8;11420:16;11438:9;11449:4;11392:8;:62::i;:::-;11468:15;;;;:11;:15;;;;;;11379:75;;-1:-1:-1;11468:15:26;;11464:47;;;11492:19;;;;;;;;;;;;;;11464:47;11521:15;;;;:11;:15;;;;;:22;;;;11539:4;11521:22;;;11553:37;:18;:5;:18;11572:9;11583:6;11553:18;:37::i;:::-;11629:9;11605:66;;11620:7;11616:2;11605:66;11640:16;11658:4;11664:6;11605:66;;;;;;;;:::i;:::-;;;;;;;;11272:406;;11107:571;;;;;:::o;1219:204:10:-;1306:37;1320:5;1327:2;1331:5;1338:4;1306:13;:37::i;:::-;1301:116;;1366:40;;;;;3011:42:28;2999:55;;1366:40:10;;;2981:74:28;2954:18;;1366:40:10;;;;;;;;5017:176:19;5094:7;5120:66;5153:20;:18;:20::i;:::-;5175:10;4093:4:20;4087:11;4123:10;4111:23;;4163:4;4154:14;;4147:39;;;;4215:4;4206:14;;4199:34;4271:4;4256:20;;;3918:374;6105:126:19;6151:13;6183:41;:5;6210:13;6183:26;:41::i;6557:135::-;6606:13;6638:47;:8;6668:16;6638:29;:47::i;1662:232:10:-;1767:47;1785:5;1792:4;1798:2;1802:5;1809:4;1767:17;:47::i;:::-;1762:126;;1837:40;;;;;3011:42:28;2999:55;;1837:40:10;;;2981:74:28;2954:18;;1837:40:10;2821:240:28;1762:126:10;1662:232;;;;:::o;3586:157:14:-;1505:66;4560:52;2407:1;4560:63;3644:93;;3696:30;;;;;;;;;;;;;;3290:882:18;3403:17;;;3490:2;3470:22;;;3466:700;;3817:30;;3904:4;3882:27;;3869:41;3975:4;3953:27;;3940:41;3508:9;3932:50;4016:25;4027:4;3932:50;3817:30;3869:41;4016:10;:25::i;:::-;4009:32;;;;;;;;;;;3466:700;-1:-1:-1;4088:1:18;;-1:-1:-1;4092:35:18;;-1:-1:-1;4137:9:18;3466:700;3290:882;;;;;;;:::o;3900:1042:21:-;4510:4;4504:11;;4094:34;4528:21;;;4578:4;4569:14;;4562:28;;;4619:4;4610:14;;4603:28;;;;4660:4;4651:14;;4644:30;;;4053:11;;4094:34;4155:9;;;;4709:4;4700:14;;4687:54;4826:4;4820;4813;4805:6;4801:17;4796:3;4788:6;4781:5;4770:61;4755:76;;4915:8;4908:4;4902:11;4899:25;4892:4;4874:16;4871:26;4867:58;4858:7;4854:72;4844:82;;;4207:729;;3900:1042;;;;;;:::o;8373:1244:10:-;8600:4;8594:11;8509:24;8467:12;8618:22;;;8674:15;8666:24;;8660:4;8653:38;8711:4;8704:19;;;8467:12;8787:4;8467:12;8775:4;8467:12;;8759:5;8752;8747:45;8736:56;;9004:1;8997:4;8991:11;8988:18;8979:7;8975:32;8965:606;;9136:6;9126:7;9119:15;9115:28;9112:165;;;9192:16;9186:4;9181:3;9166:43;9242:16;9237:3;9230:29;9112:165;9553:1;9545:5;9533:18;9530:25;9511:16;9504:24;9500:56;9491:7;9487:70;9476:81;;8965:606;9591:4;9584:17;-1:-1:-1;8373:1244:10;;-1:-1:-1;;;;8373:1244:10:o;3945:262:19:-;3998:7;4029:4;4021:28;4038:11;4021:28;;:63;;;;;4070:14;4053:13;:31;4021:63;4017:184;;;-1:-1:-1;4107:22:19;;3945:262::o;4017:184::-;4167:23;4304:80;;;2079:95;4304:80;;;11649:25:28;4326:11:19;11690:18:28;;;11683:34;;;;4339:14:19;11733:18:28;;;11726:34;4355:13:19;11776:18:28;;;11769:34;4378:4:19;11819:19:28;;;11812:84;4268:7:19;;11621:19:28;;4304:80:19;;;;;;;;;;;;4294:91;;;;;;4287:98;;4213:179;;3376:267:15;3470:13;1390:66;3499:46;;3495:142;;3568:15;3577:5;3568:8;:15::i;:::-;3561:22;;;;3495:142;3621:5;3614:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3376:267;;;;:::o;10165:1393:10:-;10460:4;10454:11;10365:28;10323:12;10478:22;;;10536:15;10526:26;;;10520:4;10513:40;10579:24;;10573:4;10566:38;10624:4;10617:19;;;10323:12;10700:4;10323:12;10688:4;10323:12;;10672:5;10665;10660:45;10649:56;;10917:1;10910:4;10904:11;10901:18;10892:7;10888:32;10878:606;;11049:6;11039:7;11032:15;11028:28;11025:165;;;11105:16;11099:4;11094:3;11079:43;11155:16;11150:3;11143:29;11025:165;11466:1;11458:5;11446:18;11443:25;11424:16;11417:24;11413:56;11404:7;11400:70;11389:81;;10878:606;11504:4;11497:17;-1:-1:-1;11540:1:10;11534:4;11527:15;10165:1393;;-1:-1:-1;;;;;10165:1393:10:o;7129:1551:18:-;7255:17;;;8209:66;8196:79;;8192:164;;;-1:-1:-1;8307:1:18;;-1:-1:-1;8311:30:18;;-1:-1:-1;8343:1:18;8291:54;;8192:164;8467:24;;;8450:14;8467:24;;;;;;;;;11214:25:28;;;11287:4;11275:17;;11255:18;;;11248:45;;;;11309:18;;;11302:34;;;11352:18;;;11345:34;;;8467:24:18;;11186:19:28;;8467:24:18;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;8467:24:18;;;;;;-1:-1:-1;;8505:20:18;;;8501:113;;-1:-1:-1;8557:1:18;;-1:-1:-1;8561:29:18;;-1:-1:-1;8557:1:18;;-1:-1:-1;8541:62:18;;8501:113;8632:6;-1:-1:-1;8640:20:18;;-1:-1:-1;8640:20:18;;-1:-1:-1;7129:1551:18;;;;;;;;;:::o;2080:380:15:-;2139:13;2164:11;2178:16;2189:4;2178:10;:16::i;:::-;2302;;;2313:4;2302:16;;;;;;;;;2164:30;;-1:-1:-1;2282:17:15;;2302:16;;;;;;;;;-1:-1:-1;;;2367:16:15;;;-1:-1:-1;2412:4:15;2403:14;;2396:28;;;;-1:-1:-1;2367:16:15;2080:380::o;2532:247::-;2593:7;2665:4;2629:40;;2692:4;2683:13;;2679:71;;;2719:20;;;;;;;;;;;;;;14:162:28;80:5;125:3;116:6;111:3;107:16;103:26;100:46;;;142:1;139;132:12;100:46;-1:-1:-1;164:6:28;14:162;-1:-1:-1;14:162:28:o;181:730::-;293:6;301;309;362:3;350:9;341:7;337:23;333:33;330:53;;;379:1;376;369:12;330:53;402:60;454:7;443:9;402:60;:::i;:::-;392:70;;513:3;502:9;498:19;485:33;541:18;533:6;530:30;527:50;;;573:1;570;563:12;527:50;596:22;;649:4;641:13;;637:27;-1:-1:-1;627:55:28;;678:1;675;668:12;627:55;718:2;705:16;744:18;736:6;733:30;730:50;;;776:1;773;766:12;730:50;823:7;816:4;807:6;803:2;799:15;795:26;792:39;789:59;;;844:1;841;834:12;789:59;181:730;;875:4;867:13;;;;;-1:-1:-1;899:6:28;;-1:-1:-1;;;181:730:28:o;916:196::-;984:20;;1044:42;1033:54;;1023:65;;1013:93;;1102:1;1099;1092:12;1013:93;916:196;;;:::o;1117:707::-;1227:6;1235;1243;1251;1259;1312:3;1300:9;1291:7;1287:23;1283:33;1280:53;;;1329:1;1326;1319:12;1280:53;1374:23;;;-1:-1:-1;1494:2:28;1479:18;;1466:32;;-1:-1:-1;1597:2:28;1582:18;;1569:32;;-1:-1:-1;1646:38:28;1680:2;1665:18;;1646:38;:::i;:::-;1636:48;;1736:3;1725:9;1721:19;1708:33;1772:1;1763:7;1760:14;1750:42;;1788:1;1785;1778:12;1750:42;1811:7;1801:17;;;1117:707;;;;;;;;:::o;2398:226::-;2457:6;2510:2;2498:9;2489:7;2485:23;2481:32;2478:52;;;2526:1;2523;2516:12;2478:52;-1:-1:-1;2571:23:28;;2398:226;-1:-1:-1;2398:226:28:o;3066:251::-;3158:6;3211:3;3199:9;3190:7;3186:23;3182:33;3179:53;;;3228:1;3225;3218:12;3179:53;3251:60;3303:7;3292:9;3251:60;:::i;:::-;3241:70;3066:251;-1:-1:-1;;;3066:251:28:o;4021:348::-;4063:3;4101:5;4095:12;4128:6;4123:3;4116:19;4184:6;4177:4;4170:5;4166:16;4159:4;4154:3;4150:14;4144:47;4236:1;4229:4;4220:6;4215:3;4211:16;4207:27;4200:38;4358:4;4288:66;4283:2;4275:6;4271:15;4267:88;4262:3;4258:98;4254:109;4247:116;;;4021:348;;;;:::o;4374:1314::-;4771:66;4763:6;4759:79;4748:9;4741:98;4875:3;4870:2;4859:9;4855:18;4848:31;4722:4;4902:46;4943:3;4932:9;4928:19;4920:6;4902:46;:::i;:::-;4996:9;4988:6;4984:22;4979:2;4968:9;4964:18;4957:50;5030:33;5056:6;5048;5030:33;:::i;:::-;5094:2;5079:18;;5072:34;;;5155:42;5143:55;;5137:3;5122:19;;5115:84;5230:3;5215:19;;5208:35;;;5280:22;;;5274:3;5259:19;;5252:51;5352:13;;5374:22;;;5424:2;5450:15;;;;-1:-1:-1;5412:15:28;;;;-1:-1:-1;5493:169:28;5507:6;5504:1;5501:13;5493:169;;;5568:13;;5556:26;;5611:2;5637:15;;;;5602:12;;;;5529:1;5522:9;5493:169;;;-1:-1:-1;5679:3:28;;4374:1314;-1:-1:-1;;;;;;;;;;;4374:1314:28:o;5693:186::-;5752:6;5805:2;5793:9;5784:7;5780:23;5776:32;5773:52;;;5821:1;5818;5811:12;5773:52;5844:29;5863:9;5844:29;:::i;5884:284::-;5942:6;5995:2;5983:9;5974:7;5970:23;5966:32;5963:52;;;6011:1;6008;6001:12;5963:52;6050:9;6037:23;6100:18;6093:5;6089:30;6082:5;6079:41;6069:69;;6134:1;6131;6124:12;6173:184;6225:77;6222:1;6215:88;6322:4;6319:1;6312:15;6346:4;6343:1;6336:15;6362:125;6427:9;;;6448:10;;;6445:36;;;6461:18;;:::i;7104:184::-;7156:77;7153:1;7146:88;7253:4;7250:1;7243:15;7277:4;7274:1;7267:15;7889:184;7959:6;8012:2;8000:9;7991:7;7987:23;7983:32;7980:52;;;8028:1;8025;8018:12;7980:52;-1:-1:-1;8051:16:28;;7889:184;-1:-1:-1;7889:184:28:o;9299:128::-;9366:9;;;9387:11;;;9384:37;;;9401:18;;:::i;9432:191::-;9535:18;9500:26;;;9528;;;9496:59;;9567:27;;9564:53;;;9597:18;;:::i;9998:542::-;10213:25;;;10201:2;10186:18;;10268:1;10257:13;;10247:201;;10304:77;10301:1;10294:88;10405:4;10402:1;10395:15;10433:4;10430:1;10423:15;10247:201;10479:2;10464:18;;10457:34;;;;10522:2;10507:18;10500:34;9998:542;;-1:-1:-1;9998:542:28:o;10545:437::-;10624:1;10620:12;;;;10667;;;10688:61;;10742:4;10734:6;10730:17;10720:27;;10688:61;10795:2;10787:6;10784:14;10764:18;10761:38;10758:218;;10832:77;10829:1;10822:88;10933:4;10930:1;10923:15;10961:4;10958:1;10951:15","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","offset":9822}},"immutableReferences":{"4682":[{"start":7940,"length":32}],"4684":[{"start":7898,"length":32}],"4686":[{"start":7856,"length":32}],"4688":[{"start":8021,"length":32}],"4690":[{"start":8061,"length":32}],"4693":[{"start":7242,"length":32}],"4696":[{"start":7286,"length":32}],"9064":[{"start":672,"length":32},{"start":4470,"length":32},{"start":4630,"length":32},{"start":4749,"length":32},{"start":5193,"length":32},{"start":5653,"length":32},{"start":5807,"length":32},{"start":6014,"length":32},{"start":6389,"length":32},{"start":6936,"length":32}],"9066":[{"start":1042,"length":32},{"start":4664,"length":32},{"start":4807,"length":32},{"start":5450,"length":32},{"start":5841,"length":32},{"start":6447,"length":32}],"9068":[{"start":1003,"length":32},{"start":2724,"length":32}],"9070":[{"start":1140,"length":32},{"start":4037,"length":32}],"9072":[{"start":748,"length":32},{"start":1971,"length":32},{"start":2585,"length":32},{"start":2849,"length":32},{"start":3709,"length":32}],"9074":[{"start":806,"length":32},{"start":3053,"length":32},{"start":5875,"length":32},{"start":5957,"length":32},{"start":6329,"length":32}]},"transformations":[{"id":"9064","type":"replace","offset":672,"reason":"immutable"},{"id":"9072","type":"replace","offset":748,"reason":"immutable"},{"id":"9074","type":"replace","offset":806,"reason":"immutable"},{"id":"9068","type":"replace","offset":1003,"reason":"immutable"},{"id":"9066","type":"replace","offset":1042,"reason":"immutable"},{"id":"9070","type":"replace","offset":1140,"reason":"immutable"},{"id":"9072","type":"replace","offset":1971,"reason":"immutable"},{"id":"9072","type":"replace","offset":2585,"reason":"immutable"},{"id":"9068","type":"replace","offset":2724,"reason":"immutable"},{"id":"9072","type":"replace","offset":2849,"reason":"immutable"},{"id":"9074","type":"replace","offset":3053,"reason":"immutable"},{"id":"9072","type":"replace","offset":3709,"reason":"immutable"},{"id":"9070","type":"replace","offset":4037,"reason":"immutable"},{"id":"9064","type":"replace","offset":4470,"reason":"immutable"},{"id":"9064","type":"replace","offset":4630,"reason":"immutable"},{"id":"9066","type":"replace","offset":4664,"reason":"immutable"},{"id":"9064","type":"replace","offset":4749,"reason":"immutable"},{"id":"9066","type":"replace","offset":4807,"reason":"immutable"},{"id":"9064","type":"replace","offset":5193,"reason":"immutable"},{"id":"9066","type":"replace","offset":5450,"reason":"immutable"},{"id":"9064","type":"replace","offset":5653,"reason":"immutable"},{"id":"9064","type":"replace","offset":5807,"reason":"immutable"},{"id":"9066","type":"replace","offset":5841,"reason":"immutable"},{"id":"9074","type":"replace","offset":5875,"reason":"immutable"},{"id":"9074","type":"replace","offset":5957,"reason":"immutable"},{"id":"9064","type":"replace","offset":6014,"reason":"immutable"},{"id":"9074","type":"replace","offset":6329,"reason":"immutable"},{"id":"9064","type":"replace","offset":6389,"reason":"immutable"},{"id":"9066","type":"replace","offset":6447,"reason":"immutable"},{"id":"9064","type":"replace","offset":6936,"reason":"immutable"},{"id":"4693","type":"replace","offset":7242,"reason":"immutable"},{"id":"4696","type":"replace","offset":7286,"reason":"immutable"},{"id":"4686","type":"replace","offset":7856,"reason":"immutable"},{"id":"4684","type":"replace","offset":7898,"reason":"immutable"},{"id":"4682","type":"replace","offset":7940,"reason":"immutable"},{"id":"4688","type":"replace","offset":8021,"reason":"immutable"},{"id":"4690","type":"replace","offset":8061,"reason":"immutable"}],"transformationValues":{"immutables":{"4682":"0xf339d15719f3f5d214c9080e3ee6406c2a9d0a673b1e6e7f13068b832f711389","4684":"0x0000000000000000000000000000000000000000000000000000000000002105","4686":"0x00000000000000000000000075b282ef9af829a0bb4bd937eb82ab8c02d636ef","4688":"0x9077fab79d3108c6ec25d8eeaf9b0379b1679f6737df2d4e3538e2a6814da58a","4690":"0xc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc6","4693":"0x63756c747572652e736273204152432054727573740000000000000000000015","4696":"0x3100000000000000000000000000000000000000000000000000000000000001","9064":"0x000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913","9066":"0x000000000000000000000000bdb2e19b03e02f2c5f32280200361baa991d38d1","9068":"0x000000000000000000000000c63f89f87cb15680fe52ad29b32e9c25f443ee1d","9070":"0x377de099a1c2fcaf53e0e5daa0edb2312edc2429ee6e5db670ccaecbf914556d","9072":"0x136fecb6e194b14d534b4e8b4ca83c7a09136340d2211a0b231e61cb42c6c59d","9074":"0x00000000000000000000000000000000000000000000000000000000004c2430"}}},"deployment":{"transactionHash":"0x86715ecb5ff8646c5f669c30c3042796ea100f0168f32e9e21e7a79960503998","blockNumber":"49881343","transactionIndex":"130","deployer":"0xbdB2e19B03E02F2C5F32280200361BaA991D38D1"},"sources":{"contracts/test/MockUSDC.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.36;\n\nimport {ERC20} from \"@openzeppelin/contracts/token/ERC20/ERC20.sol\";\n\ncontract MockUSDC is ERC20 {\n    constructor() ERC20(\"Mock USDC\", \"USDC\") {}\n\n    function decimals() public pure override returns (uint8) {\n        return 6;\n    }\n\n    function mint(address recipient, uint256 amount) external {\n        _mint(recipient, amount);\n    }\n}\n"},"@openzeppelin/contracts/token/ERC20/ERC20.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 \"./IERC20.sol\";\nimport {IERC20Metadata} from \"./extensions/IERC20Metadata.sol\";\nimport {Context} from \"../../utils/Context.sol\";\nimport {IERC20Errors} from \"../../interfaces/draft-IERC6093.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 ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {\n    mapping(address account => uint256) private _balances;\n\n    mapping(address account => mapping(address spender => uint256)) private _allowances;\n\n    uint256 private _totalSupply;\n\n    string private _name;\n    string private _symbol;\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    constructor(string memory name_, string memory symbol_) {\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        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        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        return _totalSupply;\n    }\n\n    /// @inheritdoc IERC20\n    function balanceOf(address account) public view virtual returns (uint256) {\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        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        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        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"},"@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"},"@openzeppelin/contracts/utils/Context.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)\n\npragma solidity ^0.8.20;\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 Context {\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"},"@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"},"@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/ArcTrustEscrow.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.36;\n\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {SafeERC20} from \"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol\";\nimport {EIP712} from \"@openzeppelin/contracts/utils/cryptography/EIP712.sol\";\nimport {SignatureChecker} from \"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol\";\nimport {ReentrancyGuard} from \"@openzeppelin/contracts/utils/ReentrancyGuard.sol\";\n\n/// @title ARC Trust Escrow\n/// @notice A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.\n/// @dev Selah's immutable judge signer attests only the qualification edge. This contract derives\n///      every eligible recipient and amount from the already-recorded referral graph. There is no\n///      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.\ncontract ArcTrustEscrow is EIP712, ReentrancyGuard {\n    using SafeERC20 for IERC20;\n\n    uint256 public constant PARTICIPANT_MICROUNITS = 10_000;\n    uint256 public constant DIRECT_MICROUNITS = 30_000;\n    uint256 public constant GRANDPARENT_MICROUNITS = 10_000;\n    uint256 public constant MAX_EVENT_MICROUNITS = 50_000;\n    uint256 public constant MAX_QUALIFICATIONS = 100;\n    uint256 public constant MAX_BUDGET_MICROUNITS = 4_990_000;\n    uint64 public constant CAMPAIGN_DURATION = 30 days;\n\n    bytes32 public constant QUALIFICATION_TYPEHASH = keccak256(\n        \"Qualification(bytes32 eventId,bytes32 reviewId,bytes32 subjectAgentId,address subjectPayout,bytes32 parentAgentId,bytes32 evidenceHash,uint64 approvedAt)\"\n    );\n\n    enum RewardTier {\n        Participant,\n        Direct,\n        Grandparent\n    }\n\n    struct Qualification {\n        bytes32 eventId;\n        bytes32 reviewId;\n        bytes32 subjectAgentId;\n        address subjectPayout;\n        bytes32 parentAgentId;\n        bytes32 evidenceHash;\n        uint64 approvedAt;\n    }\n\n    struct QualifiedAgent {\n        address payout;\n        bytes32 parentAgentId;\n        bytes32 eventId;\n        uint64 approvedAt;\n    }\n\n    IERC20 public immutable asset;\n    address public immutable source;\n    address public immutable judge;\n    bytes32 public immutable campaignId;\n    bytes32 public immutable rootAgentId;\n    uint256 public immutable budgetMicrounits;\n\n    uint64 public fundedAt;\n    uint64 public expiresAt;\n    uint64 public sweptAt;\n    uint256 public qualificationCount;\n    uint256 public paidMicrounits;\n\n    mapping(bytes32 agentId => QualifiedAgent agent) public qualifiedAgents;\n    mapping(address payout => bytes32 agentId) public payoutAgentIds;\n    mapping(bytes32 eventId => bool used) public usedEvents;\n    mapping(bytes32 reviewId => bool used) public usedReviews;\n    mapping(bytes32 rewardId => bool paid) public paidRewards;\n\n    event EscrowFunded(\n        address indexed source,\n        address indexed asset,\n        uint256 amountMicrounits,\n        uint64 fundedAt,\n        uint64 expiresAt\n    );\n    event QualificationClaimed(\n        bytes32 indexed eventId,\n        bytes32 indexed reviewId,\n        bytes32 indexed subjectAgentId,\n        bytes32 parentAgentId,\n        bytes32 grandparentAgentId,\n        address subjectPayout,\n        bytes32 evidenceHash,\n        uint64 approvedAt,\n        uint256 eventMicrounits\n    );\n    event RewardPaid(\n        bytes32 indexed rewardId,\n        bytes32 indexed eventId,\n        address indexed recipient,\n        bytes32 recipientAgentId,\n        RewardTier tier,\n        uint256 amountMicrounits\n    );\n    event ExpiredBalanceReturned(\n        address indexed source,\n        address indexed asset,\n        uint256 amountMicrounits,\n        uint64 sweptAt\n    );\n\n    error ZeroAddress();\n    error ZeroIdentifier();\n    error InvalidBudget();\n    error OnlySource();\n    error AlreadyFunded();\n    error NotFunded();\n    error CampaignExpired();\n    error CampaignStillActive();\n    error InvalidFundingAmount();\n    error QualificationLimitReached();\n    error EventAlreadyUsed();\n    error ReviewAlreadyUsed();\n    error AgentAlreadyQualified();\n    error RootCannotQualify();\n    error PayoutAlreadyUsed();\n    error UnknownParent();\n    error SelfParent();\n    error InvalidApprovalTime();\n    error InvalidJudgeSignature();\n    error BudgetExceeded();\n    error RewardAlreadyPaid();\n\n    constructor(\n        IERC20 asset_,\n        address source_,\n        address judge_,\n        bytes32 campaignId_,\n        bytes32 rootAgentId_,\n        uint256 budgetMicrounits_\n    ) EIP712(\"culture.sbs ARC Trust\", \"1\") {\n        if (address(asset_) == address(0) || source_ == address(0) || judge_ == address(0)) {\n            revert ZeroAddress();\n        }\n        if (campaignId_ == bytes32(0) || rootAgentId_ == bytes32(0)) revert ZeroIdentifier();\n        if (budgetMicrounits_ == 0 || budgetMicrounits_ > MAX_BUDGET_MICROUNITS) {\n            revert InvalidBudget();\n        }\n\n        asset = asset_;\n        source = source_;\n        judge = judge_;\n        campaignId = campaignId_;\n        rootAgentId = rootAgentId_;\n        budgetMicrounits = budgetMicrounits_;\n    }\n\n    /// @notice Pulls the exact immutable campaign budget from the source once.\n    /// @dev The source must approve this contract first. Fee-on-transfer tokens fail closed.\n    function fund() external nonReentrant {\n        if (msg.sender != source) revert OnlySource();\n        if (fundedAt != 0) revert AlreadyFunded();\n\n        uint256 beforeBalance = asset.balanceOf(address(this));\n        asset.safeTransferFrom(source, address(this), budgetMicrounits);\n        if (asset.balanceOf(address(this)) - beforeBalance != budgetMicrounits) {\n            revert InvalidFundingAmount();\n        }\n        fundedAt = uint64(block.timestamp);\n        expiresAt = fundedAt + CAMPAIGN_DURATION;\n        emit EscrowFunded(source, address(asset), budgetMicrounits, fundedAt, expiresAt);\n    }\n\n    /// @notice Pays one approved agent and its eligible approved ancestors atomically.\n    /// @dev Anyone may relay the immutable judge's EIP-712 signature before expiry.\n    function claimQualification(Qualification calldata q, bytes calldata signature)\n        external\n        nonReentrant\n    {\n        if (fundedAt == 0) revert NotFunded();\n        if (block.timestamp >= expiresAt) revert CampaignExpired();\n        if (qualificationCount >= MAX_QUALIFICATIONS) revert QualificationLimitReached();\n        if (\n            q.eventId == bytes32(0) || q.reviewId == bytes32(0)\n                || q.subjectAgentId == bytes32(0) || q.evidenceHash == bytes32(0)\n        ) revert ZeroIdentifier();\n        if (q.subjectPayout == address(0)) revert ZeroAddress();\n        if (usedEvents[q.eventId]) revert EventAlreadyUsed();\n        if (usedReviews[q.reviewId]) revert ReviewAlreadyUsed();\n        if (q.subjectAgentId == rootAgentId) revert RootCannotQualify();\n        if (qualifiedAgents[q.subjectAgentId].payout != address(0)) revert AgentAlreadyQualified();\n        if (payoutAgentIds[q.subjectPayout] != bytes32(0)) revert PayoutAlreadyUsed();\n        if (q.subjectAgentId == q.parentAgentId) revert SelfParent();\n        if (q.approvedAt < fundedAt || q.approvedAt > block.timestamp) revert InvalidApprovalTime();\n\n        bool parentIsRoot = q.parentAgentId == rootAgentId;\n        QualifiedAgent memory parent = qualifiedAgents[q.parentAgentId];\n        if (!parentIsRoot && parent.payout == address(0)) revert UnknownParent();\n\n        bytes32 digest = qualificationDigest(q);\n        if (!SignatureChecker.isValidSignatureNowCalldata(judge, digest, signature)) {\n            revert InvalidJudgeSignature();\n        }\n\n        bytes32 grandparentAgentId;\n        uint256 eventMicrounits = PARTICIPANT_MICROUNITS;\n        if (!parentIsRoot) {\n            eventMicrounits += DIRECT_MICROUNITS;\n            grandparentAgentId = parent.parentAgentId;\n            if (grandparentAgentId != rootAgentId) {\n                if (qualifiedAgents[grandparentAgentId].payout == address(0)) revert UnknownParent();\n                eventMicrounits += GRANDPARENT_MICROUNITS;\n            }\n        }\n        if (eventMicrounits > MAX_EVENT_MICROUNITS) revert BudgetExceeded();\n        if (paidMicrounits + eventMicrounits > budgetMicrounits) revert BudgetExceeded();\n\n        usedEvents[q.eventId] = true;\n        usedReviews[q.reviewId] = true;\n        qualifiedAgents[q.subjectAgentId] = QualifiedAgent({\n            payout: q.subjectPayout,\n            parentAgentId: q.parentAgentId,\n            eventId: q.eventId,\n            approvedAt: q.approvedAt\n        });\n        payoutAgentIds[q.subjectPayout] = q.subjectAgentId;\n        qualificationCount += 1;\n        paidMicrounits += eventMicrounits;\n\n        _pay(q.eventId, q.reviewId, q.subjectAgentId, q.subjectPayout, RewardTier.Participant);\n        if (!parentIsRoot) {\n            _pay(q.eventId, q.reviewId, q.parentAgentId, parent.payout, RewardTier.Direct);\n            if (grandparentAgentId != rootAgentId) {\n                _pay(\n                    q.eventId,\n                    q.reviewId,\n                    grandparentAgentId,\n                    qualifiedAgents[grandparentAgentId].payout,\n                    RewardTier.Grandparent\n                );\n            }\n        }\n\n        emit QualificationClaimed(\n            q.eventId,\n            q.reviewId,\n            q.subjectAgentId,\n            q.parentAgentId,\n            grandparentAgentId,\n            q.subjectPayout,\n            q.evidenceHash,\n            q.approvedAt,\n            eventMicrounits\n        );\n    }\n\n    /// @notice Returns every unclaimed USDC unit to the immutable source after expiry.\n    /// @dev Anyone may trigger this liveness operation. It cannot run early.\n    function sweepExpired() external nonReentrant {\n        if (fundedAt == 0) revert NotFunded();\n        if (block.timestamp < expiresAt) revert CampaignStillActive();\n        sweptAt = uint64(block.timestamp);\n        uint256 amount = asset.balanceOf(address(this));\n        if (amount != 0) asset.safeTransfer(source, amount);\n        emit ExpiredBalanceReturned(source, address(asset), amount, sweptAt);\n    }\n\n    function qualificationDigest(Qualification calldata q) public view returns (bytes32) {\n        return _hashTypedDataV4(\n            keccak256(\n                abi.encode(\n                    QUALIFICATION_TYPEHASH,\n                    q.eventId,\n                    q.reviewId,\n                    q.subjectAgentId,\n                    q.subjectPayout,\n                    q.parentAgentId,\n                    q.evidenceHash,\n                    q.approvedAt\n                )\n            )\n        );\n    }\n\n    function rewardId(\n        bytes32 eventId,\n        bytes32 reviewId,\n        bytes32 recipientAgentId,\n        address recipient,\n        RewardTier tier\n    ) public view returns (bytes32) {\n        return keccak256(\n            abi.encode(campaignId, eventId, reviewId, recipientAgentId, recipient, uint8(tier))\n        );\n    }\n\n    function remainingMicrounits() external view returns (uint256) {\n        return asset.balanceOf(address(this));\n    }\n\n    function _pay(\n        bytes32 eventId,\n        bytes32 reviewId,\n        bytes32 recipientAgentId,\n        address recipient,\n        RewardTier tier\n    ) private {\n        uint256 amount = tier == RewardTier.Direct ? DIRECT_MICROUNITS : PARTICIPANT_MICROUNITS;\n        bytes32 id = rewardId(eventId, reviewId, recipientAgentId, recipient, tier);\n        if (paidRewards[id]) revert RewardAlreadyPaid();\n        paidRewards[id] = true;\n        asset.safeTransfer(recipient, amount);\n        emit RewardPaid(id, eventId, recipient, recipientAgentId, tier, amount);\n    }\n}\n"},"@openzeppelin/contracts/utils/ReentrancyGuard.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/ReentrancyGuard.sol)\n\npragma solidity ^0.8.20;\n\nimport {StorageSlot} from \"./StorageSlot.sol\";\n\n/**\n * @dev Contract module that helps prevent reentrant calls to a function.\n *\n * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier\n * available, which can be applied to functions to make sure there are no nested\n * (reentrant) calls to them.\n *\n * Note that because there is a single `nonReentrant` guard, functions marked as\n * `nonReentrant` may not call one another. This can be worked around by making\n * those functions `private`, and then adding `external` `nonReentrant` entry\n * points to them.\n *\n * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,\n * consider using {ReentrancyGuardTransient} instead.\n *\n * TIP: If you would like to learn more about reentrancy and alternative ways\n * to protect against it, check out our blog post\n * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].\n *\n * IMPORTANT: Deprecated. This storage-based reentrancy guard will be removed and replaced\n * by the {ReentrancyGuardTransient} variant in v6.0.\n *\n * @custom:stateless\n */\nabstract contract ReentrancyGuard {\n    using StorageSlot for bytes32;\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.ReentrancyGuard\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant REENTRANCY_GUARD_STORAGE =\n        0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;\n\n    // Booleans are more expensive than uint256 or any type that takes up a full\n    // word because each write operation emits an extra SLOAD to first read the\n    // slot's contents, replace the bits taken up by the boolean, and then write\n    // back. This is the compiler's defense against contract upgrades and\n    // pointer aliasing, and it cannot be disabled.\n\n    // The values being non-zero value makes deployment a bit more expensive,\n    // but in exchange the refund on every call to nonReentrant will be lower in\n    // amount. Since refunds are capped to a percentage of the total\n    // transaction's gas, it is best to keep them low in cases like this one, to\n    // increase the likelihood of the full refund coming into effect.\n    uint256 private constant NOT_ENTERED = 1;\n    uint256 private constant ENTERED = 2;\n\n    /**\n     * @dev Unauthorized reentrant call.\n     */\n    error ReentrancyGuardReentrantCall();\n\n    constructor() {\n        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;\n    }\n\n    /**\n     * @dev Prevents a contract from calling itself, directly or indirectly.\n     * Calling a `nonReentrant` function from another `nonReentrant`\n     * function is not supported. It is possible to prevent this from happening\n     * by making the `nonReentrant` function external, and making it call a\n     * `private` function that does the actual work.\n     */\n    modifier nonReentrant() {\n        _nonReentrantBefore();\n        _;\n        _nonReentrantAfter();\n    }\n\n    /**\n     * @dev A `view` only version of {nonReentrant}. Use to block view functions\n     * from being called, preventing reading from inconsistent contract state.\n     *\n     * CAUTION: This is a \"view\" modifier and does not change the reentrancy\n     * status. Use it only on view functions. For payable or non-payable functions,\n     * use the standard {nonReentrant} modifier instead.\n     */\n    modifier nonReentrantView() {\n        _nonReentrantBeforeView();\n        _;\n    }\n\n    function _nonReentrantBeforeView() private view {\n        if (_reentrancyGuardEntered()) {\n            revert ReentrancyGuardReentrantCall();\n        }\n    }\n\n    function _nonReentrantBefore() private {\n        // On the first call to nonReentrant, _status will be NOT_ENTERED\n        _nonReentrantBeforeView();\n\n        // Any calls to nonReentrant after this point will fail\n        _reentrancyGuardStorageSlot().getUint256Slot().value = ENTERED;\n    }\n\n    function _nonReentrantAfter() private {\n        // By storing the original value once again, a refund is triggered (see\n        // https://eips.ethereum.org/EIPS/eip-2200)\n        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;\n    }\n\n    /**\n     * @dev Returns true if the reentrancy guard is currently set to \"entered\", which indicates there is a\n     * `nonReentrant` function in the call stack.\n     */\n    function _reentrancyGuardEntered() internal view returns (bool) {\n        return _reentrancyGuardStorageSlot().getUint256Slot().value == ENTERED;\n    }\n\n    function _reentrancyGuardStorageSlot() internal pure virtual returns (bytes32) {\n        return REENTRANCY_GUARD_STORAGE;\n    }\n}\n"},"@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"},"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/SignatureChecker.sol)\n\npragma solidity ^0.8.24;\n\nimport {ECDSA} from \"./ECDSA.sol\";\nimport {IERC1271} from \"../../interfaces/IERC1271.sol\";\nimport {IERC7913SignatureVerifier} from \"../../interfaces/IERC7913.sol\";\nimport {Bytes} from \"../Bytes.sol\";\n\n/**\n * @dev Signature verification helper that can be used instead of `ECDSA.recover` to seamlessly support:\n *\n * * ECDSA signatures from externally owned accounts (EOAs)\n * * ERC-1271 signatures from smart contract wallets like Argent and Safe Wallet (previously Gnosis Safe)\n * * ERC-7913 signatures from keys that do not have an Ethereum address of their own\n *\n * See https://eips.ethereum.org/EIPS/eip-1271[ERC-1271] and https://eips.ethereum.org/EIPS/eip-7913[ERC-7913].\n */\nlibrary SignatureChecker {\n    using Bytes for bytes;\n\n    /**\n     * @dev Checks if a signature is valid for a given signer and data hash. If the signer has code, the\n     * signature is validated against it using ERC-1271, otherwise it's validated using `ECDSA.recover`.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     *\n     * NOTE: For an extended version of this function that supports ERC-7913 signatures, see {isValidSignatureNow-bytes-bytes32-bytes-}.\n     */\n    function isValidSignatureNow(address signer, bytes32 hash, bytes memory signature) internal view returns (bool) {\n        if (signer.code.length == 0) {\n            (address recovered, ECDSA.RecoverError err, ) = ECDSA.tryRecover(hash, signature);\n            return err == ECDSA.RecoverError.NoError && recovered == signer;\n        } else {\n            return isValidERC1271SignatureNow(signer, hash, signature);\n        }\n    }\n\n    /**\n     * @dev Variant of {isValidSignatureNow} that takes a signature in calldata\n     */\n    function isValidSignatureNowCalldata(\n        address signer,\n        bytes32 hash,\n        bytes calldata signature\n    ) internal view returns (bool) {\n        if (signer.code.length == 0) {\n            (address recovered, ECDSA.RecoverError err, ) = ECDSA.tryRecoverCalldata(hash, signature);\n            return err == ECDSA.RecoverError.NoError && recovered == signer;\n        } else {\n            return isValidERC1271SignatureNowCalldata(signer, hash, signature);\n        }\n    }\n\n    /**\n     * @dev Checks if a signature is valid for a given signer and data hash. The signature is validated\n     * against the signer smart contract using ERC-1271.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function isValidERC1271SignatureNow(\n        address signer,\n        bytes32 hash,\n        bytes memory signature\n    ) internal view returns (bool result) {\n        bytes4 selector = IERC1271.isValidSignature.selector;\n        uint256 length = signature.length;\n\n        assembly (\"memory-safe\") {\n            // Encoded calldata is :\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data>\n            let ptr := mload(0x40)\n            mstore(ptr, selector)\n            mstore(add(ptr, 0x04), hash)\n            mstore(add(ptr, 0x24), 0x40)\n            mcopy(add(ptr, 0x44), signature, add(length, 0x20))\n\n            let success := staticcall(gas(), signer, ptr, add(length, 0x64), 0x00, 0x20)\n            result := and(success, and(gt(returndatasize(), 0x1f), eq(mload(0x00), selector)))\n        }\n    }\n\n    function isValidERC1271SignatureNowCalldata(\n        address signer,\n        bytes32 hash,\n        bytes calldata signature\n    ) internal view returns (bool result) {\n        bytes4 selector = IERC1271.isValidSignature.selector;\n        uint256 length = signature.length;\n\n        assembly (\"memory-safe\") {\n            // Encoded calldata is :\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data>\n            let ptr := mload(0x40)\n            mstore(ptr, selector)\n            mstore(add(ptr, 0x04), hash)\n            mstore(add(ptr, 0x24), 0x40)\n            mstore(add(ptr, 0x44), length)\n            calldatacopy(add(ptr, 0x64), signature.offset, length)\n\n            let success := staticcall(gas(), signer, ptr, add(length, 0x64), 0x00, 0x20)\n            result := and(success, and(gt(returndatasize(), 0x1f), eq(mload(0x00), selector)))\n        }\n    }\n\n    /**\n     * @dev Verifies a signature for a given ERC-7913 signer and hash.\n     *\n     * The signer is a `bytes` object that is the concatenation of an address and optionally a key:\n     * `verifier || key`. A signer must be at least 20 bytes long.\n     *\n     * Verification is done as follows:\n     *\n     * * If `signer.length < 20`: verification fails\n     * * If `signer.length == 20`: verification is done using {isValidSignatureNow}\n     * * Otherwise: verification is done using {IERC7913SignatureVerifier}\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function isValidSignatureNow(\n        bytes memory signer,\n        bytes32 hash,\n        bytes memory signature\n    ) internal view returns (bool) {\n        if (signer.length < 20) {\n            return false;\n        } else if (signer.length == 20) {\n            return isValidSignatureNow(address(bytes20(signer)), hash, signature);\n        } else {\n            (bool success, bytes memory result) = address(bytes20(signer)).staticcall(\n                abi.encodeCall(IERC7913SignatureVerifier.verify, (signer.slice(20), hash, signature))\n            );\n            return (success &&\n                result.length >= 32 &&\n                abi.decode(result, (bytes32)) == bytes32(IERC7913SignatureVerifier.verify.selector));\n        }\n    }\n\n    /**\n     * @dev Verifies multiple ERC-7913 `signatures` for a given `hash` using a set of `signers`.\n     * Returns `false` if the number of signers and signatures is not the same.\n     *\n     * The signers should be ordered by their `keccak256` hash to ensure efficient duplication check. Unordered\n     * signers are supported, but the uniqueness check will be more expensive.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function areValidSignaturesNow(\n        bytes32 hash,\n        bytes[] memory signers,\n        bytes[] memory signatures\n    ) internal view returns (bool) {\n        if (signers.length != signatures.length) return false;\n\n        bytes32 lastId = bytes32(0);\n\n        for (uint256 i = 0; i < signers.length; ++i) {\n            bytes memory signer = signers[i];\n\n            // If one of the signatures is invalid, reject the batch\n            if (!isValidSignatureNow(signer, hash, signatures[i])) return false;\n\n            bytes32 id = keccak256(signer);\n            // If the current signer ID is greater than all previous IDs, then this is a new signer.\n            if (lastId < id) {\n                lastId = id;\n            } else {\n                // If this signer id is not greater than all the previous ones, verify that it is not a duplicate of a previous one\n                // This loop is never executed if the signers are ordered by id.\n                for (uint256 j = 0; j < i; ++j) {\n                    if (id == keccak256(signers[j])) return false;\n                }\n            }\n        }\n\n        return true;\n    }\n}\n"},"@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"},"@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"},"@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"},"@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"},"@openzeppelin/contracts/interfaces/IERC7913.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC7913.sol)\n\npragma solidity >=0.5.0;\n\n/**\n * @dev Signature verifier interface.\n */\ninterface IERC7913SignatureVerifier {\n    /**\n     * @dev Verifies `signature` as a valid signature of `hash` by `key`.\n     *\n     * MUST return the bytes4 magic value IERC7913SignatureVerifier.verify.selector if the signature is valid.\n     * SHOULD return 0xffffffff or revert if the signature is not valid.\n     * SHOULD return 0xffffffff or revert if the key is empty\n     */\n    function verify(bytes calldata key, bytes32 hash, bytes calldata signature) external view returns (bytes4);\n}\n"},"@openzeppelin/contracts/interfaces/IERC1271.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC1271.sol)\n\npragma solidity >=0.5.0;\n\n/**\n * @dev Interface of the ERC-1271 standard signature validation method for\n * contracts as defined in https://eips.ethereum.org/EIPS/eip-1271[ERC-1271].\n */\ninterface IERC1271 {\n    /**\n     * @dev Should return whether the signature provided is valid for the provided data\n     * @param hash      Hash of the data to be signed\n     * @param signature Signature byte array associated with `hash`\n     */\n    function isValidSignature(bytes32 hash, bytes calldata signature) external view returns (bytes4 magicValue);\n}\n"},"@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"},"@openzeppelin/contracts/utils/cryptography/EIP712.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 \"./MessageHashUtils.sol\";\nimport {ShortStrings, ShortString} from \"../ShortStrings.sol\";\nimport {IERC5267} from \"../../interfaces/IERC5267.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: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain\n * separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the\n * separator from the immutable values, which is cheaper than accessing a cached version in cold storage.\n *\n * @custom:oz-upgrades-unsafe-allow state-variable-immutable\n */\nabstract contract EIP712 is IERC5267 {\n    using ShortStrings for *;\n\n    bytes32 private constant TYPE_HASH =\n        keccak256(\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\");\n\n    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to\n    // invalidate the cached domain separator if the chain id changes.\n    bytes32 private immutable _cachedDomainSeparator;\n    uint256 private immutable _cachedChainId;\n    address private immutable _cachedThis;\n\n    bytes32 private immutable _hashedName;\n    bytes32 private immutable _hashedVersion;\n\n    ShortString private immutable _name;\n    ShortString private immutable _version;\n    // slither-disable-next-line constable-states\n    string private _nameFallback;\n    // slither-disable-next-line constable-states\n    string private _versionFallback;\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    constructor(string memory name, string memory version) {\n        _name = name.toShortStringWithFallback(_nameFallback);\n        _version = version.toShortStringWithFallback(_versionFallback);\n        _hashedName = keccak256(bytes(name));\n        _hashedVersion = keccak256(bytes(version));\n\n        _cachedChainId = block.chainid;\n        _cachedDomainSeparator = _buildDomainSeparator();\n        _cachedThis = address(this);\n    }\n\n    /**\n     * @dev Returns the domain separator for the current chain.\n     */\n    function _domainSeparatorV4() internal view returns (bytes32) {\n        if (address(this) == _cachedThis && block.chainid == _cachedChainId) {\n            return _cachedDomainSeparator;\n        } else {\n            return _buildDomainSeparator();\n        }\n    }\n\n    function _buildDomainSeparator() private view returns (bytes32) {\n        return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, 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: By default this function reads _name which is an immutable value.\n     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Name() internal view returns (string memory) {\n        return _name.toStringWithFallback(_nameFallback);\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: By default this function reads _version which is an immutable value.\n     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Version() internal view returns (string memory) {\n        return _version.toStringWithFallback(_versionFallback);\n    }\n}\n"},"@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"},"@openzeppelin/contracts/utils/ShortStrings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/ShortStrings.sol)\n\npragma solidity ^0.8.20;\n\nimport {StorageSlot} from \"./StorageSlot.sol\";\n\n// | string  | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA   |\n// | length  | 0x                                                              BB |\ntype ShortString is bytes32;\n\n/**\n * @dev This library provides functions to convert short memory strings\n * into a `ShortString` type that can be used as an immutable variable.\n *\n * Strings of arbitrary length can be optimized using this library if\n * they are short enough (up to 31 bytes) by packing them with their\n * length (1 byte) in a single EVM word (32 bytes). Additionally, a\n * fallback mechanism can be used for every other case.\n *\n * Usage example:\n *\n * ```solidity\n * contract Named {\n *     using ShortStrings for *;\n *\n *     ShortString private immutable _name;\n *     string private _nameFallback;\n *\n *     constructor(string memory contractName) {\n *         _name = contractName.toShortStringWithFallback(_nameFallback);\n *     }\n *\n *     function name() external view returns (string memory) {\n *         return _name.toStringWithFallback(_nameFallback);\n *     }\n * }\n * ```\n */\nlibrary ShortStrings {\n    // Used as an identifier for strings longer than 31 bytes.\n    bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;\n\n    error StringTooLong(string str);\n    error InvalidShortString();\n\n    /**\n     * @dev Encode a string of at most 31 chars into a `ShortString`.\n     *\n     * This will trigger a `StringTooLong` error is the input string is too long.\n     */\n    function toShortString(string memory str) internal pure returns (ShortString) {\n        bytes memory bstr = bytes(str);\n        if (bstr.length > 0x1f) {\n            revert StringTooLong(str);\n        }\n        return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));\n    }\n\n    /**\n     * @dev Decode a `ShortString` back to a \"normal\" string.\n     */\n    function toString(ShortString sstr) internal pure returns (string memory) {\n        uint256 len = byteLength(sstr);\n        // using `new string(len)` would work locally but is not memory safe.\n        string memory str = new string(0x20);\n        assembly (\"memory-safe\") {\n            mstore(str, len)\n            mstore(add(str, 0x20), sstr)\n        }\n        return str;\n    }\n\n    /**\n     * @dev Return the length of a `ShortString`.\n     */\n    function byteLength(ShortString sstr) internal pure returns (uint256) {\n        uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;\n        if (result > 0x1f) {\n            revert InvalidShortString();\n        }\n        return result;\n    }\n\n    /**\n     * @dev Encode a string into a `ShortString`, or write it to storage if it is too long.\n     */\n    function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {\n        if (bytes(value).length < 0x20) {\n            return toShortString(value);\n        } else {\n            StorageSlot.getStringSlot(store).value = value;\n            return ShortString.wrap(FALLBACK_SENTINEL);\n        }\n    }\n\n    /**\n     * @dev Decode a string that was encoded to `ShortString` or written to storage using {toShortStringWithFallback}.\n     */\n    function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {\n        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {\n            return toString(value);\n        } else {\n            return store;\n        }\n    }\n\n    /**\n     * @dev Return the length of a string that was encoded to `ShortString` or written to storage using\n     * {toShortStringWithFallback}.\n     *\n     * WARNING: This will return the \"byte length\" of the string. This may not reflect the actual length in terms of\n     * actual characters as the UTF-8 encoding of a single character can span over multiple bytes.\n     */\n    function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {\n        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {\n            return byteLength(value);\n        } else {\n            return bytes(store).length;\n        }\n    }\n}\n"},"@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"},"@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"},"@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"},"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/utils/SafeERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"../IERC20.sol\";\nimport {IERC1363} from \"../../../interfaces/IERC1363.sol\";\n\n/**\n * @title SafeERC20\n * @dev Wrappers around ERC-20 operations that throw on failure (when the token\n * contract returns false). Tokens that return no value (and instead revert or\n * throw on failure) are also supported, non-reverting calls are assumed to be\n * successful.\n * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\n * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\n */\nlibrary SafeERC20 {\n    /**\n     * @dev An operation with an ERC-20 token failed.\n     */\n    error SafeERC20FailedOperation(address token);\n\n    /**\n     * @dev Indicates a failed `decreaseAllowance` request.\n     */\n    error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);\n\n    /**\n     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful.\n     */\n    function safeTransfer(IERC20 token, address to, uint256 value) internal {\n        if (!_safeTransfer(token, to, value, true)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the\n     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.\n     */\n    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {\n        if (!_safeTransferFrom(token, from, to, value, true)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Variant of {safeTransfer} that returns a bool instead of reverting if the operation is not successful.\n     */\n    function trySafeTransfer(IERC20 token, address to, uint256 value) internal returns (bool) {\n        return _safeTransfer(token, to, value, false);\n    }\n\n    /**\n     * @dev Variant of {safeTransferFrom} that returns a bool instead of reverting if the operation is not successful.\n     */\n    function trySafeTransferFrom(IERC20 token, address from, address to, uint256 value) internal returns (bool) {\n        return _safeTransferFrom(token, from, to, value, false);\n    }\n\n    /**\n     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful.\n     *\n     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the \"client\"\n     * smart contract uses ERC-7674 to set temporary allowances, then the \"client\" smart contract should avoid using\n     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract\n     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.\n     */\n    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {\n        uint256 oldAllowance = token.allowance(address(this), spender);\n        forceApprove(token, spender, oldAllowance + value);\n    }\n\n    /**\n     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no\n     * value, non-reverting calls are assumed to be successful.\n     *\n     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the \"client\"\n     * smart contract uses ERC-7674 to set temporary allowances, then the \"client\" smart contract should avoid using\n     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract\n     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.\n     */\n    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {\n        unchecked {\n            uint256 currentAllowance = token.allowance(address(this), spender);\n            if (currentAllowance < requestedDecrease) {\n                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);\n            }\n            forceApprove(token, spender, currentAllowance - requestedDecrease);\n        }\n    }\n\n    /**\n     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval\n     * to be set to zero before setting it to a non-zero value, such as USDT.\n     *\n     * NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function\n     * only sets the \"standard\" allowance. Any temporary allowance will remain active, in addition to the value being\n     * set here.\n     */\n    function forceApprove(IERC20 token, address spender, uint256 value) internal {\n        if (!_safeApprove(token, spender, value, false)) {\n            if (!_safeApprove(token, spender, 0, true)) revert SafeERC20FailedOperation(address(token));\n            if (!_safeApprove(token, spender, value, true)) revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no\n     * code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {\n        if (to.code.length == 0) {\n            safeTransfer(token, to, value);\n        } else if (!token.transferAndCall(to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target\n     * has no code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function transferFromAndCallRelaxed(\n        IERC1363 token,\n        address from,\n        address to,\n        uint256 value,\n        bytes memory data\n    ) internal {\n        if (to.code.length == 0) {\n            safeTransferFrom(token, from, to, value);\n        } else if (!token.transferFromAndCall(from, to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no\n     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.\n     * Oppositely, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}\n     * once without retrying, and relies on the returned value to be true.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {\n        if (to.code.length == 0) {\n            forceApprove(token, to, value);\n        } else if (!token.approveAndCall(to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.transfer(to, value)` call, relaxing the requirement on the return value: the\n     * return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param to The recipient of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeTransfer(IERC20 token, address to, uint256 value, bool bubble) private returns (bool success) {\n        bytes4 selector = IERC20.transfer.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(to, shr(96, not(0))))\n            mstore(0x24, value)\n            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.transferFrom(from, to, value)` call, relaxing the requirement on the return\n     * value: the return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param from The sender of the tokens\n     * @param to The recipient of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeTransferFrom(\n        IERC20 token,\n        address from,\n        address to,\n        uint256 value,\n        bool bubble\n    ) private returns (bool success) {\n        bytes4 selector = IERC20.transferFrom.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(from, shr(96, not(0))))\n            mstore(0x24, and(to, shr(96, not(0))))\n            mstore(0x44, value)\n            success := call(gas(), token, 0, 0x00, 0x64, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n            mstore(0x60, 0)\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.approve(spender, value)` call, relaxing the requirement on the return value:\n     * the return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param spender The spender of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeApprove(IERC20 token, address spender, uint256 value, bool bubble) private returns (bool success) {\n        bytes4 selector = IERC20.approve.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(spender, shr(96, not(0))))\n            mstore(0x24, value)\n            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n        }\n    }\n}\n"},"@openzeppelin/contracts/interfaces/IERC1363.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC1363.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20} from \"./IERC20.sol\";\nimport {IERC165} from \"./IERC165.sol\";\n\n/**\n * @title IERC1363\n * @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].\n *\n * Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract\n * after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.\n */\ninterface IERC1363 is IERC20, IERC165 {\n    /*\n     * Note: the ERC-165 identifier for this interface is 0xb0202a11.\n     * 0xb0202a11 ===\n     *   bytes4(keccak256('transferAndCall(address,uint256)')) ^\n     *   bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^\n     *   bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^\n     *   bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^\n     *   bytes4(keccak256('approveAndCall(address,uint256)')) ^\n     *   bytes4(keccak256('approveAndCall(address,uint256,bytes)'))\n     */\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferAndCall(address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @param data Additional data with no specified format, sent in call to `to`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param from The address which you want to send tokens from.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferFromAndCall(address from, address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param from The address which you want to send tokens from.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @param data Additional data with no specified format, sent in call to `to`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.\n     * @param spender The address which will spend the funds.\n     * @param value The amount of tokens to be spent.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function approveAndCall(address spender, uint256 value) external returns (bool);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.\n     * @param spender The address which will spend the funds.\n     * @param value The amount of tokens to be spent.\n     * @param data Additional data with no specified format, sent in call to `spender`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);\n}\n"},"@openzeppelin/contracts/interfaces/IERC165.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC165.sol)\n\npragma solidity >=0.4.16;\n\nimport {IERC165} from \"../utils/introspection/IERC165.sol\";\n"},"@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"},"@openzeppelin/contracts/interfaces/IERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC20.sol)\n\npragma solidity >=0.4.16;\n\nimport {IERC20} from \"../token/ERC20/IERC20.sol\";\n"}},"compilation":{"language":"Solidity","compiler":"solc","compilerVersion":"0.8.36+commit.8a079791","compilerSettings":{"metadata":{"appendCBOR":true,"bytecodeHash":"ipfs"},"optimizer":{"runs":10000,"enabled":true},"evmVersion":"cancun"},"name":"ArcTrustEscrow","fullyQualifiedName":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},"abi":[{"type":"constructor","inputs":[{"name":"asset_","type":"address","internalType":"contract IERC20"},{"name":"source_","type":"address","internalType":"address"},{"name":"judge_","type":"address","internalType":"address"},{"name":"campaignId_","type":"bytes32","internalType":"bytes32"},{"name":"rootAgentId_","type":"bytes32","internalType":"bytes32"},{"name":"budgetMicrounits_","type":"uint256","internalType":"uint256"}],"stateMutability":"nonpayable"},{"name":"AgentAlreadyQualified","type":"error","inputs":[]},{"name":"AlreadyFunded","type":"error","inputs":[]},{"name":"BudgetExceeded","type":"error","inputs":[]},{"name":"CampaignExpired","type":"error","inputs":[]},{"name":"CampaignStillActive","type":"error","inputs":[]},{"name":"EventAlreadyUsed","type":"error","inputs":[]},{"name":"InvalidApprovalTime","type":"error","inputs":[]},{"name":"InvalidBudget","type":"error","inputs":[]},{"name":"InvalidFundingAmount","type":"error","inputs":[]},{"name":"InvalidJudgeSignature","type":"error","inputs":[]},{"name":"InvalidShortString","type":"error","inputs":[]},{"name":"NotFunded","type":"error","inputs":[]},{"name":"OnlySource","type":"error","inputs":[]},{"name":"PayoutAlreadyUsed","type":"error","inputs":[]},{"name":"QualificationLimitReached","type":"error","inputs":[]},{"name":"ReentrancyGuardReentrantCall","type":"error","inputs":[]},{"name":"ReviewAlreadyUsed","type":"error","inputs":[]},{"name":"RewardAlreadyPaid","type":"error","inputs":[]},{"name":"RootCannotQualify","type":"error","inputs":[]},{"name":"SafeERC20FailedOperation","type":"error","inputs":[{"name":"token","type":"address","internalType":"address"}]},{"name":"SelfParent","type":"error","inputs":[]},{"name":"StringTooLong","type":"error","inputs":[{"name":"str","type":"string","internalType":"string"}]},{"name":"UnknownParent","type":"error","inputs":[]},{"name":"ZeroAddress","type":"error","inputs":[]},{"name":"ZeroIdentifier","type":"error","inputs":[]},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"EscrowFunded","type":"event","inputs":[{"name":"source","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"},{"name":"fundedAt","type":"uint64","indexed":false,"internalType":"uint64"},{"name":"expiresAt","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"ExpiredBalanceReturned","type":"event","inputs":[{"name":"source","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"},{"name":"sweptAt","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"QualificationClaimed","type":"event","inputs":[{"name":"eventId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"reviewId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"parentAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"grandparentAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"subjectPayout","type":"address","indexed":false,"internalType":"address"},{"name":"evidenceHash","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"approvedAt","type":"uint64","indexed":false,"internalType":"uint64"},{"name":"eventMicrounits","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"RewardPaid","type":"event","inputs":[{"name":"rewardId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"eventId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"recipient","type":"address","indexed":true,"internalType":"address"},{"name":"recipientAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"tier","type":"uint8","indexed":false,"internalType":"enum ArcTrustEscrow.RewardTier"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"CAMPAIGN_DURATION","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"DIRECT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"GRANDPARENT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_BUDGET_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_EVENT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_QUALIFICATIONS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"PARTICIPANT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"QUALIFICATION_TYPEHASH","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"asset","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"contract IERC20"}],"stateMutability":"view"},{"name":"budgetMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"campaignId","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"claimQualification","type":"function","inputs":[{"name":"q","type":"tuple","components":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","internalType":"bytes32"},{"name":"subjectPayout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"evidenceHash","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification"},{"name":"signature","type":"bytes","internalType":"bytes"}],"outputs":[],"stateMutability":"nonpayable"},{"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":"expiresAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"fund","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"fundedAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"judge","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"paidMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"paidRewards","type":"function","inputs":[{"name":"rewardId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"paid","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"payoutAgentIds","type":"function","inputs":[{"name":"payout","type":"address","internalType":"address"}],"outputs":[{"name":"agentId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"qualificationCount","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"qualificationDigest","type":"function","inputs":[{"name":"q","type":"tuple","components":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","internalType":"bytes32"},{"name":"subjectPayout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"evidenceHash","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"qualifiedAgents","type":"function","inputs":[{"name":"agentId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"payout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"remainingMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"rewardId","type":"function","inputs":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"recipientAgentId","type":"bytes32","internalType":"bytes32"},{"name":"recipient","type":"address","internalType":"address"},{"name":"tier","type":"uint8","internalType":"enum ArcTrustEscrow.RewardTier"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"rootAgentId","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"source","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"sweepExpired","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"sweptAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"usedEvents","type":"function","inputs":[{"name":"eventId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"used","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"usedReviews","type":"function","inputs":[{"name":"reviewId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"used","type":"bool","internalType":"bool"}],"stateMutability":"view"}],"metadata":{"compiler":{"version":"0.8.36+commit.8a079791"},"language":"Solidity","output":{"abi":[{"inputs":[{"internalType":"contract IERC20","name":"asset_","type":"address"},{"internalType":"address","name":"source_","type":"address"},{"internalType":"address","name":"judge_","type":"address"},{"internalType":"bytes32","name":"campaignId_","type":"bytes32"},{"internalType":"bytes32","name":"rootAgentId_","type":"bytes32"},{"internalType":"uint256","name":"budgetMicrounits_","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AgentAlreadyQualified","type":"error"},{"inputs":[],"name":"AlreadyFunded","type":"error"},{"inputs":[],"name":"BudgetExceeded","type":"error"},{"inputs":[],"name":"CampaignExpired","type":"error"},{"inputs":[],"name":"CampaignStillActive","type":"error"},{"inputs":[],"name":"EventAlreadyUsed","type":"error"},{"inputs":[],"name":"InvalidApprovalTime","type":"error"},{"inputs":[],"name":"InvalidBudget","type":"error"},{"inputs":[],"name":"InvalidFundingAmount","type":"error"},{"inputs":[],"name":"InvalidJudgeSignature","type":"error"},{"inputs":[],"name":"InvalidShortString","type":"error"},{"inputs":[],"name":"NotFunded","type":"error"},{"inputs":[],"name":"OnlySource","type":"error"},{"inputs":[],"name":"PayoutAlreadyUsed","type":"error"},{"inputs":[],"name":"QualificationLimitReached","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"ReviewAlreadyUsed","type":"error"},{"inputs":[],"name":"RewardAlreadyPaid","type":"error"},{"inputs":[],"name":"RootCannotQualify","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"SelfParent","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[],"name":"UnknownParent","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"inputs":[],"name":"ZeroIdentifier","type":"error"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"source","type":"address"},{"indexed":true,"internalType":"address","name":"asset","type":"address"},{"indexed":false,"internalType":"uint256","name":"amountMicrounits","type":"uint256"},{"indexed":false,"internalType":"uint64","name":"fundedAt","type":"uint64"},{"indexed":false,"internalType":"uint64","name":"expiresAt","type":"uint64"}],"name":"EscrowFunded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"source","type":"address"},{"indexed":true,"internalType":"address","name":"asset","type":"address"},{"indexed":false,"internalType":"uint256","name":"amountMicrounits","type":"uint256"},{"indexed":false,"internalType":"uint64","name":"sweptAt","type":"uint64"}],"name":"ExpiredBalanceReturned","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"eventId","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"reviewId","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"subjectAgentId","type":"bytes32"},{"indexed":false,"internalType":"bytes32","name":"parentAgentId","type":"bytes32"},{"indexed":false,"internalType":"bytes32","name":"grandparentAgentId","type":"bytes32"},{"indexed":false,"internalType":"address","name":"subjectPayout","type":"address"},{"indexed":false,"internalType":"bytes32","name":"evidenceHash","type":"bytes32"},{"indexed":false,"internalType":"uint64","name":"approvedAt","type":"uint64"},{"indexed":false,"internalType":"uint256","name":"eventMicrounits","type":"uint256"}],"name":"QualificationClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"rewardId","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"eventId","type":"bytes32"},{"indexed":true,"internalType":"address","name":"recipient","type":"address"},{"indexed":false,"internalType":"bytes32","name":"recipientAgentId","type":"bytes32"},{"indexed":false,"internalType":"enum ArcTrustEscrow.RewardTier","name":"tier","type":"uint8"},{"indexed":false,"internalType":"uint256","name":"amountMicrounits","type":"uint256"}],"name":"RewardPaid","type":"event"},{"inputs":[],"name":"CAMPAIGN_DURATION","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"DIRECT_MICROUNITS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"GRANDPARENT_MICROUNITS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_BUDGET_MICROUNITS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_EVENT_MICROUNITS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_QUALIFICATIONS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"PARTICIPANT_MICROUNITS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"QUALIFICATION_TYPEHASH","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"asset","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"budgetMicrounits","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"campaignId","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes32","name":"eventId","type":"bytes32"},{"internalType":"bytes32","name":"reviewId","type":"bytes32"},{"internalType":"bytes32","name":"subjectAgentId","type":"bytes32"},{"internalType":"address","name":"subjectPayout","type":"address"},{"internalType":"bytes32","name":"parentAgentId","type":"bytes32"},{"internalType":"bytes32","name":"evidenceHash","type":"bytes32"},{"internalType":"uint64","name":"approvedAt","type":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification","name":"q","type":"tuple"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"claimQualification","outputs":[],"stateMutability":"nonpayable","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":[],"name":"expiresAt","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fund","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"fundedAt","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"judge","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"paidMicrounits","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"rewardId","type":"bytes32"}],"name":"paidRewards","outputs":[{"internalType":"bool","name":"paid","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"payout","type":"address"}],"name":"payoutAgentIds","outputs":[{"internalType":"bytes32","name":"agentId","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"qualificationCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"bytes32","name":"eventId","type":"bytes32"},{"internalType":"bytes32","name":"reviewId","type":"bytes32"},{"internalType":"bytes32","name":"subjectAgentId","type":"bytes32"},{"internalType":"address","name":"subjectPayout","type":"address"},{"internalType":"bytes32","name":"parentAgentId","type":"bytes32"},{"internalType":"bytes32","name":"evidenceHash","type":"bytes32"},{"internalType":"uint64","name":"approvedAt","type":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification","name":"q","type":"tuple"}],"name":"qualificationDigest","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"agentId","type":"bytes32"}],"name":"qualifiedAgents","outputs":[{"internalType":"address","name":"payout","type":"address"},{"internalType":"bytes32","name":"parentAgentId","type":"bytes32"},{"internalType":"bytes32","name":"eventId","type":"bytes32"},{"internalType":"uint64","name":"approvedAt","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"remainingMicrounits","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"eventId","type":"bytes32"},{"internalType":"bytes32","name":"reviewId","type":"bytes32"},{"internalType":"bytes32","name":"recipientAgentId","type":"bytes32"},{"internalType":"address","name":"recipient","type":"address"},{"internalType":"enum ArcTrustEscrow.RewardTier","name":"tier","type":"uint8"}],"name":"rewardId","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"rootAgentId","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"source","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"sweepExpired","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"sweptAt","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"eventId","type":"bytes32"}],"name":"usedEvents","outputs":[{"internalType":"bool","name":"used","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"reviewId","type":"bytes32"}],"name":"usedReviews","outputs":[{"internalType":"bool","name":"used","type":"bool"}],"stateMutability":"view","type":"function"}],"devdoc":{"details":"Selah's immutable judge signer attests only the qualification edge. This contract derives      every eligible recipient and amount from the already-recorded referral graph. There is no      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.","errors":{"ReentrancyGuardReentrantCall()":[{"details":"Unauthorized reentrant call."}],"SafeERC20FailedOperation(address)":[{"details":"An operation with an ERC-20 token failed."}]},"events":{"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."}},"kind":"dev","methods":{"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"details":"Anyone may relay the immutable judge's EIP-712 signature before expiry."},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"fund()":{"details":"The source must approve this contract first. Fee-on-transfer tokens fail closed."},"sweepExpired()":{"details":"Anyone may trigger this liveness operation. It cannot run early."}},"title":"ARC Trust Escrow","version":1},"userdoc":{"kind":"user","methods":{"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"notice":"Pays one approved agent and its eligible approved ancestors atomically."},"fund()":{"notice":"Pulls the exact immutable campaign budget from the source once."},"sweepExpired()":{"notice":"Returns every unclaimed USDC unit to the immutable source after expiry."}},"notice":"A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.","version":1}},"settings":{"compilationTarget":{"contracts/ArcTrustEscrow.sol":"ArcTrustEscrow"},"evmVersion":"cancun","libraries":{},"metadata":{"bytecodeHash":"ipfs"},"optimizer":{"enabled":true,"runs":10000},"remappings":[]},"sources":{"@openzeppelin/contracts/interfaces/IERC1271.sol":{"keccak256":"0x66c7ec42c6c43712be2107a50ab4529379bc76a632b425babec698d9da921ac6","license":"MIT","urls":["bzz-raw://dce2778f0b638adfc5ba29c2c618c855fe725fa74a16846386aa1d56a834aa04","dweb:/ipfs/QmPV9oWnzQdi58od266j62xvviavLNHqKLZfm6k2K1qy9E"]},"@openzeppelin/contracts/interfaces/IERC1363.sol":{"keccak256":"0xd5ea07362ab630a6a3dee4285a74cf2377044ca2e4be472755ad64d7c5d4b69d","license":"MIT","urls":["bzz-raw://da5e832b40fc5c3145d3781e2e5fa60ac2052c9d08af7e300dc8ab80c4343100","dweb:/ipfs/QmTzf7N5ZUdh5raqtzbM11yexiUoLC9z3Ws632MCuycq1d"]},"@openzeppelin/contracts/interfaces/IERC165.sol":{"keccak256":"0x0afcb7e740d1537b252cb2676f600465ce6938398569f09ba1b9ca240dde2dfc","license":"MIT","urls":["bzz-raw://1c299900ac4ec268d4570ecef0d697a3013cd11a6eb74e295ee3fbc945056037","dweb:/ipfs/Qmab9owJoxcA7vJT5XNayCMaUR1qxqj1NDzzisduwaJMcZ"]},"@openzeppelin/contracts/interfaces/IERC20.sol":{"keccak256":"0x1a6221315ce0307746c2c4827c125d821ee796c74a676787762f4778671d4f44","license":"MIT","urls":["bzz-raw://1bb2332a7ee26dd0b0de9b7fe266749f54820c99ab6a3bcb6f7e6b751d47ee2d","dweb:/ipfs/QmcRWpaBeCYkhy68PR3B4AgD7asuQk7PwkWxrvJbZcikLF"]},"@openzeppelin/contracts/interfaces/IERC5267.sol":{"keccak256":"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee","license":"MIT","urls":["bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae","dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1"]},"@openzeppelin/contracts/interfaces/IERC7913.sol":{"keccak256":"0xe5a126930df1d54e4a6dd5fea09010c4a7db0ea974c6c17a1e6082879f5a032b","license":"MIT","urls":["bzz-raw://2f58f5a90328536a6c68289916bfa4ed653d871319c7b2a416ab3f6263c4f2f5","dweb:/ipfs/Qmaa9DmgUA16Urz5fuF4RbFz2NaVpNLV41ddwykSdasFUd"]},"@openzeppelin/contracts/token/ERC20/IERC20.sol":{"keccak256":"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2","license":"MIT","urls":["bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303","dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV"]},"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol":{"keccak256":"0x304d732678032a9781ae85c8f204c8fba3d3a5e31c02616964e75cfdc5049098","license":"MIT","urls":["bzz-raw://299ced486011781dc98f638059678323c03079fefae1482abaa2135b22fa92d0","dweb:/ipfs/QmbZNbcPTBxNvwChavN2kkZZs7xHhYL7mv51KrxMhsMs3j"]},"@openzeppelin/contracts/utils/Bytes.sol":{"keccak256":"0xf80e4b96b6849936ea0fabd76cf81b13d7276295fddb1e1c07afb3ddf650b0ac","license":"MIT","urls":["bzz-raw://6430007255ac11c6e9c4331a418f3af52ff66fbbae959f645301d025b20aeb08","dweb:/ipfs/QmQE5fjmBBRw9ndnzJuC2uskYss1gbaR7JdazoCf1FGoBj"]},"@openzeppelin/contracts/utils/Panic.sol":{"keccak256":"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a","license":"MIT","urls":["bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a","dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG"]},"@openzeppelin/contracts/utils/ReentrancyGuard.sol":{"keccak256":"0xa516cbf1c7d15d3517c2d668601ce016c54395bf5171918a14e2686977465f53","license":"MIT","urls":["bzz-raw://1e1d079e8edfb58efd23a311e315a4807b01b5d1cf153f8fa2d0608b9dec3e99","dweb:/ipfs/QmTBExeX2SDTkn5xbk5ssbYSx7VqRp9H4Ux1CY4uQM4b9N"]},"@openzeppelin/contracts/utils/ShortStrings.sol":{"keccak256":"0x0768b3bdb701fe4994b3be932ca8635551dfebe04c645f77500322741bebf57c","license":"MIT","urls":["bzz-raw://a2059f9ca8d3c11c49ca49fc9c5fb070f18cc85d12a7688e45322ed0e2a1cb99","dweb:/ipfs/QmS2gwX51RAvSw4tYbjHccY2CKbh2uvDzqHLAFXdsddgia"]},"@openzeppelin/contracts/utils/StorageSlot.sol":{"keccak256":"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97","license":"MIT","urls":["bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b","dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM"]},"@openzeppelin/contracts/utils/Strings.sol":{"keccak256":"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8","license":"MIT","urls":["bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc","dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS"]},"@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"keccak256":"0xbeb5cad8aaabe0d35d2ec1a8414d91e81e5a8ca679add4cf57e2f33476861f40","license":"MIT","urls":["bzz-raw://ebb272a5ee2da4e8bd5551334e0ce8dce4e9c56a04570d6bf046d260fab3116a","dweb:/ipfs/QmNw6RyM769qcqFocDq6HJMG2WiEnQbvizpRaUXsACHho2"]},"@openzeppelin/contracts/utils/cryptography/EIP712.sol":{"keccak256":"0x8440117ea216b97a7bad690a67449fd372c840d073c8375822667e14702782b4","license":"MIT","urls":["bzz-raw://ebb6645995b8290d0b9121825e2533e4e28977b2c6befee76e15e58f0feb61d4","dweb:/ipfs/QmVR72j6kL5R2txuihieDev1FeTi4KWJS1Z6ABbwL3Qtph"]},"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"keccak256":"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d","license":"MIT","urls":["bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c","dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL"]},"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol":{"keccak256":"0x0d53049a9969f2bc5cb88b32c909e2729a5fa157d258305b42b502427ad492c6","license":"MIT","urls":["bzz-raw://eacca39a3f50c665454866342bb05f10cc1e87c2bbd73dda981a6a0de1978fb0","dweb:/ipfs/QmbFKMUT5BXtCdA2SCof9GuasrVhoGzaLUQG3gUvGDtdoE"]},"@openzeppelin/contracts/utils/introspection/IERC165.sol":{"keccak256":"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c","license":"MIT","urls":["bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617","dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u"]},"@openzeppelin/contracts/utils/math/Math.sol":{"keccak256":"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857","license":"MIT","urls":["bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5","dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y"]},"@openzeppelin/contracts/utils/math/SafeCast.sol":{"keccak256":"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083","license":"MIT","urls":["bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9","dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif"]},"@openzeppelin/contracts/utils/math/SignedMath.sol":{"keccak256":"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3","license":"MIT","urls":["bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03","dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ"]},"contracts/ArcTrustEscrow.sol":{"keccak256":"0x9786710b868f04439c3dae8cd58b1253cbdd1945cdcb872d14d27615ae0501dd","license":"MIT","urls":["bzz-raw://a6e51864bb1197a7a3eaa03b3ea8f65e935e1f166de82316b92c4d5e2917217a","dweb:/ipfs/QmRbsSMEvDEeDMdREuCrAPhTbzcvAF5x3BLb5wbEEAdztM"]}},"version":1},"storageLayout":{"types":{"t_bool":{"label":"bool","encoding":"inplace","numberOfBytes":"1"},"t_uint64":{"label":"uint64","encoding":"inplace","numberOfBytes":"8"},"t_address":{"label":"address","encoding":"inplace","numberOfBytes":"20"},"t_bytes32":{"label":"bytes32","encoding":"inplace","numberOfBytes":"32"},"t_uint256":{"label":"uint256","encoding":"inplace","numberOfBytes":"32"},"t_string_storage":{"label":"string","encoding":"bytes","numberOfBytes":"32"},"t_mapping(t_bytes32,t_bool)":{"key":"t_bytes32","label":"mapping(bytes32 => bool)","value":"t_bool","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_address,t_bytes32)":{"key":"t_address","label":"mapping(address => bytes32)","value":"t_bytes32","encoding":"mapping","numberOfBytes":"32"},"t_struct(QualifiedAgent)9061_storage":{"label":"struct ArcTrustEscrow.QualifiedAgent","members":[{"slot":"0","type":"t_address","astId":9054,"label":"payout","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"1","type":"t_bytes32","astId":9056,"label":"parentAgentId","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_bytes32","astId":9058,"label":"eventId","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"3","type":"t_uint64","astId":9060,"label":"approvedAt","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"}],"encoding":"inplace","numberOfBytes":"128"},"t_mapping(t_bytes32,t_struct(QualifiedAgent)9061_storage)":{"key":"t_bytes32","label":"mapping(bytes32 => struct ArcTrustEscrow.QualifiedAgent)","value":"t_struct(QualifiedAgent)9061_storage","encoding":"mapping","numberOfBytes":"32"}},"storage":[{"slot":"0","type":"t_string_storage","astId":4698,"label":"_nameFallback","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"1","type":"t_string_storage","astId":4700,"label":"_versionFallback","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9076,"label":"fundedAt","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9078,"label":"expiresAt","offset":8,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9080,"label":"sweptAt","offset":16,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"3","type":"t_uint256","astId":9082,"label":"qualificationCount","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"4","type":"t_uint256","astId":9084,"label":"paidMicrounits","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"5","type":"t_mapping(t_bytes32,t_struct(QualifiedAgent)9061_storage)","astId":9089,"label":"qualifiedAgents","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"6","type":"t_mapping(t_address,t_bytes32)","astId":9093,"label":"payoutAgentIds","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"7","type":"t_mapping(t_bytes32,t_bool)","astId":9097,"label":"usedEvents","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"8","type":"t_mapping(t_bytes32,t_bool)","astId":9101,"label":"usedReviews","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"9","type":"t_mapping(t_bytes32,t_bool)","astId":9105,"label":"paidRewards","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"}]},"transientStorageLayout":{"types":null,"storage":[]},"userdoc":{"kind":"user","notice":"A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.","methods":{"fund()":{"notice":"Pulls the exact immutable campaign budget from the source once."},"sweepExpired()":{"notice":"Returns every unclaimed USDC unit to the immutable source after expiry."},"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"notice":"Pays one approved agent and its eligible approved ancestors atomically."}},"version":1},"devdoc":{"kind":"dev","title":"ARC Trust Escrow","errors":{"ReentrancyGuardReentrantCall()":[{"details":"Unauthorized reentrant call."}],"SafeERC20FailedOperation(address)":[{"details":"An operation with an ERC-20 token failed."}]},"events":{"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."}},"details":"Selah's immutable judge signer attests only the qualification edge. This contract derives      every eligible recipient and amount from the already-recorded referral graph. There is no      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.","methods":{"fund()":{"details":"The source must approve this contract first. Fee-on-transfer tokens fail closed."},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"sweepExpired()":{"details":"Anyone may trigger this liveness operation. It cannot run early."},"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"details":"Anyone may relay the immutable judge's EIP-712 signature before expiry."}},"version":1},"sourceIds":{"contracts/test/MockUSDC.sol":{"id":27},"contracts/ArcTrustEscrow.sol":{"id":26},"@openzeppelin/contracts/utils/Bytes.sol":{"id":11},"@openzeppelin/contracts/utils/Panic.sol":{"id":13},"@openzeppelin/contracts/utils/Context.sol":{"id":12},"@openzeppelin/contracts/utils/Strings.sol":{"id":17},"@openzeppelin/contracts/utils/math/Math.sol":{"id":23},"@openzeppelin/contracts/interfaces/IERC20.sol":{"id":3},"@openzeppelin/contracts/token/ERC20/ERC20.sol":{"id":7},"@openzeppelin/contracts/utils/StorageSlot.sol":{"id":16},"@openzeppelin/contracts/interfaces/IERC165.sol":{"id":2},"@openzeppelin/contracts/token/ERC20/IERC20.sol":{"id":8},"@openzeppelin/contracts/utils/ShortStrings.sol":{"id":15},"@openzeppelin/contracts/interfaces/IERC1271.sol":{"id":0},"@openzeppelin/contracts/interfaces/IERC1363.sol":{"id":1},"@openzeppelin/contracts/interfaces/IERC5267.sol":{"id":4},"@openzeppelin/contracts/interfaces/IERC7913.sol":{"id":5},"@openzeppelin/contracts/utils/math/SafeCast.sol":{"id":24},"@openzeppelin/contracts/utils/ReentrancyGuard.sol":{"id":14},"@openzeppelin/contracts/utils/math/SignedMath.sol":{"id":25},"@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"id":18},"@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"id":6},"@openzeppelin/contracts/utils/cryptography/EIP712.sol":{"id":19},"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol":{"id":10},"@openzeppelin/contracts/utils/introspection/IERC165.sol":{"id":22},"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"id":20},"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol":{"id":21},"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":9}},"additionalInput":null,"stdJsonInput":{"sources":{"contracts/test/MockUSDC.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.36;\n\nimport {ERC20} from \"@openzeppelin/contracts/token/ERC20/ERC20.sol\";\n\ncontract MockUSDC is ERC20 {\n    constructor() ERC20(\"Mock USDC\", \"USDC\") {}\n\n    function decimals() public pure override returns (uint8) {\n        return 6;\n    }\n\n    function mint(address recipient, uint256 amount) external {\n        _mint(recipient, amount);\n    }\n}\n"},"contracts/ArcTrustEscrow.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.36;\n\nimport {IERC20} from \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\nimport {SafeERC20} from \"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol\";\nimport {EIP712} from \"@openzeppelin/contracts/utils/cryptography/EIP712.sol\";\nimport {SignatureChecker} from \"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol\";\nimport {ReentrancyGuard} from \"@openzeppelin/contracts/utils/ReentrancyGuard.sol\";\n\n/// @title ARC Trust Escrow\n/// @notice A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.\n/// @dev Selah's immutable judge signer attests only the qualification edge. This contract derives\n///      every eligible recipient and amount from the already-recorded referral graph. There is no\n///      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.\ncontract ArcTrustEscrow is EIP712, ReentrancyGuard {\n    using SafeERC20 for IERC20;\n\n    uint256 public constant PARTICIPANT_MICROUNITS = 10_000;\n    uint256 public constant DIRECT_MICROUNITS = 30_000;\n    uint256 public constant GRANDPARENT_MICROUNITS = 10_000;\n    uint256 public constant MAX_EVENT_MICROUNITS = 50_000;\n    uint256 public constant MAX_QUALIFICATIONS = 100;\n    uint256 public constant MAX_BUDGET_MICROUNITS = 4_990_000;\n    uint64 public constant CAMPAIGN_DURATION = 30 days;\n\n    bytes32 public constant QUALIFICATION_TYPEHASH = keccak256(\n        \"Qualification(bytes32 eventId,bytes32 reviewId,bytes32 subjectAgentId,address subjectPayout,bytes32 parentAgentId,bytes32 evidenceHash,uint64 approvedAt)\"\n    );\n\n    enum RewardTier {\n        Participant,\n        Direct,\n        Grandparent\n    }\n\n    struct Qualification {\n        bytes32 eventId;\n        bytes32 reviewId;\n        bytes32 subjectAgentId;\n        address subjectPayout;\n        bytes32 parentAgentId;\n        bytes32 evidenceHash;\n        uint64 approvedAt;\n    }\n\n    struct QualifiedAgent {\n        address payout;\n        bytes32 parentAgentId;\n        bytes32 eventId;\n        uint64 approvedAt;\n    }\n\n    IERC20 public immutable asset;\n    address public immutable source;\n    address public immutable judge;\n    bytes32 public immutable campaignId;\n    bytes32 public immutable rootAgentId;\n    uint256 public immutable budgetMicrounits;\n\n    uint64 public fundedAt;\n    uint64 public expiresAt;\n    uint64 public sweptAt;\n    uint256 public qualificationCount;\n    uint256 public paidMicrounits;\n\n    mapping(bytes32 agentId => QualifiedAgent agent) public qualifiedAgents;\n    mapping(address payout => bytes32 agentId) public payoutAgentIds;\n    mapping(bytes32 eventId => bool used) public usedEvents;\n    mapping(bytes32 reviewId => bool used) public usedReviews;\n    mapping(bytes32 rewardId => bool paid) public paidRewards;\n\n    event EscrowFunded(\n        address indexed source,\n        address indexed asset,\n        uint256 amountMicrounits,\n        uint64 fundedAt,\n        uint64 expiresAt\n    );\n    event QualificationClaimed(\n        bytes32 indexed eventId,\n        bytes32 indexed reviewId,\n        bytes32 indexed subjectAgentId,\n        bytes32 parentAgentId,\n        bytes32 grandparentAgentId,\n        address subjectPayout,\n        bytes32 evidenceHash,\n        uint64 approvedAt,\n        uint256 eventMicrounits\n    );\n    event RewardPaid(\n        bytes32 indexed rewardId,\n        bytes32 indexed eventId,\n        address indexed recipient,\n        bytes32 recipientAgentId,\n        RewardTier tier,\n        uint256 amountMicrounits\n    );\n    event ExpiredBalanceReturned(\n        address indexed source,\n        address indexed asset,\n        uint256 amountMicrounits,\n        uint64 sweptAt\n    );\n\n    error ZeroAddress();\n    error ZeroIdentifier();\n    error InvalidBudget();\n    error OnlySource();\n    error AlreadyFunded();\n    error NotFunded();\n    error CampaignExpired();\n    error CampaignStillActive();\n    error InvalidFundingAmount();\n    error QualificationLimitReached();\n    error EventAlreadyUsed();\n    error ReviewAlreadyUsed();\n    error AgentAlreadyQualified();\n    error RootCannotQualify();\n    error PayoutAlreadyUsed();\n    error UnknownParent();\n    error SelfParent();\n    error InvalidApprovalTime();\n    error InvalidJudgeSignature();\n    error BudgetExceeded();\n    error RewardAlreadyPaid();\n\n    constructor(\n        IERC20 asset_,\n        address source_,\n        address judge_,\n        bytes32 campaignId_,\n        bytes32 rootAgentId_,\n        uint256 budgetMicrounits_\n    ) EIP712(\"culture.sbs ARC Trust\", \"1\") {\n        if (address(asset_) == address(0) || source_ == address(0) || judge_ == address(0)) {\n            revert ZeroAddress();\n        }\n        if (campaignId_ == bytes32(0) || rootAgentId_ == bytes32(0)) revert ZeroIdentifier();\n        if (budgetMicrounits_ == 0 || budgetMicrounits_ > MAX_BUDGET_MICROUNITS) {\n            revert InvalidBudget();\n        }\n\n        asset = asset_;\n        source = source_;\n        judge = judge_;\n        campaignId = campaignId_;\n        rootAgentId = rootAgentId_;\n        budgetMicrounits = budgetMicrounits_;\n    }\n\n    /// @notice Pulls the exact immutable campaign budget from the source once.\n    /// @dev The source must approve this contract first. Fee-on-transfer tokens fail closed.\n    function fund() external nonReentrant {\n        if (msg.sender != source) revert OnlySource();\n        if (fundedAt != 0) revert AlreadyFunded();\n\n        uint256 beforeBalance = asset.balanceOf(address(this));\n        asset.safeTransferFrom(source, address(this), budgetMicrounits);\n        if (asset.balanceOf(address(this)) - beforeBalance != budgetMicrounits) {\n            revert InvalidFundingAmount();\n        }\n        fundedAt = uint64(block.timestamp);\n        expiresAt = fundedAt + CAMPAIGN_DURATION;\n        emit EscrowFunded(source, address(asset), budgetMicrounits, fundedAt, expiresAt);\n    }\n\n    /// @notice Pays one approved agent and its eligible approved ancestors atomically.\n    /// @dev Anyone may relay the immutable judge's EIP-712 signature before expiry.\n    function claimQualification(Qualification calldata q, bytes calldata signature)\n        external\n        nonReentrant\n    {\n        if (fundedAt == 0) revert NotFunded();\n        if (block.timestamp >= expiresAt) revert CampaignExpired();\n        if (qualificationCount >= MAX_QUALIFICATIONS) revert QualificationLimitReached();\n        if (\n            q.eventId == bytes32(0) || q.reviewId == bytes32(0)\n                || q.subjectAgentId == bytes32(0) || q.evidenceHash == bytes32(0)\n        ) revert ZeroIdentifier();\n        if (q.subjectPayout == address(0)) revert ZeroAddress();\n        if (usedEvents[q.eventId]) revert EventAlreadyUsed();\n        if (usedReviews[q.reviewId]) revert ReviewAlreadyUsed();\n        if (q.subjectAgentId == rootAgentId) revert RootCannotQualify();\n        if (qualifiedAgents[q.subjectAgentId].payout != address(0)) revert AgentAlreadyQualified();\n        if (payoutAgentIds[q.subjectPayout] != bytes32(0)) revert PayoutAlreadyUsed();\n        if (q.subjectAgentId == q.parentAgentId) revert SelfParent();\n        if (q.approvedAt < fundedAt || q.approvedAt > block.timestamp) revert InvalidApprovalTime();\n\n        bool parentIsRoot = q.parentAgentId == rootAgentId;\n        QualifiedAgent memory parent = qualifiedAgents[q.parentAgentId];\n        if (!parentIsRoot && parent.payout == address(0)) revert UnknownParent();\n\n        bytes32 digest = qualificationDigest(q);\n        if (!SignatureChecker.isValidSignatureNowCalldata(judge, digest, signature)) {\n            revert InvalidJudgeSignature();\n        }\n\n        bytes32 grandparentAgentId;\n        uint256 eventMicrounits = PARTICIPANT_MICROUNITS;\n        if (!parentIsRoot) {\n            eventMicrounits += DIRECT_MICROUNITS;\n            grandparentAgentId = parent.parentAgentId;\n            if (grandparentAgentId != rootAgentId) {\n                if (qualifiedAgents[grandparentAgentId].payout == address(0)) revert UnknownParent();\n                eventMicrounits += GRANDPARENT_MICROUNITS;\n            }\n        }\n        if (eventMicrounits > MAX_EVENT_MICROUNITS) revert BudgetExceeded();\n        if (paidMicrounits + eventMicrounits > budgetMicrounits) revert BudgetExceeded();\n\n        usedEvents[q.eventId] = true;\n        usedReviews[q.reviewId] = true;\n        qualifiedAgents[q.subjectAgentId] = QualifiedAgent({\n            payout: q.subjectPayout,\n            parentAgentId: q.parentAgentId,\n            eventId: q.eventId,\n            approvedAt: q.approvedAt\n        });\n        payoutAgentIds[q.subjectPayout] = q.subjectAgentId;\n        qualificationCount += 1;\n        paidMicrounits += eventMicrounits;\n\n        _pay(q.eventId, q.reviewId, q.subjectAgentId, q.subjectPayout, RewardTier.Participant);\n        if (!parentIsRoot) {\n            _pay(q.eventId, q.reviewId, q.parentAgentId, parent.payout, RewardTier.Direct);\n            if (grandparentAgentId != rootAgentId) {\n                _pay(\n                    q.eventId,\n                    q.reviewId,\n                    grandparentAgentId,\n                    qualifiedAgents[grandparentAgentId].payout,\n                    RewardTier.Grandparent\n                );\n            }\n        }\n\n        emit QualificationClaimed(\n            q.eventId,\n            q.reviewId,\n            q.subjectAgentId,\n            q.parentAgentId,\n            grandparentAgentId,\n            q.subjectPayout,\n            q.evidenceHash,\n            q.approvedAt,\n            eventMicrounits\n        );\n    }\n\n    /// @notice Returns every unclaimed USDC unit to the immutable source after expiry.\n    /// @dev Anyone may trigger this liveness operation. It cannot run early.\n    function sweepExpired() external nonReentrant {\n        if (fundedAt == 0) revert NotFunded();\n        if (block.timestamp < expiresAt) revert CampaignStillActive();\n        sweptAt = uint64(block.timestamp);\n        uint256 amount = asset.balanceOf(address(this));\n        if (amount != 0) asset.safeTransfer(source, amount);\n        emit ExpiredBalanceReturned(source, address(asset), amount, sweptAt);\n    }\n\n    function qualificationDigest(Qualification calldata q) public view returns (bytes32) {\n        return _hashTypedDataV4(\n            keccak256(\n                abi.encode(\n                    QUALIFICATION_TYPEHASH,\n                    q.eventId,\n                    q.reviewId,\n                    q.subjectAgentId,\n                    q.subjectPayout,\n                    q.parentAgentId,\n                    q.evidenceHash,\n                    q.approvedAt\n                )\n            )\n        );\n    }\n\n    function rewardId(\n        bytes32 eventId,\n        bytes32 reviewId,\n        bytes32 recipientAgentId,\n        address recipient,\n        RewardTier tier\n    ) public view returns (bytes32) {\n        return keccak256(\n            abi.encode(campaignId, eventId, reviewId, recipientAgentId, recipient, uint8(tier))\n        );\n    }\n\n    function remainingMicrounits() external view returns (uint256) {\n        return asset.balanceOf(address(this));\n    }\n\n    function _pay(\n        bytes32 eventId,\n        bytes32 reviewId,\n        bytes32 recipientAgentId,\n        address recipient,\n        RewardTier tier\n    ) private {\n        uint256 amount = tier == RewardTier.Direct ? DIRECT_MICROUNITS : PARTICIPANT_MICROUNITS;\n        bytes32 id = rewardId(eventId, reviewId, recipientAgentId, recipient, tier);\n        if (paidRewards[id]) revert RewardAlreadyPaid();\n        paidRewards[id] = true;\n        asset.safeTransfer(recipient, amount);\n        emit RewardPaid(id, eventId, recipient, recipientAgentId, tier, amount);\n    }\n}\n"},"@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"},"@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"},"@openzeppelin/contracts/utils/Context.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)\n\npragma solidity ^0.8.20;\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 Context {\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"},"@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"},"@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"},"@openzeppelin/contracts/interfaces/IERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC20.sol)\n\npragma solidity >=0.4.16;\n\nimport {IERC20} from \"../token/ERC20/IERC20.sol\";\n"},"@openzeppelin/contracts/token/ERC20/ERC20.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 \"./IERC20.sol\";\nimport {IERC20Metadata} from \"./extensions/IERC20Metadata.sol\";\nimport {Context} from \"../../utils/Context.sol\";\nimport {IERC20Errors} from \"../../interfaces/draft-IERC6093.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 ERC20 is Context, IERC20, IERC20Metadata, IERC20Errors {\n    mapping(address account => uint256) private _balances;\n\n    mapping(address account => mapping(address spender => uint256)) private _allowances;\n\n    uint256 private _totalSupply;\n\n    string private _name;\n    string private _symbol;\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    constructor(string memory name_, string memory symbol_) {\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        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        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        return _totalSupply;\n    }\n\n    /// @inheritdoc IERC20\n    function balanceOf(address account) public view virtual returns (uint256) {\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        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        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        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"},"@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"},"@openzeppelin/contracts/interfaces/IERC165.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC165.sol)\n\npragma solidity >=0.4.16;\n\nimport {IERC165} from \"../utils/introspection/IERC165.sol\";\n"},"@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"},"@openzeppelin/contracts/utils/ShortStrings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/ShortStrings.sol)\n\npragma solidity ^0.8.20;\n\nimport {StorageSlot} from \"./StorageSlot.sol\";\n\n// | string  | 0xAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA   |\n// | length  | 0x                                                              BB |\ntype ShortString is bytes32;\n\n/**\n * @dev This library provides functions to convert short memory strings\n * into a `ShortString` type that can be used as an immutable variable.\n *\n * Strings of arbitrary length can be optimized using this library if\n * they are short enough (up to 31 bytes) by packing them with their\n * length (1 byte) in a single EVM word (32 bytes). Additionally, a\n * fallback mechanism can be used for every other case.\n *\n * Usage example:\n *\n * ```solidity\n * contract Named {\n *     using ShortStrings for *;\n *\n *     ShortString private immutable _name;\n *     string private _nameFallback;\n *\n *     constructor(string memory contractName) {\n *         _name = contractName.toShortStringWithFallback(_nameFallback);\n *     }\n *\n *     function name() external view returns (string memory) {\n *         return _name.toStringWithFallback(_nameFallback);\n *     }\n * }\n * ```\n */\nlibrary ShortStrings {\n    // Used as an identifier for strings longer than 31 bytes.\n    bytes32 private constant FALLBACK_SENTINEL = 0x00000000000000000000000000000000000000000000000000000000000000FF;\n\n    error StringTooLong(string str);\n    error InvalidShortString();\n\n    /**\n     * @dev Encode a string of at most 31 chars into a `ShortString`.\n     *\n     * This will trigger a `StringTooLong` error is the input string is too long.\n     */\n    function toShortString(string memory str) internal pure returns (ShortString) {\n        bytes memory bstr = bytes(str);\n        if (bstr.length > 0x1f) {\n            revert StringTooLong(str);\n        }\n        return ShortString.wrap(bytes32(uint256(bytes32(bstr)) | bstr.length));\n    }\n\n    /**\n     * @dev Decode a `ShortString` back to a \"normal\" string.\n     */\n    function toString(ShortString sstr) internal pure returns (string memory) {\n        uint256 len = byteLength(sstr);\n        // using `new string(len)` would work locally but is not memory safe.\n        string memory str = new string(0x20);\n        assembly (\"memory-safe\") {\n            mstore(str, len)\n            mstore(add(str, 0x20), sstr)\n        }\n        return str;\n    }\n\n    /**\n     * @dev Return the length of a `ShortString`.\n     */\n    function byteLength(ShortString sstr) internal pure returns (uint256) {\n        uint256 result = uint256(ShortString.unwrap(sstr)) & 0xFF;\n        if (result > 0x1f) {\n            revert InvalidShortString();\n        }\n        return result;\n    }\n\n    /**\n     * @dev Encode a string into a `ShortString`, or write it to storage if it is too long.\n     */\n    function toShortStringWithFallback(string memory value, string storage store) internal returns (ShortString) {\n        if (bytes(value).length < 0x20) {\n            return toShortString(value);\n        } else {\n            StorageSlot.getStringSlot(store).value = value;\n            return ShortString.wrap(FALLBACK_SENTINEL);\n        }\n    }\n\n    /**\n     * @dev Decode a string that was encoded to `ShortString` or written to storage using {toShortStringWithFallback}.\n     */\n    function toStringWithFallback(ShortString value, string storage store) internal pure returns (string memory) {\n        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {\n            return toString(value);\n        } else {\n            return store;\n        }\n    }\n\n    /**\n     * @dev Return the length of a string that was encoded to `ShortString` or written to storage using\n     * {toShortStringWithFallback}.\n     *\n     * WARNING: This will return the \"byte length\" of the string. This may not reflect the actual length in terms of\n     * actual characters as the UTF-8 encoding of a single character can span over multiple bytes.\n     */\n    function byteLengthWithFallback(ShortString value, string storage store) internal view returns (uint256) {\n        if (ShortString.unwrap(value) != FALLBACK_SENTINEL) {\n            return byteLength(value);\n        } else {\n            return bytes(store).length;\n        }\n    }\n}\n"},"@openzeppelin/contracts/interfaces/IERC1271.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC1271.sol)\n\npragma solidity >=0.5.0;\n\n/**\n * @dev Interface of the ERC-1271 standard signature validation method for\n * contracts as defined in https://eips.ethereum.org/EIPS/eip-1271[ERC-1271].\n */\ninterface IERC1271 {\n    /**\n     * @dev Should return whether the signature provided is valid for the provided data\n     * @param hash      Hash of the data to be signed\n     * @param signature Signature byte array associated with `hash`\n     */\n    function isValidSignature(bytes32 hash, bytes calldata signature) external view returns (bytes4 magicValue);\n}\n"},"@openzeppelin/contracts/interfaces/IERC1363.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC1363.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20} from \"./IERC20.sol\";\nimport {IERC165} from \"./IERC165.sol\";\n\n/**\n * @title IERC1363\n * @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].\n *\n * Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract\n * after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.\n */\ninterface IERC1363 is IERC20, IERC165 {\n    /*\n     * Note: the ERC-165 identifier for this interface is 0xb0202a11.\n     * 0xb0202a11 ===\n     *   bytes4(keccak256('transferAndCall(address,uint256)')) ^\n     *   bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^\n     *   bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^\n     *   bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^\n     *   bytes4(keccak256('approveAndCall(address,uint256)')) ^\n     *   bytes4(keccak256('approveAndCall(address,uint256,bytes)'))\n     */\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferAndCall(address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @param data Additional data with no specified format, sent in call to `to`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param from The address which you want to send tokens from.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferFromAndCall(address from, address to, uint256 value) external returns (bool);\n\n    /**\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism\n     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.\n     * @param from The address which you want to send tokens from.\n     * @param to The address which you want to transfer to.\n     * @param value The amount of tokens to be transferred.\n     * @param data Additional data with no specified format, sent in call to `to`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.\n     * @param spender The address which will spend the funds.\n     * @param value The amount of tokens to be spent.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function approveAndCall(address spender, uint256 value) external returns (bool);\n\n    /**\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\n     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.\n     * @param spender The address which will spend the funds.\n     * @param value The amount of tokens to be spent.\n     * @param data Additional data with no specified format, sent in call to `spender`.\n     * @return A boolean value indicating whether the operation succeeded unless throwing.\n     */\n    function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);\n}\n"},"@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"},"@openzeppelin/contracts/interfaces/IERC7913.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC7913.sol)\n\npragma solidity >=0.5.0;\n\n/**\n * @dev Signature verifier interface.\n */\ninterface IERC7913SignatureVerifier {\n    /**\n     * @dev Verifies `signature` as a valid signature of `hash` by `key`.\n     *\n     * MUST return the bytes4 magic value IERC7913SignatureVerifier.verify.selector if the signature is valid.\n     * SHOULD return 0xffffffff or revert if the signature is not valid.\n     * SHOULD return 0xffffffff or revert if the key is empty\n     */\n    function verify(bytes calldata key, bytes32 hash, bytes calldata signature) external view returns (bytes4);\n}\n"},"@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"},"@openzeppelin/contracts/utils/ReentrancyGuard.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (utils/ReentrancyGuard.sol)\n\npragma solidity ^0.8.20;\n\nimport {StorageSlot} from \"./StorageSlot.sol\";\n\n/**\n * @dev Contract module that helps prevent reentrant calls to a function.\n *\n * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier\n * available, which can be applied to functions to make sure there are no nested\n * (reentrant) calls to them.\n *\n * Note that because there is a single `nonReentrant` guard, functions marked as\n * `nonReentrant` may not call one another. This can be worked around by making\n * those functions `private`, and then adding `external` `nonReentrant` entry\n * points to them.\n *\n * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,\n * consider using {ReentrancyGuardTransient} instead.\n *\n * TIP: If you would like to learn more about reentrancy and alternative ways\n * to protect against it, check out our blog post\n * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].\n *\n * IMPORTANT: Deprecated. This storage-based reentrancy guard will be removed and replaced\n * by the {ReentrancyGuardTransient} variant in v6.0.\n *\n * @custom:stateless\n */\nabstract contract ReentrancyGuard {\n    using StorageSlot for bytes32;\n\n    // keccak256(abi.encode(uint256(keccak256(\"openzeppelin.storage.ReentrancyGuard\")) - 1)) & ~bytes32(uint256(0xff))\n    bytes32 private constant REENTRANCY_GUARD_STORAGE =\n        0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;\n\n    // Booleans are more expensive than uint256 or any type that takes up a full\n    // word because each write operation emits an extra SLOAD to first read the\n    // slot's contents, replace the bits taken up by the boolean, and then write\n    // back. This is the compiler's defense against contract upgrades and\n    // pointer aliasing, and it cannot be disabled.\n\n    // The values being non-zero value makes deployment a bit more expensive,\n    // but in exchange the refund on every call to nonReentrant will be lower in\n    // amount. Since refunds are capped to a percentage of the total\n    // transaction's gas, it is best to keep them low in cases like this one, to\n    // increase the likelihood of the full refund coming into effect.\n    uint256 private constant NOT_ENTERED = 1;\n    uint256 private constant ENTERED = 2;\n\n    /**\n     * @dev Unauthorized reentrant call.\n     */\n    error ReentrancyGuardReentrantCall();\n\n    constructor() {\n        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;\n    }\n\n    /**\n     * @dev Prevents a contract from calling itself, directly or indirectly.\n     * Calling a `nonReentrant` function from another `nonReentrant`\n     * function is not supported. It is possible to prevent this from happening\n     * by making the `nonReentrant` function external, and making it call a\n     * `private` function that does the actual work.\n     */\n    modifier nonReentrant() {\n        _nonReentrantBefore();\n        _;\n        _nonReentrantAfter();\n    }\n\n    /**\n     * @dev A `view` only version of {nonReentrant}. Use to block view functions\n     * from being called, preventing reading from inconsistent contract state.\n     *\n     * CAUTION: This is a \"view\" modifier and does not change the reentrancy\n     * status. Use it only on view functions. For payable or non-payable functions,\n     * use the standard {nonReentrant} modifier instead.\n     */\n    modifier nonReentrantView() {\n        _nonReentrantBeforeView();\n        _;\n    }\n\n    function _nonReentrantBeforeView() private view {\n        if (_reentrancyGuardEntered()) {\n            revert ReentrancyGuardReentrantCall();\n        }\n    }\n\n    function _nonReentrantBefore() private {\n        // On the first call to nonReentrant, _status will be NOT_ENTERED\n        _nonReentrantBeforeView();\n\n        // Any calls to nonReentrant after this point will fail\n        _reentrancyGuardStorageSlot().getUint256Slot().value = ENTERED;\n    }\n\n    function _nonReentrantAfter() private {\n        // By storing the original value once again, a refund is triggered (see\n        // https://eips.ethereum.org/EIPS/eip-2200)\n        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;\n    }\n\n    /**\n     * @dev Returns true if the reentrancy guard is currently set to \"entered\", which indicates there is a\n     * `nonReentrant` function in the call stack.\n     */\n    function _reentrancyGuardEntered() internal view returns (bool) {\n        return _reentrancyGuardStorageSlot().getUint256Slot().value == ENTERED;\n    }\n\n    function _reentrancyGuardStorageSlot() internal pure virtual returns (bytes32) {\n        return REENTRANCY_GUARD_STORAGE;\n    }\n}\n"},"@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"},"@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"},"@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"},"@openzeppelin/contracts/utils/cryptography/EIP712.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 \"./MessageHashUtils.sol\";\nimport {ShortStrings, ShortString} from \"../ShortStrings.sol\";\nimport {IERC5267} from \"../../interfaces/IERC5267.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: In the upgradeable version of this contract, the cached values will correspond to the address, and the domain\n * separator of the implementation contract. This will cause the {_domainSeparatorV4} function to always rebuild the\n * separator from the immutable values, which is cheaper than accessing a cached version in cold storage.\n *\n * @custom:oz-upgrades-unsafe-allow state-variable-immutable\n */\nabstract contract EIP712 is IERC5267 {\n    using ShortStrings for *;\n\n    bytes32 private constant TYPE_HASH =\n        keccak256(\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\");\n\n    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to\n    // invalidate the cached domain separator if the chain id changes.\n    bytes32 private immutable _cachedDomainSeparator;\n    uint256 private immutable _cachedChainId;\n    address private immutable _cachedThis;\n\n    bytes32 private immutable _hashedName;\n    bytes32 private immutable _hashedVersion;\n\n    ShortString private immutable _name;\n    ShortString private immutable _version;\n    // slither-disable-next-line constable-states\n    string private _nameFallback;\n    // slither-disable-next-line constable-states\n    string private _versionFallback;\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    constructor(string memory name, string memory version) {\n        _name = name.toShortStringWithFallback(_nameFallback);\n        _version = version.toShortStringWithFallback(_versionFallback);\n        _hashedName = keccak256(bytes(name));\n        _hashedVersion = keccak256(bytes(version));\n\n        _cachedChainId = block.chainid;\n        _cachedDomainSeparator = _buildDomainSeparator();\n        _cachedThis = address(this);\n    }\n\n    /**\n     * @dev Returns the domain separator for the current chain.\n     */\n    function _domainSeparatorV4() internal view returns (bytes32) {\n        if (address(this) == _cachedThis && block.chainid == _cachedChainId) {\n            return _cachedDomainSeparator;\n        } else {\n            return _buildDomainSeparator();\n        }\n    }\n\n    function _buildDomainSeparator() private view returns (bytes32) {\n        return keccak256(abi.encode(TYPE_HASH, _hashedName, _hashedVersion, 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: By default this function reads _name which is an immutable value.\n     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Name() internal view returns (string memory) {\n        return _name.toStringWithFallback(_nameFallback);\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: By default this function reads _version which is an immutable value.\n     * It only reads from storage if necessary (in case the value is too large to fit in a ShortString).\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Version() internal view returns (string memory) {\n        return _version.toStringWithFallback(_versionFallback);\n    }\n}\n"},"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.5.0) (token/ERC20/utils/SafeERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"../IERC20.sol\";\nimport {IERC1363} from \"../../../interfaces/IERC1363.sol\";\n\n/**\n * @title SafeERC20\n * @dev Wrappers around ERC-20 operations that throw on failure (when the token\n * contract returns false). Tokens that return no value (and instead revert or\n * throw on failure) are also supported, non-reverting calls are assumed to be\n * successful.\n * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\n * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\n */\nlibrary SafeERC20 {\n    /**\n     * @dev An operation with an ERC-20 token failed.\n     */\n    error SafeERC20FailedOperation(address token);\n\n    /**\n     * @dev Indicates a failed `decreaseAllowance` request.\n     */\n    error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);\n\n    /**\n     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful.\n     */\n    function safeTransfer(IERC20 token, address to, uint256 value) internal {\n        if (!_safeTransfer(token, to, value, true)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the\n     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.\n     */\n    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {\n        if (!_safeTransferFrom(token, from, to, value, true)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Variant of {safeTransfer} that returns a bool instead of reverting if the operation is not successful.\n     */\n    function trySafeTransfer(IERC20 token, address to, uint256 value) internal returns (bool) {\n        return _safeTransfer(token, to, value, false);\n    }\n\n    /**\n     * @dev Variant of {safeTransferFrom} that returns a bool instead of reverting if the operation is not successful.\n     */\n    function trySafeTransferFrom(IERC20 token, address from, address to, uint256 value) internal returns (bool) {\n        return _safeTransferFrom(token, from, to, value, false);\n    }\n\n    /**\n     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful.\n     *\n     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the \"client\"\n     * smart contract uses ERC-7674 to set temporary allowances, then the \"client\" smart contract should avoid using\n     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract\n     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.\n     */\n    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {\n        uint256 oldAllowance = token.allowance(address(this), spender);\n        forceApprove(token, spender, oldAllowance + value);\n    }\n\n    /**\n     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no\n     * value, non-reverting calls are assumed to be successful.\n     *\n     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the \"client\"\n     * smart contract uses ERC-7674 to set temporary allowances, then the \"client\" smart contract should avoid using\n     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract\n     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.\n     */\n    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {\n        unchecked {\n            uint256 currentAllowance = token.allowance(address(this), spender);\n            if (currentAllowance < requestedDecrease) {\n                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);\n            }\n            forceApprove(token, spender, currentAllowance - requestedDecrease);\n        }\n    }\n\n    /**\n     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,\n     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval\n     * to be set to zero before setting it to a non-zero value, such as USDT.\n     *\n     * NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function\n     * only sets the \"standard\" allowance. Any temporary allowance will remain active, in addition to the value being\n     * set here.\n     */\n    function forceApprove(IERC20 token, address spender, uint256 value) internal {\n        if (!_safeApprove(token, spender, value, false)) {\n            if (!_safeApprove(token, spender, 0, true)) revert SafeERC20FailedOperation(address(token));\n            if (!_safeApprove(token, spender, value, true)) revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no\n     * code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {\n        if (to.code.length == 0) {\n            safeTransfer(token, to, value);\n        } else if (!token.transferAndCall(to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target\n     * has no code. This can be used to implement an {ERC721}-like safe transfer that relies on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function transferFromAndCallRelaxed(\n        IERC1363 token,\n        address from,\n        address to,\n        uint256 value,\n        bytes memory data\n    ) internal {\n        if (to.code.length == 0) {\n            safeTransferFrom(token, from, to, value);\n        } else if (!token.transferFromAndCall(from, to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no\n     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when\n     * targeting contracts.\n     *\n     * NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.\n     * Oppositely, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}\n     * once without retrying, and relies on the returned value to be true.\n     *\n     * Reverts if the returned value is other than `true`.\n     */\n    function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {\n        if (to.code.length == 0) {\n            forceApprove(token, to, value);\n        } else if (!token.approveAndCall(to, value, data)) {\n            revert SafeERC20FailedOperation(address(token));\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.transfer(to, value)` call, relaxing the requirement on the return value: the\n     * return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param to The recipient of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeTransfer(IERC20 token, address to, uint256 value, bool bubble) private returns (bool success) {\n        bytes4 selector = IERC20.transfer.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(to, shr(96, not(0))))\n            mstore(0x24, value)\n            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.transferFrom(from, to, value)` call, relaxing the requirement on the return\n     * value: the return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param from The sender of the tokens\n     * @param to The recipient of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeTransferFrom(\n        IERC20 token,\n        address from,\n        address to,\n        uint256 value,\n        bool bubble\n    ) private returns (bool success) {\n        bytes4 selector = IERC20.transferFrom.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(from, shr(96, not(0))))\n            mstore(0x24, and(to, shr(96, not(0))))\n            mstore(0x44, value)\n            success := call(gas(), token, 0, 0x00, 0x64, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n            mstore(0x60, 0)\n        }\n    }\n\n    /**\n     * @dev Imitates a Solidity `token.approve(spender, value)` call, relaxing the requirement on the return value:\n     * the return value is optional (but if data is returned, it must not be false).\n     *\n     * @param token The token targeted by the call.\n     * @param spender The spender of the tokens\n     * @param value The amount of token to transfer\n     * @param bubble Behavior switch if the transfer call reverts: bubble the revert reason or return a false boolean.\n     */\n    function _safeApprove(IERC20 token, address spender, uint256 value, bool bubble) private returns (bool success) {\n        bytes4 selector = IERC20.approve.selector;\n\n        assembly (\"memory-safe\") {\n            let fmp := mload(0x40)\n            mstore(0x00, selector)\n            mstore(0x04, and(spender, shr(96, not(0))))\n            mstore(0x24, value)\n            success := call(gas(), token, 0, 0x00, 0x44, 0x00, 0x20)\n            // if call success and return is true, all is good.\n            // otherwise (not success or return is not true), we need to perform further checks\n            if iszero(and(success, eq(mload(0x00), 1))) {\n                // if the call was a failure and bubble is enabled, bubble the error\n                if and(iszero(success), bubble) {\n                    returndatacopy(fmp, 0x00, returndatasize())\n                    revert(fmp, returndatasize())\n                }\n                // if the return value is not true, then the call is only successful if:\n                // - the token address has code\n                // - the returndata is empty\n                success := and(success, and(iszero(returndatasize()), gt(extcodesize(token), 0)))\n            }\n            mstore(0x40, fmp)\n        }\n    }\n}\n"},"@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"},"@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"},"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.6.0) (utils/cryptography/SignatureChecker.sol)\n\npragma solidity ^0.8.24;\n\nimport {ECDSA} from \"./ECDSA.sol\";\nimport {IERC1271} from \"../../interfaces/IERC1271.sol\";\nimport {IERC7913SignatureVerifier} from \"../../interfaces/IERC7913.sol\";\nimport {Bytes} from \"../Bytes.sol\";\n\n/**\n * @dev Signature verification helper that can be used instead of `ECDSA.recover` to seamlessly support:\n *\n * * ECDSA signatures from externally owned accounts (EOAs)\n * * ERC-1271 signatures from smart contract wallets like Argent and Safe Wallet (previously Gnosis Safe)\n * * ERC-7913 signatures from keys that do not have an Ethereum address of their own\n *\n * See https://eips.ethereum.org/EIPS/eip-1271[ERC-1271] and https://eips.ethereum.org/EIPS/eip-7913[ERC-7913].\n */\nlibrary SignatureChecker {\n    using Bytes for bytes;\n\n    /**\n     * @dev Checks if a signature is valid for a given signer and data hash. If the signer has code, the\n     * signature is validated against it using ERC-1271, otherwise it's validated using `ECDSA.recover`.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     *\n     * NOTE: For an extended version of this function that supports ERC-7913 signatures, see {isValidSignatureNow-bytes-bytes32-bytes-}.\n     */\n    function isValidSignatureNow(address signer, bytes32 hash, bytes memory signature) internal view returns (bool) {\n        if (signer.code.length == 0) {\n            (address recovered, ECDSA.RecoverError err, ) = ECDSA.tryRecover(hash, signature);\n            return err == ECDSA.RecoverError.NoError && recovered == signer;\n        } else {\n            return isValidERC1271SignatureNow(signer, hash, signature);\n        }\n    }\n\n    /**\n     * @dev Variant of {isValidSignatureNow} that takes a signature in calldata\n     */\n    function isValidSignatureNowCalldata(\n        address signer,\n        bytes32 hash,\n        bytes calldata signature\n    ) internal view returns (bool) {\n        if (signer.code.length == 0) {\n            (address recovered, ECDSA.RecoverError err, ) = ECDSA.tryRecoverCalldata(hash, signature);\n            return err == ECDSA.RecoverError.NoError && recovered == signer;\n        } else {\n            return isValidERC1271SignatureNowCalldata(signer, hash, signature);\n        }\n    }\n\n    /**\n     * @dev Checks if a signature is valid for a given signer and data hash. The signature is validated\n     * against the signer smart contract using ERC-1271.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function isValidERC1271SignatureNow(\n        address signer,\n        bytes32 hash,\n        bytes memory signature\n    ) internal view returns (bool result) {\n        bytes4 selector = IERC1271.isValidSignature.selector;\n        uint256 length = signature.length;\n\n        assembly (\"memory-safe\") {\n            // Encoded calldata is :\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data>\n            let ptr := mload(0x40)\n            mstore(ptr, selector)\n            mstore(add(ptr, 0x04), hash)\n            mstore(add(ptr, 0x24), 0x40)\n            mcopy(add(ptr, 0x44), signature, add(length, 0x20))\n\n            let success := staticcall(gas(), signer, ptr, add(length, 0x64), 0x00, 0x20)\n            result := and(success, and(gt(returndatasize(), 0x1f), eq(mload(0x00), selector)))\n        }\n    }\n\n    function isValidERC1271SignatureNowCalldata(\n        address signer,\n        bytes32 hash,\n        bytes calldata signature\n    ) internal view returns (bool result) {\n        bytes4 selector = IERC1271.isValidSignature.selector;\n        uint256 length = signature.length;\n\n        assembly (\"memory-safe\") {\n            // Encoded calldata is :\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data>\n            let ptr := mload(0x40)\n            mstore(ptr, selector)\n            mstore(add(ptr, 0x04), hash)\n            mstore(add(ptr, 0x24), 0x40)\n            mstore(add(ptr, 0x44), length)\n            calldatacopy(add(ptr, 0x64), signature.offset, length)\n\n            let success := staticcall(gas(), signer, ptr, add(length, 0x64), 0x00, 0x20)\n            result := and(success, and(gt(returndatasize(), 0x1f), eq(mload(0x00), selector)))\n        }\n    }\n\n    /**\n     * @dev Verifies a signature for a given ERC-7913 signer and hash.\n     *\n     * The signer is a `bytes` object that is the concatenation of an address and optionally a key:\n     * `verifier || key`. A signer must be at least 20 bytes long.\n     *\n     * Verification is done as follows:\n     *\n     * * If `signer.length < 20`: verification fails\n     * * If `signer.length == 20`: verification is done using {isValidSignatureNow}\n     * * Otherwise: verification is done using {IERC7913SignatureVerifier}\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function isValidSignatureNow(\n        bytes memory signer,\n        bytes32 hash,\n        bytes memory signature\n    ) internal view returns (bool) {\n        if (signer.length < 20) {\n            return false;\n        } else if (signer.length == 20) {\n            return isValidSignatureNow(address(bytes20(signer)), hash, signature);\n        } else {\n            (bool success, bytes memory result) = address(bytes20(signer)).staticcall(\n                abi.encodeCall(IERC7913SignatureVerifier.verify, (signer.slice(20), hash, signature))\n            );\n            return (success &&\n                result.length >= 32 &&\n                abi.decode(result, (bytes32)) == bytes32(IERC7913SignatureVerifier.verify.selector));\n        }\n    }\n\n    /**\n     * @dev Verifies multiple ERC-7913 `signatures` for a given `hash` using a set of `signers`.\n     * Returns `false` if the number of signers and signatures is not the same.\n     *\n     * The signers should be ordered by their `keccak256` hash to ensure efficient duplication check. Unordered\n     * signers are supported, but the uniqueness check will be more expensive.\n     *\n     * NOTE: Unlike ECDSA signatures, contract signatures are revocable, and the outcome of this function can thus\n     * change through time. It could return true at block N and false at block N+1 (or the opposite).\n     */\n    function areValidSignaturesNow(\n        bytes32 hash,\n        bytes[] memory signers,\n        bytes[] memory signatures\n    ) internal view returns (bool) {\n        if (signers.length != signatures.length) return false;\n\n        bytes32 lastId = bytes32(0);\n\n        for (uint256 i = 0; i < signers.length; ++i) {\n            bytes memory signer = signers[i];\n\n            // If one of the signatures is invalid, reject the batch\n            if (!isValidSignatureNow(signer, hash, signatures[i])) return false;\n\n            bytes32 id = keccak256(signer);\n            // If the current signer ID is greater than all previous IDs, then this is a new signer.\n            if (lastId < id) {\n                lastId = id;\n            } else {\n                // If this signer id is not greater than all the previous ones, verify that it is not a duplicate of a previous one\n                // This loop is never executed if the signers are ordered by id.\n                for (uint256 j = 0; j < i; ++j) {\n                    if (id == keccak256(signers[j])) return false;\n                }\n            }\n        }\n\n        return true;\n    }\n}\n"},"@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"}},"language":"Solidity","settings":{"metadata":{"appendCBOR":true,"bytecodeHash":"ipfs"},"optimizer":{"runs":10000,"enabled":true},"evmVersion":"cancun"}},"stdJsonOutput":{"sources":{"contracts/test/MockUSDC.sol":{"id":27},"contracts/ArcTrustEscrow.sol":{"id":26},"@openzeppelin/contracts/utils/Bytes.sol":{"id":11},"@openzeppelin/contracts/utils/Panic.sol":{"id":13},"@openzeppelin/contracts/utils/Context.sol":{"id":12},"@openzeppelin/contracts/utils/Strings.sol":{"id":17},"@openzeppelin/contracts/utils/math/Math.sol":{"id":23},"@openzeppelin/contracts/interfaces/IERC20.sol":{"id":3},"@openzeppelin/contracts/token/ERC20/ERC20.sol":{"id":7},"@openzeppelin/contracts/utils/StorageSlot.sol":{"id":16},"@openzeppelin/contracts/interfaces/IERC165.sol":{"id":2},"@openzeppelin/contracts/token/ERC20/IERC20.sol":{"id":8},"@openzeppelin/contracts/utils/ShortStrings.sol":{"id":15},"@openzeppelin/contracts/interfaces/IERC1271.sol":{"id":0},"@openzeppelin/contracts/interfaces/IERC1363.sol":{"id":1},"@openzeppelin/contracts/interfaces/IERC5267.sol":{"id":4},"@openzeppelin/contracts/interfaces/IERC7913.sol":{"id":5},"@openzeppelin/contracts/utils/math/SafeCast.sol":{"id":24},"@openzeppelin/contracts/utils/ReentrancyGuard.sol":{"id":14},"@openzeppelin/contracts/utils/math/SignedMath.sol":{"id":25},"@openzeppelin/contracts/utils/cryptography/ECDSA.sol":{"id":18},"@openzeppelin/contracts/interfaces/draft-IERC6093.sol":{"id":6},"@openzeppelin/contracts/utils/cryptography/EIP712.sol":{"id":19},"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol":{"id":10},"@openzeppelin/contracts/utils/introspection/IERC165.sol":{"id":22},"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol":{"id":20},"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol":{"id":21},"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":9}},"contracts":{"contracts/ArcTrustEscrow.sol":{"ArcTrustEscrow":{"abi":[{"type":"constructor","inputs":[{"name":"asset_","type":"address","internalType":"contract IERC20"},{"name":"source_","type":"address","internalType":"address"},{"name":"judge_","type":"address","internalType":"address"},{"name":"campaignId_","type":"bytes32","internalType":"bytes32"},{"name":"rootAgentId_","type":"bytes32","internalType":"bytes32"},{"name":"budgetMicrounits_","type":"uint256","internalType":"uint256"}],"stateMutability":"nonpayable"},{"name":"AgentAlreadyQualified","type":"error","inputs":[]},{"name":"AlreadyFunded","type":"error","inputs":[]},{"name":"BudgetExceeded","type":"error","inputs":[]},{"name":"CampaignExpired","type":"error","inputs":[]},{"name":"CampaignStillActive","type":"error","inputs":[]},{"name":"EventAlreadyUsed","type":"error","inputs":[]},{"name":"InvalidApprovalTime","type":"error","inputs":[]},{"name":"InvalidBudget","type":"error","inputs":[]},{"name":"InvalidFundingAmount","type":"error","inputs":[]},{"name":"InvalidJudgeSignature","type":"error","inputs":[]},{"name":"InvalidShortString","type":"error","inputs":[]},{"name":"NotFunded","type":"error","inputs":[]},{"name":"OnlySource","type":"error","inputs":[]},{"name":"PayoutAlreadyUsed","type":"error","inputs":[]},{"name":"QualificationLimitReached","type":"error","inputs":[]},{"name":"ReentrancyGuardReentrantCall","type":"error","inputs":[]},{"name":"ReviewAlreadyUsed","type":"error","inputs":[]},{"name":"RewardAlreadyPaid","type":"error","inputs":[]},{"name":"RootCannotQualify","type":"error","inputs":[]},{"name":"SafeERC20FailedOperation","type":"error","inputs":[{"name":"token","type":"address","internalType":"address"}]},{"name":"SelfParent","type":"error","inputs":[]},{"name":"StringTooLong","type":"error","inputs":[{"name":"str","type":"string","internalType":"string"}]},{"name":"UnknownParent","type":"error","inputs":[]},{"name":"ZeroAddress","type":"error","inputs":[]},{"name":"ZeroIdentifier","type":"error","inputs":[]},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"EscrowFunded","type":"event","inputs":[{"name":"source","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"},{"name":"fundedAt","type":"uint64","indexed":false,"internalType":"uint64"},{"name":"expiresAt","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"ExpiredBalanceReturned","type":"event","inputs":[{"name":"source","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"},{"name":"sweptAt","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"QualificationClaimed","type":"event","inputs":[{"name":"eventId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"reviewId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"parentAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"grandparentAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"subjectPayout","type":"address","indexed":false,"internalType":"address"},{"name":"evidenceHash","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"approvedAt","type":"uint64","indexed":false,"internalType":"uint64"},{"name":"eventMicrounits","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"RewardPaid","type":"event","inputs":[{"name":"rewardId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"eventId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"recipient","type":"address","indexed":true,"internalType":"address"},{"name":"recipientAgentId","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"tier","type":"uint8","indexed":false,"internalType":"enum ArcTrustEscrow.RewardTier"},{"name":"amountMicrounits","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"CAMPAIGN_DURATION","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"DIRECT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"GRANDPARENT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_BUDGET_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_EVENT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"MAX_QUALIFICATIONS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"PARTICIPANT_MICROUNITS","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"QUALIFICATION_TYPEHASH","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"asset","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"contract IERC20"}],"stateMutability":"view"},{"name":"budgetMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"campaignId","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"claimQualification","type":"function","inputs":[{"name":"q","type":"tuple","components":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","internalType":"bytes32"},{"name":"subjectPayout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"evidenceHash","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification"},{"name":"signature","type":"bytes","internalType":"bytes"}],"outputs":[],"stateMutability":"nonpayable"},{"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":"expiresAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"fund","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"fundedAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"judge","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"paidMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"paidRewards","type":"function","inputs":[{"name":"rewardId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"paid","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"payoutAgentIds","type":"function","inputs":[{"name":"payout","type":"address","internalType":"address"}],"outputs":[{"name":"agentId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"qualificationCount","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"qualificationDigest","type":"function","inputs":[{"name":"q","type":"tuple","components":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"subjectAgentId","type":"bytes32","internalType":"bytes32"},{"name":"subjectPayout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"evidenceHash","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"internalType":"struct ArcTrustEscrow.Qualification"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"qualifiedAgents","type":"function","inputs":[{"name":"agentId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"payout","type":"address","internalType":"address"},{"name":"parentAgentId","type":"bytes32","internalType":"bytes32"},{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"approvedAt","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"remainingMicrounits","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"rewardId","type":"function","inputs":[{"name":"eventId","type":"bytes32","internalType":"bytes32"},{"name":"reviewId","type":"bytes32","internalType":"bytes32"},{"name":"recipientAgentId","type":"bytes32","internalType":"bytes32"},{"name":"recipient","type":"address","internalType":"address"},{"name":"tier","type":"uint8","internalType":"enum ArcTrustEscrow.RewardTier"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"rootAgentId","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"source","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"sweepExpired","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"sweptAt","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"usedEvents","type":"function","inputs":[{"name":"eventId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"used","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"usedReviews","type":"function","inputs":[{"name":"reviewId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"used","type":"bool","internalType":"bool"}],"stateMutability":"view"}],"metadata":"{\"compiler\":{\"version\":\"0.8.36+commit.8a079791\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"asset_\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"source_\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"judge_\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"campaignId_\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"rootAgentId_\",\"type\":\"bytes32\"},{\"internalType\":\"uint256\",\"name\":\"budgetMicrounits_\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AgentAlreadyQualified\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AlreadyFunded\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"BudgetExceeded\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CampaignExpired\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CampaignStillActive\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EventAlreadyUsed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidApprovalTime\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidBudget\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidFundingAmount\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidJudgeSignature\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidShortString\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotFunded\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OnlySource\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"PayoutAlreadyUsed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"QualificationLimitReached\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ReentrancyGuardReentrantCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ReviewAlreadyUsed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"RewardAlreadyPaid\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"RootCannotQualify\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"token\",\"type\":\"address\"}],\"name\":\"SafeERC20FailedOperation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"SelfParent\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"string\",\"name\":\"str\",\"type\":\"string\"}],\"name\":\"StringTooLong\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnknownParent\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ZeroAddress\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ZeroIdentifier\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[],\"name\":\"EIP712DomainChanged\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"source\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amountMicrounits\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"fundedAt\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"expiresAt\",\"type\":\"uint64\"}],\"name\":\"EscrowFunded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"source\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amountMicrounits\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"sweptAt\",\"type\":\"uint64\"}],\"name\":\"ExpiredBalanceReturned\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"reviewId\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"subjectAgentId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"parentAgentId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"grandparentAgentId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"subjectPayout\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"evidenceHash\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"approvedAt\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"eventMicrounits\",\"type\":\"uint256\"}],\"name\":\"QualificationClaimed\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"rewardId\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"recipient\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"recipientAgentId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"enum ArcTrustEscrow.RewardTier\",\"name\":\"tier\",\"type\":\"uint8\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amountMicrounits\",\"type\":\"uint256\"}],\"name\":\"RewardPaid\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"CAMPAIGN_DURATION\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"DIRECT_MICROUNITS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"GRANDPARENT_MICROUNITS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"MAX_BUDGET_MICROUNITS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"MAX_EVENT_MICROUNITS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"MAX_QUALIFICATIONS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"PARTICIPANT_MICROUNITS\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"QUALIFICATION_TYPEHASH\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"asset\",\"outputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"budgetMicrounits\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"campaignId\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"components\":[{\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"reviewId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"subjectAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"subjectPayout\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"parentAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"evidenceHash\",\"type\":\"bytes32\"},{\"internalType\":\"uint64\",\"name\":\"approvedAt\",\"type\":\"uint64\"}],\"internalType\":\"struct ArcTrustEscrow.Qualification\",\"name\":\"q\",\"type\":\"tuple\"},{\"internalType\":\"bytes\",\"name\":\"signature\",\"type\":\"bytes\"}],\"name\":\"claimQualification\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"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\":[],\"name\":\"expiresAt\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"fund\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"fundedAt\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"judge\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"paidMicrounits\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"rewardId\",\"type\":\"bytes32\"}],\"name\":\"paidRewards\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"paid\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"payout\",\"type\":\"address\"}],\"name\":\"payoutAgentIds\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"agentId\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"qualificationCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"components\":[{\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"reviewId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"subjectAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"subjectPayout\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"parentAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"evidenceHash\",\"type\":\"bytes32\"},{\"internalType\":\"uint64\",\"name\":\"approvedAt\",\"type\":\"uint64\"}],\"internalType\":\"struct ArcTrustEscrow.Qualification\",\"name\":\"q\",\"type\":\"tuple\"}],\"name\":\"qualificationDigest\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"agentId\",\"type\":\"bytes32\"}],\"name\":\"qualifiedAgents\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"payout\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"parentAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"internalType\":\"uint64\",\"name\":\"approvedAt\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"remainingMicrounits\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"reviewId\",\"type\":\"bytes32\"},{\"internalType\":\"bytes32\",\"name\":\"recipientAgentId\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"recipient\",\"type\":\"address\"},{\"internalType\":\"enum ArcTrustEscrow.RewardTier\",\"name\":\"tier\",\"type\":\"uint8\"}],\"name\":\"rewardId\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"rootAgentId\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"source\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"sweepExpired\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"sweptAt\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"eventId\",\"type\":\"bytes32\"}],\"name\":\"usedEvents\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"used\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"reviewId\",\"type\":\"bytes32\"}],\"name\":\"usedReviews\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"used\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"details\":\"Selah's immutable judge signer attests only the qualification edge. This contract derives      every eligible recipient and amount from the already-recorded referral graph. There is no      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.\",\"errors\":{\"ReentrancyGuardReentrantCall()\":[{\"details\":\"Unauthorized reentrant call.\"}],\"SafeERC20FailedOperation(address)\":[{\"details\":\"An operation with an ERC-20 token failed.\"}]},\"events\":{\"EIP712DomainChanged()\":{\"details\":\"MAY be emitted to signal that the domain could have changed.\"}},\"kind\":\"dev\",\"methods\":{\"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)\":{\"details\":\"Anyone may relay the immutable judge's EIP-712 signature before expiry.\"},\"eip712Domain()\":{\"details\":\"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature.\"},\"fund()\":{\"details\":\"The source must approve this contract first. Fee-on-transfer tokens fail closed.\"},\"sweepExpired()\":{\"details\":\"Anyone may trigger this liveness operation. It cannot run early.\"}},\"title\":\"ARC Trust Escrow\",\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{\"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)\":{\"notice\":\"Pays one approved agent and its eligible approved ancestors atomically.\"},\"fund()\":{\"notice\":\"Pulls the exact immutable campaign budget from the source once.\"},\"sweepExpired()\":{\"notice\":\"Returns every unclaimed USDC unit to the immutable source after expiry.\"}},\"notice\":\"A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/ArcTrustEscrow.sol\":\"ArcTrustEscrow\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\"},\"optimizer\":{\"enabled\":true,\"runs\":10000},\"remappings\":[]},\"sources\":{\"@openzeppelin/contracts/interfaces/IERC1271.sol\":{\"keccak256\":\"0x66c7ec42c6c43712be2107a50ab4529379bc76a632b425babec698d9da921ac6\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://dce2778f0b638adfc5ba29c2c618c855fe725fa74a16846386aa1d56a834aa04\",\"dweb:/ipfs/QmPV9oWnzQdi58od266j62xvviavLNHqKLZfm6k2K1qy9E\"]},\"@openzeppelin/contracts/interfaces/IERC1363.sol\":{\"keccak256\":\"0xd5ea07362ab630a6a3dee4285a74cf2377044ca2e4be472755ad64d7c5d4b69d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://da5e832b40fc5c3145d3781e2e5fa60ac2052c9d08af7e300dc8ab80c4343100\",\"dweb:/ipfs/QmTzf7N5ZUdh5raqtzbM11yexiUoLC9z3Ws632MCuycq1d\"]},\"@openzeppelin/contracts/interfaces/IERC165.sol\":{\"keccak256\":\"0x0afcb7e740d1537b252cb2676f600465ce6938398569f09ba1b9ca240dde2dfc\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1c299900ac4ec268d4570ecef0d697a3013cd11a6eb74e295ee3fbc945056037\",\"dweb:/ipfs/Qmab9owJoxcA7vJT5XNayCMaUR1qxqj1NDzzisduwaJMcZ\"]},\"@openzeppelin/contracts/interfaces/IERC20.sol\":{\"keccak256\":\"0x1a6221315ce0307746c2c4827c125d821ee796c74a676787762f4778671d4f44\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1bb2332a7ee26dd0b0de9b7fe266749f54820c99ab6a3bcb6f7e6b751d47ee2d\",\"dweb:/ipfs/QmcRWpaBeCYkhy68PR3B4AgD7asuQk7PwkWxrvJbZcikLF\"]},\"@openzeppelin/contracts/interfaces/IERC5267.sol\":{\"keccak256\":\"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae\",\"dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1\"]},\"@openzeppelin/contracts/interfaces/IERC7913.sol\":{\"keccak256\":\"0xe5a126930df1d54e4a6dd5fea09010c4a7db0ea974c6c17a1e6082879f5a032b\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://2f58f5a90328536a6c68289916bfa4ed653d871319c7b2a416ab3f6263c4f2f5\",\"dweb:/ipfs/Qmaa9DmgUA16Urz5fuF4RbFz2NaVpNLV41ddwykSdasFUd\"]},\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303\",\"dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV\"]},\"@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol\":{\"keccak256\":\"0x304d732678032a9781ae85c8f204c8fba3d3a5e31c02616964e75cfdc5049098\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://299ced486011781dc98f638059678323c03079fefae1482abaa2135b22fa92d0\",\"dweb:/ipfs/QmbZNbcPTBxNvwChavN2kkZZs7xHhYL7mv51KrxMhsMs3j\"]},\"@openzeppelin/contracts/utils/Bytes.sol\":{\"keccak256\":\"0xf80e4b96b6849936ea0fabd76cf81b13d7276295fddb1e1c07afb3ddf650b0ac\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://6430007255ac11c6e9c4331a418f3af52ff66fbbae959f645301d025b20aeb08\",\"dweb:/ipfs/QmQE5fjmBBRw9ndnzJuC2uskYss1gbaR7JdazoCf1FGoBj\"]},\"@openzeppelin/contracts/utils/Panic.sol\":{\"keccak256\":\"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a\",\"dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG\"]},\"@openzeppelin/contracts/utils/ReentrancyGuard.sol\":{\"keccak256\":\"0xa516cbf1c7d15d3517c2d668601ce016c54395bf5171918a14e2686977465f53\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1e1d079e8edfb58efd23a311e315a4807b01b5d1cf153f8fa2d0608b9dec3e99\",\"dweb:/ipfs/QmTBExeX2SDTkn5xbk5ssbYSx7VqRp9H4Ux1CY4uQM4b9N\"]},\"@openzeppelin/contracts/utils/ShortStrings.sol\":{\"keccak256\":\"0x0768b3bdb701fe4994b3be932ca8635551dfebe04c645f77500322741bebf57c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://a2059f9ca8d3c11c49ca49fc9c5fb070f18cc85d12a7688e45322ed0e2a1cb99\",\"dweb:/ipfs/QmS2gwX51RAvSw4tYbjHccY2CKbh2uvDzqHLAFXdsddgia\"]},\"@openzeppelin/contracts/utils/StorageSlot.sol\":{\"keccak256\":\"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b\",\"dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM\"]},\"@openzeppelin/contracts/utils/Strings.sol\":{\"keccak256\":\"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc\",\"dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS\"]},\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\":{\"keccak256\":\"0xbeb5cad8aaabe0d35d2ec1a8414d91e81e5a8ca679add4cf57e2f33476861f40\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ebb272a5ee2da4e8bd5551334e0ce8dce4e9c56a04570d6bf046d260fab3116a\",\"dweb:/ipfs/QmNw6RyM769qcqFocDq6HJMG2WiEnQbvizpRaUXsACHho2\"]},\"@openzeppelin/contracts/utils/cryptography/EIP712.sol\":{\"keccak256\":\"0x8440117ea216b97a7bad690a67449fd372c840d073c8375822667e14702782b4\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ebb6645995b8290d0b9121825e2533e4e28977b2c6befee76e15e58f0feb61d4\",\"dweb:/ipfs/QmVR72j6kL5R2txuihieDev1FeTi4KWJS1Z6ABbwL3Qtph\"]},\"@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol\":{\"keccak256\":\"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c\",\"dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL\"]},\"@openzeppelin/contracts/utils/cryptography/SignatureChecker.sol\":{\"keccak256\":\"0x0d53049a9969f2bc5cb88b32c909e2729a5fa157d258305b42b502427ad492c6\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://eacca39a3f50c665454866342bb05f10cc1e87c2bbd73dda981a6a0de1978fb0\",\"dweb:/ipfs/QmbFKMUT5BXtCdA2SCof9GuasrVhoGzaLUQG3gUvGDtdoE\"]},\"@openzeppelin/contracts/utils/introspection/IERC165.sol\":{\"keccak256\":\"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617\",\"dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u\"]},\"@openzeppelin/contracts/utils/math/Math.sol\":{\"keccak256\":\"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5\",\"dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y\"]},\"@openzeppelin/contracts/utils/math/SafeCast.sol\":{\"keccak256\":\"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9\",\"dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif\"]},\"@openzeppelin/contracts/utils/math/SignedMath.sol\":{\"keccak256\":\"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03\",\"dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ\"]},\"contracts/ArcTrustEscrow.sol\":{\"keccak256\":\"0x9786710b868f04439c3dae8cd58b1253cbdd1945cdcb872d14d27615ae0501dd\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://a6e51864bb1197a7a3eaa03b3ea8f65e935e1f166de82316b92c4d5e2917217a\",\"dweb:/ipfs/QmRbsSMEvDEeDMdREuCrAPhTbzcvAF5x3BLb5wbEEAdztM\"]}},\"version\":1}","userdoc":{"kind":"user","notice":"A fixed-term, non-upgradeable USDC escrow for culture.sbs ARC/v0.","methods":{"fund()":{"notice":"Pulls the exact immutable campaign budget from the source once."},"sweepExpired()":{"notice":"Returns every unclaimed USDC unit to the immutable source after expiry."},"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"notice":"Pays one approved agent and its eligible approved ancestors atomically."}},"version":1},"devdoc":{"kind":"dev","title":"ARC Trust Escrow","errors":{"ReentrancyGuardReentrantCall()":[{"details":"Unauthorized reentrant call."}],"SafeERC20FailedOperation(address)":[{"details":"An operation with an ERC-20 token failed."}]},"events":{"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."}},"details":"Selah's immutable judge signer attests only the qualification edge. This contract derives      every eligible recipient and amount from the already-recorded referral graph. There is no      owner, pause, upgrade, signer rotation, arbitrary payout, or withdrawal before expiry.","methods":{"fund()":{"details":"The source must approve this contract first. Fee-on-transfer tokens fail closed."},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"sweepExpired()":{"details":"Anyone may trigger this liveness operation. It cannot run early."},"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)":{"details":"Anyone may relay the immutable judge's EIP-712 signature before expiry."}},"version":1},"storageLayout":{"types":{"t_bool":{"label":"bool","encoding":"inplace","numberOfBytes":"1"},"t_uint64":{"label":"uint64","encoding":"inplace","numberOfBytes":"8"},"t_address":{"label":"address","encoding":"inplace","numberOfBytes":"20"},"t_bytes32":{"label":"bytes32","encoding":"inplace","numberOfBytes":"32"},"t_uint256":{"label":"uint256","encoding":"inplace","numberOfBytes":"32"},"t_string_storage":{"label":"string","encoding":"bytes","numberOfBytes":"32"},"t_mapping(t_bytes32,t_bool)":{"key":"t_bytes32","label":"mapping(bytes32 => bool)","value":"t_bool","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_address,t_bytes32)":{"key":"t_address","label":"mapping(address => bytes32)","value":"t_bytes32","encoding":"mapping","numberOfBytes":"32"},"t_struct(QualifiedAgent)9061_storage":{"label":"struct ArcTrustEscrow.QualifiedAgent","members":[{"slot":"0","type":"t_address","astId":9054,"label":"payout","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"1","type":"t_bytes32","astId":9056,"label":"parentAgentId","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_bytes32","astId":9058,"label":"eventId","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"3","type":"t_uint64","astId":9060,"label":"approvedAt","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"}],"encoding":"inplace","numberOfBytes":"128"},"t_mapping(t_bytes32,t_struct(QualifiedAgent)9061_storage)":{"key":"t_bytes32","label":"mapping(bytes32 => struct ArcTrustEscrow.QualifiedAgent)","value":"t_struct(QualifiedAgent)9061_storage","encoding":"mapping","numberOfBytes":"32"}},"storage":[{"slot":"0","type":"t_string_storage","astId":4698,"label":"_nameFallback","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"1","type":"t_string_storage","astId":4700,"label":"_versionFallback","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9076,"label":"fundedAt","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9078,"label":"expiresAt","offset":8,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"2","type":"t_uint64","astId":9080,"label":"sweptAt","offset":16,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"3","type":"t_uint256","astId":9082,"label":"qualificationCount","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"4","type":"t_uint256","astId":9084,"label":"paidMicrounits","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"5","type":"t_mapping(t_bytes32,t_struct(QualifiedAgent)9061_storage)","astId":9089,"label":"qualifiedAgents","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"6","type":"t_mapping(t_address,t_bytes32)","astId":9093,"label":"payoutAgentIds","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"7","type":"t_mapping(t_bytes32,t_bool)","astId":9097,"label":"usedEvents","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"8","type":"t_mapping(t_bytes32,t_bool)","astId":9101,"label":"usedReviews","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"},{"slot":"9","type":"t_mapping(t_bytes32,t_bool)","astId":9105,"label":"paidRewards","offset":0,"contract":"contracts/ArcTrustEscrow.sol:ArcTrustEscrow"}]},"transientStorageLayout":{"types":null,"storage":[]},"evm":{"bytecode":{"object":"610220604052348015610010575f5ffd5b50604051612c9c380380612c9c83398101604081905261002f916102b5565b604080518082018252601581527f63756c747572652e736273204152432054727573740000000000000000000000602080830191909152825180840190935260018352603160f81b9083015290610086825f610226565b61012052610095816001610226565b61014052815160208084019190912060e052815190820120610100524660a05261012160e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c05260017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00556001600160a01b038616158061016b57506001600160a01b038516155b8061017d57506001600160a01b038416155b1561019b5760405163d92e233d60e01b815260040160405180910390fd5b8215806101a6575081155b156101c45760405163e334302b60e01b815260040160405180910390fd5b8015806101d35750624c243081115b156101f157604051630757bfc960e21b815260040160405180910390fd5b6001600160a01b039586166101605293851661018052919093166101a0526101c0929092526101e091909152610200526104d4565b5f6020835110156102415761023a83610258565b9050610252565b8161024c84826103be565b5060ff90505b92915050565b5f5f829050601f8151111561028b578260405163305a27a960e01b8152600401610282919061047c565b60405180910390fd5b8051610296826104b1565b179392505050565b6001600160a01b03811681146102b2575f5ffd5b50565b5f5f5f5f5f5f60c087890312156102ca575f5ffd5b86516102d58161029e565b60208801519096506102e68161029e565b60408801519095506102f78161029e565b6060880151608089015160a090990151979a96995090979096909590945092505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061034357607f821691505b60208210810361036157634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156103b957828211156103b957805f5260205f20601f840160051c602085101561039257505f5b90810190601f840160051c035f5b818110156103b5575f838201556001016103a0565b5050505b505050565b81516001600160401b038111156103d7576103d761031b565b6103eb816103e5845461032f565b84610367565b6020601f82116001811461041d575f83156104065750848201515b5f19600385901b1c1916600184901b178455610475565b5f84815260208120601f198516915b8281101561044c578785015182556020948501946001909201910161042c565b508482101561046957868401515f19600387901b60f8161c191681555b505060018360011b0184555b5050505050565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b80516020808301519190811015610361575f1960209190910360031b1b16919050565b60805160a05160c05160e05161010051610120516101405161016051610180516101a0516101c0516101e051610200516126936106095f395f818161032601528181610bed015281816116f30152818161174501526118b901525f81816102ec015281816107b301528181610a1901528181610b210152610e7d01525f81816104740152610fc501525f81816103eb0152610aa401525f818161041201528181611238015281816112c70152818161154a015281816116d1015261192f01525f81816102a001528181611176015281816112160152818161128d0152818161144901528181611615015281816116af0152818161177e015281816118f50152611b1801525f611c7601525f611c4a01525f611f7d01525f611f5501525f611eb001525f611eda01525f611f0401526126935ff3fe608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61020861031c3660046123a2565b611342565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000083604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f00000000000000000000000000000000000000000000000000000000000000001490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f00000000000000000000000000000000000000000000000000000000000000008287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f00000000000000000000000000000000000000000000000000000000000000008214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f00000000000000000000000000000000000000000000000000000000000000008214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f000000000000000000000000000000000000000000000000000000000000000086868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f000000000000000000000000000000000000000000000000000000000000000083611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116927f0000000000000000000000000000000000000000000000000000000000000000909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f0000000000000000000000000000000000000000000000000000000000000000307f0000000000000000000000000000000000000000000000000000000000000000611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f000000000000000000000000000000000000000000000000000000000000000090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000000000008152938616928616929092176020840152909204909216908201527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116917f0000000000000000000000000000000000000000000000000000000000000000909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f00000000000000000000000000000000000000000000000000000000000000005f611fcd565b60606114c77f00000000000000000000000000000000000000000000000000000000000000006001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016148015611efc57507f000000000000000000000000000000000000000000000000000000000000000046145b15611f2657507f000000000000000000000000000000000000000000000000000000000000000090565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","sourceMap":"871:10809:26:-:0;;;4327:780;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;3428:431:19;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;3428:431:19;;;;;3501:45;3428:431;-1:-1:-1;3501:30:19;:45::i;:::-;3493:53;;3567:51;:7;3601:16;3567:33;:51::i;:::-;3556:62;;3642:22;;;;;;;;;;3628:36;;3691:25;;;;;;3674:42;;3744:13;3727:30;;3792:23;4326:11;;4339:14;;4304:80;;;2079:95;4304:80;;;4084:25:28;4125:18;;;4118:34;;;;4168:18;;;4161:34;4355:13:19;4211:18:28;;;4204:34;4378:4:19;4254:19:28;;;4247:61;4268:7:19;;4056:19:28;;4304:80:19;;;;;;;;;;;;4294:91;;;;;;4287:98;;4213:179;;3792:23;3767:48;;-1:-1:-1;;3847:4:19;3825:27;;2365:1:14;1505:66;2539;-1:-1:-1;;;;;4562:29:26;::::1;::::0;;:54:::1;;-1:-1:-1::0;;;;;;4595:21:26;::::1;::::0;4562:54:::1;:78;;;-1:-1:-1::0;;;;;;4620:20:26;::::1;::::0;4562:78:::1;4558:129;;;4663:13;;-1:-1:-1::0;;;4663:13:26::1;;;;;;;;;;;4558:129;4700:25:::0;;;:55:::1;;-1:-1:-1::0;4729:26:26;;4700:55:::1;4696:84;;;4764:16;;-1:-1:-1::0;;;4764:16:26::1;;;;;;;;;;;4696:84;4794:22:::0;;;:67:::1;;;1300:9;4820:17;:41;4794:67;4790:120;;;4884:15;;-1:-1:-1::0;;;4884:15:26::1;;;;;;;;;;;4790:120;-1:-1:-1::0;;;;;4920:14:26;;::::1;;::::0;4944:16;;::::1;;::::0;4970:14;;;::::1;;::::0;4994:24:::1;::::0;;;;5028:26:::1;::::0;;;;5064:36:::1;::::0;871:10809;;2893:342:15;2989:11;3038:4;3022:5;3016:19;:26;3012:217;;;3065:20;3079:5;3065:13;:20::i;:::-;3058:27;;;;3012:217;3142:5;3116:46;3157:5;3142;3116:46;:::i;:::-;-1:-1:-1;1390:66:15;;-1:-1:-1;3012:217:15;2893:342;;;;:::o;1708:288::-;1773:11;1796:17;1822:3;1796:30;;1854:4;1840;:11;:18;1836:74;;;1895:3;1881:18;;-1:-1:-1;;;1881:18:15;;;;;;;;:::i;:::-;;;;;;;;1836:74;1976:11;;1959:13;1976:4;1959:13;:::i;:::-;1951:36;;1708:288;-1:-1:-1;;;1708:288:15:o;14:139:28:-;-1:-1:-1;;;;;97:31:28;;87:42;;77:70;;143:1;140;133:12;77:70;14:139;:::o;158:847::-;287:6;295;303;311;319;327;380:3;368:9;359:7;355:23;351:33;348:53;;;397:1;394;387:12;348:53;429:9;423:16;448:39;481:5;448:39;:::i;:::-;556:2;541:18;;535:25;506:5;;-1:-1:-1;569:41:28;535:25;569:41;:::i;:::-;681:2;666:18;;660:25;629:7;;-1:-1:-1;694:41:28;660:25;694:41;:::i;:::-;827:2;812:18;;806:25;923:3;908:19;;902:26;994:3;979:19;;;973:26;158:847;;;;-1:-1:-1;754:7:28;;806:25;;902:26;;973;;-1:-1:-1;158:847:28;-1:-1:-1;;;158:847:28:o;1010:127::-;1071:10;1066:3;1062:20;1059:1;1052:31;1102:4;1099:1;1092:15;1126:4;1123:1;1116:15;1142:380;1221:1;1217:12;;;;1264;;;1285:61;;1339:4;1331:6;1327:17;1317:27;;1285:61;1392:2;1384:6;1381:14;1361:18;1358:38;1355:161;;1438:10;1433:3;1429:20;1426:1;1419:31;1473:4;1470:1;1463:15;1501:4;1498:1;1491:15;1355:161;;1142:380;;;:::o;1653:692::-;1755:2;1750:3;1747:11;1744:595;;;1792:10;1787:3;1784:19;1781:548;;;1844:5;1841:1;1834:16;1892:4;1889:1;1879:18;1957:2;1945:10;1941:19;1938:1;1934:27;1996:4;1984:10;1981:20;1978:45;;;-1:-1:-1;2020:1:28;1978:45;2059:23;;;;2129:2;2120:12;;2117:1;2113:20;2109:39;2174:1;2192:123;2206:2;2203:1;2200:9;2192:123;;;2295:1;2274:19;;;2267:30;2224:1;2217:9;2192:123;;;2196:3;;;1781:548;1653:692;;;:::o;2521:1299::-;2641:10;;-1:-1:-1;;;;;2663:30:28;;2660:56;;;2696:18;;:::i;:::-;2725:97;2815:6;2775:38;2807:4;2801:11;2775:38;:::i;:::-;2769:4;2725:97;:::i;:::-;2871:4;2902:2;2891:14;;2919:1;2914:649;;;;3607:1;3624:6;3621:89;;;-1:-1:-1;3676:19:28;;;3670:26;3621:89;-1:-1:-1;;2478:1:28;2474:11;;;2470:24;2466:29;2456:40;2502:1;2498:11;;;2453:57;3723:81;;2884:930;;2914:649;1600:1;1593:14;;;1637:4;1624:18;;-1:-1:-1;;2950:20:28;;;3068:222;3082:7;3079:1;3076:14;3068:222;;;3164:19;;;3158:26;3143:42;;3271:4;3256:20;;;;3224:1;3212:14;;;;3098:12;3068:222;;;3072:3;3318:6;3309:7;3306:19;3303:201;;;3379:19;;;3373:26;-1:-1:-1;;3462:1:28;3458:14;;;3474:3;3454:24;3450:37;3446:42;3431:58;3416:74;;3303:201;;;3550:1;3541:6;3538:1;3534:14;3530:22;3524:4;3517:36;2884:930;;;;2521:1299;;:::o;4319:418::-;4468:2;4457:9;4450:21;4431:4;4500:6;4494:13;4543:6;4538:2;4527:9;4523:18;4516:34;4602:6;4597:2;4589:6;4585:15;4580:2;4569:9;4565:18;4559:50;4658:1;4653:2;4644:6;4633:9;4629:22;4625:31;4618:42;4728:2;4721;4717:7;4712:2;4704:6;4700:15;4696:29;4685:9;4681:45;4677:54;4669:62;;;4319:418;;;;:::o;4742:297::-;4860:12;;4907:4;4896:16;;;4890:23;;4860:12;4925:16;;4922:111;;;-1:-1:-1;;4999:4:28;4995:17;;;;4992:1;4988:25;4984:38;4973:50;;4742:297;-1:-1:-1;4742:297:28:o;:::-;871:10809:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","linkReferences":{}},"deployedBytecode":{"object":"608060405234801561000f575f5ffd5b50600436106101dc575f3560e01c8063573255f411610109578063c42365811161009e578063e592f6ac1161006e578063e592f6ac14610536578063e7f6f900146104d4578063e930121714610555578063fecaf8e81461055e575f5ffd5b8063c4236581146104d4578063c77bc2e3146104dd578063d2c7639414610504578063d887f2f51461050e575f5ffd5b80638ed5b0fc116100d95780638ed5b0fc1461046f578063a81d79fc14610496578063a9a748ff146104b8578063b60d4288146104cc575f5ffd5b8063573255f4146103e657806367e828bf1461040d57806384b0196e146104345780638622a6891461044f575f5ffd5b80632ad2ea811161017f578063436969ad1161014f578063436969ad1461030e57806346234dde146103215780634a5d10b91461034857806352b45d3014610350575f5ffd5b80632ad2ea81146102615780632cd446b51461026957806338d52e0f1461029b5780633d56d67b146102e7575f5ffd5b8063132271dc116101ba578063132271dc1461023e5780631da16ecb14610246578063245aff711461024f5780632825378b14610258575f5ffd5b80630652ff8c146101e0578063083f20ea146101f557806308fd4cfa1461021b575b5f5ffd5b6101f36101ee366004612290565b610580565b005b610208610203366004612338565b610fc2565b6040519081526020015b60405180910390f35b61022562278d0081565b60405167ffffffffffffffff9091168152602001610212565b610208606481565b61020860045481565b61020861c35081565b61020861753081565b6101f3611060565b61028b61027736600461238b565b60096020525f908152604090205460ff1681565b6040519015158152602001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b60405173ffffffffffffffffffffffffffffffffffffffff9091168152602001610212565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61020861031c3660046123a2565b611342565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b610208611419565b6103a561035e36600461238b565b60056020525f9081526040902080546001820154600283015460039093015473ffffffffffffffffffffffffffffffffffffffff90921692909167ffffffffffffffff1684565b6040805173ffffffffffffffffffffffffffffffffffffffff909516855260208501939093529183015267ffffffffffffffff166060820152608001610212565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b6102c27f000000000000000000000000000000000000000000000000000000000000000081565b61043c6114cc565b604051610212979695949392919061240f565b6002546102259068010000000000000000900467ffffffffffffffff1681565b6102087f000000000000000000000000000000000000000000000000000000000000000081565b61028b6104a436600461238b565b60086020525f908152604090205460ff1681565b6002546102259067ffffffffffffffff1681565b6101f361152a565b61020861271081565b6102087fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac81565b610208624c243081565b60025461022590700100000000000000000000000000000000900467ffffffffffffffff1681565b6102086105443660046124ce565b60066020525f908152604090205481565b61020860035481565b61028b61056c36600461238b565b60076020525f908152604090205460ff1681565b61058861197c565b60025467ffffffffffffffff165f036105cd576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff16421061061e576040517f8320b48300000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60646003541061065a576040517f2edc196000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8235158061066a57506020830135155b8061067757506040830135155b80610684575060a0830135155b156106bb576040517fe334302b00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f6106cc60808501606086016124ce565b73ffffffffffffffffffffffffffffffffffffffff1603610719576040517fd92e233d00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b82355f9081526007602052604090205460ff1615610763576040517f865d5ca800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6020808401355f9081526008909152604090205460ff16156107b1576040517f5ca748ab00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000083604001350361080e576040517f4d0fa8b900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040808401355f9081526005602052205473ffffffffffffffffffffffffffffffffffffffff161561086c576040517f68b06ce500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60068161088060808701606088016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054146108f1576040517f45d77fc000000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b8260800135836040013503610932576040517f7a812dca00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff1661094f60e0850160c086016124e7565b67ffffffffffffffff16108061097d57504261097160e0850160c086016124e7565b67ffffffffffffffff16115b156109b4576040517ff2aa4c8900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6080808401355f8181526005602090815260409182902082519485018352805473ffffffffffffffffffffffffffffffffffffffff1685526001810154918501919091526002810154918401919091526003015467ffffffffffffffff1660608301527f00000000000000000000000000000000000000000000000000000000000000001490811582610a5c5750805173ffffffffffffffffffffffffffffffffffffffff16155b15610a93576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f610a9d86611342565b9050610acb7f00000000000000000000000000000000000000000000000000000000000000008287876119aa565b610b01576040517f14aff84400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f61271084610baf57610b166175308261253b565b9050836020015191507f00000000000000000000000000000000000000000000000000000000000000008214610baf575f8281526005602052604090205473ffffffffffffffffffffffffffffffffffffffff16610ba0576040517fad5ad4f500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b610bac6127108261253b565b90505b61c350811115610beb576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b7f000000000000000000000000000000000000000000000000000000000000000081600454610c1a919061253b565b1115610c52576040517f50b2c4e100000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b87355f908152600760209081526040808320805460017fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff009182168117909255838d013585526008909352928190208054909216909217905580516080808201909252908190610cc6908b0160608c016124ce565b73ffffffffffffffffffffffffffffffffffffffff16815260808a0135602082015289356040820152606001610d0260e08b0160c08c016124e7565b67ffffffffffffffff90811690915260408a8101355f81815260056020908152838220865181547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff909116178155908601516001820155928501516002840155606094850151600390930180547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000169390941692909217909255909160069190610dc89060808d01908d016124ce565b73ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550600160035f828254610e17919061253b565b925050819055508060045f828254610e2f919061253b565b90915550610e5a9050883560208a013560408b0135610e5460808d0160608e016124ce565b5f611a47565b84610ede57610e7b885f013589602001358a60800135875f01516001611a47565b7f00000000000000000000000000000000000000000000000000000000000000008214610ede575f82815260056020908152604090912054610ede918a3591908b013590859073ffffffffffffffffffffffffffffffffffffffff166002611a47565b87604001358860200135895f01357fd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d68b60800135868d6060016020810190610f2691906124ce565b8e60a001358f60c0016020810190610f3e91906124e7565b60408051958652602086019490945273ffffffffffffffffffffffffffffffffffffffff9290921684840152606084015267ffffffffffffffff16608083015260a08201879052519081900360c00190a45050505050610fbd60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b505050565b5f7f000000000000000000000000000000000000000000000000000000000000000086868686866002811115610ffa57610ffa61254e565b6040805160208101979097528601949094526060850192909252608084015273ffffffffffffffffffffffffffffffffffffffff1660a083015260ff1660c082015260e00160405160208183030381529060405280519060200120905095945050505050565b61106861197c565b60025467ffffffffffffffff165f036110ad576040517fd5ef09ba00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025468010000000000000000900467ffffffffffffffff164210156110ff576040517f9cb6acb600000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffff0000000000000000ffffffffffffffffffffffffffffffff167001000000000000000000000000000000004267ffffffffffffffff16021790556040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156111d0573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111f4919061257b565b9050801561125d5761125d73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f000000000000000000000000000000000000000000000000000000000000000083611b9c565b6002546040805183815270010000000000000000000000000000000090920467ffffffffffffffff1660208301527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116927f0000000000000000000000000000000000000000000000000000000000000000909116917fd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e42662801891015b60405180910390a35061134060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b565b5f6114137fc6628f6949fa605d6246471374c3e40a5fc65d7609ea3f304a4d270221d58eac83356020850135604086013561138360808801606089016124ce565b608088013560a089013561139d60e08b0160c08c016124e7565b6040805160208101999099528801969096526060870194909452608086019290925273ffffffffffffffffffffffffffffffffffffffff1660a085015260c084015260e083015267ffffffffffffffff166101008201526101200160405160208183030381529060405280519060200120611bfc565b92915050565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa1580156114a3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114c7919061257b565b905090565b5f6060805f5f5f60606114dd611c43565b6114e5611c6f565b604080515f808252602082019092527f0f000000000000000000000000000000000000000000000000000000000000009b939a50919850469750309650945092509050565b61153261197c565b3373ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016146115a1576040517f46806c8500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60025467ffffffffffffffff16156115e5576040517f5adf638700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201525f907f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff16906370a0823190602401602060405180830381865afa15801561166f573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611693919061257b565b905061171773ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000167f0000000000000000000000000000000000000000000000000000000000000000307f0000000000000000000000000000000000000000000000000000000000000000611c9c565b6040517f70a082310000000000000000000000000000000000000000000000000000000081523060048201527f000000000000000000000000000000000000000000000000000000000000000090829073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016906370a0823190602401602060405180830381865afa1580156117c3573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906117e7919061257b565b6117f19190612592565b14611828576040517fbb21bfd400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b600280547fffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000164267ffffffffffffffff1690811790915561186d9062278d00906125a5565b600280547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff81166801000000000000000067ffffffffffffffff948516810291821793849055604080517f00000000000000000000000000000000000000000000000000000000000000008152938616928616929092176020840152909204909216908201527f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff908116917f0000000000000000000000000000000000000000000000000000000000000000909116907fde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b769060600161130e565b611984611cfe565b60027f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5f8473ffffffffffffffffffffffffffffffffffffffff163b5f03611a30575f5f6119d6868686611d59565b5090925090505f8160038111156119ef576119ef61254e565b148015611a2757508673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16145b92505050611a3f565b611a3c85858585611da0565b90505b949350505050565b5f6001826002811115611a5c57611a5c61254e565b14611a6957612710611a6d565b6175305b90505f611a7d8787878787610fc2565b5f8181526009602052604090205490915060ff1615611ac8576040517f16600c2800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f81815260096020526040902080547fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00166001179055611b3f73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168584611b9c565b8373ffffffffffffffffffffffffffffffffffffffff1687827fc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4888787604051611b8b939291906125c5565b60405180910390a450505050505050565b611ba98383836001611e0f565b610fbd576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff841660048201526024015b60405180910390fd5b5f611413611c08611e97565b836040517f19010000000000000000000000000000000000000000000000000000000000008152600281019290925260228201526042902090565b60606114c77f00000000000000000000000000000000000000000000000000000000000000005f611fcd565b60606114c77f00000000000000000000000000000000000000000000000000000000000000006001611fcd565b611caa848484846001612077565b611cf8576040517f5274afe700000000000000000000000000000000000000000000000000000000815273ffffffffffffffffffffffffffffffffffffffff85166004820152602401611bf3565b50505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0054600203611340576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f80806041849003611d8d578435602086013560408701355f1a611d7f8982858561210a565b955095509550505050611d97565b505f915060029050825b93509350939050565b604080517f1626ba7e00000000000000000000000000000000000000000000000000000000808252600482018690526024820192909252604481018390525f919083908186606483013760205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6040517fa9059cbb000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8616600452602485905291602083604481808b5af1925060015f51148316611e8b578383151615611e7f573d5f823e3d81fd5b5f873b113d1516831692505b60405250949350505050565b5f3073ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000000000000000000000000000000000000000000016148015611efc57507f000000000000000000000000000000000000000000000000000000000000000046145b15611f2657507f000000000000000000000000000000000000000000000000000000000000000090565b6114c7604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b606060ff8314611fe757611fe0836121fd565b9050611413565b818054611ff390612612565b80601f016020809104026020016040519081016040528092919081815260200182805461201f90612612565b801561206a5780601f106120415761010080835404028352916020019161206a565b820191905f5260205f20905b81548152906001019060200180831161204d57829003601f168201915b5050505050905092915050565b6040517f23b872dd000000000000000000000000000000000000000000000000000000005f81815273ffffffffffffffffffffffffffffffffffffffff8781166004528616602452604485905291602083606481808c5af1925060015f511483166120f95783831516156120ed573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084111561214357505f915060039050826121f3565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612194573d5f5f3e3d5ffd5b50506040517fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0015191505073ffffffffffffffffffffffffffffffffffffffff81166121ea57505f9250600191508290506121f3565b92505f91508190505b9450945094915050565b60605f6122098361223a565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f60ff8216601f811115611413576040517fb3512b0c00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b5f60e0828403121561228a575f5ffd5b50919050565b5f5f5f61010084860312156122a3575f5ffd5b6122ad858561227a565b925060e084013567ffffffffffffffff8111156122c8575f5ffd5b8401601f810186136122d8575f5ffd5b803567ffffffffffffffff8111156122ee575f5ffd5b8660208284010111156122ff575f5ffd5b939660209190910195509293505050565b803573ffffffffffffffffffffffffffffffffffffffff81168114612333575f5ffd5b919050565b5f5f5f5f5f60a0868803121561234c575f5ffd5b85359450602086013593506040860135925061236a60608701612310565b915060808601356003811061237d575f5ffd5b809150509295509295909350565b5f6020828403121561239b575f5ffd5b5035919050565b5f60e082840312156123b2575f5ffd5b6123bc838361227a565b9392505050565b5f81518084528060208401602086015e5f6020828601015260207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f83011685010191505092915050565b7fff000000000000000000000000000000000000000000000000000000000000008816815260e060208201525f61244960e08301896123c3565b828103604084015261245b81896123c3565b6060840188905273ffffffffffffffffffffffffffffffffffffffff8716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156124bd57835183526020938401939092019160010161249f565b50909b9a5050505050505050505050565b5f602082840312156124de575f5ffd5b6123bc82612310565b5f602082840312156124f7575f5ffd5b813567ffffffffffffffff811681146123bc575f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b808201808211156114135761141361250e565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b5f6020828403121561258b575f5ffd5b5051919050565b818103818111156114135761141361250e565b67ffffffffffffffff81811683821601908111156114135761141361250e565b8381526060810160038410612601577f4e487b71000000000000000000000000000000000000000000000000000000005f52602160045260245ffd5b602082019390935260400152919050565b600181811c9082168061262657607f821691505b60208210810361228a577f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffdfea2646970667358221220a8c793112b85db0691fd9fd268158e1239c2795bf3a1531ea52550469f074c9e64736f6c63430008240033","sourceMap":"871:10809:26:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6074:3472;;;;;;:::i;:::-;;:::i;:::-;;10647:331;;;;;;:::i;:::-;;:::i;:::-;;;1975:25:28;;;1963:2;1948:18;10647:331:26;;;;;;;;1315:50;;1358:7;1315:50;;;;;2185:18:28;2173:31;;;2155:50;;2143:2;2128:18;1315:50:26;2011:200:28;1198:48:26;;1243:3;1198:48;;2434:29;;;;;;1139:53;;1186:6;1139:53;;1022:50;;1066:6;1022:50;;9718:410;;;:::i;2741:57::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;2794:14:28;;2787:22;2769:41;;2757:2;2742:18;2741:57:26;2629:187:28;2072:29:26;;;;;;;;3011:42:28;2999:55;;;2981:74;;2969:2;2954:18;2072:29:26;2821:240:28;2221:36:26;;;;;10134:507;;;;;;:::i;:::-;;:::i;2263:41::-;;;;;10984:117;;;:::i;2470:71::-;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3581:42:28;3569:55;;;3551:74;;3656:2;3641:18;;3634:34;;;;3684:18;;;3677:34;3759:18;3747:31;3742:2;3727:18;;3720:59;3538:3;3523:19;2470:71:26;3322:463:28;2144:30:26;;;;;2107:31;;;;;5228:557:19;;;:::i;:::-;;;;;;;;;;;;;:::i;2339:23:26:-;;;;;;;;;;;;2180:35;;;;;2678:57;;;;;;:::i;:::-;;;;;;;;;;;;;;;;2311:22;;;;;;;;;5287:608;;;:::i;1078:55::-;;1127:6;1078:55;;1372:229;;1421:180;1372:229;;1252:57;;1300:9;1252:57;;2368:21;;;;;;;;;;;;2547:64;;;;;;:::i;:::-;;;;;;;;;;;;;;2395:33;;;;;;2617:55;;;;;;:::i;:::-;;;;;;;;;;;;;;;;6074:3472;3023:21:14;:19;:21::i;:::-;6210:8:26::1;::::0;::::1;;;:13:::0;6206:37:::1;;6232:11;;;;;;;;;;;;;;6206:37;6276:9;::::0;;;::::1;;;6257:15;:28;6253:58;;6294:17;;;;;;;;;;;;;;6253:58;1243:3;6325:18;;:40;6321:80;;6374:27;;;;;;;;;;;;;;6321:80;6428:9:::0;::::1;:23:::0;;:51:::1;;-1:-1:-1::0;6455:10:26::1;::::0;::::1;;:24:::0;6428:51:::1;:101;;;-1:-1:-1::0;6499:16:26::1;::::0;::::1;;:30:::0;6428:101:::1;:133;;;-1:-1:-1::0;6533:14:26::1;::::0;::::1;;:28:::0;6428:133:::1;6411:184;;;6579:16;;;;;;;;;;;;;;6411:184;6636:1;6609:15;::::0;;;::::1;::::0;::::1;;:::i;:::-;:29;;::::0;6605:55:::1;;6647:13;;;;;;;;;;;;;;6605:55;6685:9:::0;::::1;6674:21;::::0;;;:10:::1;:21;::::0;;;;;::::1;;6670:52;;;6704:18;;;;;;;;;;;;;;6670:52;6748:10;::::0;;::::1;;6736:23;::::0;;;:11:::1;:23:::0;;;;;;;::::1;;6732:55;;;6768:19;;;;;;;;;;;;;;6732:55;6821:11;6801:1;:16;;;:31:::0;6797:63:::1;;6841:19;;;;;;;;;;;;;;6797:63;6890:16;::::0;;::::1;;6926:1;6874:33:::0;;;:15:::1;:33;::::0;;:40;:54:::1;:40;:54:::0;6870:90:::1;;6937:23;;;;;;;;;;;;;;6870:90;7017:1;6974:14;7017:1:::0;6989:15:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;6974:31;;;;;;;;;;;;;;;;:45;6970:77;;7028:19;;;;;;;;;;;;;;6970:77;7081:1;:15;;;7061:1;:16;;;:35:::0;7057:60:::1;;7105:12;;;;;;;;;;;;;;7057:60;7146:8;::::0;::::1;;7131:12;::::0;;;::::1;::::0;::::1;;:::i;:::-;:23;;;:57;;;-1:-1:-1::0;7173:15:26::1;7158:12;::::0;;;::::1;::::0;::::1;;:::i;:::-;:30;;;7131:57;7127:91;;;7197:21;;;;;;;;;;;;;;7127:91;7249:15;::::0;;::::1;;7229:17;7320:32:::0;;;:15:::1;:32;::::0;;;;;;;;7289:63;;;;::::1;::::0;;;;::::1;;::::0;;;;::::1;::::0;;;::::1;::::0;;;;::::1;::::0;::::1;::::0;;;;;;;;::::1;;::::0;::::1;;::::0;;;;7268:11:::1;7249:30;::::0;7366:13;::::1;7249:30:::0;7366:44:::1;;-1:-1:-1::0;7383:13:26;;:27:::1;;::::0;7366:44:::1;7362:72;;;7419:15;;;;;;;;;;;;;;7362:72;7445:14;7462:22;7482:1;7462:19;:22::i;:::-;7445:39;;7499:70;7544:5;7551:6;7559:9;;7499:44;:70::i;:::-;7494:132;;7592:23;;;;;;;;;;;;;;7494:132;7636:26;1010:6;7735:12:::0;7730:363:::1;;7763:36;1066:6;7763:36:::0;::::1;:::i;:::-;;;7834:6;:20;;;7813:41;;7894:11;7872:18;:33;7868:215;;7983:1;7929:35:::0;;;:15:::1;:35;::::0;;;;:42;:56:::1;:42;7925:84;;7994:15;;;;;;;;;;;;;;7925:84;8027:41;1127:6;8027:41:::0;::::1;:::i;:::-;;;7868:215;1186:6;8106:15;:38;8102:67;;;8153:16;;;;;;;;;;;;;;8102:67;8218:16;8200:15;8183:14;;:32;;;;:::i;:::-;:51;8179:80;;;8243:16;;;;;;;;;;;;;;8179:80;8281:9:::0;::::1;8270:21;::::0;;;:10:::1;:21;::::0;;;;;;;:28;;8294:4:::1;8270:28:::0;;;::::1;::::0;::::1;::::0;;;8320:10;;::::1;;8308:23:::0;;:11:::1;:23:::0;;;;;;;:30;;;;::::1;::::0;;::::1;::::0;;8384:177;;::::1;::::0;;::::1;::::0;;;;;;8421:15:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;8384:177;;::::0;;8465:15:::1;::::0;::::1;;8384:177;::::0;::::1;::::0;8503:9;::::1;8384:177:::0;;;;;;8538:12:::1;::::0;;;::::1;::::0;::::1;;:::i;:::-;8384:177;::::0;;::::1;::::0;;;8364:16:::1;::::0;;::::1;;8348:33;::::0;;;:15:::1;:33;::::0;;;;;;:213;;;;;::::1;;::::0;;::::1;;::::0;;;;::::1;::::0;-1:-1:-1;8348:213:26;::::1;::::0;;;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;;8364:16;;8571:14:::1;::::0;8348:33;8586:15:::1;::::0;;;;;;::::1;;:::i;:::-;8571:31;;;;;;;;;;;;;;;:50;;;;8653:1;8631:18;;:23;;;;;;;:::i;:::-;;;;;;;;8682:15;8664:14;;:33;;;;;;;:::i;:::-;::::0;;;-1:-1:-1;8708:86:26::1;::::0;-1:-1:-1;8713:9:26;::::1;8724:10;::::0;::::1;;8736:16;::::0;::::1;;8754:15;::::0;;;::::1;::::0;::::1;;:::i;:::-;8771:22;8708:4;:86::i;:::-;8809:12;8804:440;;8837:78;8842:1;:9;;;8853:1;:10;;;8865:1;:15;;;8882:6;:13;;;8897:17;8837:4;:78::i;:::-;8955:11;8933:18;:33;8929:305;;9012:9;9115:35:::0;;;:15:::1;9043:10;9115:35:::0;;;;;;;:42;8986:233:::1;::::0;9012:9;::::1;::::0;9043:10;;::::1;;::::0;9075:18;;9115:42:::1;;9179:22;8986:4;:233::i;:::-;9340:1;:16;;;9316:1;:10;;;9293:1;:9;;;9259:280;9370:1;:15;;;9399:18;9431:1;:15;;;;;;;;;;:::i;:::-;9460:1;:14;;;9488:1;:12;;;;;;;;;;:::i;:::-;9259:280;::::0;;6777:25:28;;;6833:2;6818:18;;6811:34;;;;6893:42;6881:55;;;;6861:18;;;6854:83;6968:2;6953:18;;6946:34;7029:18;7017:31;7011:3;6996:19;;6989:60;7080:3;7065:19;;7058:35;;;9259:280:26;;;;;6764:3:28;9259:280:26;;::::1;6196:3350;;;;;3065:20:14::0;2365:1;1505:66;3972:62;3749:292;3065:20;6074:3472:26;;;:::o;10647:331::-;10829:7;10889:10;10901:7;10910:8;10920:16;10938:9;10955:4;10949:11;;;;;;;;:::i;:::-;10878:83;;;;;;7576:25:28;;;;7617:18;;7610:34;;;;7660:18;;;7653:34;;;;7703:18;;;7696:34;7779:42;7767:55;7746:19;;;7739:84;7872:4;7860:17;7839:19;;;7832:46;7548:19;;10878:83:26;;;;;;;;;;;;10855:116;;;;;;10848:123;;10647:331;;;;;;;:::o;9718:410::-;3023:21:14;:19;:21::i;:::-;9778:8:26::1;::::0;::::1;;;:13:::0;9774:37:::1;;9800:11;;;;;;;;;;;;;;9774:37;9843:9;::::0;;;::::1;;;9825:15;:27;9821:61;;;9861:21;;;;;;;;;;;;;;9821:61;9892:7;:33:::0;;;::::1;::::0;9909:15:::1;9892:33;;;;::::0;;9952:30:::1;::::0;;;;9976:4:::1;9952:30;::::0;::::1;2981:74:28::0;-1:-1:-1;;9952:5:26::1;:15;;::::0;::::1;::::0;2954:18:28;;9952:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;9935:47:::0;-1:-1:-1;9996:11:26;;9992:51:::1;;10009:34;:18;:5;:18;10028:6;10036::::0;10009:18:::1;:34::i;:::-;10113:7;::::0;10058:63:::1;::::0;;8250:25:28;;;10113:7:26;;;::::1;;;8306:2:28::0;8291:18;;8284:59;10097:5:26::1;10058:63;::::0;;::::1;::::0;10081:6:::1;10058:63:::0;;::::1;::::0;::::1;::::0;8223:18:28;10058:63:26::1;;;;;;;;9764:364;3065:20:14::0;2365:1;1505:66;3972:62;3749:292;3065:20;9718:410:26:o;10134:507::-;10210:7;10236:398;1421:180;10369:9;;10400:10;;;;10432:16;;;;10470:15;;;;;;;;:::i;:::-;10507;;;;10544:14;;;;10580:12;;;;;;;;:::i;:::-;10293:317;;;;;;8695:25:28;;;;8736:18;;8729:34;;;;8779:18;;;8772:34;;;;8822:18;;;8815:34;;;;8898:42;8886:55;8865:19;;;8858:84;8958:19;;;8951:35;9002:19;;;8995:35;9079:18;9067:31;9046:19;;;9039:60;8667:19;;10293:317:26;;;;;;;;;;;;10266:358;;;;;;10236:16;:398::i;:::-;10229:405;10134:507;-1:-1:-1;;10134:507:26:o;10984:117::-;11064:30;;;;;11088:4;11064:30;;;2981:74:28;11038:7:26;;11064:5;:15;;;;;2954:18:28;;11064:30:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;11057:37;;10984:117;:::o;5228:557:19:-;5326:13;5353:18;5385:21;5420:15;5449:25;5488:12;5514:27;5617:13;:11;:13::i;:::-;5644:16;:14;:16::i;:::-;5752;;;5736:1;5752:16;;;;;;;;;5566:212;;;;-1:-1:-1;5566:212:19;;-1:-1:-1;5674:13:19;;-1:-1:-1;5709:4:19;;-1:-1:-1;5736:1:19;-1:-1:-1;5752:16:19;-1:-1:-1;5566:212:19;-1:-1:-1;5228:557:19:o;5287:608:26:-;3023:21:14;:19;:21::i;:::-;5339:10:26::1;:20;5353:6;5339:20;;5335:45;;5368:12;;;;;;;;;;;;;;5335:45;5394:8;::::0;::::1;;:13:::0;5390:41:::1;;5416:15;;;;;;;;;;;;;;5390:41;5466:30;::::0;;;;5490:4:::1;5466:30;::::0;::::1;2981:74:28::0;5442:21:26::1;::::0;5466:5:::1;:15;;::::0;::::1;::::0;2954:18:28;;5466:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;5442:54:::0;-1:-1:-1;5506:63:26::1;:22;:5;:22;5529:6;5545:4;5552:16;5506:22;:63::i;:::-;5583:30;::::0;;;;5607:4:::1;5583:30;::::0;::::1;2981:74:28::0;5633:16:26::1;::::0;5616:13;;5583:15:::1;:5;:15;::::0;::::1;::::0;2954:18:28;;5583:30:26::1;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;:46;;;;:::i;:::-;:66;5579:126;;5672:22;;;;;;;;;;;;;;5579:126;5714:8;:34:::0;;;::::1;5732:15;5714:34;;::::0;;::::1;::::0;;;5770:28:::1;::::0;1358:7:::1;::::0;5770:28:::1;:::i;:::-;5758:9;:40:::0;;;;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;::::1;::::0;;;;5813:75:::1;::::0;;5850:16:::1;9826:25:28::0;;5868:8:26;;;;;;;;;;9882:2:28;9867:18;;9860:59;5878:9:26;;::::1;::::0;;::::1;9935:18:28::0;;;9928:59;5842:5:26::1;5813:75;::::0;;::::1;::::0;5826:6:::1;5813:75:::0;;::::1;::::0;::::1;::::0;9814:2:28;9799:18;5813:75:26::1;9628:365:28::0;3749:292:14;3872:25;:23;:25::i;:::-;2407:1;1505:66;3972:62;3749:292::o;2016:485:21:-;2162:4;2182:6;:18;;;2204:1;2182:23;2178:317;;2222:17;2241:22;2269:41;2294:4;2300:9;;2269:24;:41::i;:::-;-1:-1:-1;2221:89:21;;-1:-1:-1;2221:89:21;-1:-1:-1;2338:26:21;2331:3;:33;;;;;;;;:::i;:::-;;:56;;;;;2381:6;2368:19;;:9;:19;;;2331:56;2324:63;;;;;;2178:317;2425:59;2460:6;2468:4;2474:9;;2425:34;:59::i;:::-;2418:66;;2178:317;2016:485;;;;;;:::o;11107:571:26:-;11282:14;11307:17;11299:4;:25;;;;;;;;:::i;:::-;;:70;;1010:6;11299:70;;;1066:6;11299:70;11282:87;;11379:10;11392:62;11401:7;11410:8;11420:16;11438:9;11449:4;11392:8;:62::i;:::-;11468:15;;;;:11;:15;;;;;;11379:75;;-1:-1:-1;11468:15:26;;11464:47;;;11492:19;;;;;;;;;;;;;;11464:47;11521:15;;;;:11;:15;;;;;:22;;;;11539:4;11521:22;;;11553:37;:18;:5;:18;11572:9;11583:6;11553:18;:37::i;:::-;11629:9;11605:66;;11620:7;11616:2;11605:66;11640:16;11658:4;11664:6;11605:66;;;;;;;;:::i;:::-;;;;;;;;11272:406;;11107:571;;;;;:::o;1219:204:10:-;1306:37;1320:5;1327:2;1331:5;1338:4;1306:13;:37::i;:::-;1301:116;;1366:40;;;;;3011:42:28;2999:55;;1366:40:10;;;2981:74:28;2954:18;;1366:40:10;;;;;;;;5017:176:19;5094:7;5120:66;5153:20;:18;:20::i;:::-;5175:10;4093:4:20;4087:11;4123:10;4111:23;;4163:4;4154:14;;4147:39;;;;4215:4;4206:14;;4199:34;4271:4;4256:20;;;3918:374;6105:126:19;6151:13;6183:41;:5;6210:13;6183:26;:41::i;6557:135::-;6606:13;6638:47;:8;6668:16;6638:29;:47::i;1662:232:10:-;1767:47;1785:5;1792:4;1798:2;1802:5;1809:4;1767:17;:47::i;:::-;1762:126;;1837:40;;;;;3011:42:28;2999:55;;1837:40:10;;;2981:74:28;2954:18;;1837:40:10;2821:240:28;1762:126:10;1662:232;;;;:::o;3586:157:14:-;1505:66;4560:52;2407:1;4560:63;3644:93;;3696:30;;;;;;;;;;;;;;3290:882:18;3403:17;;;3490:2;3470:22;;;3466:700;;3817:30;;3904:4;3882:27;;3869:41;3975:4;3953:27;;3940:41;3508:9;3932:50;4016:25;4027:4;3932:50;3817:30;3869:41;4016:10;:25::i;:::-;4009:32;;;;;;;;;;;3466:700;-1:-1:-1;4088:1:18;;-1:-1:-1;4092:35:18;;-1:-1:-1;4137:9:18;3466:700;3290:882;;;;;;;:::o;3900:1042:21:-;4510:4;4504:11;;4094:34;4528:21;;;4578:4;4569:14;;4562:28;;;4619:4;4610:14;;4603:28;;;;4660:4;4651:14;;4644:30;;;4053:11;;4094:34;4155:9;;;;4709:4;4700:14;;4687:54;4826:4;4820;4813;4805:6;4801:17;4796:3;4788:6;4781:5;4770:61;4755:76;;4915:8;4908:4;4902:11;4899:25;4892:4;4874:16;4871:26;4867:58;4858:7;4854:72;4844:82;;;4207:729;;3900:1042;;;;;;:::o;8373:1244:10:-;8600:4;8594:11;8509:24;8467:12;8618:22;;;8674:15;8666:24;;8660:4;8653:38;8711:4;8704:19;;;8467:12;8787:4;8467:12;8775:4;8467:12;;8759:5;8752;8747:45;8736:56;;9004:1;8997:4;8991:11;8988:18;8979:7;8975:32;8965:606;;9136:6;9126:7;9119:15;9115:28;9112:165;;;9192:16;9186:4;9181:3;9166:43;9242:16;9237:3;9230:29;9112:165;9553:1;9545:5;9533:18;9530:25;9511:16;9504:24;9500:56;9491:7;9487:70;9476:81;;8965:606;9591:4;9584:17;-1:-1:-1;8373:1244:10;;-1:-1:-1;;;;8373:1244:10:o;3945:262:19:-;3998:7;4029:4;4021:28;4038:11;4021:28;;:63;;;;;4070:14;4053:13;:31;4021:63;4017:184;;;-1:-1:-1;4107:22:19;;3945:262::o;4017:184::-;4167:23;4304:80;;;2079:95;4304:80;;;11649:25:28;4326:11:19;11690:18:28;;;11683:34;;;;4339:14:19;11733:18:28;;;11726:34;4355:13:19;11776:18:28;;;11769:34;4378:4:19;11819:19:28;;;11812:84;4268:7:19;;11621:19:28;;4304:80:19;;;;;;;;;;;;4294:91;;;;;;4287:98;;4213:179;;3376:267:15;3470:13;1390:66;3499:46;;3495:142;;3568:15;3577:5;3568:8;:15::i;:::-;3561:22;;;;3495:142;3621:5;3614:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;3376:267;;;;:::o;10165:1393:10:-;10460:4;10454:11;10365:28;10323:12;10478:22;;;10536:15;10526:26;;;10520:4;10513:40;10579:24;;10573:4;10566:38;10624:4;10617:19;;;10323:12;10700:4;10323:12;10688:4;10323:12;;10672:5;10665;10660:45;10649:56;;10917:1;10910:4;10904:11;10901:18;10892:7;10888:32;10878:606;;11049:6;11039:7;11032:15;11028:28;11025:165;;;11105:16;11099:4;11094:3;11079:43;11155:16;11150:3;11143:29;11025:165;11466:1;11458:5;11446:18;11443:25;11424:16;11417:24;11413:56;11404:7;11400:70;11389:81;;10878:606;11504:4;11497:17;-1:-1:-1;11540:1:10;11534:4;11527:15;10165:1393;;-1:-1:-1;;;;;10165:1393:10:o;7129:1551:18:-;7255:17;;;8209:66;8196:79;;8192:164;;;-1:-1:-1;8307:1:18;;-1:-1:-1;8311:30:18;;-1:-1:-1;8343:1:18;8291:54;;8192:164;8467:24;;;8450:14;8467:24;;;;;;;;;11214:25:28;;;11287:4;11275:17;;11255:18;;;11248:45;;;;11309:18;;;11302:34;;;11352:18;;;11345:34;;;8467:24:18;;11186:19:28;;8467:24:18;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;8467:24:18;;;;;;-1:-1:-1;;8505:20:18;;;8501:113;;-1:-1:-1;8557:1:18;;-1:-1:-1;8561:29:18;;-1:-1:-1;8557:1:18;;-1:-1:-1;8541:62:18;;8501:113;8632:6;-1:-1:-1;8640:20:18;;-1:-1:-1;8640:20:18;;-1:-1:-1;7129:1551:18;;;;;;;;;:::o;2080:380:15:-;2139:13;2164:11;2178:16;2189:4;2178:10;:16::i;:::-;2302;;;2313:4;2302:16;;;;;;;;;2164:30;;-1:-1:-1;2282:17:15;;2302:16;;;;;;;;;-1:-1:-1;;;2367:16:15;;;-1:-1:-1;2412:4:15;2403:14;;2396:28;;;;-1:-1:-1;2367:16:15;2080:380::o;2532:247::-;2593:7;2665:4;2629:40;;2692:4;2683:13;;2679:71;;;2719:20;;;;;;;;;;;;;;14:162:28;80:5;125:3;116:6;111:3;107:16;103:26;100:46;;;142:1;139;132:12;100:46;-1:-1:-1;164:6:28;14:162;-1:-1:-1;14:162:28:o;181:730::-;293:6;301;309;362:3;350:9;341:7;337:23;333:33;330:53;;;379:1;376;369:12;330:53;402:60;454:7;443:9;402:60;:::i;:::-;392:70;;513:3;502:9;498:19;485:33;541:18;533:6;530:30;527:50;;;573:1;570;563:12;527:50;596:22;;649:4;641:13;;637:27;-1:-1:-1;627:55:28;;678:1;675;668:12;627:55;718:2;705:16;744:18;736:6;733:30;730:50;;;776:1;773;766:12;730:50;823:7;816:4;807:6;803:2;799:15;795:26;792:39;789:59;;;844:1;841;834:12;789:59;181:730;;875:4;867:13;;;;;-1:-1:-1;899:6:28;;-1:-1:-1;;;181:730:28:o;916:196::-;984:20;;1044:42;1033:54;;1023:65;;1013:93;;1102:1;1099;1092:12;1013:93;916:196;;;:::o;1117:707::-;1227:6;1235;1243;1251;1259;1312:3;1300:9;1291:7;1287:23;1283:33;1280:53;;;1329:1;1326;1319:12;1280:53;1374:23;;;-1:-1:-1;1494:2:28;1479:18;;1466:32;;-1:-1:-1;1597:2:28;1582:18;;1569:32;;-1:-1:-1;1646:38:28;1680:2;1665:18;;1646:38;:::i;:::-;1636:48;;1736:3;1725:9;1721:19;1708:33;1772:1;1763:7;1760:14;1750:42;;1788:1;1785;1778:12;1750:42;1811:7;1801:17;;;1117:707;;;;;;;;:::o;2398:226::-;2457:6;2510:2;2498:9;2489:7;2485:23;2481:32;2478:52;;;2526:1;2523;2516:12;2478:52;-1:-1:-1;2571:23:28;;2398:226;-1:-1:-1;2398:226:28:o;3066:251::-;3158:6;3211:3;3199:9;3190:7;3186:23;3182:33;3179:53;;;3228:1;3225;3218:12;3179:53;3251:60;3303:7;3292:9;3251:60;:::i;:::-;3241:70;3066:251;-1:-1:-1;;;3066:251:28:o;4021:348::-;4063:3;4101:5;4095:12;4128:6;4123:3;4116:19;4184:6;4177:4;4170:5;4166:16;4159:4;4154:3;4150:14;4144:47;4236:1;4229:4;4220:6;4215:3;4211:16;4207:27;4200:38;4358:4;4288:66;4283:2;4275:6;4271:15;4267:88;4262:3;4258:98;4254:109;4247:116;;;4021:348;;;;:::o;4374:1314::-;4771:66;4763:6;4759:79;4748:9;4741:98;4875:3;4870:2;4859:9;4855:18;4848:31;4722:4;4902:46;4943:3;4932:9;4928:19;4920:6;4902:46;:::i;:::-;4996:9;4988:6;4984:22;4979:2;4968:9;4964:18;4957:50;5030:33;5056:6;5048;5030:33;:::i;:::-;5094:2;5079:18;;5072:34;;;5155:42;5143:55;;5137:3;5122:19;;5115:84;5230:3;5215:19;;5208:35;;;5280:22;;;5274:3;5259:19;;5252:51;5352:13;;5374:22;;;5424:2;5450:15;;;;-1:-1:-1;5412:15:28;;;;-1:-1:-1;5493:169:28;5507:6;5504:1;5501:13;5493:169;;;5568:13;;5556:26;;5611:2;5637:15;;;;5602:12;;;;5529:1;5522:9;5493:169;;;-1:-1:-1;5679:3:28;;4374:1314;-1:-1:-1;;;;;;;;;;;4374:1314:28:o;5693:186::-;5752:6;5805:2;5793:9;5784:7;5780:23;5776:32;5773:52;;;5821:1;5818;5811:12;5773:52;5844:29;5863:9;5844:29;:::i;5884:284::-;5942:6;5995:2;5983:9;5974:7;5970:23;5966:32;5963:52;;;6011:1;6008;6001:12;5963:52;6050:9;6037:23;6100:18;6093:5;6089:30;6082:5;6079:41;6069:69;;6134:1;6131;6124:12;6173:184;6225:77;6222:1;6215:88;6322:4;6319:1;6312:15;6346:4;6343:1;6336:15;6362:125;6427:9;;;6448:10;;;6445:36;;;6461:18;;:::i;7104:184::-;7156:77;7153:1;7146:88;7253:4;7250:1;7243:15;7277:4;7274:1;7267:15;7889:184;7959:6;8012:2;8000:9;7991:7;7987:23;7983:32;7980:52;;;8028:1;8025;8018:12;7980:52;-1:-1:-1;8051:16:28;;7889:184;-1:-1:-1;7889:184:28:o;9299:128::-;9366:9;;;9387:11;;;9384:37;;;9401:18;;:::i;9432:191::-;9535:18;9500:26;;;9528;;;9496:59;;9567:27;;9564:53;;;9597:18;;:::i;9998:542::-;10213:25;;;10201:2;10186:18;;10268:1;10257:13;;10247:201;;10304:77;10301:1;10294:88;10405:4;10402:1;10395:15;10433:4;10430:1;10423:15;10247:201;10479:2;10464:18;;10457:34;;;;10522:2;10507:18;10500:34;9998:542;;-1:-1:-1;9998:542:28:o;10545:437::-;10624:1;10620:12;;;;10667;;;10688:61;;10742:4;10734:6;10730:17;10720:27;;10688:61;10795:2;10787:6;10784:14;10764:18;10761:38;10758:218;;10832:77;10829:1;10822:88;10933:4;10930:1;10923:15;10961:4;10958:1;10951:15","linkReferences":{},"immutableReferences":{"4682":[{"start":7940,"length":32}],"4684":[{"start":7898,"length":32}],"4686":[{"start":7856,"length":32}],"4688":[{"start":8021,"length":32}],"4690":[{"start":8061,"length":32}],"4693":[{"start":7242,"length":32}],"4696":[{"start":7286,"length":32}],"9064":[{"start":672,"length":32},{"start":4470,"length":32},{"start":4630,"length":32},{"start":4749,"length":32},{"start":5193,"length":32},{"start":5653,"length":32},{"start":5807,"length":32},{"start":6014,"length":32},{"start":6389,"length":32},{"start":6936,"length":32}],"9066":[{"start":1042,"length":32},{"start":4664,"length":32},{"start":4807,"length":32},{"start":5450,"length":32},{"start":5841,"length":32},{"start":6447,"length":32}],"9068":[{"start":1003,"length":32},{"start":2724,"length":32}],"9070":[{"start":1140,"length":32},{"start":4037,"length":32}],"9072":[{"start":748,"length":32},{"start":1971,"length":32},{"start":2585,"length":32},{"start":2849,"length":32},{"start":3709,"length":32}],"9074":[{"start":806,"length":32},{"start":3053,"length":32},{"start":5875,"length":32},{"start":5957,"length":32},{"start":6329,"length":32}]}}}}}}},"signatures":{"function":[{"signature":"asset()","signatureHash4":"0x38d52e0f","signatureHash32":"0x38d52e0f1dbe7a70d1f1bbce52487d111fd5a226368cd8ae0e1fc641c0299139"},{"signature":"budgetMicrounits()","signatureHash4":"0x46234dde","signatureHash32":"0x46234ddebe8a5ba7c83ad747c01ef4209b993210fc1f3f325ba4a67b6f501203"},{"signature":"CAMPAIGN_DURATION()","signatureHash4":"0x08fd4cfa","signatureHash32":"0x08fd4cfaab54c1873ace5ed12611e4ae513be22bde8edcd510a9806a146630d5"},{"signature":"campaignId()","signatureHash4":"0x8ed5b0fc","signatureHash32":"0x8ed5b0fccff0c0bedc857ddf9a9ffc008e72c790ccdf226173ea1d7f009a121d"},{"signature":"claimQualification((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64),bytes)","signatureHash4":"0x0652ff8c","signatureHash32":"0x0652ff8c11e55cc7e9f6aaf09a9a1d6395feb7866ba4e2c3c204e966066494c8"},{"signature":"DIRECT_MICROUNITS()","signatureHash4":"0x2825378b","signatureHash32":"0x2825378bb5cb6e0638405a76af9556ea05816f24b2b83a35c15abd1ca58c7d66"},{"signature":"eip712Domain()","signatureHash4":"0x84b0196e","signatureHash32":"0x84b0196e4b78e1918928c3b71e1f57a2bfc6d4a368fe07990ccc1367172719fb"},{"signature":"expiresAt()","signatureHash4":"0x8622a689","signatureHash32":"0x8622a689dab7ad858cc66ae07aebfb455f29d07100f3c6ead5f5cdf3a77e5546"},{"signature":"fund()","signatureHash4":"0xb60d4288","signatureHash32":"0xb60d428855c1736d47572c3571eaba773815dc83325838977c147e0884595388"},{"signature":"fundedAt()","signatureHash4":"0xa9a748ff","signatureHash32":"0xa9a748fffcef5eaeeb632341db3fbeaf4291b8bc76c1528fb83846c181bdd929"},{"signature":"GRANDPARENT_MICROUNITS()","signatureHash4":"0xc4236581","signatureHash32":"0xc4236581c1e25165064f8adfedd626075a9983c1fbd82ec4fed6b3cbc67ed8e9"},{"signature":"judge()","signatureHash4":"0x573255f4","signatureHash32":"0x573255f4cd784a1ee2c54835744c9978553f7e106f9c459405127adb8a2c6a18"},{"signature":"MAX_BUDGET_MICROUNITS()","signatureHash4":"0xd2c76394","signatureHash32":"0xd2c763941fce75c7ae17c60360720280b23ddbe432f4bee75f527b4cc54d57c3"},{"signature":"MAX_EVENT_MICROUNITS()","signatureHash4":"0x245aff71","signatureHash32":"0x245aff710961ee208501becc71732570c403b377c6a01cb036423acdd639373a"},{"signature":"MAX_QUALIFICATIONS()","signatureHash4":"0x132271dc","signatureHash32":"0x132271dc1508e184b69cad6a0b066d9fe85161c21a3fc70b3e9bf1b0d7744236"},{"signature":"paidMicrounits()","signatureHash4":"0x1da16ecb","signatureHash32":"0x1da16ecb316eb6539263476b0566fab41b1f76a256ad88806c83d2a29d6b1e28"},{"signature":"paidRewards(bytes32)","signatureHash4":"0x2cd446b5","signatureHash32":"0x2cd446b54f84171f0c745ec1013ca0a99c96852fbc5204cd83fd0a63b3567396"},{"signature":"PARTICIPANT_MICROUNITS()","signatureHash4":"0xe7f6f900","signatureHash32":"0xe7f6f9006ed3ac4e5f60a372342f3e7606e28024fadcb06d2a9631ae5ccf29ed"},{"signature":"payoutAgentIds(address)","signatureHash4":"0xe592f6ac","signatureHash32":"0xe592f6ac4092cdb3c912e182f75e43a1bbe037cf10666a8e3933e2573eeee92f"},{"signature":"qualificationCount()","signatureHash4":"0xe9301217","signatureHash32":"0xe930121752ee65aea3be09ad44c96034117c1e93839ba2f5d02c982f6219261a"},{"signature":"qualificationDigest((bytes32,bytes32,bytes32,address,bytes32,bytes32,uint64))","signatureHash4":"0x436969ad","signatureHash32":"0x436969adb15c5e9baf299014f9f10585f66e73d8d783faf8b5d03aae1e15aea1"},{"signature":"QUALIFICATION_TYPEHASH()","signatureHash4":"0xc77bc2e3","signatureHash32":"0xc77bc2e3ac1bb0301a6bff76bf54c58f146db2989089344f4c0963880b2f0f51"},{"signature":"qualifiedAgents(bytes32)","signatureHash4":"0x52b45d30","signatureHash32":"0x52b45d30ba34632de9da8a270e4ae4e948e18bd866edd53c937d02740773a80e"},{"signature":"remainingMicrounits()","signatureHash4":"0x4a5d10b9","signatureHash32":"0x4a5d10b93bf4542d14cc5d75bcbbb98754d366d122356bff4574f9172f3dfb27"},{"signature":"rewardId(bytes32,bytes32,bytes32,address,uint8)","signatureHash4":"0x083f20ea","signatureHash32":"0x083f20ea68c65d6cbffee364abec808c0bd2d8be20556a99a1161af08d6aa847"},{"signature":"rootAgentId()","signatureHash4":"0x3d56d67b","signatureHash32":"0x3d56d67b7b9a254a0e44687a1af6bb8db2c86629dba6c2c19540d6acb6e55027"},{"signature":"source()","signatureHash4":"0x67e828bf","signatureHash32":"0x67e828bf82b9da49075c7c8309c7442ae17643199438b933dc78fb919720c861"},{"signature":"sweepExpired()","signatureHash4":"0x2ad2ea81","signatureHash32":"0x2ad2ea815fa418ff39fd058371c6eeb904ac5ffcac756742231b2df413ac0267"},{"signature":"sweptAt()","signatureHash4":"0xd887f2f5","signatureHash32":"0xd887f2f5316d98d79e3eb7cf9b2ecfa5fe0dc276f959da9cd8a1b1042ce51b88"},{"signature":"usedEvents(bytes32)","signatureHash4":"0xfecaf8e8","signatureHash32":"0xfecaf8e85022a4c0de052cb96fde4c019c2b19c0056e4809ca7f3ed8d61b986f"},{"signature":"usedReviews(bytes32)","signatureHash4":"0xa81d79fc","signatureHash32":"0xa81d79fc9e2892283e954f59613ae4d24c53aa72c833703c4a14382c769cb008"}],"event":[{"signature":"EIP712DomainChanged()","signatureHash4":"0x0a6387c9","signatureHash32":"0x0a6387c9ea3628b88a633bb4f3b151770f70085117a15f9bf3787cda53f13d31"},{"signature":"EscrowFunded(address,address,uint256,uint64,uint64)","signatureHash4":"0xde60b7be","signatureHash32":"0xde60b7beae1a5cd2ede9530a3d822923389ebcd8487a154504f5601a8d974b76"},{"signature":"ExpiredBalanceReturned(address,address,uint256,uint64)","signatureHash4":"0xd294ce8c","signatureHash32":"0xd294ce8ce6bb625c7988680ca4cf5843bfea218682cf7edcb685c4e426628018"},{"signature":"QualificationClaimed(bytes32,bytes32,bytes32,bytes32,bytes32,address,bytes32,uint64,uint256)","signatureHash4":"0xd20bbbe0","signatureHash32":"0xd20bbbe0c47281ced3771c0e06898b3c79a8196c623301438e657401cdfcc7d6"},{"signature":"RewardPaid(bytes32,bytes32,address,bytes32,uint8,uint256)","signatureHash4":"0xc8913810","signatureHash32":"0xc8913810ba6c9b173e78b8cb8706a1fe9017ec8bd9ffba0f7775d8d7bc8b82b4"}],"error":[{"signature":"AgentAlreadyQualified()","signatureHash4":"0x68b06ce5","signatureHash32":"0x68b06ce5c9c9a2060d609fcfb4941d6728246653f9e67781f3963fde6d882069"},{"signature":"AlreadyFunded()","signatureHash4":"0x5adf6387","signatureHash32":"0x5adf6387ec5c920e4de823637bfd3dd3984adcb91b8e09c0270a8b0fa160418d"},{"signature":"BudgetExceeded()","signatureHash4":"0x50b2c4e1","signatureHash32":"0x50b2c4e1cb04adfc21d8eccf66275133f1d9b0102c40d58ef044bab627ac8c70"},{"signature":"CampaignExpired()","signatureHash4":"0x8320b483","signatureHash32":"0x8320b4834614afaa76e7b1030e11616fec2f0c997e75dccfbe5db95e284ff093"},{"signature":"CampaignStillActive()","signatureHash4":"0x9cb6acb6","signatureHash32":"0x9cb6acb639eea133a402f09ebc4632327c206f552fe6b7b9abcbb456f51c1fe5"},{"signature":"EventAlreadyUsed()","signatureHash4":"0x865d5ca8","signatureHash32":"0x865d5ca8519af142c471badc3a0cd4b884d53529a534959780007235c23eb6f3"},{"signature":"InvalidApprovalTime()","signatureHash4":"0xf2aa4c89","signatureHash32":"0xf2aa4c89d905a57634e50fc1a3945df6560f95c2ca0c0d1b71cf47c1044bedb6"},{"signature":"InvalidBudget()","signatureHash4":"0x1d5eff24","signatureHash32":"0x1d5eff24f8cdfafeecea914e585fe29401c0b6b055e43488b5f41f1863e5f919"},{"signature":"InvalidFundingAmount()","signatureHash4":"0xbb21bfd4","signatureHash32":"0xbb21bfd48be507f19c9b89c99bac89d10b2771973c83f084a14c6ce0ecab7d8a"},{"signature":"InvalidJudgeSignature()","signatureHash4":"0x14aff844","signatureHash32":"0x14aff84442ce8f2fe1d11a0d96794c419c0be8f0a21a42abcbe5a39b4aae3f7d"},{"signature":"InvalidShortString()","signatureHash4":"0xb3512b0c","signatureHash32":"0xb3512b0c6163e5f0bafab72bb631b9d58cd7a731b082f910338aa21c83d5c274"},{"signature":"NotFunded()","signatureHash4":"0xd5ef09ba","signatureHash32":"0xd5ef09ba23600adfb1dfea21179026e470e879ff3f11352d78b4ab95489db294"},{"signature":"OnlySource()","signatureHash4":"0x46806c85","signatureHash32":"0x46806c858f17abe24915c386c34f386565a3255ff10f1fe4c513d5c8ea91f8e1"},{"signature":"PayoutAlreadyUsed()","signatureHash4":"0x45d77fc0","signatureHash32":"0x45d77fc06d58ef5160b583ec3c1a7a071abf4e722018f87ee0c8e3fa9dff25b9"},{"signature":"QualificationLimitReached()","signatureHash4":"0x2edc1960","signatureHash32":"0x2edc196022b93b7a73c9bf7aecbba45b9e7747584ef5e840977e6b56401cad33"},{"signature":"ReentrancyGuardReentrantCall()","signatureHash4":"0x3ee5aeb5","signatureHash32":"0x3ee5aeb571de7fc460830b4d0017439a1ca56fb0bc39062227ade4fe4a24c1ca"},{"signature":"ReviewAlreadyUsed()","signatureHash4":"0x5ca748ab","signatureHash32":"0x5ca748abcd83134790208e96ca690d000065548c25e2ff1ed4136d7ff8e1b8de"},{"signature":"RewardAlreadyPaid()","signatureHash4":"0x16600c28","signatureHash32":"0x16600c288d78f96fa5fb9ecda6531219c2969e331e36b1d6121cb64a6e5fc355"},{"signature":"RootCannotQualify()","signatureHash4":"0x4d0fa8b9","signatureHash32":"0x4d0fa8b9c6f422dcac00ecd062e6a8a8a30599f1160c18ca041c699c079667a1"},{"signature":"SafeERC20FailedOperation(address)","signatureHash4":"0x5274afe7","signatureHash32":"0x5274afe73c98b4749fc91ffae6b7b574e7842cb2144a159e9377a5f20b32edf9"},{"signature":"SelfParent()","signatureHash4":"0x7a812dca","signatureHash32":"0x7a812dca2640d8b61b500cc4d95aeb4be492c3a76b57410838fedc0c6e7c0b69"},{"signature":"StringTooLong(string)","signatureHash4":"0x305a27a9","signatureHash32":"0x305a27a93f8e33b7392df0a0f91d6fc63847395853c45991eec52dbf24d72381"},{"signature":"UnknownParent()","signatureHash4":"0xad5ad4f5","signatureHash32":"0xad5ad4f54f86a5068fa8cd6a93ed3dd7e43a0551428633eb7ed8b3969e51dc98"},{"signature":"ZeroAddress()","signatureHash4":"0xd92e233d","signatureHash32":"0xd92e233df2717d4a40030e20904abd27b68fcbeede117eaaccbbdac9618c8c73"},{"signature":"ZeroIdentifier()","signatureHash4":"0xe334302b","signatureHash32":"0xe334302b2380e515cb03f20d1ee21fb6f984e8afe672828ed3397b87a41f8bda"}]},"proxyResolution":{"isProxy":false,"proxyType":null,"implementations":[]},"match":"exact_match","chainId":"8453","address":"0x75b282eF9af829A0BB4bd937Eb82Ab8c02D636Ef"}