{"matchId":"55896583","creationMatch":"match","runtimeMatch":"match","verifiedAt":"2026-10-10T22:03:23Z","creationBytecode":{"onchainBytecode":"0x61016060405260068054600160a01b600160e01b031916610c3560a61b17905534801561002a575f80fd5b5060405161212538038061212583398101604081905261004991610350565b60408051808201825260118152704964656e746974794d4420496e74616b6560781b602080830191909152825180840190935260018352603160f81b9083015290856001600160a01b0381166100b957604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b6100c28161028d565b506100cc826102a9565b610120526100d9816102a9565b61014052815160208084019190912060e052815190820120610100524660a05261016560e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c0526001600160a01b038316158061018b57506001600160a01b038216155b8061019d57506001600160a01b038116155b156101bb5760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b038086166001600160a01b031992831681179093556005805486831690841617905560068054918516919092161790556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a26040516001600160a01b038316907f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a26040516001600160a01b038216907f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a2505050506103fc565b600180546001600160a01b03191690556102a6816102e6565b50565b5f80829050601f815111156102d3578260405163305a27a960e01b81526004016100b091906103a1565b80516102de826103d6565b179392505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b038116811461034b575f80fd5b919050565b5f805f8060808587031215610363575f80fd5b61036c85610335565b935061037a60208601610335565b925061038860408601610335565b915061039660608601610335565b905092959194509250565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b805160208083015191908110156103f6575f198160200360031b1b821691505b50919050565b60805160a05160c05160e051610100516101205161014051611cd861044d5f395f61128201525f61125201525f61152a01525f61150201525f61145d01525f61148701525f6114b10152611cd85ff3fe608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b905090565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161480156114a957507f000000000000000000000000000000000000000000000000000000000000000046145b156114d357507f000000000000000000000000000000000000000000000000000000000000000090565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a000000000000000000000000047f606fd5b2baa5f5c6c4ab8958e45cb6b054b70000000000000000000000004e0fa57bde726079356537e2f34d671e9f41adbc0000000000000000000000003d3c0df7c1a17d384545e9d7c8228897bd9625cb000000000000000000000000169b08ea234d7819eeabb246e34d8cd81e32279f","recompiledBytecode":"0x61016060405260068054600160a01b600160e01b031916610c3560a61b17905534801561002a575f80fd5b5060405161212538038061212583398101604081905261004991610350565b60408051808201825260118152704964656e746974794d4420496e74616b6560781b602080830191909152825180840190935260018352603160f81b9083015290856001600160a01b0381166100b957604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b6100c28161028d565b506100cc826102a9565b610120526100d9816102a9565b61014052815160208084019190912060e052815190820120610100524660a05261016560e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c0526001600160a01b038316158061018b57506001600160a01b038216155b8061019d57506001600160a01b038116155b156101bb5760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b038086166001600160a01b031992831681179093556005805486831690841617905560068054918516919092161790556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a26040516001600160a01b038316907f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a26040516001600160a01b038216907f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a2505050506103fc565b600180546001600160a01b03191690556102a6816102e6565b50565b5f80829050601f815111156102d3578260405163305a27a960e01b81526004016100b091906103a1565b80516102de826103d6565b179392505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b038116811461034b575f80fd5b919050565b5f805f8060808587031215610363575f80fd5b61036c85610335565b935061037a60208601610335565b925061038860408601610335565b915061039660608601610335565b905092959194509250565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b805160208083015191908110156103f6575f198160200360031b1b821691505b50919050565b60805160a05160c05160e051610100516101205161014051611cd861044d5f395f61128201525f61125201525f61152a01525f61150201525f61145d01525f61148701525f6114b10152611cd85ff3fe608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b905090565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161480156114a957507f000000000000000000000000000000000000000000000000000000000000000046145b156114d357507f000000000000000000000000000000000000000000000000000000000000000090565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a","sourceMap":"3533:12959:26:-:0;;;6370:35;;;-1:-1:-1;;;;;;;;6370:35:26;-1:-1:-1;;;6370:35:26;;;7052:433;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;4053:378:19;;;;;;;;;;;-1:-1:-1;;;4053:378:19;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;4053:378:19;;;;;7146:6:26;-1:-1:-1;;;;;1273:26:0;;1269:95;;1322:31;;-1:-1:-1;;;1322:31:0;;1350:1;1322:31;;;811:51:27;784:18;;1322:31:0;;;;;;;;1269:95;1373:32;1392:12;1373:18;:32::i;:::-;-1:-1:-1;4126:20:19;:4;:18;:20::i;:::-;4118:28;;4167:23;:7;:21;:23::i;:::-;4156:34;;4214:22;;;;;;;;;;4200:36;;4263:25;;;;;;4246:42;;4316:13;4299:30;;4364:23;4898:11;;4911:14;;4876:80;;;2424:95;4876:80;;;1857:25:27;1898:18;;;1891:34;;;;1941:18;;;1934:34;4927:13:19;1984:18:27;;;1977:34;4950:4:19;2027:19:27;;;2020:61;4840:7:19;;1829:19:27;;4876:80:19;;;;;;;;;;;;4866:91;;;;;;4859:98;;4785:179;;4364:23;4339:48;;-1:-1:-1;;4419:4:19;4397:27;;-1:-1:-1;;;;;7213:20:26;::::2;::::0;;:45:::2;;-1:-1:-1::0;;;;;;7237:21:26;::::2;::::0;7213:45:::2;:70;;;-1:-1:-1::0;;;;;;7262:21:26;::::2;::::0;7213:70:::2;7209:96;;;7292:13;;-1:-1:-1::0;;;7292:13:26::2;;;;;;;;;;;7209:96;7315:5;:14:::0;;-1:-1:-1;;;;;7315:14:26;;::::2;-1:-1:-1::0;;;;;;7315:14:26;;::::2;::::0;::::2;::::0;;;7339:6:::2;:16:::0;;;;::::2;::::0;;::::2;;::::0;;7365:6:::2;:16:::0;;;;::::2;::::0;;;::::2;;::::0;;7396::::2;::::0;::::2;::::0;7315:5:::2;::::0;7396:16:::2;7427:18;::::0;-1:-1:-1;;;;;7427:18:26;::::2;::::0;::::2;::::0;;;::::2;7460;::::0;-1:-1:-1;;;;;7460:18:26;::::2;::::0;::::2;::::0;;;::::2;7052:433:::0;;;;3533:12959;;2011:153:1;2100:13;2093:20;;-1:-1:-1;;;;;;2093:20:1;;;2123:34;2148:8;2123:24;:34::i;:::-;2011:153;:::o;1708:288:15:-;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;2912:187:0:-;2985:16;3004:6;;-1:-1:-1;;;;;3020:17:0;;;-1:-1:-1;;;;;;3020:17:0;;;;;;3052:40;;3004:6;;;;;;;3052:40;;2985:16;3052:40;2975:124;2912:187;:::o;14:177:27:-;93:13;;-1:-1:-1;;;;;135:31:27;;125:42;;115:70;;181:1;178;171:12;115:70;14:177;;;:::o;196:464::-;293:6;301;309;317;370:3;358:9;349:7;345:23;341:33;338:53;;;387:1;384;377:12;338:53;410:40;440:9;410:40;:::i;:::-;400:50;;469:49;514:2;503:9;499:18;469:49;:::i;:::-;459:59;;537:49;582:2;571:9;567:18;537:49;:::i;:::-;527:59;;605:49;650:2;639:9;635:18;605:49;:::i;:::-;595:59;;196:464;;;;;;;:::o;873:418::-;1022:2;1011:9;1004:21;985:4;1054:6;1048:13;1097:6;1092:2;1081:9;1077:18;1070:34;1156:6;1151:2;1143:6;1139:15;1134:2;1123:9;1119:18;1113:50;1212:1;1207:2;1198:6;1187:9;1183:22;1179:31;1172:42;1282:2;1275;1271:7;1266:2;1258:6;1254:15;1250:29;1239:9;1235:45;1231:54;1223:62;;;873:418;;;;:::o;1296:297::-;1414:12;;1461:4;1450:16;;;1444:23;;1414:12;1479:16;;1476:111;;;1573:1;1569:6;1559;1553:4;1549:17;1546:1;1542:25;1538:38;1531:5;1527:50;1518:59;;1476:111;;1296:297;;;:::o;1598:489::-;3533:12959:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa164736f6c634300081a000a","offset":8473}},"transformations":[{"type":"insert","offset":8485,"reason":"constructorArguments"}],"transformationValues":{"constructorArguments":"0x000000000000000000000000047f606fd5b2baa5f5c6c4ab8958e45cb6b054b70000000000000000000000004e0fa57bde726079356537e2f34d671e9f41adbc0000000000000000000000003d3c0df7c1a17d384545e9d7c8228897bd9625cb000000000000000000000000169b08ea234d7819eeabb246e34d8cd81e32279f"}},"runtimeBytecode":{"onchainBytecode":"0x608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f4964656e746974794d4420496e74616b65000000000000000000000000000011611414565b905090565b60606112767f3100000000000000000000000000000000000000000000000000000000000001611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f000000000000000000000000a43e6f75ee006411f79ac1c84120606c2330de82161480156114a957507f000000000000000000000000000000000000000000000000000000000000000146145b156114d357507f4282d5c610c44a05224d89ba5fae1c9b69e40213f81f44a4cfc22560fa95191590565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527fe527e4dd475ca06f05a10d1850a39dcf959ba8ce26ea6efe8d955e2bc54ff967918101919091527fc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc660608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a","recompiledBytecode":"0x608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b905090565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161480156114a957507f000000000000000000000000000000000000000000000000000000000000000046145b156114d357507f000000000000000000000000000000000000000000000000000000000000000090565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a","sourceMap":"3533:12959:26:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6886:70;;;;;;;;;;-1:-1:-1;6886:70:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;407:33:27;;;389:52;;377:2;362:18;6886:70:26;;;;;;;;12418:2446;;;;;;;;;;-1:-1:-1;12418:2446:26;;;;;:::i;:::-;;:::i;:::-;;6250:21;;;;;;;;;;-1:-1:-1;6250:21:26;;;;-1:-1:-1;;;;;6250:21:26;;;;;;-1:-1:-1;;;;;2090:32:27;;;2072:51;;2060:2;2045:18;6250:21:26;1926:203:27;3985:47:26;;;;;;;;;;;;4026:6;3985:47;;;;;2280:25:27;;;2268:2;2253:18;3985:47:26;2134:177:27;8104:273:26;;;;;;:::i;:::-;;:::i;15246:158::-;;;;;;;;;;-1:-1:-1;15246:158:26;;;;;:::i;:::-;;:::i;6142:21::-;;;;;;;;;;-1:-1:-1;6142:21:26;;;;-1:-1:-1;;;;;6142:21:26;;;6550:82;;;;;;;;;;-1:-1:-1;6550:82:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;15085:155;;;;;;;;;;-1:-1:-1;15085:155:26;;;;;:::i;:::-;;:::i;15410:158::-;;;;;;;;;;-1:-1:-1;15410:158:26;;;;;:::i;:::-;;:::i;2293:101:0:-;;;;;;;;;;;;;:::i;2244:229:1:-;;;;;;;;;;;;;:::i;10400:661:26:-;;;;;;:::i;:::-;;:::i;5800:557:19:-;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;:::i;1638:85:0:-;;;;;;;;;;-1:-1:-1;1684:7:0;1710:6;-1:-1:-1;;;;;1710:6:0;1638:85;;15574:123:26;;;;;;;;;;-1:-1:-1;15574:123:26;;;;;:::i;:::-;;:::i;8758:432::-;;;;;;:::i;:::-;;:::i;6638:53::-;;;;;;;;;;-1:-1:-1;6638:53:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;6638:53:26;;;;;;;-1:-1:-1;;;6638:53:26;;;;;-1:-1:-1;;;6638:53:26;;;;;;;;;;-1:-1:-1;;;;;8232:32:27;;;8214:51;;8301:32;;;;8296:2;8281:18;;8274:60;-1:-1:-1;;;;;;8370:33:27;;;8350:18;;;8343:61;;;;8447:14;8440:22;8435:2;8420:18;;8413:50;8201:3;8186:19;6638:53:26;7991:478:27;6370:35:26;;;;;;;;;;-1:-1:-1;6370:35:26;;;;-1:-1:-1;;;6370:35:26;;-1:-1:-1;;;;;6370:35:26;;;;;;-1:-1:-1;;;;;8636:31:27;;;8618:50;;8606:2;8591:18;6370:35:26;8474:200:27;7025:20:26;;;;;;;;;;;;;;;;6049;;;;;;;;;;-1:-1:-1;6049:20:26;;;;-1:-1:-1;;;;;6049:20:26;;;14901:178;;;;;;;;;;-1:-1:-1;14901:178:26;;;;;:::i;:::-;;:::i;1232:99:1:-;;;;;;;;;;-1:-1:-1;1311:13:1;;-1:-1:-1;;;;;1311:13:1;1232:99;;1649:178;;;;;;;;;;-1:-1:-1;1649:178:1;;;;;:::i;:::-;;:::i;4223:132:26:-;;;;;;;;;;;;4272:83;4223:132;;11169:235;;;;;;;;;;-1:-1:-1;11169:235:26;;;;;:::i;:::-;;:::i;6962:57::-;;;;;;;;;;-1:-1:-1;6962:57:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;9767:14:27;;9760:22;9742:41;;9730:2;9715:18;6962:57:26;9602:187:27;12418:2446:26;12580:6;;-1:-1:-1;;;;;12580:6:26;12566:10;:20;12562:44;;12595:11;;-1:-1:-1;;;12595:11:26;;;;;;;;;;;12562:44;12616:22;12641:19;;;:8;:19;;;;;12674:12;;-1:-1:-1;;;;;12674:12:26;12670:64;;12709:25;;-1:-1:-1;;;12709:25:26;;;;;2280::27;;;2253:18;;12709:25:26;;;;;;;;12670:64;12748:16;;;;-1:-1:-1;;;12748:16:26;;;;12744:56;;;12773:27;;-1:-1:-1;;;12773:27:26;;;;;2280:25:27;;;2253:18;;12773:27:26;2134:177:27;12744:56:26;12829:4;12810:16;;:23;;-1:-1:-1;;;;12810:23:26;-1:-1:-1;;;12810:23:26;;;;;-1:-1:-1;;;12861:23:26;;;;12810;12898:11;;;12894:608;;-1:-1:-1;12936:28:26;;;;:17;:28;;;;;;;;-1:-1:-1;;;;;;13171:21:26;;;;;;:41;;-1:-1:-1;13196:16:26;;;13171:41;13167:325;;;13250:2;13236:16;;;:52;;-1:-1:-1;13279:9:26;13264:10;13271:2;13269:1;13264:4;;:10;:::i;:::-;13256:19;;;:::i;:::-;:32;;13236:52;:95;;;-1:-1:-1;13292:39:26;;;13308:11;13316:2;13313;13308:4;;:11;:::i;:::-;13300:20;;;:::i;:::-;13292:39;;13236:95;13232:187;;;13362:38;;-1:-1:-1;;;13362:38:26;;;;;10560:25:27;;;10633:4;10621:17;;10601:18;;;10594:45;10533:18;;13362:38:26;10390:255:27;13232:187:26;13167:325;;;-1:-1:-1;13475:1:26;13167:325;13511:14;13540:11;;;;;:36;;-1:-1:-1;;;;;;;13555:21:26;;;;13540:36;13539:77;;;;-1:-1:-1;13581:21:26;;;;-1:-1:-1;;;;;13581:21:26;:35;;13539:77;13535:1252;;;14086:11;;-1:-1:-1;;;14086:11:26;;-1:-1:-1;;;;;14086:11:26;14068:15;4211:6;14138:12;14148:2;14086:11;14138:12;:::i;:::-;14128:22;;:7;:22;:::i;:::-;:41;;;;:::i;:::-;14111:58;;14199:6;14187:9;:18;14183:66;;;14231:6;14239:9;14214:35;;-1:-1:-1;;;14214:35:26;;;;;11308:25:27;;;;11349:18;;;11342:34;11281:18;;14214:35:26;11134:248:27;14183:66:26;14263:17;14296:8;14306:4;;14283:28;;;;;;;;;;:::i;:::-;;;;-1:-1:-1;;14283:28:26;;;;;;;;;14342:21;;;;14283:28;;-1:-1:-1;;;;;;14342:21:26;14583:18;;:22;14579:198;;14743:1;14740;14733:4;14727:11;14720:4;14714;14710:15;14707:1;14699:6;14690:7;14685:60;14672:73;;14579:198;13618:1169;;;;13535:1252;14811:9;14801:56;14822:6;14830:10;14842:3;;14847:9;14801:56;;;;;;;;;;:::i;:::-;;;;;;;;12552:2312;;;12418:2446;;;;;;;:::o;8104:273::-;8267:17;8312:58;8321:6;8329:4;;8335:8;8267:17;8356:5;8363:6;8312:8;:58::i;:::-;8300:70;8104:273;-1:-1:-1;;;;;;;8104:273:26:o;15246:158::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15310:16:26;::::1;15306:42;;15335:13;;-1:-1:-1::0;;;15335:13:26::1;;;;;;;;;;;15306:42;15358:6;:11:::0;;-1:-1:-1;;;;;;15358:11:26::1;-1:-1:-1::0;;;;;15358:11:26;::::1;::::0;;::::1;::::0;;;15384:13:::1;::::0;::::1;::::0;-1:-1:-1;;15384:13:26::1;15246:158:::0;:::o;15085:155::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15148:16:26;::::1;15144:42;;15173:13;;-1:-1:-1::0;;;15173:13:26::1;;;;;;;;;;;15144:42;15196:5;:10:::0;;-1:-1:-1;;;;;;15196:10:26::1;-1:-1:-1::0;;;;;15196:10:26;::::1;::::0;;::::1;::::0;;;15221:12:::1;::::0;::::1;::::0;-1:-1:-1;;15221:12:26::1;15085:155:::0;:::o;15410:158::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15474:16:26;::::1;15470:42;;15499:13;;-1:-1:-1::0;;;15499:13:26::1;;;;;;;;;;;15470:42;15522:6;:11:::0;;-1:-1:-1;;;;;;15522:11:26::1;-1:-1:-1::0;;;;;15522:11:26;::::1;::::0;;::::1;::::0;;;15548:13:::1;::::0;::::1;::::0;-1:-1:-1;;15548:13:26::1;15410:158:::0;:::o;2293:101:0:-;1531:13;:11;:13::i;:::-;2357:30:::1;2384:1;2357:18;:30::i;:::-;2293:101::o:0;2244:229:1:-;1311:13;;735:10:13;;-1:-1:-1;;;;;1311:13:1;2339:24;;2335:96;;2386:34;;-1:-1:-1;;;2386:34:1;;-1:-1:-1;;;;;2090:32:27;;2386:34:1;;;2072:51:27;2045:18;;2386:34:1;1926:203:27;2335:96:1;2440:26;2459:6;2440:18;:26::i;:::-;2286:187;2244:229::o;10400:661:26:-;10634:9;-1:-1:-1;;;;;10616:27:26;:15;:27;10612:63;;;10652:23;;-1:-1:-1;;;10652:23:26;;-1:-1:-1;;;;;8636:31:27;;10652:23:26;;;8618:50:27;8591:18;;10652:23:26;8474:200:27;10612:63:26;10689:21;;;;:10;:21;;;;;;;;10685:61;;;10719:27;;-1:-1:-1;;;10719:27:26;;;;;2280:25:27;;;2253:18;;10719:27:26;2134:177:27;10685:61:26;10806:6;;10761:113;;-1:-1:-1;;;;;10806:6:26;10814:48;10826:9;10837:5;10844:6;10852:9;10814:11;:48::i;:::-;10864:9;;10761:44;:113::i;:::-;10756:171;;10897:19;;-1:-1:-1;;;10897:19:26;;;;;;;;;;;10756:171;10936:21;;;;:10;:21;;;;;:28;;-1:-1:-1;;10936:28:26;10960:4;10936:28;;;10974:23;10983:5;10990:6;10974:8;:23::i;:::-;11012:42;;;-1:-1:-1;;;;;12708:32:27;;12690:51;;12772:2;12757:18;;12750:34;;;11028:10:26;;11017:9;;11012:42;;12663:18:27;11012:42:26;;;;;;;10400:661;;;;;;:::o;5800:557:19:-;5898:13;5925:18;5957:21;5992:15;6021:25;6060:12;6086:27;6189:13;:11;:13::i;:::-;6216:16;:14;:16::i;:::-;6324;;;6308:1;6324:16;;;;;;;;;-1:-1:-1;;;6138:212:19;;;-1:-1:-1;6138:212:19;;-1:-1:-1;6246:13:19;;-1:-1:-1;6281:4:19;;-1:-1:-1;6308:1:19;-1:-1:-1;6324:16:19;-1:-1:-1;6138:212:19;-1:-1:-1;5800:557:19:o;15574:123:26:-;1531:13:0;:11;:13::i;:::-;15639:11:26::1;:17:::0;;-1:-1:-1;;;;15639:17:26::1;-1:-1:-1::0;;;;;;;;15639:17:26;::::1;::::0;;::::1;::::0;;;::::1;::::0;;;15671:19:::1;::::0;8618:50:27;;;15671:19:26::1;::::0;8606:2:27;8591:18;15671:19:26::1;;;;;;;15574:123:::0;:::o;8758:432::-;8980:17;-1:-1:-1;;;;;;9013:22:26;;;;;;:55;;-1:-1:-1;9066:1:26;9039:15;;;;:8;:15;:::i;:::-;-1:-1:-1;;;;;9039:29:26;;9013:55;9009:94;;;9077:26;;-1:-1:-1;;;9077:26:26;;;;;;;;;;;9009:94;9125:58;9134:6;9142:4;;9148:8;9158:9;9169:5;9176:6;9125:8;:58::i;:::-;9113:70;8758:432;-1:-1:-1;;;;;;;;8758:432:26:o;14901:178::-;1531:13:0;:11;:13::i;:::-;14995:15:26::1;::::0;;;:7:::1;:15;::::0;;;;;;;-1:-1:-1;;;;;14995:22:26;::::1;::::0;;;;;;;;;;:31;;;15041;2280:25:27;;;14995:15:26;;15041:31:::1;::::0;2253:18:27;15041:31:26::1;;;;;;;14901:178:::0;;;:::o;1649::1:-;1531:13:0;:11;:13::i;:::-;1738::1::1;:24:::0;;-1:-1:-1;;;;;1738:24:1;::::1;-1:-1:-1::0;;;;;;1738:24:1;;::::1;::::0;::::1;::::0;;;1802:7:::1;1684::0::0;1710:6;-1:-1:-1;;;;;1710:6:0;;1638:85;1802:7:1::1;-1:-1:-1::0;;;;;1777:43:1::1;;;;;;;;;;;1649:178:::0;:::o;11169:235:26:-;11332:63;;;4272:83;11332:63;;;13184:25:27;13225:18;;;13218:34;;;-1:-1:-1;;;;;13288:32:27;;13268:18;;;13261:60;13337:18;;;13330:34;;;-1:-1:-1;;;;;13401:31:27;;13380:19;;;13373:60;11279:7:26;;11305:92;;13156:19:27;;11332:63:26;;;;;;;;;;;;11322:74;;;;;;11305:16;:92::i;:::-;11298:99;;11169:235;;;;;;;:::o;9196:1104::-;9399:17;9444:15;;;:7;:15;;;;;;;;-1:-1:-1;;;;;9444:22:26;;;;;;;;;;9480:10;;;9476:51;;9499:28;;-1:-1:-1;;;9499:28:26;;;;;13618:25:27;;;-1:-1:-1;;;;;13679:32:27;;13659:18;;;13652:60;13591:18;;9499:28:26;13444:274:27;9476:51:26;9550:5;9541:6;:14;9537:53;;;9564:26;;-1:-1:-1;;;9564:26:26;;;;;11308:25:27;;;11349:18;;;11342:34;;;11281:18;;9564:26:26;11134:248:27;9537:53:26;9619:1;9604:16;;;9600:40;;9629:11;;-1:-1:-1;;;9629:11:26;;;;;;;;;;;9600:40;4026:6;9654:28;;9650:65;;;9691:24;;-1:-1:-1;;;9691:24:26;;;;;2280:25:27;;;2253:18;;9691:24:26;2134:177:27;9650:65:26;9858:13;9881:4;9890:5;;9888:7;;;;;:::i;:::-;;;;;-1:-1:-1;9847:49:26;;;;;;9888:7;9847:49;;14065:25:27;;;-1:-1:-1;;;;;14126:32:27;;;;14121:2;14106:18;;14099:60;14190:2;14175:18;;14168:34;14053:2;14038:18;;13863:345;9847:49:26;;;;-1:-1:-1;;9847:49:26;;;;;;;;;9837:60;;9847:49;9837:60;;;;9929:62;;;;;;9937:10;9929:62;;9837:60;;-1:-1:-1;9929:62:26;;;;9949:15;;;;:8;:15;:::i;:::-;-1:-1:-1;;;;;9929:62:26;;;;;9966:8;:17;;;;;;;;;;:::i;:::-;-1:-1:-1;;;;;;9929:62:26;;;;;9985:5;9929:62;;;;;;;9907:19;;;:8;:19;;;;;;;:84;;;;-1:-1:-1;;;;;9907:84:26;;;-1:-1:-1;;;;;;9907:84:26;;;;;;;;;;9929:62;9907:84;;;;;;;;;;;;;;;;;-1:-1:-1;;;9907:84:26;-1:-1:-1;;;;9907:84:26;;;;;-1:-1:-1;;;9907:84:26;-1:-1:-1;;;;;;9907:84:26;;;;;;;;;;;;;;;;;;;;;;;;;;10005:22;;;10001:68;;10029:28;;;;:17;:28;;;;;:40;;-1:-1:-1;;10029:40:26;;;;;;;;10001:68;10079:23;10088:5;10095:6;10079:8;:23::i;:::-;10150:6;10138:10;10127:9;10117:97;10158:4;;10164:15;;;;:8;:15;:::i;:::-;10181:17;;;;;;;;:::i;:::-;10200:5;10207:6;10117:97;;;;;;;;;;;:::i;:::-;;;;;;;;-1:-1:-1;;;;;;10228:22:26;;;10224:69;;10257:36;;-1:-1:-1;;;;;;407:33:27;;389:52;;10272:9:26;;10257:36;;377:2:27;362:18;10257:36:26;;;;;;;10224:69;9418:882;9196:1104;;;;;;;;;:::o;1796:162:0:-;1684:7;1710:6;-1:-1:-1;;;;;1710:6:0;735:10:13;1855:23:0;1851:101;;1901:40;;-1:-1:-1;;;1901:40:0;;735:10:13;1901:40:0;;;2072:51:27;2045:18;;1901:40:0;1926:203:27;2011:153:1;2100:13;2093:20;;-1:-1:-1;;;;;;2093:20:1;;;2123:34;2148:8;2123:24;:34::i;2016:485:21:-;2162:4;2182:6;-1:-1:-1;;;;;2182:18:21;;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;-1:-1:-1;;;;;2368:19:21;:9;-1:-1:-1;;;;;2368:19:21;;2331:56;2324:63;;;;;;2178:317;2425:59;2460:6;2468:4;2474:9;;2425:34;:59::i;:::-;2418:66;;;;15793:697:26;-1:-1:-1;;;;;15864:19:26;;15860:624;;15916:6;15903:9;:19;15899:61;;15931:29;;-1:-1:-1;;;15931:29:26;;;;;11308:25:27;;;15950:9:26;11349:18:27;;;11342:34;11281:18;;15931:29:26;11134:248:27;15899:61:26;16246:5;;:29;;16234:7;;-1:-1:-1;;;;;16246:5:26;;16264:6;;16234:7;16246:29;16234:7;16246:29;16264:6;16246:5;:29;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;16233:42;;;16294:2;16289:31;;16305:15;;-1:-1:-1;;;16305:15:26;;;;;;;;;;;16289:31;15885:446;15793:697;;:::o;15860:624::-;16355:9;:14;16351:51;;16378:24;;-1:-1:-1;;;16378:24:26;;16389:1;16378:24;;;11308:25:27;16392:9:26;11349:18:27;;;11342:34;11281:18;;16378:24:26;11134:248:27;16351:51:26;16459:5;;16416:57;;-1:-1:-1;;;;;16416:30:26;;;;16447:10;;16459:5;16466:6;16416:30;:57::i;:::-;15793:697;;:::o;6564:101:19:-;6610:13;6642:16;:5;:14;:16::i;:::-;6635:23;;6564:101;:::o;6878:107::-;6927:13;6959:19;:8;:17;:19::i;5589:176::-;5666:7;5692:66;5725:20;:18;:20::i;:::-;5747:10;4093:4:20;4087:11;-1:-1:-1;;;4111:23:20;;4163:4;4154:14;;4147:39;;;;4215:4;4206:14;;4199:34;4271:4;4256:20;;;3918:374;5692:66:19;5685:73;5589:176;-1:-1:-1;;5589:176:19:o;2912:187:0:-;2985:16;3004:6;;-1:-1:-1;;;;;3020:17:0;;;-1:-1:-1;;;;;;3020:17:0;;;;;;3052:40;;3004:6;;;;;;;3052:40;;2985:16;3052:40;2975:124;2912:187;:::o;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;4201:1343:21:-;4889:4;4883:11;;-1:-1:-1;;;4907:21:21;;;4957:4;4948:14;;4941:28;;;4998:4;4989:14;;4982:28;;;;5039:4;5030:14;;5023:30;;;4354:11;;4395:34;4456:9;;;;5088:4;5079:14;;5066:54;5169:1;5160:6;5153:4;5148:3;5144:14;5140:27;5133:38;5336:4;5328:6;5324:17;5321:1;5317:25;5314:1;5310:33;5300:43;;5428:4;5422;5415;5407:6;5403:17;5398:3;5390:6;5383:5;5372:61;5357:76;;5517:8;5510:4;5504:11;5501:25;5494:4;5476:16;5473:26;5469:58;5460:7;5456:72;5446:82;;;4508:1030;;4201:1343;;;;;;:::o;1733:232:11:-;1838:47;1856:5;1863:4;1869:2;1873:5;1880:4;1838:17;:47::i;:::-;1833:126;;1908:40;;-1:-1:-1;;;1908:40:11;;-1:-1:-1;;;;;2090:32:27;;1908:40:11;;;2072:51:27;2045:18;;1908:40:11;1926:203:27;1833:126:11;1733:232;;;;:::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;4517:262:19:-;4570:7;4601:4;-1:-1:-1;;;;;4610:11:19;4593:28;;:63;;;;;4642:14;4625:13;:31;4593:63;4589:184;;;-1:-1:-1;4679:22:19;;4517:262::o;4589:184::-;4739:23;4876:80;;;2424:95;4876:80;;;16281:25:27;4898:11:19;16322:18:27;;;16315:34;;;;4911:14:19;16365:18:27;;;16358:34;4927:13:19;16408:18:27;;;16401:34;4950:4:19;16451:19:27;;;16444:61;4840:7:19;;16253:19:27;;4876:80:19;;;;;;;;;;;;4866:91;;;;;;4859:98;;4785:179;;7117:1551:18;7243:17;;;8197:66;8184:79;;8180:164;;;-1:-1:-1;8295:1:18;;-1:-1:-1;8299:30:18;;-1:-1:-1;8331:1:18;8279:54;;8180:164;8455:24;;;8438:14;8455:24;;;;;;;;;15846:25:27;;;15919:4;15907:17;;15887:18;;;15880:45;;;;15941:18;;;15934:34;;;15984:18;;;15977:34;;;8455:24:18;;15818:19:27;;8455:24:18;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;8455:24:18;;-1:-1:-1;;8455:24:18;;;-1:-1:-1;;;;;;;8493:20:18;;8489:113;;-1:-1:-1;8545:1:18;;-1:-1:-1;8549:29:18;;-1:-1:-1;8545:1:18;;-1:-1:-1;8529:62:18;;8489:113;8620:6;-1:-1:-1;8628:20:18;;-1:-1:-1;8628:20:18;;-1:-1:-1;7117:1551:18;;;;;;;;;:::o;10814:1393:11:-;11109:4;11103:11;-1:-1:-1;;;10972:12:11;11127:22;;;-1:-1:-1;;;;;11175:26:11;;;11169:4;11162:40;11228:24;;11222:4;11215:38;11273:4;11266:19;;;10972:12;11349:4;10972:12;11337:4;10972:12;;11321:5;11314;11309:45;11298:56;;11566:1;11559:4;11553:11;11550:18;11541:7;11537:32;11527:606;;11698:6;11688:7;11681:15;11677:28;11674:165;;;11754:16;11748:4;11743:3;11728:43;11804:16;11799:3;11792:29;11674:165;12115:1;12107:5;12095:18;12092:25;12073:16;12066:24;12062:56;12053:7;12049:70;12038:81;;11527:606;12153:4;12146:17;-1:-1:-1;12189:1:11;12183:4;12176:15;10814:1393;;-1:-1:-1;;;;;10814:1393:11:o;2532:247:15:-;2593:7;2665:4;2629:40;;2692:4;2683:13;;2679:71;;;2719:20;;-1:-1:-1;;;2719:20:15;;;;;;;;;;;14:226:27;73:6;126:2;114:9;105:7;101:23;97:32;94:52;;;142:1;139;132:12;94:52;-1:-1:-1;187:23:27;;14:226;-1:-1:-1;14:226:27:o;452:348::-;504:8;514:6;568:3;561:4;553:6;549:17;545:27;535:55;;586:1;583;576:12;535:55;-1:-1:-1;609:20:27;;-1:-1:-1;;;;;641:30:27;;638:50;;;684:1;681;674:12;638:50;721:4;713:6;709:17;697:29;;773:3;766:4;757:6;749;745:19;741:30;738:39;735:59;;;790:1;787;780:12;735:59;452:348;;;;;:::o;805:1116::-;921:6;929;937;945;953;961;969;1022:3;1010:9;1001:7;997:23;993:33;990:53;;;1039:1;1036;1029:12;990:53;1084:23;;;-1:-1:-1;1183:2:27;1168:18;;1155:32;1231:4;1218:18;;1206:31;;1196:59;;1251:1;1248;1241:12;1196:59;1274:7;-1:-1:-1;1354:2:27;1339:18;;1326:32;;-1:-1:-1;1435:2:27;1420:18;;1407:32;-1:-1:-1;;;;;1451:30:27;;1448:50;;;1494:1;1491;1484:12;1448:50;1533:59;1584:7;1575:6;1564:9;1560:22;1533:59;:::i;:::-;1611:8;;-1:-1:-1;1507:85:27;-1:-1:-1;;1699:3:27;1684:19;;1671:33;-1:-1:-1;;;;;1716:32:27;;1713:52;;;1761:1;1758;1751:12;1713:52;1800:61;1853:7;1842:8;1831:9;1827:24;1800:61;:::i;:::-;805:1116;;;;-1:-1:-1;805:1116:27;;-1:-1:-1;805:1116:27;;;;1774:87;;-1:-1:-1;;;805:1116:27:o;2316:156::-;2377:5;2422:2;2413:6;2408:3;2404:16;2400:25;2397:45;;;2438:1;2435;2428:12;2397:45;-1:-1:-1;2460:6:27;2316:156;-1:-1:-1;2316:156:27:o;2477:173::-;2545:20;;-1:-1:-1;;;;;2594:31:27;;2584:42;;2574:70;;2640:1;2637;2630:12;2574:70;2477:173;;;:::o;2655:849::-;2789:6;2797;2805;2813;2821;2829;2882:3;2870:9;2861:7;2857:23;2853:33;2850:53;;;2899:1;2896;2889:12;2850:53;2944:23;;;-1:-1:-1;3042:2:27;3027:18;;3014:32;-1:-1:-1;;;;;3058:30:27;;3055:50;;;3101:1;3098;3091:12;3055:50;3140:59;3191:7;3182:6;3171:9;3167:22;3140:59;:::i;:::-;3218:8;;-1:-1:-1;3114:85:27;-1:-1:-1;3272:64:27;;-1:-1:-1;3328:7:27;3323:2;3308:18;;3272:64;:::i;:::-;3262:74;;3355:39;3389:3;3378:9;3374:19;3355:39;:::i;:::-;2655:849;;;;-1:-1:-1;2655:849:27;;;;;3467:3;3452:19;;;3439:33;;-1:-1:-1;;2655:849:27:o;3691:186::-;3750:6;3803:2;3791:9;3782:7;3778:23;3774:32;3771:52;;;3819:1;3816;3809:12;3771:52;3842:29;3861:9;3842:29;:::i;:::-;3832:39;3691:186;-1:-1:-1;;;3691:186:27:o;3882:300::-;3950:6;3958;4011:2;3999:9;3990:7;3986:23;3982:32;3979:52;;;4027:1;4024;4017:12;3979:52;4072:23;;;-1:-1:-1;4138:38:27;4172:2;4157:18;;4138:38;:::i;:::-;4128:48;;3882:300;;;;;:::o;4187:171::-;4254:20;;-1:-1:-1;;;;;4303:30:27;;4293:41;;4283:69;;4348:1;4345;4338:12;4363:792;4468:6;4476;4484;4492;4500;4508;4561:3;4549:9;4540:7;4536:23;4532:33;4529:53;;;4578:1;4575;4568:12;4529:53;4623:23;;;-1:-1:-1;4689:38:27;4723:2;4708:18;;4689:38;:::i;:::-;4679:48;-1:-1:-1;4800:2:27;4785:18;;4772:32;;-1:-1:-1;4849:37:27;4882:2;4867:18;;4849:37;:::i;:::-;4839:47;;4937:3;4926:9;4922:19;4909:33;-1:-1:-1;;;;;4957:6:27;4954:30;4951:50;;;4997:1;4994;4987:12;4951:50;5036:59;5087:7;5078:6;5067:9;5063:22;5036:59;:::i;:::-;4363:792;;;;-1:-1:-1;4363:792:27;;-1:-1:-1;4363:792:27;;5114:8;;4363:792;-1:-1:-1;;;4363:792:27:o;5160:289::-;5202:3;5240:5;5234:12;5267:6;5262:3;5255:19;5323:6;5316:4;5309:5;5305:16;5298:4;5293:3;5289:14;5283:47;5375:1;5368:4;5359:6;5354:3;5350:16;5346:27;5339:38;5438:4;5431:2;5427:7;5422:2;5414:6;5410:15;5406:29;5401:3;5397:39;5393:50;5386:57;;;5160:289;;;;:::o;5454:1238::-;5860:3;5855;5851:13;5843:6;5839:26;5828:9;5821:45;5902:3;5897:2;5886:9;5882:18;5875:31;5802:4;5929:46;5970:3;5959:9;5955:19;5947:6;5929:46;:::i;:::-;6023:9;6015:6;6011:22;6006:2;5995:9;5991:18;5984:50;6057:33;6083:6;6075;6057:33;:::i;:::-;6121:2;6106:18;;6099:34;;;-1:-1:-1;;;;;6170:32:27;;6164:3;6149:19;;6142:61;6190:3;6219:19;;6212:35;;;6284:22;;;6278:3;6263:19;;6256:51;6356:13;;6378:22;;;6428:2;6454:15;;;;-1:-1:-1;6416:15:27;;;;-1:-1:-1;6497:169:27;6511:6;6508:1;6505:13;6497:169;;;6572:13;;6560:26;;6615:2;6641:15;;;;6606:12;;;;6533:1;6526:9;6497:169;;;-1:-1:-1;6683:3:27;;5454:1238;-1:-1:-1;;;;;;;;;;;5454:1238:27:o;6697:184::-;6755:6;6808:2;6796:9;6787:7;6783:23;6779:32;6776:52;;;6824:1;6821;6814:12;6776:52;6847:28;6865:9;6847:28;:::i;6886:173::-;6953:20;;-1:-1:-1;;;;;;7002:32:27;;6992:43;;6982:71;;7049:1;7046;7039:12;7064:922;7206:6;7214;7222;7230;7238;7246;7254;7307:3;7295:9;7286:7;7282:23;7278:33;7275:53;;;7324:1;7321;7314:12;7275:53;7369:23;;;-1:-1:-1;7467:2:27;7452:18;;7439:32;-1:-1:-1;;;;;7483:30:27;;7480:50;;;7526:1;7523;7516:12;7480:50;7565:59;7616:7;7607:6;7596:9;7592:22;7565:59;:::i;:::-;7643:8;;-1:-1:-1;7539:85:27;-1:-1:-1;7697:64:27;;-1:-1:-1;7753:7:27;7748:2;7733:18;;7697:64;:::i;:::-;7687:74;;7780:38;7813:3;7802:9;7798:19;7780:38;:::i;:::-;7770:48;;7837:39;7871:3;7860:9;7856:19;7837:39;:::i;:::-;7064:922;;;;-1:-1:-1;7064:922:27;;;;;;;;-1:-1:-1;;7949:3:27;7934:19;;;7921:33;;7064:922::o;8679:420::-;8756:6;8764;8772;8825:2;8813:9;8804:7;8800:23;8796:32;8793:52;;;8841:1;8838;8831:12;8793:52;8886:23;;;-1:-1:-1;8952:38:27;8986:2;8971:18;;8952:38;:::i;:::-;8679:420;;8942:48;;-1:-1:-1;;;9063:2:27;9048:18;;;;9035:32;;8679:420::o;9104:493::-;9189:6;9197;9205;9213;9266:3;9254:9;9245:7;9241:23;9237:33;9234:53;;;9283:1;9280;9273:12;9234:53;9328:23;;;-1:-1:-1;9394:38:27;9428:2;9413:18;;9394:38;:::i;:::-;9384:48;-1:-1:-1;9505:2:27;9490:18;;9477:32;;-1:-1:-1;9554:37:27;9587:2;9572:18;;9554:37;:::i;:::-;9544:47;;9104:493;;;;;;;:::o;9794:331::-;9899:9;9910;9952:8;9940:10;9937:24;9934:44;;;9974:1;9971;9964:12;9934:44;10003:6;9993:8;9990:20;9987:40;;;10023:1;10020;10013:12;9987:40;-1:-1:-1;;10049:23:27;;;10094:25;;;;;-1:-1:-1;9794:331:27:o;10130:255::-;10250:19;;10289:2;10281:11;;10278:101;;;-1:-1:-1;;10350:2:27;10346:12;;;10343:1;10339:20;10335:33;10324:45;10130:255;;;;:::o;10650:127::-;10711:10;10706:3;10702:20;10699:1;10692:31;10742:4;10739:1;10732:15;10766:4;10763:1;10756:15;10782:217;10822:1;10848;10838:132;;10892:10;10887:3;10883:20;10880:1;10873:31;10927:4;10924:1;10917:15;10955:4;10952:1;10945:15;10838:132;-1:-1:-1;10984:9:27;;10782:217::o;11004:125::-;11069:9;;;11090:10;;;11087:36;;;11103:18;;:::i;11387:368::-;-1:-1:-1;;;;;;11582:33:27;;11570:46;;11659:6;11651;11647:1;11638:11;;11625:41;11552:3;11689:16;;11707:1;11685:24;11718:13;;;11685:24;11387:368;-1:-1:-1;;11387:368:27:o;11760:267::-;11849:6;11844:3;11837:19;11901:6;11894:5;11887:4;11882:3;11878:14;11865:43;-1:-1:-1;11953:1:27;11928:16;;;11946:4;11924:27;;;11917:38;;;;12009:2;11988:15;;;-1:-1:-1;;11984:29:27;11975:39;;;11971:50;;11760:267::o;12032:479::-;12277:4;12269:6;12265:17;12254:9;12247:36;12319:6;12314:2;12303:9;12299:18;12292:34;12362:3;12357:2;12346:9;12342:18;12335:31;12228:4;12383:63;12441:3;12430:9;12426:19;12418:6;12410;12383:63;:::i;:::-;12375:71;;12496:6;12489:14;12482:22;12477:2;12466:9;12462:18;12455:50;12032:479;;;;;;;;:::o;13723:135::-;13762:3;13783:17;;;13780:43;;13803:18;;:::i;:::-;-1:-1:-1;13850:1:27;13839:13;;13723:135::o;14213:184::-;14271:6;14324:2;14312:9;14303:7;14299:23;14295:32;14292:52;;;14340:1;14337;14330:12;14292:52;14363:28;14381:9;14363:28;:::i;14402:609::-;14669:3;14658:9;14651:22;14632:4;14690:63;14748:3;14737:9;14733:19;14725:6;14717;14690:63;:::i;:::-;-1:-1:-1;;;;;14789:32:27;;;14784:2;14769:18;;14762:60;-1:-1:-1;;;;;;14858:33:27;;;;14853:2;14838:18;;14831:61;-1:-1:-1;14928:32:27;;;;14923:2;14908:18;;14901:60;14992:3;14977:19;14970:35;;;;14682:71;14402:609;-1:-1:-1;;14402:609:27:o;15016:127::-;15077:10;15072:3;15068:20;15065:1;15058:31;15108:4;15105:1;15098:15;15132:4;15129:1;15122:15","linkReferences":{},"cborAuxdata":{"1":{"value":"0xa164736f6c634300081a000a","offset":7372}},"immutableReferences":{"4176":[{"start":5297,"length":32}],"4178":[{"start":5255,"length":32}],"4180":[{"start":5213,"length":32}],"4182":[{"start":5378,"length":32}],"4184":[{"start":5418,"length":32}],"4187":[{"start":4690,"length":32}],"4190":[{"start":4738,"length":32}]},"transformations":[{"id":"4187","type":"replace","offset":4690,"reason":"immutable"},{"id":"4190","type":"replace","offset":4738,"reason":"immutable"},{"id":"4180","type":"replace","offset":5213,"reason":"immutable"},{"id":"4178","type":"replace","offset":5255,"reason":"immutable"},{"id":"4176","type":"replace","offset":5297,"reason":"immutable"},{"id":"4182","type":"replace","offset":5378,"reason":"immutable"},{"id":"4184","type":"replace","offset":5418,"reason":"immutable"}],"transformationValues":{"immutables":{"4176":"0x4282d5c610c44a05224d89ba5fae1c9b69e40213f81f44a4cfc22560fa951915","4178":"0x0000000000000000000000000000000000000000000000000000000000000001","4180":"0x000000000000000000000000a43e6f75ee006411f79ac1c84120606c2330de82","4182":"0xe527e4dd475ca06f05a10d1850a39dcf959ba8ce26ea6efe8d955e2bc54ff967","4184":"0xc89efdaa54c0f20c7adf612882df0950f5a951637e0307cdcb4c672f298b8bc6","4187":"0x4964656e746974794d4420496e74616b65000000000000000000000000000011","4190":"0x3100000000000000000000000000000000000000000000000000000000000001"}}},"deployment":{"transactionHash":"0x75acc7ce4cdddeff526a9a6aa40e5dbebfe8608e1e6576bcb6e4f640a6fc90db","blockNumber":"26164897","transactionIndex":"266","deployer":"0x047F606fD5b2BaA5f5C6c4aB8958E45CB6B054B7"},"sources":{"src/Intake.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.26;\n\nimport {Ownable} from \"@openzeppelin/contracts/access/Ownable.sol\";\nimport {Ownable2Step} from \"@openzeppelin/contracts/access/Ownable2Step.sol\";\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\";\n\n/// @title The swarm's door on a chain: one transaction buys work\n/// @notice A payer sends the price, the ask and, if it wants one, a contract and function to call\n/// with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same\n/// call, and what it keeps is a record of who asked and where the answer goes.\n///\n/// Two ways in:\n///\n/// - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid\n///   action and its version as one right-padded string, the action, an at sign and the version\n///   (`oracle.request`, `oracle-1`); `body` is the\n///   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here\n///   for that action and asset, so a short payment reverts instead of landing in `payTo`.\n/// - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off\n///   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a\n///   wrong asset, a short amount or a stale quote reverts too.\n///\n/// The body travels in the `Requested` event, whole. A contract that calls `request` from inside\n/// its own function is the usual caller, and its transaction's input is that function, not this\n/// one; the event is the one place the body can be read back from whoever sent it.\n///\n/// One way out. When the work ends the plane's writer calls `complete`, which records the result\n/// hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend\n/// inside a try. A callback that reverts or runs out of gas cannot block the write and costs the\n/// network nothing beyond that stipend; the result is still readable by the request's transaction.\n///\n/// A request made with `requestWithFailure` also names a second function on the same target, called\n/// the same way when the plane refused the ask or the work ended without a result:\n/// `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered,\n/// bytes signature)`. The payer commits to that selector in its own call, so the writer can never\n/// choose which of the payer's functions it reaches; it supplies only the arguments, and the\n/// contract checks that they name this request and this status.\n///\n/// Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a\n/// service written for version 1 works against this one at its new address; `requestWithFailure`,\n/// `failureSelectorOf` and `FailureHookSet` are what is new.\n///\n/// @dev Deployed through CREATE2 with the same salt and constructor arguments on every chain, so\n/// the address a contract author stores is the same everywhere. An `action` whose price is zero\n/// is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller\n/// loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the\n/// price list, the treasury or the writer with it.\ncontract Intake is Ownable2Step, EIP712 {\n    using SafeERC20 for IERC20;\n\n    struct Callback {\n        address target;\n        bytes4 selector;\n    }\n\n    struct Request {\n        address payer;\n        address callbackTarget;\n        bytes4 callbackSelector;\n        bool completed;\n    }\n\n    /// @dev The largest body accepted, in bytes. A job draft is a few kilobytes; a request that\n    /// needs more carries a pointer in the body instead.\n    uint256 public constant MAX_BODY_BYTES = 16_384;\n    /// @dev Gas kept back for the rest of `complete` once the callback returns: the event and the\n    /// call's own overhead.\n    uint256 internal constant CALLBACK_RESERVE = 20_000;\n    bytes32 public constant QUOTE_TYPEHASH =\n        keccak256(\"Quote(bytes32 quoteHash,address asset,uint256 amount,uint64 expiresAt)\");\n\n    error ActionNotSold(bytes32 action, address asset);\n    error PriceNotMet(uint256 price, uint256 amount);\n    error EmptyBody();\n    error BodyTooLong(uint256 length);\n    error WrongValue(uint256 expected, uint256 sent);\n    error QuoteExpired(uint64 expiresAt);\n    error QuoteAlreadyPaid(bytes32 quoteHash);\n    error BadQuoteSignature();\n    error UnknownRequest(bytes32 requestId);\n    error AlreadyCompleted(bytes32 requestId);\n    error NotWriter();\n    error CallbackGasShort(uint256 needed, uint256 left);\n    error ZeroAddress();\n    error ForwardFailed();\n    error FailureHookWithoutTarget();\n    error FailureArgsMismatch(bytes32 requestId, uint8 status);\n\n    event Requested(\n        bytes32 indexed requestId,\n        address indexed payer,\n        bytes32 indexed action,\n        bytes body,\n        address callbackTarget,\n        bytes4 callbackSelector,\n        address asset,\n        uint256 amount\n    );\n    /// @notice Emitted beside `Requested` by `requestWithFailure`: the function the target is called\n    /// on when the request is refused or fails.\n    event FailureHookSet(bytes32 indexed requestId, bytes4 selector);\n    event Paid(bytes32 indexed quoteHash, address indexed payer, address asset, uint256 amount);\n    event Completed(bytes32 indexed requestId, uint8 status, bytes32 resultHash, string uri, bool delivered);\n    event PriceSet(bytes32 indexed action, address indexed asset, uint256 amount);\n    event PayToSet(address indexed payTo);\n    event WriterSet(address indexed writer);\n    event SignerSet(address indexed signer);\n    event CallbackGasSet(uint64 gas);\n\n    /// @notice Where every payment goes, in the same call that made it.\n    address public payTo;\n    /// @notice The plane's writer: the only caller of `complete`.\n    address public writer;\n    /// @notice The key the plane signs off-chain quotes with, checked by `pay`.\n    address public signer;\n    /// @notice The gas a callback is given. Fixed so a hostile target costs a known amount.\n    uint64 public callbackGas = 200_000;\n    /// @notice Price per action and asset; zero means the action is not sold in that asset here.\n    /// The native coin is `address(0)`.\n    mapping(bytes32 action => mapping(address asset => uint256 amount)) public priceOf;\n    mapping(bytes32 requestId => Request) public requests;\n    /// @notice The callback target's function for a refusal or a failure; zero when the request\n    /// named none. Kept apart from `requests` so that getter reads as it did in version 1.\n    mapping(bytes32 requestId => bytes4 selector) public failureSelectorOf;\n    mapping(bytes32 quoteHash => bool paid) public paidQuotes;\n    uint256 public nonce;\n\n    constructor(address owner_, address payTo_, address writer_, address signer_)\n        Ownable(owner_)\n        EIP712(\"IdentityMD Intake\", \"1\")\n    {\n        if (payTo_ == address(0) || writer_ == address(0) || signer_ == address(0)) revert ZeroAddress();\n        payTo = payTo_;\n        writer = writer_;\n        signer = signer_;\n        emit PayToSet(payTo_);\n        emit WriterSet(writer_);\n        emit SignerSet(signer_);\n    }\n\n    // ---- the way in ----\n\n    /// @notice Buys one action with the ask on chain. Reverts below the action's price.\n    /// @param action The paid action and its version as one right-padded string: the action, an at\n    /// sign, the version.\n    /// @param body The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.\n    /// @param callback Where the result goes; a zero target means nowhere on chain.\n    /// @param asset The asset paid in; `address(0)` is the native coin, sent as `msg.value`.\n    /// @param amount The amount paid; at least the price. Whatever is paid is forwarded whole.\n    function request(bytes32 action, bytes calldata body, Callback calldata callback, address asset, uint256 amount)\n        external\n        payable\n        returns (bytes32 requestId)\n    {\n        requestId = _request(action, body, callback, bytes4(0), asset, amount);\n    }\n\n    /// @notice `request`, and a function on the callback's target to call if the ask is refused or\n    /// the work ends without a result. The target is the callback's; a zero `onFailure` is `request`.\n    /// @param onFailure The selector of `(bytes32 requestId, uint8 status, bytes32 reason,\n    /// uint16 agreed, uint16 answered, bytes signature)` on `callback.target`.\n    function requestWithFailure(\n        bytes32 action,\n        bytes calldata body,\n        Callback calldata callback,\n        bytes4 onFailure,\n        address asset,\n        uint256 amount\n    ) external payable returns (bytes32 requestId) {\n        if (onFailure != bytes4(0) && callback.target == address(0)) revert FailureHookWithoutTarget();\n        requestId = _request(action, body, callback, onFailure, asset, amount);\n    }\n\n    function _request(\n        bytes32 action,\n        bytes calldata body,\n        Callback calldata callback,\n        bytes4 onFailure,\n        address asset,\n        uint256 amount\n    ) private returns (bytes32 requestId) {\n        uint256 price = priceOf[action][asset];\n        if (price == 0) revert ActionNotSold(action, asset);\n        if (amount < price) revert PriceNotMet(price, amount);\n        if (body.length == 0) revert EmptyBody();\n        if (body.length > MAX_BODY_BYTES) revert BodyTooLong(body.length);\n        // Recorded before the payment moves, so a treasury or token that calls back finds it done.\n        requestId = keccak256(abi.encode(block.chainid, address(this), ++nonce));\n        requests[requestId] = Request(msg.sender, callback.target, callback.selector, false);\n        if (onFailure != bytes4(0)) failureSelectorOf[requestId] = onFailure;\n        _collect(asset, amount);\n        emit Requested(requestId, msg.sender, action, body, callback.target, callback.selector, asset, amount);\n        if (onFailure != bytes4(0)) emit FailureHookSet(requestId, onFailure);\n    }\n\n    /// @notice Settles a quote the plane made off chain. The plane signed these exact terms.\n    function pay(bytes32 quoteHash, address asset, uint256 amount, uint64 expiresAt, bytes calldata signature)\n        external\n        payable\n    {\n        // forge-lint: disable-next-line(block-timestamp)\n        if (block.timestamp > expiresAt) revert QuoteExpired(expiresAt);\n        if (paidQuotes[quoteHash]) revert QuoteAlreadyPaid(quoteHash);\n        if (!SignatureChecker.isValidSignatureNowCalldata(signer, quoteDigest(quoteHash, asset, amount, expiresAt), signature)) {\n            revert BadQuoteSignature();\n        }\n        paidQuotes[quoteHash] = true;\n        _collect(asset, amount);\n        emit Paid(quoteHash, msg.sender, asset, amount);\n    }\n\n    /// @notice The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms.\n    function quoteDigest(bytes32 quoteHash, address asset, uint256 amount, uint64 expiresAt) public view returns (bytes32) {\n        return _hashTypedDataV4(keccak256(abi.encode(QUOTE_TYPEHASH, quoteHash, asset, amount, expiresAt)));\n    }\n\n    // ---- the way out ----\n\n    /// @notice Records what became of a request and calls its callback once, if it named one: the\n    /// result's function on status 0, the failure's on any other status.\n    /// @param status 0 when the work produced a result, 1 when the plane refused the ask, 2 when\n    /// the work ended without a result (a panel that disagreed, a job that failed).\n    /// @param resultHash The hash of the document `uri` serves; zero when there is none.\n    /// @param args The callback's arguments, ABI-encoded without the selector. The shape is the\n    /// action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job\n    /// result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it\n    /// is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered,\n    /// bytes signature)`, and its first two words must be this request and this status; empty, the\n    /// failure function is not called.\n    function complete(bytes32 requestId, uint8 status, bytes32 resultHash, string calldata uri, bytes calldata args)\n        external\n    {\n        if (msg.sender != writer) revert NotWriter();\n        Request storage stored = requests[requestId];\n        if (stored.payer == address(0)) revert UnknownRequest(requestId);\n        if (stored.completed) revert AlreadyCompleted(requestId);\n        stored.completed = true;\n        bytes4 selector = stored.callbackSelector;\n        if (status != 0) {\n            selector = failureSelectorOf[requestId];\n            // The writer chooses the arguments, never the function: the payer named the selector,\n            // and the arguments must say which request and which outcome they are about.\n            if (selector != bytes4(0) && args.length != 0) {\n                if (args.length < 64 || bytes32(args[0:32]) != requestId || uint256(bytes32(args[32:64])) != status) {\n                    revert FailureArgsMismatch(requestId, status);\n                }\n            } else {\n                selector = bytes4(0);\n            }\n        }\n        bool delivered;\n        if ((status == 0 || selector != bytes4(0)) && stored.callbackTarget != address(0)) {\n            // A fixed stipend, no value, and the outcome recorded rather than trusted: the target\n            // is the payer's code, and a revert there is the payer's problem, not the writer's.\n            // A call passes on at most 63/64 of the gas left, so a writer sending too little would\n            // starve the callback and still mark it tried; refused here, `delivered == false` is\n            // always the target's doing.\n            uint256 stipend = callbackGas;\n            uint256 needed = stipend + stipend / 63 + CALLBACK_RESERVE;\n            if (gasleft() < needed) revert CallbackGasShort(needed, gasleft());\n            bytes memory data = bytes.concat(selector, args);\n            address target = stored.callbackTarget;\n            // An address with no code would \"succeed\" at anything; it is recorded as not delivered.\n            // No return data is copied, so a target cannot make the writer pay to read a large one.\n            if (target.code.length > 0) {\n                assembly (\"memory-safe\") {\n                    delivered := call(stipend, target, 0, add(data, 0x20), mload(data), 0, 0)\n                }\n            }\n        }\n        emit Completed(requestId, status, resultHash, uri, delivered);\n    }\n\n    // ---- the operator ----\n\n    function setPrice(bytes32 action, address asset, uint256 amount) external onlyOwner {\n        priceOf[action][asset] = amount;\n        emit PriceSet(action, asset, amount);\n    }\n\n    function setPayTo(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        payTo = to;\n        emit PayToSet(to);\n    }\n\n    function setWriter(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        writer = to;\n        emit WriterSet(to);\n    }\n\n    function setSigner(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        signer = to;\n        emit SignerSet(to);\n    }\n\n    function setCallbackGas(uint64 gas) external onlyOwner {\n        callbackGas = gas;\n        emit CallbackGasSet(gas);\n    }\n\n    /// @dev Forwards the payment to `payTo` in the same call. Nothing is ever held here.\n    function _collect(address asset, uint256 amount) private {\n        if (asset == address(0)) {\n            if (msg.value != amount) revert WrongValue(amount, msg.value);\n            // The destination is the owner's `payTo`, never a caller's argument, and the amount is\n            // the value this call arrived with: the contract forwards, it never holds or chooses.\n            // slither-disable-next-line arbitrary-send-eth\n            (bool ok,) = payTo.call{value: amount}(\"\");\n            if (!ok) revert ForwardFailed();\n        } else {\n            if (msg.value != 0) revert WrongValue(0, msg.value);\n            IERC20(asset).safeTransferFrom(msg.sender, payTo, amount);\n        }\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/access/Ownable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)\n\npragma solidity ^0.8.20;\n\nimport {Context} from \"../utils/Context.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * The initial owner is set to the address provided by the deployer. This can\n * later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract Ownable is Context {\n    address private _owner;\n\n    /**\n     * @dev The caller account is not authorized to perform an operation.\n     */\n    error OwnableUnauthorizedAccount(address account);\n\n    /**\n     * @dev The owner is not a valid owner account. (eg. `address(0)`)\n     */\n    error OwnableInvalidOwner(address owner);\n\n    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n    /**\n     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.\n     */\n    constructor(address initialOwner) {\n        if (initialOwner == address(0)) {\n            revert OwnableInvalidOwner(address(0));\n        }\n        _transferOwnership(initialOwner);\n    }\n\n    /**\n     * @dev Throws if called by any account other than the owner.\n     */\n    modifier onlyOwner() {\n        _checkOwner();\n        _;\n    }\n\n    /**\n     * @dev Returns the address of the current owner.\n     */\n    function owner() public view virtual returns (address) {\n        return _owner;\n    }\n\n    /**\n     * @dev Throws if the sender is not the owner.\n     */\n    function _checkOwner() internal view virtual {\n        if (owner() != _msgSender()) {\n            revert OwnableUnauthorizedAccount(_msgSender());\n        }\n    }\n\n    /**\n     * @dev Leaves the contract without owner. It will not be possible to call\n     * `onlyOwner` functions. Can only be called by the current owner.\n     *\n     * NOTE: Renouncing ownership will leave the contract without an owner,\n     * thereby disabling any functionality that is only available to the owner.\n     */\n    function renounceOwnership() public virtual onlyOwner {\n        _transferOwnership(address(0));\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Can only be called by the current owner.\n     */\n    function transferOwnership(address newOwner) public virtual onlyOwner {\n        if (newOwner == address(0)) {\n            revert OwnableInvalidOwner(address(0));\n        }\n        _transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual {\n        address oldOwner = _owner;\n        _owner = newOwner;\n        emit OwnershipTransferred(oldOwner, newOwner);\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (access/Ownable2Step.sol)\n\npragma solidity ^0.8.20;\n\nimport {Ownable} from \"./Ownable.sol\";\n\n/**\n * @dev Contract module which provides access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * This extension of the {Ownable} contract includes a two-step mechanism to transfer\n * ownership, where the new owner must call {acceptOwnership} in order to replace the\n * old one. This can help prevent common mistakes, such as transfers of ownership to\n * incorrect accounts, or to contracts that are unable to interact with the\n * permission system.\n *\n * The initial owner is specified at deployment time in the constructor for `Ownable`. This\n * can later be changed with {transferOwnership} and {acceptOwnership}.\n *\n * This module is used through inheritance. It will make available all functions\n * from parent (Ownable).\n */\nabstract contract Ownable2Step is Ownable {\n    address private _pendingOwner;\n\n    event OwnershipTransferStarted(address indexed previousOwner, address indexed newOwner);\n\n    /**\n     * @dev Returns the address of the pending owner.\n     */\n    function pendingOwner() public view virtual returns (address) {\n        return _pendingOwner;\n    }\n\n    /**\n     * @dev Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one.\n     * Can only be called by the current owner.\n     *\n     * Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer.\n     */\n    function transferOwnership(address newOwner) public virtual override onlyOwner {\n        _pendingOwner = newOwner;\n        emit OwnershipTransferStarted(owner(), newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`) and deletes any pending owner.\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual override {\n        delete _pendingOwner;\n        super._transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev The new owner accepts the ownership transfer.\n     */\n    function acceptOwnership() public virtual {\n        address sender = _msgSender();\n        if (pendingOwner() != sender) {\n            revert OwnableUnauthorizedAccount(sender);\n        }\n        _transferOwnership(sender);\n    }\n}\n"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.0) (token/ERC20/utils/SafeERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"../IERC20.sol\";\nimport {IERC1363} from \"../../../interfaces/IERC1363.sol\";\nimport {IERC20Metadata} from \"../../../interfaces/IERC20Metadata.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    /// @dev Attempts to fetch the token decimals. A return value of false indicates that the attempt failed in some way.\n    function tryGetDecimals(IERC20 token) internal view returns (bool success, uint8 decimals) {\n        bytes4 selector = IERC20Metadata.decimals.selector;\n        assembly (\"memory-safe\") {\n            mstore(0x00, selector)\n            success := staticcall(gas(), token, 0x00, 4, 0x00, 0x20)\n            success := and(and(success, gt(returndatasize(), 0x1f)), lt(mload(0x00), 0x100))\n            decimals := mul(success, mload(0x00))\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 approve\n     * @param bubble Behavior switch if the approve 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"},"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 * IMPORTANT: The `name` and `version` must each fit in a `ShortString` (at most 31 bytes). Longer values cause the\n * constructor to revert with a `ShortStrings.StringTooLong` error. Because the values are stored exclusively in\n * immutables, the domain is preserved when the contract is used behind a proxy or clone without an initializer.\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\n    // IMPORTANT: Deprecated. Kept to preserve the storage layout of inheriting contracts used as an\n    // implementation behind a proxy.\n    // slither-disable-next-line constable-states\n    string private _nameFallback;\n\n    // IMPORTANT: Deprecated. Kept to preserve the storage layout of inheriting contracts used as an\n    // implementation behind a proxy.\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.toShortString();\n        _version = version.toShortString();\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: This function reads `_name`, which is an immutable value.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Name() internal view returns (string memory) {\n        return _name.toString();\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads `_version`, which is an immutable value.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Version() internal view returns (string memory) {\n        return _version.toString();\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 following https://docs.soliditylang.org/en/v0.8.35/abi-spec.html:\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data> | <zero padding>\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            mstore(add(add(ptr, 0x64), length), 0)\n\n            // round up the length to the next multiple of 32 bytes to ensure that the calldata is properly padded\n            length := shl(5, shr(5, add(length, 0x1F)))\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 following https://docs.soliditylang.org/en/v0.8.35/abi-spec.html:\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data> | <zero padding>\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            mstore(add(add(ptr, 0x64), length), 0)\n\n            // round up the length to the next multiple of 32 bytes to ensure that the calldata is properly padded\n            length := shl(5, shr(5, add(length, 0x1F)))\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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC20Metadata.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20Metadata} from \"../token/ERC20/extensions/IERC20Metadata.sol\";\n"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 if 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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 err, bytes32 errorArg) = tryRecover(hash, signature);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecoverCalldata(hash, signature);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecover(hash, r, vs);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecover(hash, v, r, s);\n        _throwError(err, 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 err, bytes32 errorArg) private pure {\n        if (err == RecoverError.NoError) {\n            return; // no error: do nothing\n        } else if (err == RecoverError.InvalidSignature) {\n            revert ECDSAInvalidSignature();\n        } else if (err == RecoverError.InvalidSignatureLength) {\n            revert ECDSAInvalidSignatureLength(uint256(errorArg));\n        } else if (err == RecoverError.InvalidSignatureS) {\n            revert ECDSAInvalidSignatureS(errorArg);\n        }\n    }\n}\n"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/Bytes.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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) | ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) | ((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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"}},"compilation":{"language":"Solidity","compiler":"solc","compilerVersion":"0.8.26+commit.8a97fa7a","compilerSettings":{"viaIR":false,"metadata":{"appendCBOR":true,"bytecodeHash":"none","useLiteralContent":false},"libraries":{},"optimizer":{"runs":200,"enabled":true},"evmVersion":"cancun","remappings":["@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/","forge-std/=lib/forge-std/src/","solmate/=lib/solmate/","v4-core/=lib/v4-core/","@ensdomains/=lib/v4-core/node_modules/@ensdomains/","@openzeppelin/=lib/v4-core/lib/openzeppelin-contracts/","ds-test/=lib/v4-core/lib/forge-std/lib/ds-test/src/","hardhat/=lib/v4-core/node_modules/hardhat/","openzeppelin-contracts/=lib/openzeppelin-contracts/"]},"name":"Intake","fullyQualifiedName":"src/Intake.sol:Intake"},"abi":[{"type":"constructor","inputs":[{"name":"owner_","type":"address","internalType":"address"},{"name":"payTo_","type":"address","internalType":"address"},{"name":"writer_","type":"address","internalType":"address"},{"name":"signer_","type":"address","internalType":"address"}],"stateMutability":"nonpayable"},{"name":"ActionNotSold","type":"error","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"}]},{"name":"AlreadyCompleted","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}]},{"name":"BadQuoteSignature","type":"error","inputs":[]},{"name":"BodyTooLong","type":"error","inputs":[{"name":"length","type":"uint256","internalType":"uint256"}]},{"name":"CallbackGasShort","type":"error","inputs":[{"name":"needed","type":"uint256","internalType":"uint256"},{"name":"left","type":"uint256","internalType":"uint256"}]},{"name":"EmptyBody","type":"error","inputs":[]},{"name":"FailureArgsMismatch","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"},{"name":"status","type":"uint8","internalType":"uint8"}]},{"name":"FailureHookWithoutTarget","type":"error","inputs":[]},{"name":"ForwardFailed","type":"error","inputs":[]},{"name":"InvalidShortString","type":"error","inputs":[]},{"name":"NotWriter","type":"error","inputs":[]},{"name":"OwnableInvalidOwner","type":"error","inputs":[{"name":"owner","type":"address","internalType":"address"}]},{"name":"OwnableUnauthorizedAccount","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"}]},{"name":"PriceNotMet","type":"error","inputs":[{"name":"price","type":"uint256","internalType":"uint256"},{"name":"amount","type":"uint256","internalType":"uint256"}]},{"name":"QuoteAlreadyPaid","type":"error","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"}]},{"name":"QuoteExpired","type":"error","inputs":[{"name":"expiresAt","type":"uint64","internalType":"uint64"}]},{"name":"SafeERC20FailedOperation","type":"error","inputs":[{"name":"token","type":"address","internalType":"address"}]},{"name":"StringTooLong","type":"error","inputs":[{"name":"str","type":"string","internalType":"string"}]},{"name":"UnknownRequest","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}]},{"name":"WrongValue","type":"error","inputs":[{"name":"expected","type":"uint256","internalType":"uint256"},{"name":"sent","type":"uint256","internalType":"uint256"}]},{"name":"ZeroAddress","type":"error","inputs":[]},{"name":"CallbackGasSet","type":"event","inputs":[{"name":"gas","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"Completed","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"status","type":"uint8","indexed":false,"internalType":"uint8"},{"name":"resultHash","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"uri","type":"string","indexed":false,"internalType":"string"},{"name":"delivered","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"FailureHookSet","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"selector","type":"bytes4","indexed":false,"internalType":"bytes4"}],"anonymous":false},{"name":"OwnershipTransferStarted","type":"event","inputs":[{"name":"previousOwner","type":"address","indexed":true,"internalType":"address"},{"name":"newOwner","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"OwnershipTransferred","type":"event","inputs":[{"name":"previousOwner","type":"address","indexed":true,"internalType":"address"},{"name":"newOwner","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"Paid","type":"event","inputs":[{"name":"quoteHash","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"payer","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":false,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"PayToSet","type":"event","inputs":[{"name":"payTo","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"PriceSet","type":"event","inputs":[{"name":"action","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"Requested","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"payer","type":"address","indexed":true,"internalType":"address"},{"name":"action","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"body","type":"bytes","indexed":false,"internalType":"bytes"},{"name":"callbackTarget","type":"address","indexed":false,"internalType":"address"},{"name":"callbackSelector","type":"bytes4","indexed":false,"internalType":"bytes4"},{"name":"asset","type":"address","indexed":false,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"SignerSet","type":"event","inputs":[{"name":"signer","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"WriterSet","type":"event","inputs":[{"name":"writer","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"MAX_BODY_BYTES","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"QUOTE_TYPEHASH","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"acceptOwnership","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"callbackGas","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"complete","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"},{"name":"status","type":"uint8","internalType":"uint8"},{"name":"resultHash","type":"bytes32","internalType":"bytes32"},{"name":"uri","type":"string","internalType":"string"},{"name":"args","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":"failureSelectorOf","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"selector","type":"bytes4","internalType":"bytes4"}],"stateMutability":"view"},{"name":"nonce","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"owner","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"paidQuotes","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"paid","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"pay","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"},{"name":"expiresAt","type":"uint64","internalType":"uint64"},{"name":"signature","type":"bytes","internalType":"bytes"}],"outputs":[],"stateMutability":"payable"},{"name":"payTo","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"pendingOwner","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"priceOf","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"}],"outputs":[{"name":"amount","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"quoteDigest","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"},{"name":"expiresAt","type":"uint64","internalType":"uint64"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"renounceOwnership","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"request","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"body","type":"bytes","internalType":"bytes"},{"name":"callback","type":"tuple","components":[{"name":"target","type":"address","internalType":"address"},{"name":"selector","type":"bytes4","internalType":"bytes4"}],"internalType":"struct Intake.Callback"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"payable"},{"name":"requestWithFailure","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"body","type":"bytes","internalType":"bytes"},{"name":"callback","type":"tuple","components":[{"name":"target","type":"address","internalType":"address"},{"name":"selector","type":"bytes4","internalType":"bytes4"}],"internalType":"struct Intake.Callback"},{"name":"onFailure","type":"bytes4","internalType":"bytes4"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"payable"},{"name":"requests","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"payer","type":"address","internalType":"address"},{"name":"callbackTarget","type":"address","internalType":"address"},{"name":"callbackSelector","type":"bytes4","internalType":"bytes4"},{"name":"completed","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"setCallbackGas","type":"function","inputs":[{"name":"gas","type":"uint64","internalType":"uint64"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setPayTo","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setPrice","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setSigner","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setWriter","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"signer","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"transferOwnership","type":"function","inputs":[{"name":"newOwner","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"writer","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"}],"metadata":{"compiler":{"version":"0.8.26+commit.8a97fa7a"},"language":"Solidity","output":{"abi":[{"inputs":[{"internalType":"address","name":"owner_","type":"address"},{"internalType":"address","name":"payTo_","type":"address"},{"internalType":"address","name":"writer_","type":"address"},{"internalType":"address","name":"signer_","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"bytes32","name":"action","type":"bytes32"},{"internalType":"address","name":"asset","type":"address"}],"name":"ActionNotSold","type":"error"},{"inputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"name":"AlreadyCompleted","type":"error"},{"inputs":[],"name":"BadQuoteSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"BodyTooLong","type":"error"},{"inputs":[{"internalType":"uint256","name":"needed","type":"uint256"},{"internalType":"uint256","name":"left","type":"uint256"}],"name":"CallbackGasShort","type":"error"},{"inputs":[],"name":"EmptyBody","type":"error"},{"inputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"},{"internalType":"uint8","name":"status","type":"uint8"}],"name":"FailureArgsMismatch","type":"error"},{"inputs":[],"name":"FailureHookWithoutTarget","type":"error"},{"inputs":[],"name":"ForwardFailed","type":"error"},{"inputs":[],"name":"InvalidShortString","type":"error"},{"inputs":[],"name":"NotWriter","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"PriceNotMet","type":"error"},{"inputs":[{"internalType":"bytes32","name":"quoteHash","type":"bytes32"}],"name":"QuoteAlreadyPaid","type":"error"},{"inputs":[{"internalType":"uint64","name":"expiresAt","type":"uint64"}],"name":"QuoteExpired","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[{"internalType":"string","name":"str","type":"string"}],"name":"StringTooLong","type":"error"},{"inputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"name":"UnknownRequest","type":"error"},{"inputs":[{"internalType":"uint256","name":"expected","type":"uint256"},{"internalType":"uint256","name":"sent","type":"uint256"}],"name":"WrongValue","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"gas","type":"uint64"}],"name":"CallbackGasSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"requestId","type":"bytes32"},{"indexed":false,"internalType":"uint8","name":"status","type":"uint8"},{"indexed":false,"internalType":"bytes32","name":"resultHash","type":"bytes32"},{"indexed":false,"internalType":"string","name":"uri","type":"string"},{"indexed":false,"internalType":"bool","name":"delivered","type":"bool"}],"name":"Completed","type":"event"},{"anonymous":false,"inputs":[],"name":"EIP712DomainChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"requestId","type":"bytes32"},{"indexed":false,"internalType":"bytes4","name":"selector","type":"bytes4"}],"name":"FailureHookSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferStarted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"quoteHash","type":"bytes32"},{"indexed":true,"internalType":"address","name":"payer","type":"address"},{"indexed":false,"internalType":"address","name":"asset","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Paid","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"payTo","type":"address"}],"name":"PayToSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"action","type":"bytes32"},{"indexed":true,"internalType":"address","name":"asset","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"PriceSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"requestId","type":"bytes32"},{"indexed":true,"internalType":"address","name":"payer","type":"address"},{"indexed":true,"internalType":"bytes32","name":"action","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"body","type":"bytes"},{"indexed":false,"internalType":"address","name":"callbackTarget","type":"address"},{"indexed":false,"internalType":"bytes4","name":"callbackSelector","type":"bytes4"},{"indexed":false,"internalType":"address","name":"asset","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Requested","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"signer","type":"address"}],"name":"SignerSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"writer","type":"address"}],"name":"WriterSet","type":"event"},{"inputs":[],"name":"MAX_BODY_BYTES","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"QUOTE_TYPEHASH","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"acceptOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"callbackGas","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"},{"internalType":"uint8","name":"status","type":"uint8"},{"internalType":"bytes32","name":"resultHash","type":"bytes32"},{"internalType":"string","name":"uri","type":"string"},{"internalType":"bytes","name":"args","type":"bytes"}],"name":"complete","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":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"name":"failureSelectorOf","outputs":[{"internalType":"bytes4","name":"selector","type":"bytes4"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"nonce","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"quoteHash","type":"bytes32"}],"name":"paidQuotes","outputs":[{"internalType":"bool","name":"paid","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"quoteHash","type":"bytes32"},{"internalType":"address","name":"asset","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint64","name":"expiresAt","type":"uint64"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"pay","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"payTo","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pendingOwner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"action","type":"bytes32"},{"internalType":"address","name":"asset","type":"address"}],"name":"priceOf","outputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"quoteHash","type":"bytes32"},{"internalType":"address","name":"asset","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"uint64","name":"expiresAt","type":"uint64"}],"name":"quoteDigest","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"action","type":"bytes32"},{"internalType":"bytes","name":"body","type":"bytes"},{"components":[{"internalType":"address","name":"target","type":"address"},{"internalType":"bytes4","name":"selector","type":"bytes4"}],"internalType":"struct Intake.Callback","name":"callback","type":"tuple"},{"internalType":"address","name":"asset","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"request","outputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"action","type":"bytes32"},{"internalType":"bytes","name":"body","type":"bytes"},{"components":[{"internalType":"address","name":"target","type":"address"},{"internalType":"bytes4","name":"selector","type":"bytes4"}],"internalType":"struct Intake.Callback","name":"callback","type":"tuple"},{"internalType":"bytes4","name":"onFailure","type":"bytes4"},{"internalType":"address","name":"asset","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"requestWithFailure","outputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"requestId","type":"bytes32"}],"name":"requests","outputs":[{"internalType":"address","name":"payer","type":"address"},{"internalType":"address","name":"callbackTarget","type":"address"},{"internalType":"bytes4","name":"callbackSelector","type":"bytes4"},{"internalType":"bool","name":"completed","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint64","name":"gas","type":"uint64"}],"name":"setCallbackGas","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"}],"name":"setPayTo","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"action","type":"bytes32"},{"internalType":"address","name":"asset","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"setPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"}],"name":"setSigner","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"}],"name":"setWriter","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"signer","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"writer","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"}],"devdoc":{"details":"Deployed through CREATE2 with the same salt and constructor arguments on every chain, so the address a contract author stores is the same everywhere. An `action` whose price is zero is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the price list, the treasury or the writer with it.","errors":{"OwnableInvalidOwner(address)":[{"details":"The owner is not a valid owner account. (eg. `address(0)`)"}],"OwnableUnauthorizedAccount(address)":[{"details":"The caller account is not authorized to perform an operation."}],"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":{"acceptOwnership()":{"details":"The new owner accepts the ownership transfer."},"complete(bytes32,uint8,bytes32,string,bytes)":{"params":{"args":"The callback's arguments, ABI-encoded without the selector. The shape is the action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`, and its first two words must be this request and this status; empty, the failure function is not called.","resultHash":"The hash of the document `uri` serves; zero when there is none.","status":"0 when the work produced a result, 1 when the plane refused the ask, 2 when the work ended without a result (a panel that disagreed, a job that failed)."}},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"owner()":{"details":"Returns the address of the current owner."},"pendingOwner()":{"details":"Returns the address of the pending owner."},"renounceOwnership()":{"details":"Leaves the contract without owner. It will not be possible to call `onlyOwner` functions. Can only be called by the current owner. NOTE: Renouncing ownership will leave the contract without an owner, thereby disabling any functionality that is only available to the owner."},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"params":{"action":"The paid action and its version as one right-padded string: the action, an at sign, the version.","amount":"The amount paid; at least the price. Whatever is paid is forwarded whole.","asset":"The asset paid in; `address(0)` is the native coin, sent as `msg.value`.","body":"The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.","callback":"Where the result goes; a zero target means nowhere on chain."}},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"params":{"onFailure":"The selector of `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)` on `callback.target`."}},"transferOwnership(address)":{"details":"Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one. Can only be called by the current owner. Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer."}},"stateVariables":{"CALLBACK_RESERVE":{"details":"Gas kept back for the rest of `complete` once the callback returns: the event and the call's own overhead."},"MAX_BODY_BYTES":{"details":"The largest body accepted, in bytes. A job draft is a few kilobytes; a request that needs more carries a pointer in the body instead."}},"title":"The swarm's door on a chain: one transaction buys work","version":1},"userdoc":{"events":{"FailureHookSet(bytes32,bytes4)":{"notice":"Emitted beside `Requested` by `requestWithFailure`: the function the target is called on when the request is refused or fails."}},"kind":"user","methods":{"callbackGas()":{"notice":"The gas a callback is given. Fixed so a hostile target costs a known amount."},"complete(bytes32,uint8,bytes32,string,bytes)":{"notice":"Records what became of a request and calls its callback once, if it named one: the result's function on status 0, the failure's on any other status."},"failureSelectorOf(bytes32)":{"notice":"The callback target's function for a refusal or a failure; zero when the request named none. Kept apart from `requests` so that getter reads as it did in version 1."},"pay(bytes32,address,uint256,uint64,bytes)":{"notice":"Settles a quote the plane made off chain. The plane signed these exact terms."},"payTo()":{"notice":"Where every payment goes, in the same call that made it."},"priceOf(bytes32,address)":{"notice":"Price per action and asset; zero means the action is not sold in that asset here. The native coin is `address(0)`."},"quoteDigest(bytes32,address,uint256,uint64)":{"notice":"The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms."},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"notice":"Buys one action with the ask on chain. Reverts below the action's price."},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"notice":"`request`, and a function on the callback's target to call if the ask is refused or the work ends without a result. The target is the callback's; a zero `onFailure` is `request`."},"signer()":{"notice":"The key the plane signs off-chain quotes with, checked by `pay`."},"writer()":{"notice":"The plane's writer: the only caller of `complete`."}},"notice":"A payer sends the price, the ask and, if it wants one, a contract and function to call with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same call, and what it keeps is a record of who asked and where the answer goes. Two ways in: - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid   action and its version as one right-padded string, the action, an at sign and the version   (`oracle.request`, `oracle-1`); `body` is the   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here   for that action and asset, so a short payment reverts instead of landing in `payTo`. - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a   wrong asset, a short amount or a stale quote reverts too. The body travels in the `Requested` event, whole. A contract that calls `request` from inside its own function is the usual caller, and its transaction's input is that function, not this one; the event is the one place the body can be read back from whoever sent it. One way out. When the work ends the plane's writer calls `complete`, which records the result hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend inside a try. A callback that reverts or runs out of gas cannot block the write and costs the network nothing beyond that stipend; the result is still readable by the request's transaction. A request made with `requestWithFailure` also names a second function on the same target, called the same way when the plane refused the ask or the work ended without a result: `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`. The payer commits to that selector in its own call, so the writer can never choose which of the payer's functions it reaches; it supplies only the arguments, and the contract checks that they name this request and this status. Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a service written for version 1 works against this one at its new address; `requestWithFailure`, `failureSelectorOf` and `FailureHookSet` are what is new.","version":1}},"settings":{"compilationTarget":{"src/Intake.sol":"Intake"},"evmVersion":"cancun","libraries":{},"metadata":{"bytecodeHash":"none"},"optimizer":{"enabled":true,"runs":200},"remappings":[":@ensdomains/=lib/v4-core/node_modules/@ensdomains/",":@openzeppelin/=lib/v4-core/lib/openzeppelin-contracts/",":@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/",":ds-test/=lib/v4-core/lib/forge-std/lib/ds-test/src/",":forge-std/=lib/forge-std/src/",":hardhat/=lib/v4-core/node_modules/hardhat/",":openzeppelin-contracts/=lib/openzeppelin-contracts/",":solmate/=lib/solmate/",":v4-core/=lib/v4-core/"]},"sources":{"lib/openzeppelin-contracts/contracts/access/Ownable.sol":{"keccak256":"0xff6d0bb2e285473e5311d9d3caacb525ae3538a80758c10649a4d61029b017bb","license":"MIT","urls":["bzz-raw://8ed324d3920bb545059d66ab97d43e43ee85fd3bd52e03e401f020afb0b120f6","dweb:/ipfs/QmfEckWLmZkDDcoWrkEvMWhms66xwTLff9DDhegYpvHo1a"]},"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol":{"keccak256":"0xdcad8898fda432696597752e8ec361b87d85c82cb258115427af006dacf7128c","license":"MIT","urls":["bzz-raw://e2c9d517f0c136d54bd00cd57959d25681d4d6273f5bbbc263afe228303772f0","dweb:/ipfs/QmReNFjXBiufByiAAzfSQ2SM5r3qeUErn46BmN3yVRvrek"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC1271.sol":{"keccak256":"0x66c7ec42c6c43712be2107a50ab4529379bc76a632b425babec698d9da921ac6","license":"MIT","urls":["bzz-raw://dce2778f0b638adfc5ba29c2c618c855fe725fa74a16846386aa1d56a834aa04","dweb:/ipfs/QmPV9oWnzQdi58od266j62xvviavLNHqKLZfm6k2K1qy9E"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC1363.sol":{"keccak256":"0xd5ea07362ab630a6a3dee4285a74cf2377044ca2e4be472755ad64d7c5d4b69d","license":"MIT","urls":["bzz-raw://da5e832b40fc5c3145d3781e2e5fa60ac2052c9d08af7e300dc8ab80c4343100","dweb:/ipfs/QmTzf7N5ZUdh5raqtzbM11yexiUoLC9z3Ws632MCuycq1d"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC165.sol":{"keccak256":"0x0afcb7e740d1537b252cb2676f600465ce6938398569f09ba1b9ca240dde2dfc","license":"MIT","urls":["bzz-raw://1c299900ac4ec268d4570ecef0d697a3013cd11a6eb74e295ee3fbc945056037","dweb:/ipfs/Qmab9owJoxcA7vJT5XNayCMaUR1qxqj1NDzzisduwaJMcZ"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC20.sol":{"keccak256":"0x1a6221315ce0307746c2c4827c125d821ee796c74a676787762f4778671d4f44","license":"MIT","urls":["bzz-raw://1bb2332a7ee26dd0b0de9b7fe266749f54820c99ab6a3bcb6f7e6b751d47ee2d","dweb:/ipfs/QmcRWpaBeCYkhy68PR3B4AgD7asuQk7PwkWxrvJbZcikLF"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol":{"keccak256":"0xd735962e3d6660884153ba8a972b5f100dde4c482f2ff1c525ba7fdefb154cbd","license":"MIT","urls":["bzz-raw://5a264d17b093f585844b0d977e9f60555b8c8d6513b304fde863cdf652a0d336","dweb:/ipfs/QmWXfaJisjVnrjTUjZGryZpMob9wKivvtbodLS3PTc1ttq"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol":{"keccak256":"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee","license":"MIT","urls":["bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae","dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1"]},"lib/openzeppelin-contracts/contracts/interfaces/IERC7913.sol":{"keccak256":"0xe5a126930df1d54e4a6dd5fea09010c4a7db0ea974c6c17a1e6082879f5a032b","license":"MIT","urls":["bzz-raw://2f58f5a90328536a6c68289916bfa4ed653d871319c7b2a416ab3f6263c4f2f5","dweb:/ipfs/Qmaa9DmgUA16Urz5fuF4RbFz2NaVpNLV41ddwykSdasFUd"]},"lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol":{"keccak256":"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2","license":"MIT","urls":["bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303","dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV"]},"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"keccak256":"0xd6fa4088198f04eef10c5bce8a2f4d60554b7ec4b987f684393c01bf79b94d9f","license":"MIT","urls":["bzz-raw://f95ee0bbd4dd3ac730d066ba3e785ded4565e890dbec2fa7d3b9fe3bad9d0d6e","dweb:/ipfs/QmSLr6bHkPFWT7ntj34jmwfyskpwo97T9jZUrk5sz3sdtR"]},"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol":{"keccak256":"0x318ea37780610ca7808852275651885d428669402b81488cb7434fde361e9704","license":"MIT","urls":["bzz-raw://4aad80ad93cedad85619900fd7c2084c4d2f4b28f1dbda27e491c5f4fd31025d","dweb:/ipfs/QmUyXtX7FUi2u1W5fs7ufka9XkRVb5ss2menQHTsrsSmqZ"]},"lib/openzeppelin-contracts/contracts/utils/Bytes.sol":{"keccak256":"0xa34f1a24f9138bd6bafa5b6cf5d513a45097266204caa1b3e5038e728bfe45b4","license":"MIT","urls":["bzz-raw://4dc3d6b3593089cd12d1919d7515e2ff1f8a08a88705bd52421c5be8573a0c0c","dweb:/ipfs/QmTCFpJfm75KqM23LA2iiJS53cSfRqpnUqdx7XSfUNE851"]},"lib/openzeppelin-contracts/contracts/utils/Context.sol":{"keccak256":"0x493033a8d1b176a037b2cc6a04dad01a5c157722049bbecf632ca876224dd4b2","license":"MIT","urls":["bzz-raw://6a708e8a5bdb1011c2c381c9a5cfd8a9a956d7d0a9dc1bd8bcdaf52f76ef2f12","dweb:/ipfs/Qmax9WHBnVsZP46ZxEMNRQpLQnrdE4dK8LehML1Py8FowF"]},"lib/openzeppelin-contracts/contracts/utils/Panic.sol":{"keccak256":"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a","license":"MIT","urls":["bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a","dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG"]},"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol":{"keccak256":"0x818c1d828c45953bff1ff6e2714d6d41f8f731f9fc3ed15005af0ac881510f30","license":"MIT","urls":["bzz-raw://0dbc15dd325807c5c987010d6389e0f798b45078c70fc1cd28c3e9f47cb3d54a","dweb:/ipfs/QmeRXMqW9M3Wjb5SoiGWiyuWvjfxX3PxdXgqGRrt94gnu3"]},"lib/openzeppelin-contracts/contracts/utils/StorageSlot.sol":{"keccak256":"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97","license":"MIT","urls":["bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b","dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM"]},"lib/openzeppelin-contracts/contracts/utils/Strings.sol":{"keccak256":"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8","license":"MIT","urls":["bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc","dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS"]},"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol":{"keccak256":"0x00de000d6004a92cb99f62dd6956c579551d805705122ef05fbd23bef039825b","license":"MIT","urls":["bzz-raw://4f4885442b527dd1275ea99497bca0cb2b824202f69b22804d0fe48ad8cf3f48","dweb:/ipfs/QmVfiqEhA9vE8Z6486Hs6YRbDqzokVfKxUJqwrvnFZhHeW"]},"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol":{"keccak256":"0xd52a80195641d334b966a1fc02714cda8921cc260d6a6a6943e622cf878236a8","license":"MIT","urls":["bzz-raw://0b62842b2567a83ff4a1628c024a08fad9213b8d54adafb70aebf4eb8a9c682d","dweb:/ipfs/QmPLyXphSjENSt2TVitFQtasj35eDNuqgHYMZS9N3R8Svo"]},"lib/openzeppelin-contracts/contracts/utils/cryptography/MessageHashUtils.sol":{"keccak256":"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d","license":"MIT","urls":["bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c","dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL"]},"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol":{"keccak256":"0x2e1d7ed1e9e028f05cfddb7979f38557ae26732446e60fd5db1d17894a3da7a4","license":"MIT","urls":["bzz-raw://e24f1135137d3e7a0d9464a2258599d360eb8631c7f999c303fd63275ef36109","dweb:/ipfs/QmebV3GXEUqYBFirsUhoULPF7Tc2bvAvFEafkU2wwWjMHf"]},"lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol":{"keccak256":"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c","license":"MIT","urls":["bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617","dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u"]},"lib/openzeppelin-contracts/contracts/utils/math/Math.sol":{"keccak256":"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857","license":"MIT","urls":["bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5","dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y"]},"lib/openzeppelin-contracts/contracts/utils/math/SafeCast.sol":{"keccak256":"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083","license":"MIT","urls":["bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9","dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif"]},"lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol":{"keccak256":"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3","license":"MIT","urls":["bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03","dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ"]},"src/Intake.sol":{"keccak256":"0x1f23e11b662626c773b9db92485c89e542f1889e4bdfdf6b431b522d208a7685","license":"MIT","urls":["bzz-raw://38a952b03fb957068ca54fe7c8a8b3b0d0e9e0086b330aab064027586d5f9c84","dweb:/ipfs/QmZh4ia4WfS8by45GXgLLKw3WcBu4ZkoaLoyMSe8uXMXHL"]}},"version":1},"storageLayout":{"types":{"t_bool":{"label":"bool","encoding":"inplace","numberOfBytes":"1"},"t_bytes4":{"label":"bytes4","encoding":"inplace","numberOfBytes":"4"},"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_bytes32,t_bytes4)":{"key":"t_bytes32","label":"mapping(bytes32 => bytes4)","value":"t_bytes4","encoding":"mapping","numberOfBytes":"32"},"t_struct(Request)8513_storage":{"label":"struct Intake.Request","members":[{"slot":"0","type":"t_address","astId":8506,"label":"payer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_address","astId":8508,"label":"callbackTarget","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_bytes4","astId":8510,"label":"callbackSelector","offset":20,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_bool","astId":8512,"label":"completed","offset":24,"contract":"src/Intake.sol:Intake"}],"encoding":"inplace","numberOfBytes":"64"},"t_mapping(t_address,t_uint256)":{"key":"t_address","label":"mapping(address => uint256)","value":"t_uint256","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_bytes32,t_struct(Request)8513_storage)":{"key":"t_bytes32","label":"mapping(bytes32 => struct Intake.Request)","value":"t_struct(Request)8513_storage","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_bytes32,t_mapping(t_address,t_uint256))":{"key":"t_bytes32","label":"mapping(bytes32 => mapping(address => uint256))","value":"t_mapping(t_address,t_uint256)","encoding":"mapping","numberOfBytes":"32"}},"storage":[{"slot":"0","type":"t_address","astId":8,"label":"_owner","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_address","astId":156,"label":"_pendingOwner","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"2","type":"t_string_storage","astId":4192,"label":"_nameFallback","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"3","type":"t_string_storage","astId":4194,"label":"_versionFallback","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"4","type":"t_address","astId":8662,"label":"payTo","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"5","type":"t_address","astId":8665,"label":"writer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"6","type":"t_address","astId":8668,"label":"signer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"6","type":"t_uint64","astId":8672,"label":"callbackGas","offset":20,"contract":"src/Intake.sol:Intake"},{"slot":"7","type":"t_mapping(t_bytes32,t_mapping(t_address,t_uint256))","astId":8679,"label":"priceOf","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"8","type":"t_mapping(t_bytes32,t_struct(Request)8513_storage)","astId":8684,"label":"requests","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"9","type":"t_mapping(t_bytes32,t_bytes4)","astId":8689,"label":"failureSelectorOf","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"10","type":"t_mapping(t_bytes32,t_bool)","astId":8693,"label":"paidQuotes","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"11","type":"t_uint256","astId":8695,"label":"nonce","offset":0,"contract":"src/Intake.sol:Intake"}]},"transientStorageLayout":null,"userdoc":{"kind":"user","events":{"FailureHookSet(bytes32,bytes4)":{"notice":"Emitted beside `Requested` by `requestWithFailure`: the function the target is called on when the request is refused or fails."}},"notice":"A payer sends the price, the ask and, if it wants one, a contract and function to call with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same call, and what it keeps is a record of who asked and where the answer goes. Two ways in: - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid   action and its version as one right-padded string, the action, an at sign and the version   (`oracle.request`, `oracle-1`); `body` is the   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here   for that action and asset, so a short payment reverts instead of landing in `payTo`. - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a   wrong asset, a short amount or a stale quote reverts too. The body travels in the `Requested` event, whole. A contract that calls `request` from inside its own function is the usual caller, and its transaction's input is that function, not this one; the event is the one place the body can be read back from whoever sent it. One way out. When the work ends the plane's writer calls `complete`, which records the result hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend inside a try. A callback that reverts or runs out of gas cannot block the write and costs the network nothing beyond that stipend; the result is still readable by the request's transaction. A request made with `requestWithFailure` also names a second function on the same target, called the same way when the plane refused the ask or the work ended without a result: `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`. The payer commits to that selector in its own call, so the writer can never choose which of the payer's functions it reaches; it supplies only the arguments, and the contract checks that they name this request and this status. Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a service written for version 1 works against this one at its new address; `requestWithFailure`, `failureSelectorOf` and `FailureHookSet` are what is new.","methods":{"payTo()":{"notice":"Where every payment goes, in the same call that made it."},"signer()":{"notice":"The key the plane signs off-chain quotes with, checked by `pay`."},"writer()":{"notice":"The plane's writer: the only caller of `complete`."},"callbackGas()":{"notice":"The gas a callback is given. Fixed so a hostile target costs a known amount."},"priceOf(bytes32,address)":{"notice":"Price per action and asset; zero means the action is not sold in that asset here. The native coin is `address(0)`."},"failureSelectorOf(bytes32)":{"notice":"The callback target's function for a refusal or a failure; zero when the request named none. Kept apart from `requests` so that getter reads as it did in version 1."},"pay(bytes32,address,uint256,uint64,bytes)":{"notice":"Settles a quote the plane made off chain. The plane signed these exact terms."},"quoteDigest(bytes32,address,uint256,uint64)":{"notice":"The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms."},"complete(bytes32,uint8,bytes32,string,bytes)":{"notice":"Records what became of a request and calls its callback once, if it named one: the result's function on status 0, the failure's on any other status."},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"notice":"Buys one action with the ask on chain. Reverts below the action's price."},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"notice":"`request`, and a function on the callback's target to call if the ask is refused or the work ends without a result. The target is the callback's; a zero `onFailure` is `request`."}},"version":1},"devdoc":{"kind":"dev","title":"The swarm's door on a chain: one transaction buys work","errors":{"OwnableInvalidOwner(address)":[{"details":"The owner is not a valid owner account. (eg. `address(0)`)"}],"SafeERC20FailedOperation(address)":[{"details":"An operation with an ERC-20 token failed."}],"OwnableUnauthorizedAccount(address)":[{"details":"The caller account is not authorized to perform an operation."}]},"events":{"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."}},"details":"Deployed through CREATE2 with the same salt and constructor arguments on every chain, so the address a contract author stores is the same everywhere. An `action` whose price is zero is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the price list, the treasury or the writer with it.","methods":{"owner()":{"details":"Returns the address of the current owner."},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"pendingOwner()":{"details":"Returns the address of the pending owner."},"acceptOwnership()":{"details":"The new owner accepts the ownership transfer."},"renounceOwnership()":{"details":"Leaves the contract without owner. It will not be possible to call `onlyOwner` functions. Can only be called by the current owner. NOTE: Renouncing ownership will leave the contract without an owner, thereby disabling any functionality that is only available to the owner."},"transferOwnership(address)":{"details":"Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one. Can only be called by the current owner. Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer."},"complete(bytes32,uint8,bytes32,string,bytes)":{"params":{"args":"The callback's arguments, ABI-encoded without the selector. The shape is the action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`, and its first two words must be this request and this status; empty, the failure function is not called.","status":"0 when the work produced a result, 1 when the plane refused the ask, 2 when the work ended without a result (a panel that disagreed, a job that failed).","resultHash":"The hash of the document `uri` serves; zero when there is none."}},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"params":{"body":"The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.","asset":"The asset paid in; `address(0)` is the native coin, sent as `msg.value`.","action":"The paid action and its version as one right-padded string: the action, an at sign, the version.","amount":"The amount paid; at least the price. Whatever is paid is forwarded whole.","callback":"Where the result goes; a zero target means nowhere on chain."}},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"params":{"onFailure":"The selector of `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)` on `callback.target`."}}},"version":1,"stateVariables":{"MAX_BODY_BYTES":{"details":"The largest body accepted, in bytes. A job draft is a few kilobytes; a request that needs more carries a pointer in the body instead."},"CALLBACK_RESERVE":{"details":"Gas kept back for the rest of `complete` once the callback returns: the event and the call's own overhead."}}},"sourceIds":{"src/Intake.sol":{"id":26},"lib/openzeppelin-contracts/contracts/utils/Bytes.sol":{"id":12},"lib/openzeppelin-contracts/contracts/utils/Panic.sol":{"id":14},"lib/openzeppelin-contracts/contracts/utils/Context.sol":{"id":13},"lib/openzeppelin-contracts/contracts/utils/Strings.sol":{"id":17},"lib/openzeppelin-contracts/contracts/access/Ownable.sol":{"id":0},"lib/openzeppelin-contracts/contracts/utils/math/Math.sol":{"id":23},"lib/openzeppelin-contracts/contracts/interfaces/IERC20.sol":{"id":5},"lib/openzeppelin-contracts/contracts/utils/StorageSlot.sol":{"id":16},"lib/openzeppelin-contracts/contracts/interfaces/IERC165.sol":{"id":4},"lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol":{"id":9},"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol":{"id":15},"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol":{"id":1},"lib/openzeppelin-contracts/contracts/interfaces/IERC1271.sol":{"id":2},"lib/openzeppelin-contracts/contracts/interfaces/IERC1363.sol":{"id":3},"lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol":{"id":7},"lib/openzeppelin-contracts/contracts/interfaces/IERC7913.sol":{"id":8},"lib/openzeppelin-contracts/contracts/utils/math/SafeCast.sol":{"id":24},"lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol":{"id":25},"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol":{"id":18},"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol":{"id":6},"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol":{"id":19},"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol":{"id":11},"lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol":{"id":22},"lib/openzeppelin-contracts/contracts/utils/cryptography/MessageHashUtils.sol":{"id":20},"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol":{"id":21},"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":10}},"additionalInput":null,"stdJsonInput":{"sources":{"src/Intake.sol":{"content":"// SPDX-License-Identifier: MIT\npragma solidity 0.8.26;\n\nimport {Ownable} from \"@openzeppelin/contracts/access/Ownable.sol\";\nimport {Ownable2Step} from \"@openzeppelin/contracts/access/Ownable2Step.sol\";\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\";\n\n/// @title The swarm's door on a chain: one transaction buys work\n/// @notice A payer sends the price, the ask and, if it wants one, a contract and function to call\n/// with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same\n/// call, and what it keeps is a record of who asked and where the answer goes.\n///\n/// Two ways in:\n///\n/// - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid\n///   action and its version as one right-padded string, the action, an at sign and the version\n///   (`oracle.request`, `oracle-1`); `body` is the\n///   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here\n///   for that action and asset, so a short payment reverts instead of landing in `payTo`.\n/// - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off\n///   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a\n///   wrong asset, a short amount or a stale quote reverts too.\n///\n/// The body travels in the `Requested` event, whole. A contract that calls `request` from inside\n/// its own function is the usual caller, and its transaction's input is that function, not this\n/// one; the event is the one place the body can be read back from whoever sent it.\n///\n/// One way out. When the work ends the plane's writer calls `complete`, which records the result\n/// hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend\n/// inside a try. A callback that reverts or runs out of gas cannot block the write and costs the\n/// network nothing beyond that stipend; the result is still readable by the request's transaction.\n///\n/// A request made with `requestWithFailure` also names a second function on the same target, called\n/// the same way when the plane refused the ask or the work ended without a result:\n/// `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered,\n/// bytes signature)`. The payer commits to that selector in its own call, so the writer can never\n/// choose which of the payer's functions it reaches; it supplies only the arguments, and the\n/// contract checks that they name this request and this status.\n///\n/// Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a\n/// service written for version 1 works against this one at its new address; `requestWithFailure`,\n/// `failureSelectorOf` and `FailureHookSet` are what is new.\n///\n/// @dev Deployed through CREATE2 with the same salt and constructor arguments on every chain, so\n/// the address a contract author stores is the same everywhere. An `action` whose price is zero\n/// is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller\n/// loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the\n/// price list, the treasury or the writer with it.\ncontract Intake is Ownable2Step, EIP712 {\n    using SafeERC20 for IERC20;\n\n    struct Callback {\n        address target;\n        bytes4 selector;\n    }\n\n    struct Request {\n        address payer;\n        address callbackTarget;\n        bytes4 callbackSelector;\n        bool completed;\n    }\n\n    /// @dev The largest body accepted, in bytes. A job draft is a few kilobytes; a request that\n    /// needs more carries a pointer in the body instead.\n    uint256 public constant MAX_BODY_BYTES = 16_384;\n    /// @dev Gas kept back for the rest of `complete` once the callback returns: the event and the\n    /// call's own overhead.\n    uint256 internal constant CALLBACK_RESERVE = 20_000;\n    bytes32 public constant QUOTE_TYPEHASH =\n        keccak256(\"Quote(bytes32 quoteHash,address asset,uint256 amount,uint64 expiresAt)\");\n\n    error ActionNotSold(bytes32 action, address asset);\n    error PriceNotMet(uint256 price, uint256 amount);\n    error EmptyBody();\n    error BodyTooLong(uint256 length);\n    error WrongValue(uint256 expected, uint256 sent);\n    error QuoteExpired(uint64 expiresAt);\n    error QuoteAlreadyPaid(bytes32 quoteHash);\n    error BadQuoteSignature();\n    error UnknownRequest(bytes32 requestId);\n    error AlreadyCompleted(bytes32 requestId);\n    error NotWriter();\n    error CallbackGasShort(uint256 needed, uint256 left);\n    error ZeroAddress();\n    error ForwardFailed();\n    error FailureHookWithoutTarget();\n    error FailureArgsMismatch(bytes32 requestId, uint8 status);\n\n    event Requested(\n        bytes32 indexed requestId,\n        address indexed payer,\n        bytes32 indexed action,\n        bytes body,\n        address callbackTarget,\n        bytes4 callbackSelector,\n        address asset,\n        uint256 amount\n    );\n    /// @notice Emitted beside `Requested` by `requestWithFailure`: the function the target is called\n    /// on when the request is refused or fails.\n    event FailureHookSet(bytes32 indexed requestId, bytes4 selector);\n    event Paid(bytes32 indexed quoteHash, address indexed payer, address asset, uint256 amount);\n    event Completed(bytes32 indexed requestId, uint8 status, bytes32 resultHash, string uri, bool delivered);\n    event PriceSet(bytes32 indexed action, address indexed asset, uint256 amount);\n    event PayToSet(address indexed payTo);\n    event WriterSet(address indexed writer);\n    event SignerSet(address indexed signer);\n    event CallbackGasSet(uint64 gas);\n\n    /// @notice Where every payment goes, in the same call that made it.\n    address public payTo;\n    /// @notice The plane's writer: the only caller of `complete`.\n    address public writer;\n    /// @notice The key the plane signs off-chain quotes with, checked by `pay`.\n    address public signer;\n    /// @notice The gas a callback is given. Fixed so a hostile target costs a known amount.\n    uint64 public callbackGas = 200_000;\n    /// @notice Price per action and asset; zero means the action is not sold in that asset here.\n    /// The native coin is `address(0)`.\n    mapping(bytes32 action => mapping(address asset => uint256 amount)) public priceOf;\n    mapping(bytes32 requestId => Request) public requests;\n    /// @notice The callback target's function for a refusal or a failure; zero when the request\n    /// named none. Kept apart from `requests` so that getter reads as it did in version 1.\n    mapping(bytes32 requestId => bytes4 selector) public failureSelectorOf;\n    mapping(bytes32 quoteHash => bool paid) public paidQuotes;\n    uint256 public nonce;\n\n    constructor(address owner_, address payTo_, address writer_, address signer_)\n        Ownable(owner_)\n        EIP712(\"IdentityMD Intake\", \"1\")\n    {\n        if (payTo_ == address(0) || writer_ == address(0) || signer_ == address(0)) revert ZeroAddress();\n        payTo = payTo_;\n        writer = writer_;\n        signer = signer_;\n        emit PayToSet(payTo_);\n        emit WriterSet(writer_);\n        emit SignerSet(signer_);\n    }\n\n    // ---- the way in ----\n\n    /// @notice Buys one action with the ask on chain. Reverts below the action's price.\n    /// @param action The paid action and its version as one right-padded string: the action, an at\n    /// sign, the version.\n    /// @param body The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.\n    /// @param callback Where the result goes; a zero target means nowhere on chain.\n    /// @param asset The asset paid in; `address(0)` is the native coin, sent as `msg.value`.\n    /// @param amount The amount paid; at least the price. Whatever is paid is forwarded whole.\n    function request(bytes32 action, bytes calldata body, Callback calldata callback, address asset, uint256 amount)\n        external\n        payable\n        returns (bytes32 requestId)\n    {\n        requestId = _request(action, body, callback, bytes4(0), asset, amount);\n    }\n\n    /// @notice `request`, and a function on the callback's target to call if the ask is refused or\n    /// the work ends without a result. The target is the callback's; a zero `onFailure` is `request`.\n    /// @param onFailure The selector of `(bytes32 requestId, uint8 status, bytes32 reason,\n    /// uint16 agreed, uint16 answered, bytes signature)` on `callback.target`.\n    function requestWithFailure(\n        bytes32 action,\n        bytes calldata body,\n        Callback calldata callback,\n        bytes4 onFailure,\n        address asset,\n        uint256 amount\n    ) external payable returns (bytes32 requestId) {\n        if (onFailure != bytes4(0) && callback.target == address(0)) revert FailureHookWithoutTarget();\n        requestId = _request(action, body, callback, onFailure, asset, amount);\n    }\n\n    function _request(\n        bytes32 action,\n        bytes calldata body,\n        Callback calldata callback,\n        bytes4 onFailure,\n        address asset,\n        uint256 amount\n    ) private returns (bytes32 requestId) {\n        uint256 price = priceOf[action][asset];\n        if (price == 0) revert ActionNotSold(action, asset);\n        if (amount < price) revert PriceNotMet(price, amount);\n        if (body.length == 0) revert EmptyBody();\n        if (body.length > MAX_BODY_BYTES) revert BodyTooLong(body.length);\n        // Recorded before the payment moves, so a treasury or token that calls back finds it done.\n        requestId = keccak256(abi.encode(block.chainid, address(this), ++nonce));\n        requests[requestId] = Request(msg.sender, callback.target, callback.selector, false);\n        if (onFailure != bytes4(0)) failureSelectorOf[requestId] = onFailure;\n        _collect(asset, amount);\n        emit Requested(requestId, msg.sender, action, body, callback.target, callback.selector, asset, amount);\n        if (onFailure != bytes4(0)) emit FailureHookSet(requestId, onFailure);\n    }\n\n    /// @notice Settles a quote the plane made off chain. The plane signed these exact terms.\n    function pay(bytes32 quoteHash, address asset, uint256 amount, uint64 expiresAt, bytes calldata signature)\n        external\n        payable\n    {\n        // forge-lint: disable-next-line(block-timestamp)\n        if (block.timestamp > expiresAt) revert QuoteExpired(expiresAt);\n        if (paidQuotes[quoteHash]) revert QuoteAlreadyPaid(quoteHash);\n        if (!SignatureChecker.isValidSignatureNowCalldata(signer, quoteDigest(quoteHash, asset, amount, expiresAt), signature)) {\n            revert BadQuoteSignature();\n        }\n        paidQuotes[quoteHash] = true;\n        _collect(asset, amount);\n        emit Paid(quoteHash, msg.sender, asset, amount);\n    }\n\n    /// @notice The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms.\n    function quoteDigest(bytes32 quoteHash, address asset, uint256 amount, uint64 expiresAt) public view returns (bytes32) {\n        return _hashTypedDataV4(keccak256(abi.encode(QUOTE_TYPEHASH, quoteHash, asset, amount, expiresAt)));\n    }\n\n    // ---- the way out ----\n\n    /// @notice Records what became of a request and calls its callback once, if it named one: the\n    /// result's function on status 0, the failure's on any other status.\n    /// @param status 0 when the work produced a result, 1 when the plane refused the ask, 2 when\n    /// the work ended without a result (a panel that disagreed, a job that failed).\n    /// @param resultHash The hash of the document `uri` serves; zero when there is none.\n    /// @param args The callback's arguments, ABI-encoded without the selector. The shape is the\n    /// action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job\n    /// result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it\n    /// is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered,\n    /// bytes signature)`, and its first two words must be this request and this status; empty, the\n    /// failure function is not called.\n    function complete(bytes32 requestId, uint8 status, bytes32 resultHash, string calldata uri, bytes calldata args)\n        external\n    {\n        if (msg.sender != writer) revert NotWriter();\n        Request storage stored = requests[requestId];\n        if (stored.payer == address(0)) revert UnknownRequest(requestId);\n        if (stored.completed) revert AlreadyCompleted(requestId);\n        stored.completed = true;\n        bytes4 selector = stored.callbackSelector;\n        if (status != 0) {\n            selector = failureSelectorOf[requestId];\n            // The writer chooses the arguments, never the function: the payer named the selector,\n            // and the arguments must say which request and which outcome they are about.\n            if (selector != bytes4(0) && args.length != 0) {\n                if (args.length < 64 || bytes32(args[0:32]) != requestId || uint256(bytes32(args[32:64])) != status) {\n                    revert FailureArgsMismatch(requestId, status);\n                }\n            } else {\n                selector = bytes4(0);\n            }\n        }\n        bool delivered;\n        if ((status == 0 || selector != bytes4(0)) && stored.callbackTarget != address(0)) {\n            // A fixed stipend, no value, and the outcome recorded rather than trusted: the target\n            // is the payer's code, and a revert there is the payer's problem, not the writer's.\n            // A call passes on at most 63/64 of the gas left, so a writer sending too little would\n            // starve the callback and still mark it tried; refused here, `delivered == false` is\n            // always the target's doing.\n            uint256 stipend = callbackGas;\n            uint256 needed = stipend + stipend / 63 + CALLBACK_RESERVE;\n            if (gasleft() < needed) revert CallbackGasShort(needed, gasleft());\n            bytes memory data = bytes.concat(selector, args);\n            address target = stored.callbackTarget;\n            // An address with no code would \"succeed\" at anything; it is recorded as not delivered.\n            // No return data is copied, so a target cannot make the writer pay to read a large one.\n            if (target.code.length > 0) {\n                assembly (\"memory-safe\") {\n                    delivered := call(stipend, target, 0, add(data, 0x20), mload(data), 0, 0)\n                }\n            }\n        }\n        emit Completed(requestId, status, resultHash, uri, delivered);\n    }\n\n    // ---- the operator ----\n\n    function setPrice(bytes32 action, address asset, uint256 amount) external onlyOwner {\n        priceOf[action][asset] = amount;\n        emit PriceSet(action, asset, amount);\n    }\n\n    function setPayTo(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        payTo = to;\n        emit PayToSet(to);\n    }\n\n    function setWriter(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        writer = to;\n        emit WriterSet(to);\n    }\n\n    function setSigner(address to) external onlyOwner {\n        if (to == address(0)) revert ZeroAddress();\n        signer = to;\n        emit SignerSet(to);\n    }\n\n    function setCallbackGas(uint64 gas) external onlyOwner {\n        callbackGas = gas;\n        emit CallbackGasSet(gas);\n    }\n\n    /// @dev Forwards the payment to `payTo` in the same call. Nothing is ever held here.\n    function _collect(address asset, uint256 amount) private {\n        if (asset == address(0)) {\n            if (msg.value != amount) revert WrongValue(amount, msg.value);\n            // The destination is the owner's `payTo`, never a caller's argument, and the amount is\n            // the value this call arrived with: the contract forwards, it never holds or chooses.\n            // slither-disable-next-line arbitrary-send-eth\n            (bool ok,) = payTo.call{value: amount}(\"\");\n            if (!ok) revert ForwardFailed();\n        } else {\n            if (msg.value != 0) revert WrongValue(0, msg.value);\n            IERC20(asset).safeTransferFrom(msg.sender, payTo, amount);\n        }\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/utils/Bytes.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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) | ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\n        value = // swap 2-byte long pairs\n            ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\n        value = // swap 4-byte long pairs\n            ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) | ((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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/access/Ownable.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)\n\npragma solidity ^0.8.20;\n\nimport {Context} from \"../utils/Context.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * The initial owner is set to the address provided by the deployer. This can\n * later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract Ownable is Context {\n    address private _owner;\n\n    /**\n     * @dev The caller account is not authorized to perform an operation.\n     */\n    error OwnableUnauthorizedAccount(address account);\n\n    /**\n     * @dev The owner is not a valid owner account. (eg. `address(0)`)\n     */\n    error OwnableInvalidOwner(address owner);\n\n    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n    /**\n     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.\n     */\n    constructor(address initialOwner) {\n        if (initialOwner == address(0)) {\n            revert OwnableInvalidOwner(address(0));\n        }\n        _transferOwnership(initialOwner);\n    }\n\n    /**\n     * @dev Throws if called by any account other than the owner.\n     */\n    modifier onlyOwner() {\n        _checkOwner();\n        _;\n    }\n\n    /**\n     * @dev Returns the address of the current owner.\n     */\n    function owner() public view virtual returns (address) {\n        return _owner;\n    }\n\n    /**\n     * @dev Throws if the sender is not the owner.\n     */\n    function _checkOwner() internal view virtual {\n        if (owner() != _msgSender()) {\n            revert OwnableUnauthorizedAccount(_msgSender());\n        }\n    }\n\n    /**\n     * @dev Leaves the contract without owner. It will not be possible to call\n     * `onlyOwner` functions. Can only be called by the current owner.\n     *\n     * NOTE: Renouncing ownership will leave the contract without an owner,\n     * thereby disabling any functionality that is only available to the owner.\n     */\n    function renounceOwnership() public virtual onlyOwner {\n        _transferOwnership(address(0));\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Can only be called by the current owner.\n     */\n    function transferOwnership(address newOwner) public virtual onlyOwner {\n        if (newOwner == address(0)) {\n            revert OwnableInvalidOwner(address(0));\n        }\n        _transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual {\n        address oldOwner = _owner;\n        _owner = newOwner;\n        emit OwnershipTransferred(oldOwner, newOwner);\n    }\n}\n"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 if 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"},"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.1.0) (access/Ownable2Step.sol)\n\npragma solidity ^0.8.20;\n\nimport {Ownable} from \"./Ownable.sol\";\n\n/**\n * @dev Contract module which provides access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * This extension of the {Ownable} contract includes a two-step mechanism to transfer\n * ownership, where the new owner must call {acceptOwnership} in order to replace the\n * old one. This can help prevent common mistakes, such as transfers of ownership to\n * incorrect accounts, or to contracts that are unable to interact with the\n * permission system.\n *\n * The initial owner is specified at deployment time in the constructor for `Ownable`. This\n * can later be changed with {transferOwnership} and {acceptOwnership}.\n *\n * This module is used through inheritance. It will make available all functions\n * from parent (Ownable).\n */\nabstract contract Ownable2Step is Ownable {\n    address private _pendingOwner;\n\n    event OwnershipTransferStarted(address indexed previousOwner, address indexed newOwner);\n\n    /**\n     * @dev Returns the address of the pending owner.\n     */\n    function pendingOwner() public view virtual returns (address) {\n        return _pendingOwner;\n    }\n\n    /**\n     * @dev Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one.\n     * Can only be called by the current owner.\n     *\n     * Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer.\n     */\n    function transferOwnership(address newOwner) public virtual override onlyOwner {\n        _pendingOwner = newOwner;\n        emit OwnershipTransferStarted(owner(), newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`) and deletes any pending owner.\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual override {\n        delete _pendingOwner;\n        super._transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev The new owner accepts the ownership transfer.\n     */\n    function acceptOwnership() public virtual {\n        address sender = _msgSender();\n        if (pendingOwner() != sender) {\n            revert OwnableUnauthorizedAccount(sender);\n        }\n        _transferOwnership(sender);\n    }\n}\n"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 err, bytes32 errorArg) = tryRecover(hash, signature);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecoverCalldata(hash, signature);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecover(hash, r, vs);\n        _throwError(err, 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 err, bytes32 errorArg) = tryRecover(hash, v, r, s);\n        _throwError(err, 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 err, bytes32 errorArg) private pure {\n        if (err == RecoverError.NoError) {\n            return; // no error: do nothing\n        } else if (err == RecoverError.InvalidSignature) {\n            revert ECDSAInvalidSignature();\n        } else if (err == RecoverError.InvalidSignatureLength) {\n            revert ECDSAInvalidSignatureLength(uint256(errorArg));\n        } else if (err == RecoverError.InvalidSignatureS) {\n            revert ECDSAInvalidSignatureS(errorArg);\n        }\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC20Metadata.sol)\n\npragma solidity >=0.6.2;\n\nimport {IERC20Metadata} from \"../token/ERC20/extensions/IERC20Metadata.sol\";\n"},"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 * IMPORTANT: The `name` and `version` must each fit in a `ShortString` (at most 31 bytes). Longer values cause the\n * constructor to revert with a `ShortStrings.StringTooLong` error. Because the values are stored exclusively in\n * immutables, the domain is preserved when the contract is used behind a proxy or clone without an initializer.\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\n    // IMPORTANT: Deprecated. Kept to preserve the storage layout of inheriting contracts used as an\n    // implementation behind a proxy.\n    // slither-disable-next-line constable-states\n    string private _nameFallback;\n\n    // IMPORTANT: Deprecated. Kept to preserve the storage layout of inheriting contracts used as an\n    // implementation behind a proxy.\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.toShortString();\n        _version = version.toShortString();\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: This function reads `_name`, which is an immutable value.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Name() internal view returns (string memory) {\n        return _name.toString();\n    }\n\n    /**\n     * @dev The version parameter for the EIP712 domain.\n     *\n     * NOTE: This function reads `_version`, which is an immutable value.\n     */\n    // solhint-disable-next-line func-name-mixedcase\n    function _EIP712Version() internal view returns (string memory) {\n        return _version.toString();\n    }\n}\n"},"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.0) (token/ERC20/utils/SafeERC20.sol)\n\npragma solidity ^0.8.20;\n\nimport {IERC20} from \"../IERC20.sol\";\nimport {IERC1363} from \"../../../interfaces/IERC1363.sol\";\nimport {IERC20Metadata} from \"../../../interfaces/IERC20Metadata.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    /// @dev Attempts to fetch the token decimals. A return value of false indicates that the attempt failed in some way.\n    function tryGetDecimals(IERC20 token) internal view returns (bool success, uint8 decimals) {\n        bytes4 selector = IERC20Metadata.decimals.selector;\n        assembly (\"memory-safe\") {\n            mstore(0x00, selector)\n            success := staticcall(gas(), token, 0x00, 4, 0x00, 0x20)\n            success := and(and(success, gt(returndatasize(), 0x1f)), lt(mload(0x00), 0x100))\n            decimals := mul(success, mload(0x00))\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 approve\n     * @param bubble Behavior switch if the approve 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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/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"},"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol":{"content":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v5.7.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 following https://docs.soliditylang.org/en/v0.8.35/abi-spec.html:\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data> | <zero padding>\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            mstore(add(add(ptr, 0x64), length), 0)\n\n            // round up the length to the next multiple of 32 bytes to ensure that the calldata is properly padded\n            length := shl(5, shr(5, add(length, 0x1F)))\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 following https://docs.soliditylang.org/en/v0.8.35/abi-spec.html:\n            // [ 0x00 - 0x03 ] <selector>\n            // [ 0x04 - 0x23 ] <hash>\n            // [ 0x24 - 0x43 ] <signature offset> (0x40)\n            // [ 0x44 - 0x63 ] <signature length>\n            // [ 0x64 - ...  ] <signature data> | <zero padding>\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            mstore(add(add(ptr, 0x64), length), 0)\n\n            // round up the length to the next multiple of 32 bytes to ensure that the calldata is properly padded\n            length := shl(5, shr(5, add(length, 0x1F)))\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"},"lib/openzeppelin-contracts/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":{"viaIR":false,"metadata":{"appendCBOR":true,"bytecodeHash":"none","useLiteralContent":false},"libraries":{},"optimizer":{"runs":200,"enabled":true},"evmVersion":"cancun","remappings":["@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/","forge-std/=lib/forge-std/src/","solmate/=lib/solmate/","v4-core/=lib/v4-core/","@ensdomains/=lib/v4-core/node_modules/@ensdomains/","@openzeppelin/=lib/v4-core/lib/openzeppelin-contracts/","ds-test/=lib/v4-core/lib/forge-std/lib/ds-test/src/","hardhat/=lib/v4-core/node_modules/hardhat/","openzeppelin-contracts/=lib/openzeppelin-contracts/"]}},"stdJsonOutput":{"sources":{"src/Intake.sol":{"id":26},"lib/openzeppelin-contracts/contracts/utils/Bytes.sol":{"id":12},"lib/openzeppelin-contracts/contracts/utils/Panic.sol":{"id":14},"lib/openzeppelin-contracts/contracts/utils/Context.sol":{"id":13},"lib/openzeppelin-contracts/contracts/utils/Strings.sol":{"id":17},"lib/openzeppelin-contracts/contracts/access/Ownable.sol":{"id":0},"lib/openzeppelin-contracts/contracts/utils/math/Math.sol":{"id":23},"lib/openzeppelin-contracts/contracts/interfaces/IERC20.sol":{"id":5},"lib/openzeppelin-contracts/contracts/utils/StorageSlot.sol":{"id":16},"lib/openzeppelin-contracts/contracts/interfaces/IERC165.sol":{"id":4},"lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol":{"id":9},"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol":{"id":15},"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol":{"id":1},"lib/openzeppelin-contracts/contracts/interfaces/IERC1271.sol":{"id":2},"lib/openzeppelin-contracts/contracts/interfaces/IERC1363.sol":{"id":3},"lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol":{"id":7},"lib/openzeppelin-contracts/contracts/interfaces/IERC7913.sol":{"id":8},"lib/openzeppelin-contracts/contracts/utils/math/SafeCast.sol":{"id":24},"lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol":{"id":25},"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol":{"id":18},"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol":{"id":6},"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol":{"id":19},"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol":{"id":11},"lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol":{"id":22},"lib/openzeppelin-contracts/contracts/utils/cryptography/MessageHashUtils.sol":{"id":20},"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol":{"id":21},"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol":{"id":10}},"contracts":{"src/Intake.sol":{"Intake":{"abi":[{"type":"constructor","inputs":[{"name":"owner_","type":"address","internalType":"address"},{"name":"payTo_","type":"address","internalType":"address"},{"name":"writer_","type":"address","internalType":"address"},{"name":"signer_","type":"address","internalType":"address"}],"stateMutability":"nonpayable"},{"name":"ActionNotSold","type":"error","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"}]},{"name":"AlreadyCompleted","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}]},{"name":"BadQuoteSignature","type":"error","inputs":[]},{"name":"BodyTooLong","type":"error","inputs":[{"name":"length","type":"uint256","internalType":"uint256"}]},{"name":"CallbackGasShort","type":"error","inputs":[{"name":"needed","type":"uint256","internalType":"uint256"},{"name":"left","type":"uint256","internalType":"uint256"}]},{"name":"EmptyBody","type":"error","inputs":[]},{"name":"FailureArgsMismatch","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"},{"name":"status","type":"uint8","internalType":"uint8"}]},{"name":"FailureHookWithoutTarget","type":"error","inputs":[]},{"name":"ForwardFailed","type":"error","inputs":[]},{"name":"InvalidShortString","type":"error","inputs":[]},{"name":"NotWriter","type":"error","inputs":[]},{"name":"OwnableInvalidOwner","type":"error","inputs":[{"name":"owner","type":"address","internalType":"address"}]},{"name":"OwnableUnauthorizedAccount","type":"error","inputs":[{"name":"account","type":"address","internalType":"address"}]},{"name":"PriceNotMet","type":"error","inputs":[{"name":"price","type":"uint256","internalType":"uint256"},{"name":"amount","type":"uint256","internalType":"uint256"}]},{"name":"QuoteAlreadyPaid","type":"error","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"}]},{"name":"QuoteExpired","type":"error","inputs":[{"name":"expiresAt","type":"uint64","internalType":"uint64"}]},{"name":"SafeERC20FailedOperation","type":"error","inputs":[{"name":"token","type":"address","internalType":"address"}]},{"name":"StringTooLong","type":"error","inputs":[{"name":"str","type":"string","internalType":"string"}]},{"name":"UnknownRequest","type":"error","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}]},{"name":"WrongValue","type":"error","inputs":[{"name":"expected","type":"uint256","internalType":"uint256"},{"name":"sent","type":"uint256","internalType":"uint256"}]},{"name":"ZeroAddress","type":"error","inputs":[]},{"name":"CallbackGasSet","type":"event","inputs":[{"name":"gas","type":"uint64","indexed":false,"internalType":"uint64"}],"anonymous":false},{"name":"Completed","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"status","type":"uint8","indexed":false,"internalType":"uint8"},{"name":"resultHash","type":"bytes32","indexed":false,"internalType":"bytes32"},{"name":"uri","type":"string","indexed":false,"internalType":"string"},{"name":"delivered","type":"bool","indexed":false,"internalType":"bool"}],"anonymous":false},{"name":"EIP712DomainChanged","type":"event","inputs":[],"anonymous":false},{"name":"FailureHookSet","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"selector","type":"bytes4","indexed":false,"internalType":"bytes4"}],"anonymous":false},{"name":"OwnershipTransferStarted","type":"event","inputs":[{"name":"previousOwner","type":"address","indexed":true,"internalType":"address"},{"name":"newOwner","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"OwnershipTransferred","type":"event","inputs":[{"name":"previousOwner","type":"address","indexed":true,"internalType":"address"},{"name":"newOwner","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"Paid","type":"event","inputs":[{"name":"quoteHash","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"payer","type":"address","indexed":true,"internalType":"address"},{"name":"asset","type":"address","indexed":false,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"PayToSet","type":"event","inputs":[{"name":"payTo","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"PriceSet","type":"event","inputs":[{"name":"action","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"asset","type":"address","indexed":true,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"Requested","type":"event","inputs":[{"name":"requestId","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"payer","type":"address","indexed":true,"internalType":"address"},{"name":"action","type":"bytes32","indexed":true,"internalType":"bytes32"},{"name":"body","type":"bytes","indexed":false,"internalType":"bytes"},{"name":"callbackTarget","type":"address","indexed":false,"internalType":"address"},{"name":"callbackSelector","type":"bytes4","indexed":false,"internalType":"bytes4"},{"name":"asset","type":"address","indexed":false,"internalType":"address"},{"name":"amount","type":"uint256","indexed":false,"internalType":"uint256"}],"anonymous":false},{"name":"SignerSet","type":"event","inputs":[{"name":"signer","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"WriterSet","type":"event","inputs":[{"name":"writer","type":"address","indexed":true,"internalType":"address"}],"anonymous":false},{"name":"MAX_BODY_BYTES","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"QUOTE_TYPEHASH","type":"function","inputs":[],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"acceptOwnership","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"callbackGas","type":"function","inputs":[],"outputs":[{"name":"","type":"uint64","internalType":"uint64"}],"stateMutability":"view"},{"name":"complete","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"},{"name":"status","type":"uint8","internalType":"uint8"},{"name":"resultHash","type":"bytes32","internalType":"bytes32"},{"name":"uri","type":"string","internalType":"string"},{"name":"args","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":"failureSelectorOf","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"selector","type":"bytes4","internalType":"bytes4"}],"stateMutability":"view"},{"name":"nonce","type":"function","inputs":[],"outputs":[{"name":"","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"owner","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"paidQuotes","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"paid","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"pay","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"},{"name":"expiresAt","type":"uint64","internalType":"uint64"},{"name":"signature","type":"bytes","internalType":"bytes"}],"outputs":[],"stateMutability":"payable"},{"name":"payTo","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"pendingOwner","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"priceOf","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"}],"outputs":[{"name":"amount","type":"uint256","internalType":"uint256"}],"stateMutability":"view"},{"name":"quoteDigest","type":"function","inputs":[{"name":"quoteHash","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"},{"name":"expiresAt","type":"uint64","internalType":"uint64"}],"outputs":[{"name":"","type":"bytes32","internalType":"bytes32"}],"stateMutability":"view"},{"name":"renounceOwnership","type":"function","inputs":[],"outputs":[],"stateMutability":"nonpayable"},{"name":"request","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"body","type":"bytes","internalType":"bytes"},{"name":"callback","type":"tuple","components":[{"name":"target","type":"address","internalType":"address"},{"name":"selector","type":"bytes4","internalType":"bytes4"}],"internalType":"struct Intake.Callback"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"payable"},{"name":"requestWithFailure","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"body","type":"bytes","internalType":"bytes"},{"name":"callback","type":"tuple","components":[{"name":"target","type":"address","internalType":"address"},{"name":"selector","type":"bytes4","internalType":"bytes4"}],"internalType":"struct Intake.Callback"},{"name":"onFailure","type":"bytes4","internalType":"bytes4"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"stateMutability":"payable"},{"name":"requests","type":"function","inputs":[{"name":"requestId","type":"bytes32","internalType":"bytes32"}],"outputs":[{"name":"payer","type":"address","internalType":"address"},{"name":"callbackTarget","type":"address","internalType":"address"},{"name":"callbackSelector","type":"bytes4","internalType":"bytes4"},{"name":"completed","type":"bool","internalType":"bool"}],"stateMutability":"view"},{"name":"setCallbackGas","type":"function","inputs":[{"name":"gas","type":"uint64","internalType":"uint64"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setPayTo","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setPrice","type":"function","inputs":[{"name":"action","type":"bytes32","internalType":"bytes32"},{"name":"asset","type":"address","internalType":"address"},{"name":"amount","type":"uint256","internalType":"uint256"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setSigner","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"setWriter","type":"function","inputs":[{"name":"to","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"signer","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"},{"name":"transferOwnership","type":"function","inputs":[{"name":"newOwner","type":"address","internalType":"address"}],"outputs":[],"stateMutability":"nonpayable"},{"name":"writer","type":"function","inputs":[],"outputs":[{"name":"","type":"address","internalType":"address"}],"stateMutability":"view"}],"metadata":"{\"compiler\":{\"version\":\"0.8.26+commit.8a97fa7a\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"owner_\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"payTo_\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"writer_\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"signer_\",\"type\":\"address\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"}],\"name\":\"ActionNotSold\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"name\":\"AlreadyCompleted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"BadQuoteSignature\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"length\",\"type\":\"uint256\"}],\"name\":\"BodyTooLong\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"needed\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"left\",\"type\":\"uint256\"}],\"name\":\"CallbackGasShort\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EmptyBody\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"},{\"internalType\":\"uint8\",\"name\":\"status\",\"type\":\"uint8\"}],\"name\":\"FailureArgsMismatch\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailureHookWithoutTarget\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ForwardFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidShortString\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotWriter\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"owner\",\"type\":\"address\"}],\"name\":\"OwnableInvalidOwner\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"OwnableUnauthorizedAccount\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"price\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"PriceNotMet\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"quoteHash\",\"type\":\"bytes32\"}],\"name\":\"QuoteAlreadyPaid\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint64\",\"name\":\"expiresAt\",\"type\":\"uint64\"}],\"name\":\"QuoteExpired\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"token\",\"type\":\"address\"}],\"name\":\"SafeERC20FailedOperation\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"string\",\"name\":\"str\",\"type\":\"string\"}],\"name\":\"StringTooLong\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"name\":\"UnknownRequest\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"expected\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"sent\",\"type\":\"uint256\"}],\"name\":\"WrongValue\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ZeroAddress\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"gas\",\"type\":\"uint64\"}],\"name\":\"CallbackGasSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"uint8\",\"name\":\"status\",\"type\":\"uint8\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"resultHash\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"uri\",\"type\":\"string\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"delivered\",\"type\":\"bool\"}],\"name\":\"Completed\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[],\"name\":\"EIP712DomainChanged\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"bytes4\",\"name\":\"selector\",\"type\":\"bytes4\"}],\"name\":\"FailureHookSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"previousOwner\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newOwner\",\"type\":\"address\"}],\"name\":\"OwnershipTransferStarted\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"previousOwner\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newOwner\",\"type\":\"address\"}],\"name\":\"OwnershipTransferred\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"quoteHash\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"payer\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"Paid\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"payTo\",\"type\":\"address\"}],\"name\":\"PayToSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"PriceSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"payer\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"body\",\"type\":\"bytes\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"callbackTarget\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"bytes4\",\"name\":\"callbackSelector\",\"type\":\"bytes4\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"Requested\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"signer\",\"type\":\"address\"}],\"name\":\"SignerSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"writer\",\"type\":\"address\"}],\"name\":\"WriterSet\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"MAX_BODY_BYTES\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"QUOTE_TYPEHASH\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"acceptOwnership\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"callbackGas\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"\",\"type\":\"uint64\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"},{\"internalType\":\"uint8\",\"name\":\"status\",\"type\":\"uint8\"},{\"internalType\":\"bytes32\",\"name\":\"resultHash\",\"type\":\"bytes32\"},{\"internalType\":\"string\",\"name\":\"uri\",\"type\":\"string\"},{\"internalType\":\"bytes\",\"name\":\"args\",\"type\":\"bytes\"}],\"name\":\"complete\",\"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\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"name\":\"failureSelectorOf\",\"outputs\":[{\"internalType\":\"bytes4\",\"name\":\"selector\",\"type\":\"bytes4\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"nonce\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"quoteHash\",\"type\":\"bytes32\"}],\"name\":\"paidQuotes\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"paid\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"quoteHash\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"},{\"internalType\":\"uint64\",\"name\":\"expiresAt\",\"type\":\"uint64\"},{\"internalType\":\"bytes\",\"name\":\"signature\",\"type\":\"bytes\"}],\"name\":\"pay\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"payTo\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"pendingOwner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"}],\"name\":\"priceOf\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"quoteHash\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"},{\"internalType\":\"uint64\",\"name\":\"expiresAt\",\"type\":\"uint64\"}],\"name\":\"quoteDigest\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"renounceOwnership\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"internalType\":\"bytes\",\"name\":\"body\",\"type\":\"bytes\"},{\"components\":[{\"internalType\":\"address\",\"name\":\"target\",\"type\":\"address\"},{\"internalType\":\"bytes4\",\"name\":\"selector\",\"type\":\"bytes4\"}],\"internalType\":\"struct Intake.Callback\",\"name\":\"callback\",\"type\":\"tuple\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"request\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"internalType\":\"bytes\",\"name\":\"body\",\"type\":\"bytes\"},{\"components\":[{\"internalType\":\"address\",\"name\":\"target\",\"type\":\"address\"},{\"internalType\":\"bytes4\",\"name\":\"selector\",\"type\":\"bytes4\"}],\"internalType\":\"struct Intake.Callback\",\"name\":\"callback\",\"type\":\"tuple\"},{\"internalType\":\"bytes4\",\"name\":\"onFailure\",\"type\":\"bytes4\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"requestWithFailure\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"requestId\",\"type\":\"bytes32\"}],\"name\":\"requests\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"payer\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"callbackTarget\",\"type\":\"address\"},{\"internalType\":\"bytes4\",\"name\":\"callbackSelector\",\"type\":\"bytes4\"},{\"internalType\":\"bool\",\"name\":\"completed\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint64\",\"name\":\"gas\",\"type\":\"uint64\"}],\"name\":\"setCallbackGas\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"}],\"name\":\"setPayTo\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"action\",\"type\":\"bytes32\"},{\"internalType\":\"address\",\"name\":\"asset\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"name\":\"setPrice\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"}],\"name\":\"setSigner\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"to\",\"type\":\"address\"}],\"name\":\"setWriter\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"signer\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newOwner\",\"type\":\"address\"}],\"name\":\"transferOwnership\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"writer\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"details\":\"Deployed through CREATE2 with the same salt and constructor arguments on every chain, so the address a contract author stores is the same everywhere. An `action` whose price is zero is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the price list, the treasury or the writer with it.\",\"errors\":{\"OwnableInvalidOwner(address)\":[{\"details\":\"The owner is not a valid owner account. (eg. `address(0)`)\"}],\"OwnableUnauthorizedAccount(address)\":[{\"details\":\"The caller account is not authorized to perform an operation.\"}],\"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\":{\"acceptOwnership()\":{\"details\":\"The new owner accepts the ownership transfer.\"},\"complete(bytes32,uint8,bytes32,string,bytes)\":{\"params\":{\"args\":\"The callback's arguments, ABI-encoded without the selector. The shape is the action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`, and its first two words must be this request and this status; empty, the failure function is not called.\",\"resultHash\":\"The hash of the document `uri` serves; zero when there is none.\",\"status\":\"0 when the work produced a result, 1 when the plane refused the ask, 2 when the work ended without a result (a panel that disagreed, a job that failed).\"}},\"eip712Domain()\":{\"details\":\"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature.\"},\"owner()\":{\"details\":\"Returns the address of the current owner.\"},\"pendingOwner()\":{\"details\":\"Returns the address of the pending owner.\"},\"renounceOwnership()\":{\"details\":\"Leaves the contract without owner. It will not be possible to call `onlyOwner` functions. Can only be called by the current owner. NOTE: Renouncing ownership will leave the contract without an owner, thereby disabling any functionality that is only available to the owner.\"},\"request(bytes32,bytes,(address,bytes4),address,uint256)\":{\"params\":{\"action\":\"The paid action and its version as one right-padded string: the action, an at sign, the version.\",\"amount\":\"The amount paid; at least the price. Whatever is paid is forwarded whole.\",\"asset\":\"The asset paid in; `address(0)` is the native coin, sent as `msg.value`.\",\"body\":\"The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.\",\"callback\":\"Where the result goes; a zero target means nowhere on chain.\"}},\"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)\":{\"params\":{\"onFailure\":\"The selector of `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)` on `callback.target`.\"}},\"transferOwnership(address)\":{\"details\":\"Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one. Can only be called by the current owner. Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer.\"}},\"stateVariables\":{\"CALLBACK_RESERVE\":{\"details\":\"Gas kept back for the rest of `complete` once the callback returns: the event and the call's own overhead.\"},\"MAX_BODY_BYTES\":{\"details\":\"The largest body accepted, in bytes. A job draft is a few kilobytes; a request that needs more carries a pointer in the body instead.\"}},\"title\":\"The swarm's door on a chain: one transaction buys work\",\"version\":1},\"userdoc\":{\"events\":{\"FailureHookSet(bytes32,bytes4)\":{\"notice\":\"Emitted beside `Requested` by `requestWithFailure`: the function the target is called on when the request is refused or fails.\"}},\"kind\":\"user\",\"methods\":{\"callbackGas()\":{\"notice\":\"The gas a callback is given. Fixed so a hostile target costs a known amount.\"},\"complete(bytes32,uint8,bytes32,string,bytes)\":{\"notice\":\"Records what became of a request and calls its callback once, if it named one: the result's function on status 0, the failure's on any other status.\"},\"failureSelectorOf(bytes32)\":{\"notice\":\"The callback target's function for a refusal or a failure; zero when the request named none. Kept apart from `requests` so that getter reads as it did in version 1.\"},\"pay(bytes32,address,uint256,uint64,bytes)\":{\"notice\":\"Settles a quote the plane made off chain. The plane signed these exact terms.\"},\"payTo()\":{\"notice\":\"Where every payment goes, in the same call that made it.\"},\"priceOf(bytes32,address)\":{\"notice\":\"Price per action and asset; zero means the action is not sold in that asset here. The native coin is `address(0)`.\"},\"quoteDigest(bytes32,address,uint256,uint64)\":{\"notice\":\"The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms.\"},\"request(bytes32,bytes,(address,bytes4),address,uint256)\":{\"notice\":\"Buys one action with the ask on chain. Reverts below the action's price.\"},\"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)\":{\"notice\":\"`request`, and a function on the callback's target to call if the ask is refused or the work ends without a result. The target is the callback's; a zero `onFailure` is `request`.\"},\"signer()\":{\"notice\":\"The key the plane signs off-chain quotes with, checked by `pay`.\"},\"writer()\":{\"notice\":\"The plane's writer: the only caller of `complete`.\"}},\"notice\":\"A payer sends the price, the ask and, if it wants one, a contract and function to call with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same call, and what it keeps is a record of who asked and where the answer goes. Two ways in: - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid   action and its version as one right-padded string, the action, an at sign and the version   (`oracle.request`, `oracle-1`); `body` is the   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here   for that action and asset, so a short payment reverts instead of landing in `payTo`. - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a   wrong asset, a short amount or a stale quote reverts too. The body travels in the `Requested` event, whole. A contract that calls `request` from inside its own function is the usual caller, and its transaction's input is that function, not this one; the event is the one place the body can be read back from whoever sent it. One way out. When the work ends the plane's writer calls `complete`, which records the result hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend inside a try. A callback that reverts or runs out of gas cannot block the write and costs the network nothing beyond that stipend; the result is still readable by the request's transaction. A request made with `requestWithFailure` also names a second function on the same target, called the same way when the plane refused the ask or the work ended without a result: `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`. The payer commits to that selector in its own call, so the writer can never choose which of the payer's functions it reaches; it supplies only the arguments, and the contract checks that they name this request and this status. Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a service written for version 1 works against this one at its new address; `requestWithFailure`, `failureSelectorOf` and `FailureHookSet` are what is new.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/Intake.sol\":\"Intake\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"none\"},\"optimizer\":{\"enabled\":true,\"runs\":200},\"remappings\":[\":@ensdomains/=lib/v4-core/node_modules/@ensdomains/\",\":@openzeppelin/=lib/v4-core/lib/openzeppelin-contracts/\",\":@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/\",\":ds-test/=lib/v4-core/lib/forge-std/lib/ds-test/src/\",\":forge-std/=lib/forge-std/src/\",\":hardhat/=lib/v4-core/node_modules/hardhat/\",\":openzeppelin-contracts/=lib/openzeppelin-contracts/\",\":solmate/=lib/solmate/\",\":v4-core/=lib/v4-core/\"]},\"sources\":{\"lib/openzeppelin-contracts/contracts/access/Ownable.sol\":{\"keccak256\":\"0xff6d0bb2e285473e5311d9d3caacb525ae3538a80758c10649a4d61029b017bb\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://8ed324d3920bb545059d66ab97d43e43ee85fd3bd52e03e401f020afb0b120f6\",\"dweb:/ipfs/QmfEckWLmZkDDcoWrkEvMWhms66xwTLff9DDhegYpvHo1a\"]},\"lib/openzeppelin-contracts/contracts/access/Ownable2Step.sol\":{\"keccak256\":\"0xdcad8898fda432696597752e8ec361b87d85c82cb258115427af006dacf7128c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://e2c9d517f0c136d54bd00cd57959d25681d4d6273f5bbbc263afe228303772f0\",\"dweb:/ipfs/QmReNFjXBiufByiAAzfSQ2SM5r3qeUErn46BmN3yVRvrek\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC1271.sol\":{\"keccak256\":\"0x66c7ec42c6c43712be2107a50ab4529379bc76a632b425babec698d9da921ac6\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://dce2778f0b638adfc5ba29c2c618c855fe725fa74a16846386aa1d56a834aa04\",\"dweb:/ipfs/QmPV9oWnzQdi58od266j62xvviavLNHqKLZfm6k2K1qy9E\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC1363.sol\":{\"keccak256\":\"0xd5ea07362ab630a6a3dee4285a74cf2377044ca2e4be472755ad64d7c5d4b69d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://da5e832b40fc5c3145d3781e2e5fa60ac2052c9d08af7e300dc8ab80c4343100\",\"dweb:/ipfs/QmTzf7N5ZUdh5raqtzbM11yexiUoLC9z3Ws632MCuycq1d\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC165.sol\":{\"keccak256\":\"0x0afcb7e740d1537b252cb2676f600465ce6938398569f09ba1b9ca240dde2dfc\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1c299900ac4ec268d4570ecef0d697a3013cd11a6eb74e295ee3fbc945056037\",\"dweb:/ipfs/Qmab9owJoxcA7vJT5XNayCMaUR1qxqj1NDzzisduwaJMcZ\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC20.sol\":{\"keccak256\":\"0x1a6221315ce0307746c2c4827c125d821ee796c74a676787762f4778671d4f44\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1bb2332a7ee26dd0b0de9b7fe266749f54820c99ab6a3bcb6f7e6b751d47ee2d\",\"dweb:/ipfs/QmcRWpaBeCYkhy68PR3B4AgD7asuQk7PwkWxrvJbZcikLF\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC20Metadata.sol\":{\"keccak256\":\"0xd735962e3d6660884153ba8a972b5f100dde4c482f2ff1c525ba7fdefb154cbd\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://5a264d17b093f585844b0d977e9f60555b8c8d6513b304fde863cdf652a0d336\",\"dweb:/ipfs/QmWXfaJisjVnrjTUjZGryZpMob9wKivvtbodLS3PTc1ttq\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol\":{\"keccak256\":\"0xfb223a85dd0b2175cfbbaa325a744e2cd74ecd17c3df2b77b0722f991d2725ee\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://84bf1dea0589ec49c8d15d559cc6d86ee493048a89b2d4adb60fbe705a3d89ae\",\"dweb:/ipfs/Qmd56n556d529wk2pRMhYhm5nhMDhviwereodDikjs68w1\"]},\"lib/openzeppelin-contracts/contracts/interfaces/IERC7913.sol\":{\"keccak256\":\"0xe5a126930df1d54e4a6dd5fea09010c4a7db0ea974c6c17a1e6082879f5a032b\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://2f58f5a90328536a6c68289916bfa4ed653d871319c7b2a416ab3f6263c4f2f5\",\"dweb:/ipfs/Qmaa9DmgUA16Urz5fuF4RbFz2NaVpNLV41ddwykSdasFUd\"]},\"lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol\":{\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://5282825a626cfe924e504274b864a652b0023591fa66f06a067b25b51ba9b303\",\"dweb:/ipfs/QmeCfPykghhMc81VJTrHTC7sF6CRvaA1FXVq2pJhwYp1dV\"]},\"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\":{\"keccak256\":\"0xd6fa4088198f04eef10c5bce8a2f4d60554b7ec4b987f684393c01bf79b94d9f\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://f95ee0bbd4dd3ac730d066ba3e785ded4565e890dbec2fa7d3b9fe3bad9d0d6e\",\"dweb:/ipfs/QmSLr6bHkPFWT7ntj34jmwfyskpwo97T9jZUrk5sz3sdtR\"]},\"lib/openzeppelin-contracts/contracts/token/ERC20/utils/SafeERC20.sol\":{\"keccak256\":\"0x318ea37780610ca7808852275651885d428669402b81488cb7434fde361e9704\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://4aad80ad93cedad85619900fd7c2084c4d2f4b28f1dbda27e491c5f4fd31025d\",\"dweb:/ipfs/QmUyXtX7FUi2u1W5fs7ufka9XkRVb5ss2menQHTsrsSmqZ\"]},\"lib/openzeppelin-contracts/contracts/utils/Bytes.sol\":{\"keccak256\":\"0xa34f1a24f9138bd6bafa5b6cf5d513a45097266204caa1b3e5038e728bfe45b4\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://4dc3d6b3593089cd12d1919d7515e2ff1f8a08a88705bd52421c5be8573a0c0c\",\"dweb:/ipfs/QmTCFpJfm75KqM23LA2iiJS53cSfRqpnUqdx7XSfUNE851\"]},\"lib/openzeppelin-contracts/contracts/utils/Context.sol\":{\"keccak256\":\"0x493033a8d1b176a037b2cc6a04dad01a5c157722049bbecf632ca876224dd4b2\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://6a708e8a5bdb1011c2c381c9a5cfd8a9a956d7d0a9dc1bd8bcdaf52f76ef2f12\",\"dweb:/ipfs/Qmax9WHBnVsZP46ZxEMNRQpLQnrdE4dK8LehML1Py8FowF\"]},\"lib/openzeppelin-contracts/contracts/utils/Panic.sol\":{\"keccak256\":\"0xf7fe324703a64fc51702311dc51562d5cb1497734f074e4f483bfb6717572d7a\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c6a5ff4f9fd8649b7ee20800b7fa387d3465bd77cf20c2d1068cd5c98e1ed57a\",\"dweb:/ipfs/QmVSaVJf9FXFhdYEYeCEfjMVHrxDh5qL4CGkxdMWpQCrqG\"]},\"lib/openzeppelin-contracts/contracts/utils/ShortStrings.sol\":{\"keccak256\":\"0x818c1d828c45953bff1ff6e2714d6d41f8f731f9fc3ed15005af0ac881510f30\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://0dbc15dd325807c5c987010d6389e0f798b45078c70fc1cd28c3e9f47cb3d54a\",\"dweb:/ipfs/QmeRXMqW9M3Wjb5SoiGWiyuWvjfxX3PxdXgqGRrt94gnu3\"]},\"lib/openzeppelin-contracts/contracts/utils/StorageSlot.sol\":{\"keccak256\":\"0xcf74f855663ce2ae00ed8352666b7935f6cddea2932fdf2c3ecd30a9b1cd0e97\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://9f660b1f351b757dfe01438e59888f31f33ded3afcf5cb5b0d9bf9aa6f320a8b\",\"dweb:/ipfs/QmarDJ5hZEgBtCmmrVzEZWjub9769eD686jmzb2XpSU1cM\"]},\"lib/openzeppelin-contracts/contracts/utils/Strings.sol\":{\"keccak256\":\"0x1fdc2de9585ab0f1c417f02a873a2b6343cd64bb7ffec6b00ffa11a4a158d9e8\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1ab223a3d969c6cd7610049431dd42740960c477e45878f5d8b54411f7a32bdc\",\"dweb:/ipfs/QmWumhjvhpKcwx3vDPQninsNVTc3BGvqaihkQakFkQYpaS\"]},\"lib/openzeppelin-contracts/contracts/utils/cryptography/ECDSA.sol\":{\"keccak256\":\"0x00de000d6004a92cb99f62dd6956c579551d805705122ef05fbd23bef039825b\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://4f4885442b527dd1275ea99497bca0cb2b824202f69b22804d0fe48ad8cf3f48\",\"dweb:/ipfs/QmVfiqEhA9vE8Z6486Hs6YRbDqzokVfKxUJqwrvnFZhHeW\"]},\"lib/openzeppelin-contracts/contracts/utils/cryptography/EIP712.sol\":{\"keccak256\":\"0xd52a80195641d334b966a1fc02714cda8921cc260d6a6a6943e622cf878236a8\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://0b62842b2567a83ff4a1628c024a08fad9213b8d54adafb70aebf4eb8a9c682d\",\"dweb:/ipfs/QmPLyXphSjENSt2TVitFQtasj35eDNuqgHYMZS9N3R8Svo\"]},\"lib/openzeppelin-contracts/contracts/utils/cryptography/MessageHashUtils.sol\":{\"keccak256\":\"0x6d8579873b9650426bfbd2a754092d1725049ca05e4e3c8c2c82dd9f3453129d\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://1fa3127a8968d55096d37124a9e212013af112affa5e30b84a1d22263c31576c\",\"dweb:/ipfs/QmetxaVcn5Q6nkpF9yXzaxPQ7d3rgrhV13sTH9BgiuzGJL\"]},\"lib/openzeppelin-contracts/contracts/utils/cryptography/SignatureChecker.sol\":{\"keccak256\":\"0x2e1d7ed1e9e028f05cfddb7979f38557ae26732446e60fd5db1d17894a3da7a4\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://e24f1135137d3e7a0d9464a2258599d360eb8631c7f999c303fd63275ef36109\",\"dweb:/ipfs/QmebV3GXEUqYBFirsUhoULPF7Tc2bvAvFEafkU2wwWjMHf\"]},\"lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol\":{\"keccak256\":\"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://971f954442df5c2ef5b5ebf1eb245d7105d9fbacc7386ee5c796df1d45b21617\",\"dweb:/ipfs/QmadRjHbkicwqwwh61raUEapaVEtaLMcYbQZWs9gUkgj3u\"]},\"lib/openzeppelin-contracts/contracts/utils/math/Math.sol\":{\"keccak256\":\"0x59973a93b1f983f94e10529f46ca46544a9fec2b5f56fb1390bbe9e0dc79f857\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://c55ef8f0b9719790c2ae6f81d80a59ffb89f2f0abe6bc065585bd79edce058c5\",\"dweb:/ipfs/QmNNmCbX9NjPXKqHJN8R1WC2rNeZSQrPZLd6FF6AKLyH5Y\"]},\"lib/openzeppelin-contracts/contracts/utils/math/SafeCast.sol\":{\"keccak256\":\"0xc8cae21c9ae4a46e5162ff9bf5b351d6fa6a6eba72d515f3bc1bdfeda7fdf083\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://ce830ebcf28e31643caba318996db3763c36d52cd0f23798ba83c135355d45e9\",\"dweb:/ipfs/QmdGPcvptHN7UBCbUYBbRX3hiRVRFLRwno8b4uga6uFNif\"]},\"lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol\":{\"keccak256\":\"0xb1970fac7b64e6c09611e6691791e848d5e3fe410fa5899e7df2e0afd77a99e3\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://db5fbb3dddd8b7047465b62575d96231ba8a2774d37fb4737fbf23340fabbb03\",\"dweb:/ipfs/QmVUSvooZKEdEdap619tcJjTLcAuH6QBdZqAzWwnAXZAWJ\"]},\"src/Intake.sol\":{\"keccak256\":\"0x1f23e11b662626c773b9db92485c89e542f1889e4bdfdf6b431b522d208a7685\",\"license\":\"MIT\",\"urls\":[\"bzz-raw://38a952b03fb957068ca54fe7c8a8b3b0d0e9e0086b330aab064027586d5f9c84\",\"dweb:/ipfs/QmZh4ia4WfS8by45GXgLLKw3WcBu4ZkoaLoyMSe8uXMXHL\"]}},\"version\":1}","userdoc":{"kind":"user","events":{"FailureHookSet(bytes32,bytes4)":{"notice":"Emitted beside `Requested` by `requestWithFailure`: the function the target is called on when the request is refused or fails."}},"notice":"A payer sends the price, the ask and, if it wants one, a contract and function to call with the result. The contract holds nothing: every payment is forwarded to `payTo` in the same call, and what it keeps is a record of who asked and where the answer goes. Two ways in: - `request(action, body, callback, asset, amount)` carries the whole ask. `action` names a paid   action and its version as one right-padded string, the action, an at sign and the version   (`oracle.request`, `oracle-1`); `body` is the   same JSON the HTTP door takes for that action, as UTF-8 bytes. The price is the one set here   for that action and asset, so a short payment reverts instead of landing in `payTo`. - `pay(quoteHash, asset, amount, expiresAt, signature)` settles an ask that was quoted off   chain, for a body a human wrote. The plane signed the terms; the contract checks them, so a   wrong asset, a short amount or a stale quote reverts too. The body travels in the `Requested` event, whole. A contract that calls `request` from inside its own function is the usual caller, and its transaction's input is that function, not this one; the event is the one place the body can be read back from whoever sent it. One way out. When the work ends the plane's writer calls `complete`, which records the result hash and its URL and, when the request named a callback, calls it once with a fixed gas stipend inside a try. A callback that reverts or runs out of gas cannot block the write and costs the network nothing beyond that stipend; the result is still readable by the request's transaction. A request made with `requestWithFailure` also names a second function on the same target, called the same way when the plane refused the ask or the work ended without a result: `onFailure(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`. The payer commits to that selector in its own call, so the writer can never choose which of the payer's functions it reaches; it supplies only the arguments, and the contract checks that they name this request and this status. Version 2. Every function, event and getter of version 1 is here unchanged, so a contract or a service written for version 1 works against this one at its new address; `requestWithFailure`, `failureSelectorOf` and `FailureHookSet` are what is new.","methods":{"payTo()":{"notice":"Where every payment goes, in the same call that made it."},"signer()":{"notice":"The key the plane signs off-chain quotes with, checked by `pay`."},"writer()":{"notice":"The plane's writer: the only caller of `complete`."},"callbackGas()":{"notice":"The gas a callback is given. Fixed so a hostile target costs a known amount."},"priceOf(bytes32,address)":{"notice":"Price per action and asset; zero means the action is not sold in that asset here. The native coin is `address(0)`."},"failureSelectorOf(bytes32)":{"notice":"The callback target's function for a refusal or a failure; zero when the request named none. Kept apart from `requests` so that getter reads as it did in version 1."},"pay(bytes32,address,uint256,uint64,bytes)":{"notice":"Settles a quote the plane made off chain. The plane signed these exact terms."},"quoteDigest(bytes32,address,uint256,uint64)":{"notice":"The EIP-712 digest the plane signs for `pay`: this chain, this contract, these terms."},"complete(bytes32,uint8,bytes32,string,bytes)":{"notice":"Records what became of a request and calls its callback once, if it named one: the result's function on status 0, the failure's on any other status."},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"notice":"Buys one action with the ask on chain. Reverts below the action's price."},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"notice":"`request`, and a function on the callback's target to call if the ask is refused or the work ends without a result. The target is the callback's; a zero `onFailure` is `request`."}},"version":1},"devdoc":{"kind":"dev","title":"The swarm's door on a chain: one transaction buys work","errors":{"OwnableInvalidOwner(address)":[{"details":"The owner is not a valid owner account. (eg. `address(0)`)"}],"SafeERC20FailedOperation(address)":[{"details":"An operation with an ERC-20 token failed."}],"OwnableUnauthorizedAccount(address)":[{"details":"The caller account is not authorized to perform an operation."}]},"events":{"EIP712DomainChanged()":{"details":"MAY be emitted to signal that the domain could have changed."}},"details":"Deployed through CREATE2 with the same salt and constructor arguments on every chain, so the address a contract author stores is the same everywhere. An `action` whose price is zero is not sold: retiring a version is `setPrice(action, asset, 0)`, after which a stale caller loses gas and nothing else. Ownership moves in two steps, so a mistyped owner cannot take the price list, the treasury or the writer with it.","methods":{"owner()":{"details":"Returns the address of the current owner."},"eip712Domain()":{"details":"returns the fields and values that describe the domain separator used by this contract for EIP-712 signature."},"pendingOwner()":{"details":"Returns the address of the pending owner."},"acceptOwnership()":{"details":"The new owner accepts the ownership transfer."},"renounceOwnership()":{"details":"Leaves the contract without owner. It will not be possible to call `onlyOwner` functions. Can only be called by the current owner. NOTE: Renouncing ownership will leave the contract without an owner, thereby disabling any functionality that is only available to the owner."},"transferOwnership(address)":{"details":"Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one. Can only be called by the current owner. Setting `newOwner` to the zero address is allowed; this can be used to cancel an initiated ownership transfer."},"complete(bytes32,uint8,bytes32,string,bytes)":{"params":{"args":"The callback's arguments, ABI-encoded without the selector. The shape is the action's: an oracle answer is `(bytes32 requestId, Attestation a, bytes signature)`, a job result is `(bytes32 requestId, bytes32 resultHash, string uri)`. On a refusal or a failure it is `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)`, and its first two words must be this request and this status; empty, the failure function is not called.","status":"0 when the work produced a result, 1 when the plane refused the ask, 2 when the work ended without a result (a panel that disagreed, a job that failed).","resultHash":"The hash of the document `uri` serves; zero when there is none."}},"request(bytes32,bytes,(address,bytes4),address,uint256)":{"params":{"body":"The action's request body, the JSON the HTTP door takes, as UTF-8 bytes.","asset":"The asset paid in; `address(0)` is the native coin, sent as `msg.value`.","action":"The paid action and its version as one right-padded string: the action, an at sign, the version.","amount":"The amount paid; at least the price. Whatever is paid is forwarded whole.","callback":"Where the result goes; a zero target means nowhere on chain."}},"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)":{"params":{"onFailure":"The selector of `(bytes32 requestId, uint8 status, bytes32 reason, uint16 agreed, uint16 answered, bytes signature)` on `callback.target`."}}},"version":1,"stateVariables":{"MAX_BODY_BYTES":{"details":"The largest body accepted, in bytes. A job draft is a few kilobytes; a request that needs more carries a pointer in the body instead."},"CALLBACK_RESERVE":{"details":"Gas kept back for the rest of `complete` once the callback returns: the event and the call's own overhead."}}},"storageLayout":{"types":{"t_bool":{"label":"bool","encoding":"inplace","numberOfBytes":"1"},"t_bytes4":{"label":"bytes4","encoding":"inplace","numberOfBytes":"4"},"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_bytes32,t_bytes4)":{"key":"t_bytes32","label":"mapping(bytes32 => bytes4)","value":"t_bytes4","encoding":"mapping","numberOfBytes":"32"},"t_struct(Request)8513_storage":{"label":"struct Intake.Request","members":[{"slot":"0","type":"t_address","astId":8506,"label":"payer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_address","astId":8508,"label":"callbackTarget","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_bytes4","astId":8510,"label":"callbackSelector","offset":20,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_bool","astId":8512,"label":"completed","offset":24,"contract":"src/Intake.sol:Intake"}],"encoding":"inplace","numberOfBytes":"64"},"t_mapping(t_address,t_uint256)":{"key":"t_address","label":"mapping(address => uint256)","value":"t_uint256","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_bytes32,t_struct(Request)8513_storage)":{"key":"t_bytes32","label":"mapping(bytes32 => struct Intake.Request)","value":"t_struct(Request)8513_storage","encoding":"mapping","numberOfBytes":"32"},"t_mapping(t_bytes32,t_mapping(t_address,t_uint256))":{"key":"t_bytes32","label":"mapping(bytes32 => mapping(address => uint256))","value":"t_mapping(t_address,t_uint256)","encoding":"mapping","numberOfBytes":"32"}},"storage":[{"slot":"0","type":"t_address","astId":8,"label":"_owner","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"1","type":"t_address","astId":156,"label":"_pendingOwner","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"2","type":"t_string_storage","astId":4192,"label":"_nameFallback","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"3","type":"t_string_storage","astId":4194,"label":"_versionFallback","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"4","type":"t_address","astId":8662,"label":"payTo","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"5","type":"t_address","astId":8665,"label":"writer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"6","type":"t_address","astId":8668,"label":"signer","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"6","type":"t_uint64","astId":8672,"label":"callbackGas","offset":20,"contract":"src/Intake.sol:Intake"},{"slot":"7","type":"t_mapping(t_bytes32,t_mapping(t_address,t_uint256))","astId":8679,"label":"priceOf","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"8","type":"t_mapping(t_bytes32,t_struct(Request)8513_storage)","astId":8684,"label":"requests","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"9","type":"t_mapping(t_bytes32,t_bytes4)","astId":8689,"label":"failureSelectorOf","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"10","type":"t_mapping(t_bytes32,t_bool)","astId":8693,"label":"paidQuotes","offset":0,"contract":"src/Intake.sol:Intake"},{"slot":"11","type":"t_uint256","astId":8695,"label":"nonce","offset":0,"contract":"src/Intake.sol:Intake"}]},"transientStorageLayout":null,"evm":{"bytecode":{"object":"61016060405260068054600160a01b600160e01b031916610c3560a61b17905534801561002a575f80fd5b5060405161212538038061212583398101604081905261004991610350565b60408051808201825260118152704964656e746974794d4420496e74616b6560781b602080830191909152825180840190935260018352603160f81b9083015290856001600160a01b0381166100b957604051631e4fbdf760e01b81525f60048201526024015b60405180910390fd5b6100c28161028d565b506100cc826102a9565b610120526100d9816102a9565b61014052815160208084019190912060e052815190820120610100524660a05261016560e05161010051604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201529081019290925260608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b60805250503060c0526001600160a01b038316158061018b57506001600160a01b038216155b8061019d57506001600160a01b038116155b156101bb5760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b038086166001600160a01b031992831681179093556005805486831690841617905560068054918516919092161790556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a26040516001600160a01b038316907f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a26040516001600160a01b038216907f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a2505050506103fc565b600180546001600160a01b03191690556102a6816102e6565b50565b5f80829050601f815111156102d3578260405163305a27a960e01b81526004016100b091906103a1565b80516102de826103d6565b179392505050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b80516001600160a01b038116811461034b575f80fd5b919050565b5f805f8060808587031215610363575f80fd5b61036c85610335565b935061037a60208601610335565b925061038860408601610335565b915061039660608601610335565b905092959194509250565b602081525f82518060208401528060208501604085015e5f604082850101526040601f19601f83011684010191505092915050565b805160208083015191908110156103f6575f198160200360031b1b821691505b50919050565b60805160a05160c05160e051610100516101205161014051611cd861044d5f395f61128201525f61125201525f61152a01525f61150201525f61145d01525f61148701525f6114b10152611cd85ff3fe608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b905090565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161480156114a957507f000000000000000000000000000000000000000000000000000000000000000046145b156114d357507f000000000000000000000000000000000000000000000000000000000000000090565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a","sourceMap":"3533:12959:26:-:0;;;6370:35;;;-1:-1:-1;;;;;;;;6370:35:26;-1:-1:-1;;;6370:35:26;;;7052:433;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;4053:378:19;;;;;;;;;;;-1:-1:-1;;;4053:378:19;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;4053:378:19;;;;;7146:6:26;-1:-1:-1;;;;;1273:26:0;;1269:95;;1322:31;;-1:-1:-1;;;1322:31:0;;1350:1;1322:31;;;811:51:27;784:18;;1322:31:0;;;;;;;;1269:95;1373:32;1392:12;1373:18;:32::i;:::-;-1:-1:-1;4126:20:19;:4;:18;:20::i;:::-;4118:28;;4167:23;:7;:21;:23::i;:::-;4156:34;;4214:22;;;;;;;;;;4200:36;;4263:25;;;;;;4246:42;;4316:13;4299:30;;4364:23;4898:11;;4911:14;;4876:80;;;2424:95;4876:80;;;1857:25:27;1898:18;;;1891:34;;;;1941:18;;;1934:34;4927:13:19;1984:18:27;;;1977:34;4950:4:19;2027:19:27;;;2020:61;4840:7:19;;1829:19:27;;4876:80:19;;;;;;;;;;;;4866:91;;;;;;4859:98;;4785:179;;4364:23;4339:48;;-1:-1:-1;;4419:4:19;4397:27;;-1:-1:-1;;;;;7213:20:26;::::2;::::0;;:45:::2;;-1:-1:-1::0;;;;;;7237:21:26;::::2;::::0;7213:45:::2;:70;;;-1:-1:-1::0;;;;;;7262:21:26;::::2;::::0;7213:70:::2;7209:96;;;7292:13;;-1:-1:-1::0;;;7292:13:26::2;;;;;;;;;;;7209:96;7315:5;:14:::0;;-1:-1:-1;;;;;7315:14:26;;::::2;-1:-1:-1::0;;;;;;7315:14:26;;::::2;::::0;::::2;::::0;;;7339:6:::2;:16:::0;;;;::::2;::::0;;::::2;;::::0;;7365:6:::2;:16:::0;;;;::::2;::::0;;;::::2;;::::0;;7396::::2;::::0;::::2;::::0;7315:5:::2;::::0;7396:16:::2;7427:18;::::0;-1:-1:-1;;;;;7427:18:26;::::2;::::0;::::2;::::0;;;::::2;7460;::::0;-1:-1:-1;;;;;7460:18:26;::::2;::::0;::::2;::::0;;;::::2;7052:433:::0;;;;3533:12959;;2011:153:1;2100:13;2093:20;;-1:-1:-1;;;;;;2093:20:1;;;2123:34;2148:8;2123:24;:34::i;:::-;2011:153;:::o;1708:288:15:-;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;2912:187:0:-;2985:16;3004:6;;-1:-1:-1;;;;;3020:17:0;;;-1:-1:-1;;;;;;3020:17:0;;;;;;3052:40;;3004:6;;;;;;;3052:40;;2985:16;3052:40;2975:124;2912:187;:::o;14:177:27:-;93:13;;-1:-1:-1;;;;;135:31:27;;125:42;;115:70;;181:1;178;171:12;115:70;14:177;;;:::o;196:464::-;293:6;301;309;317;370:3;358:9;349:7;345:23;341:33;338:53;;;387:1;384;377:12;338:53;410:40;440:9;410:40;:::i;:::-;400:50;;469:49;514:2;503:9;499:18;469:49;:::i;:::-;459:59;;537:49;582:2;571:9;567:18;537:49;:::i;:::-;527:59;;605:49;650:2;639:9;635:18;605:49;:::i;:::-;595:59;;196:464;;;;;;;:::o;873:418::-;1022:2;1011:9;1004:21;985:4;1054:6;1048:13;1097:6;1092:2;1081:9;1077:18;1070:34;1156:6;1151:2;1143:6;1139:15;1134:2;1123:9;1119:18;1113:50;1212:1;1207:2;1198:6;1187:9;1183:22;1179:31;1172:42;1282:2;1275;1271:7;1266:2;1258:6;1254:15;1250:29;1239:9;1235:45;1231:54;1223:62;;;873:418;;;;:::o;1296:297::-;1414:12;;1461:4;1450:16;;;1444:23;;1414:12;1479:16;;1476:111;;;1573:1;1569:6;1559;1553:4;1549:17;1546:1;1542:25;1538:38;1531:5;1527:50;1518:59;;1476:111;;1296:297;;;:::o;1598:489::-;3533:12959:26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","linkReferences":{}},"deployedBytecode":{"object":"608060405260043610610195575f3560e01c806384b0196e116100e7578063b837c58e11610087578063f2fde38b11610062578063f2fde38b14610515578063f758161514610534578063faf55adf14610567578063fe41944a14610586575f80fd5b8063b837c58e146104ba578063cab57414146104d9578063e30c3978146104f8575f80fd5b80639a78c321116100c25780639a78c321146103c25780639d866985146103d5578063a10132ad14610467578063affed0e0146104a5575f80fd5b806384b0196e146103605780638da5cb5b146103875780638fceb798146103a3575f80fd5b8063453a2abc116101525780636c19e7831161012d5780636c19e78314610306578063715018a61461032557806379ba5097146103395780637bea4a621461034d575f80fd5b8063453a2abc1461029257806351102885146102b157806361b9739a146102e7575f80fd5b80630754d9e5146101995780630f6261af146101e5578063238ac933146102065780632ade18c21461023d578063380c2cda1461026057806339e2052314610273575b5f80fd5b3480156101a4575f80fd5b506101c76101b33660046116d6565b60096020525f908152604090205460e01b81565b6040516001600160e01b031990911681526020015b60405180910390f35b3480156101f0575f80fd5b506102046101ff366004611731565b6105c4565b005b348015610211575f80fd5b50600654610225906001600160a01b031681565b6040516001600160a01b0390911681526020016101dc565b348015610248575f80fd5b5061025261400081565b6040519081526020016101dc565b61025261026e3660046117f9565b610867565b34801561027e575f80fd5b5061020461028d36600461186d565b610882565b34801561029d575f80fd5b50600554610225906001600160a01b031681565b3480156102bc575f80fd5b506102526102cb36600461188d565b600760209081525f928352604080842090915290825290205481565b3480156102f2575f80fd5b5061020461030136600461186d565b6108fa565b348015610311575f80fd5b5061020461032036600461186d565b610972565b348015610330575f80fd5b506102046109ea565b348015610344575f80fd5b506102046109fd565b61020461035b3660046118cd565b610a41565b34801561036b575f80fd5b50610374610b58565b6040516101dc979695949392919061196d565b348015610392575f80fd5b505f546001600160a01b0316610225565b3480156103ae575f80fd5b506102046103bd366004611a03565b610b9a565b6102526103d0366004611a33565b610c03565b3480156103e0575f80fd5b5061042b6103ef3660046116d6565b60086020525f9081526040902080546001909101546001600160a01b0391821691811690600160a01b810460e01b90600160c01b900460ff1684565b604080516001600160a01b0395861681529490931660208501526001600160e01b031990911691830191909152151560608201526080016101dc565b348015610472575f80fd5b5060065461048d90600160a01b90046001600160401b031681565b6040516001600160401b0390911681526020016101dc565b3480156104b0575f80fd5b50610252600b5481565b3480156104c5575f80fd5b50600454610225906001600160a01b031681565b3480156104e4575f80fd5b506102046104f3366004611ab9565b610c6a565b348015610503575f80fd5b506001546001600160a01b0316610225565b348015610520575f80fd5b5061020461052f36600461186d565b610ccf565b34801561053f575f80fd5b506102527f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4081565b348015610572575f80fd5b50610252610581366004611aec565b610d3f565b348015610591575f80fd5b506105b46105a03660046116d6565b600a6020525f908152604090205460ff1681565b60405190151581526020016101dc565b6005546001600160a01b031633146105ef57604051630751a1cd60e41b815260040160405180910390fd5b5f87815260086020526040902080546001600160a01b031661062c57604051637bbe34c960e01b8152600481018990526024015b60405180910390fd5b6001810154600160c01b900460ff161561065b5760405162f2918f60e31b815260048101899052602401610623565b60018101805460ff60c01b1916600160c01b1790819055600160a01b900460e01b60ff88161561072e57505f8881526009602052604090205460e01b6001600160e01b03198116158015906106af57508215155b1561072b5760408310806106d85750886106cc60205f8688611b2f565b6106d591611b56565b14155b806106fc575060ff88166106f0604060208688611b2f565b6106f991611b56565b14155b156107265760405163310c275f60e21b8152600481018a905260ff89166024820152604401610623565b61072e565b505f5b5f60ff8916158061074857506001600160e01b0319821615155b8015610760575060018301546001600160a01b031615155b1561081b57600654600160a01b90046001600160401b03165f614e20610787603f84611b87565b6107919084611ba6565b61079b9190611ba6565b9050805a10156107c957805a604051638765ca0160e01b815260048101929092526024820152604401610623565b5f8488886040516020016107df93929190611bb9565b60408051601f1981840301815291905260018701549091506001600160a01b0316803b15610816575f808351602085015f8589f194505b505050505b897fd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa18a8a8a8a86604051610853959493929190611c04565b60405180910390a250505050505050505050565b5f61087787878787858888610dc3565b979650505050505050565b61088a6110a0565b6001600160a01b0381166108b15760405163d92e233d60e01b815260040160405180910390fd5b600580546001600160a01b0319166001600160a01b0383169081179091556040517f2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9905f90a250565b6109026110a0565b6001600160a01b0381166109295760405163d92e233d60e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0383169081179091556040517f40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787905f90a250565b61097a6110a0565b6001600160a01b0381166109a15760405163d92e233d60e01b815260040160405180910390fd5b600680546001600160a01b0319166001600160a01b0383169081179091556040517f9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3905f90a250565b6109f26110a0565b6109fb5f6110cc565b565b60015433906001600160a01b03168114610a355760405163118cdaa760e01b81526001600160a01b0382166004820152602401610623565b610a3e816110cc565b50565b826001600160401b0316421115610a76576040516307e655c360e21b81526001600160401b0384166004820152602401610623565b5f868152600a602052604090205460ff1615610aa857604051630f6e618560e01b815260048101879052602401610623565b600654610acb906001600160a01b0316610ac488888888610d3f565b84846110e5565b610ae857604051630fb3389960e11b815260040160405180910390fd5b5f868152600a60205260409020805460ff19166001179055610b0a8585611157565b604080516001600160a01b038716815260208101869052339188917f37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85910160405180910390a3505050505050565b5f6060805f805f6060610b6961124b565b610b7161127b565b604080515f80825260208201909252600f60f81b9b939a50919850469750309650945092509050565b610ba26110a0565b6006805467ffffffffffffffff60a01b1916600160a01b6001600160401b038416908102919091179091556040519081527fd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae89060200160405180910390a150565b5f6001600160e01b0319841615801590610c3157505f610c26602087018761186d565b6001600160a01b0316145b15610c4f576040516312d9c1d360e11b815260040160405180910390fd5b610c5e88888888888888610dc3565b98975050505050505050565b610c726110a0565b5f8381526007602090815260408083206001600160a01b038616808552908352928190208490555183815285917f75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3910160405180910390a3505050565b610cd76110a0565b600180546001600160a01b0383166001600160a01b03199091168117909155610d075f546001600160a01b031690565b6001600160a01b03167f38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e2270060405160405180910390a350565b604080517f2145fb89f3576af4e0dc0857bd1031204aca725396c3fc62462f5eb55fd52d4060208201529081018590526001600160a01b0384166060820152608081018390526001600160401b03821660a08201525f90610db89060c001604051602081830303815290604052805190602001206112a6565b90505b949350505050565b5f8781526007602090815260408083206001600160a01b0386168452909152812054808203610e1757604051634823178960e01b8152600481018a90526001600160a01b0385166024820152604401610623565b80831015610e425760405163bc03bccd60e01b81526004810182905260248101849052604401610623565b5f879003610e635760405163da84d67d60e01b815260040160405180910390fd5b614000871115610e895760405163ce672af160e01b815260048101889052602401610623565b4630600b5f8154610e9990611c3a565b9182905550604051610eca939291906020019283526001600160a01b03919091166020830152604082015260600190565b60408051601f1981840301815282825280516020918201206080840190925233835290935081810190610eff9089018961186d565b6001600160a01b03168152602001876020016020810190610f209190611c52565b6001600160e01b031990811682525f602092830181905285815260088352604090819020845181546001600160a01b039182166001600160a01b0319909116178255938501516001919091018054928601516060909601511515600160c01b0260ff60c01b1960e09790971c600160a01b026001600160c01b03199094169290951691909117919091179390931691909117909155851615610fdb575f828152600960205260409020805463ffffffff191660e087901c1790555b610fe58484611157565b8833837f1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a5760743790638b8b61101860208d018d61186d565b61102860408e0160208f01611c52565b8b8b60405161103c96959493929190611c6b565b60405180910390a46001600160e01b0319851615611094576040516001600160e01b03198616815282907ff81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c9060200160405180910390a25b50979650505050505050565b5f546001600160a01b031633146109fb5760405163118cdaa760e01b8152336004820152602401610623565b600180546001600160a01b0319169055610a3e816112d8565b5f846001600160a01b03163b5f03611144575f80611104868686611327565b5090925090505f81600381111561111d5761111d611cb7565b14801561113b5750866001600160a01b0316826001600160a01b0316145b92505050610dbb565b6111508585858561136e565b9050610dbb565b6001600160a01b0382166112045780341461118e5760405163195a3ca160e01b815260048101829052346024820152604401610623565b6004546040515f916001600160a01b03169083908381818185875af1925050503d805f81146111d8576040519150601f19603f3d011682016040523d82523d5f602084013e6111dd565b606091505b50509050806111ff5760405163096dc0e160e01b815260040160405180910390fd5b505050565b341561122b5760405163195a3ca160e01b81525f6004820152346024820152604401610623565b600454611247906001600160a01b0384811691339116846113d8565b5050565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b905090565b60606112767f0000000000000000000000000000000000000000000000000000000000000000611414565b5f6112d26112b2611451565b8360405161190160f01b8152600281019290925260228201526042902090565b92915050565b5f80546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b5f8080604184900361135b578435602086013560408701355f1a61134d8982858561157a565b955095509550505050611365565b505f915060029050825b93509350939050565b60408051630b135d3f60e11b808252600482018690526024820192909252604481018390525f91908390818660648301375f82606483010152601f820160051c60051b915060205f60648401838b5afa9050825f5114601f3d111681169350505050949350505050565b6113e6848484846001611642565b61140e57604051635274afe760e01b81526001600160a01b0385166004820152602401610623565b50505050565b60605f611420836116af565b6040805160208082528183019092529192505f91906020820181803683375050509182525060208101929092525090565b5f306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161480156114a957507f000000000000000000000000000000000000000000000000000000000000000046145b156114d357507f000000000000000000000000000000000000000000000000000000000000000090565b611276604080517f8b73c3c69bb8fe3d512ecc4cf759cc79239f7b179b0ffacaa9a75d522b39400f60208201527f0000000000000000000000000000000000000000000000000000000000000000918101919091527f000000000000000000000000000000000000000000000000000000000000000060608201524660808201523060a08201525f9060c00160405160208183030381529060405280519060200120905090565b5f80807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a08411156115b357505f91506003905082611638565b604080515f808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015611604573d5f803e3d5ffd5b5050604051601f1901519150506001600160a01b03811661162f57505f925060019150829050611638565b92505f91508190505b9450945094915050565b6040516323b872dd60e01b5f8181526001600160a01b038781166004528616602452604485905291602083606481808c5af1925060015f5114831661169e578383151615611692573d5f823e3d81fd5b5f883b113d1516831692505b604052505f60605295945050505050565b5f60ff8216601f8111156112d257604051632cd44ac360e21b815260040160405180910390fd5b5f602082840312156116e6575f80fd5b5035919050565b5f8083601f8401126116fd575f80fd5b5081356001600160401b03811115611713575f80fd5b60208301915083602082850101111561172a575f80fd5b9250929050565b5f805f805f805f60a0888a031215611747575f80fd5b87359650602088013560ff8116811461175e575f80fd5b95506040880135945060608801356001600160401b0381111561177f575f80fd5b61178b8a828b016116ed565b90955093505060808801356001600160401b038111156117a9575f80fd5b6117b58a828b016116ed565b989b979a50959850939692959293505050565b5f604082840312156117d8575f80fd5b50919050565b80356001600160a01b03811681146117f4575f80fd5b919050565b5f805f805f8060c0878903121561180e575f80fd5b8635955060208701356001600160401b0381111561182a575f80fd5b61183689828a016116ed565b909650945061184a905088604089016117c8565b9250611858608088016117de565b9598949750929591949360a090920135925050565b5f6020828403121561187d575f80fd5b611886826117de565b9392505050565b5f806040838503121561189e575f80fd5b823591506118ae602084016117de565b90509250929050565b80356001600160401b03811681146117f4575f80fd5b5f805f805f8060a087890312156118e2575f80fd5b863595506118f2602088016117de565b945060408701359350611907606088016118b7565b925060808701356001600160401b03811115611921575f80fd5b61192d89828a016116ed565b979a9699509497509295939492505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b60ff60f81b8816815260e060208201525f61198b60e083018961193f565b828103604084015261199d818961193f565b606084018890526001600160a01b038716608085015260a0840186905283810360c0850152845180825260208087019350909101905f5b818110156119f25783518352602093840193909201916001016119d4565b50909b9a5050505050505050505050565b5f60208284031215611a13575f80fd5b611886826118b7565b80356001600160e01b0319811681146117f4575f80fd5b5f805f805f805f60e0888a031215611a49575f80fd5b8735965060208801356001600160401b03811115611a65575f80fd5b611a718a828b016116ed565b9097509550611a8590508960408a016117c8565b9350611a9360808901611a1c565b9250611aa160a089016117de565b96999598509396929591949193505060c09091013590565b5f805f60608486031215611acb575f80fd5b83359250611adb602085016117de565b929592945050506040919091013590565b5f805f8060808587031215611aff575f80fd5b84359350611b0f602086016117de565b925060408501359150611b24606086016118b7565b905092959194509250565b5f8085851115611b3d575f80fd5b83861115611b49575f80fd5b5050820193919092039150565b803560208310156112d2575f19602084900360031b1b1692915050565b634e487b7160e01b5f52601160045260245ffd5b5f82611ba157634e487b7160e01b5f52601260045260245ffd5b500490565b808201808211156112d2576112d2611b73565b6001600160e01b031984168152818360048301375f910160040190815292915050565b81835281816020850137505f828201602090810191909152601f909101601f19169091010190565b60ff86168152846020820152608060408201525f611c26608083018587611bdc565b905082151560608301529695505050505050565b5f60018201611c4b57611c4b611b73565b5060010190565b5f60208284031215611c62575f80fd5b61188682611a1c565b60a081525f611c7e60a08301888a611bdc565b6001600160a01b0396871660208401526001600160e01b0319959095166040830152509190931660608201526080019190915292915050565b634e487b7160e01b5f52602160045260245ffdfea164736f6c634300081a000a","sourceMap":"3533:12959:26:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6886:70;;;;;;;;;;-1:-1:-1;6886:70:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;;407:33:27;;;389:52;;377:2;362:18;6886:70:26;;;;;;;;12418:2446;;;;;;;;;;-1:-1:-1;12418:2446:26;;;;;:::i;:::-;;:::i;:::-;;6250:21;;;;;;;;;;-1:-1:-1;6250:21:26;;;;-1:-1:-1;;;;;6250:21:26;;;;;;-1:-1:-1;;;;;2090:32:27;;;2072:51;;2060:2;2045:18;6250:21:26;1926:203:27;3985:47:26;;;;;;;;;;;;4026:6;3985:47;;;;;2280:25:27;;;2268:2;2253:18;3985:47:26;2134:177:27;8104:273:26;;;;;;:::i;:::-;;:::i;15246:158::-;;;;;;;;;;-1:-1:-1;15246:158:26;;;;;:::i;:::-;;:::i;6142:21::-;;;;;;;;;;-1:-1:-1;6142:21:26;;;;-1:-1:-1;;;;;6142:21:26;;;6550:82;;;;;;;;;;-1:-1:-1;6550:82:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;15085:155;;;;;;;;;;-1:-1:-1;15085:155:26;;;;;:::i;:::-;;:::i;15410:158::-;;;;;;;;;;-1:-1:-1;15410:158:26;;;;;:::i;:::-;;:::i;2293:101:0:-;;;;;;;;;;;;;:::i;2244:229:1:-;;;;;;;;;;;;;:::i;10400:661:26:-;;;;;;:::i;:::-;;:::i;5800:557:19:-;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;:::i;1638:85:0:-;;;;;;;;;;-1:-1:-1;1684:7:0;1710:6;-1:-1:-1;;;;;1710:6:0;1638:85;;15574:123:26;;;;;;;;;;-1:-1:-1;15574:123:26;;;;;:::i;:::-;;:::i;8758:432::-;;;;;;:::i;:::-;;:::i;6638:53::-;;;;;;;;;;-1:-1:-1;6638:53:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;-1:-1:-1;;;;;6638:53:26;;;;;;;-1:-1:-1;;;6638:53:26;;;;;-1:-1:-1;;;6638:53:26;;;;;;;;;;-1:-1:-1;;;;;8232:32:27;;;8214:51;;8301:32;;;;8296:2;8281:18;;8274:60;-1:-1:-1;;;;;;8370:33:27;;;8350:18;;;8343:61;;;;8447:14;8440:22;8435:2;8420:18;;8413:50;8201:3;8186:19;6638:53:26;7991:478:27;6370:35:26;;;;;;;;;;-1:-1:-1;6370:35:26;;;;-1:-1:-1;;;6370:35:26;;-1:-1:-1;;;;;6370:35:26;;;;;;-1:-1:-1;;;;;8636:31:27;;;8618:50;;8606:2;8591:18;6370:35:26;8474:200:27;7025:20:26;;;;;;;;;;;;;;;;6049;;;;;;;;;;-1:-1:-1;6049:20:26;;;;-1:-1:-1;;;;;6049:20:26;;;14901:178;;;;;;;;;;-1:-1:-1;14901:178:26;;;;;:::i;:::-;;:::i;1232:99:1:-;;;;;;;;;;-1:-1:-1;1311:13:1;;-1:-1:-1;;;;;1311:13:1;1232:99;;1649:178;;;;;;;;;;-1:-1:-1;1649:178:1;;;;;:::i;:::-;;:::i;4223:132:26:-;;;;;;;;;;;;4272:83;4223:132;;11169:235;;;;;;;;;;-1:-1:-1;11169:235:26;;;;;:::i;:::-;;:::i;6962:57::-;;;;;;;;;;-1:-1:-1;6962:57:26;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;9767:14:27;;9760:22;9742:41;;9730:2;9715:18;6962:57:26;9602:187:27;12418:2446:26;12580:6;;-1:-1:-1;;;;;12580:6:26;12566:10;:20;12562:44;;12595:11;;-1:-1:-1;;;12595:11:26;;;;;;;;;;;12562:44;12616:22;12641:19;;;:8;:19;;;;;12674:12;;-1:-1:-1;;;;;12674:12:26;12670:64;;12709:25;;-1:-1:-1;;;12709:25:26;;;;;2280::27;;;2253:18;;12709:25:26;;;;;;;;12670:64;12748:16;;;;-1:-1:-1;;;12748:16:26;;;;12744:56;;;12773:27;;-1:-1:-1;;;12773:27:26;;;;;2280:25:27;;;2253:18;;12773:27:26;2134:177:27;12744:56:26;12829:4;12810:16;;:23;;-1:-1:-1;;;;12810:23:26;-1:-1:-1;;;12810:23:26;;;;;-1:-1:-1;;;12861:23:26;;;;12810;12898:11;;;12894:608;;-1:-1:-1;12936:28:26;;;;:17;:28;;;;;;;;-1:-1:-1;;;;;;13171:21:26;;;;;;:41;;-1:-1:-1;13196:16:26;;;13171:41;13167:325;;;13250:2;13236:16;;;:52;;-1:-1:-1;13279:9:26;13264:10;13271:2;13269:1;13264:4;;:10;:::i;:::-;13256:19;;;:::i;:::-;:32;;13236:52;:95;;;-1:-1:-1;13292:39:26;;;13308:11;13316:2;13313;13308:4;;:11;:::i;:::-;13300:20;;;:::i;:::-;13292:39;;13236:95;13232:187;;;13362:38;;-1:-1:-1;;;13362:38:26;;;;;10560:25:27;;;10633:4;10621:17;;10601:18;;;10594:45;10533:18;;13362:38:26;10390:255:27;13232:187:26;13167:325;;;-1:-1:-1;13475:1:26;13167:325;13511:14;13540:11;;;;;:36;;-1:-1:-1;;;;;;;13555:21:26;;;;13540:36;13539:77;;;;-1:-1:-1;13581:21:26;;;;-1:-1:-1;;;;;13581:21:26;:35;;13539:77;13535:1252;;;14086:11;;-1:-1:-1;;;14086:11:26;;-1:-1:-1;;;;;14086:11:26;14068:15;4211:6;14138:12;14148:2;14086:11;14138:12;:::i;:::-;14128:22;;:7;:22;:::i;:::-;:41;;;;:::i;:::-;14111:58;;14199:6;14187:9;:18;14183:66;;;14231:6;14239:9;14214:35;;-1:-1:-1;;;14214:35:26;;;;;11308:25:27;;;;11349:18;;;11342:34;11281:18;;14214:35:26;11134:248:27;14183:66:26;14263:17;14296:8;14306:4;;14283:28;;;;;;;;;;:::i;:::-;;;;-1:-1:-1;;14283:28:26;;;;;;;;;14342:21;;;;14283:28;;-1:-1:-1;;;;;;14342:21:26;14583:18;;:22;14579:198;;14743:1;14740;14733:4;14727:11;14720:4;14714;14710:15;14707:1;14699:6;14690:7;14685:60;14672:73;;14579:198;13618:1169;;;;13535:1252;14811:9;14801:56;14822:6;14830:10;14842:3;;14847:9;14801:56;;;;;;;;;;:::i;:::-;;;;;;;;12552:2312;;;12418:2446;;;;;;;:::o;8104:273::-;8267:17;8312:58;8321:6;8329:4;;8335:8;8267:17;8356:5;8363:6;8312:8;:58::i;:::-;8300:70;8104:273;-1:-1:-1;;;;;;;8104:273:26:o;15246:158::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15310:16:26;::::1;15306:42;;15335:13;;-1:-1:-1::0;;;15335:13:26::1;;;;;;;;;;;15306:42;15358:6;:11:::0;;-1:-1:-1;;;;;;15358:11:26::1;-1:-1:-1::0;;;;;15358:11:26;::::1;::::0;;::::1;::::0;;;15384:13:::1;::::0;::::1;::::0;-1:-1:-1;;15384:13:26::1;15246:158:::0;:::o;15085:155::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15148:16:26;::::1;15144:42;;15173:13;;-1:-1:-1::0;;;15173:13:26::1;;;;;;;;;;;15144:42;15196:5;:10:::0;;-1:-1:-1;;;;;;15196:10:26::1;-1:-1:-1::0;;;;;15196:10:26;::::1;::::0;;::::1;::::0;;;15221:12:::1;::::0;::::1;::::0;-1:-1:-1;;15221:12:26::1;15085:155:::0;:::o;15410:158::-;1531:13:0;:11;:13::i;:::-;-1:-1:-1;;;;;15474:16:26;::::1;15470:42;;15499:13;;-1:-1:-1::0;;;15499:13:26::1;;;;;;;;;;;15470:42;15522:6;:11:::0;;-1:-1:-1;;;;;;15522:11:26::1;-1:-1:-1::0;;;;;15522:11:26;::::1;::::0;;::::1;::::0;;;15548:13:::1;::::0;::::1;::::0;-1:-1:-1;;15548:13:26::1;15410:158:::0;:::o;2293:101:0:-;1531:13;:11;:13::i;:::-;2357:30:::1;2384:1;2357:18;:30::i;:::-;2293:101::o:0;2244:229:1:-;1311:13;;735:10:13;;-1:-1:-1;;;;;1311:13:1;2339:24;;2335:96;;2386:34;;-1:-1:-1;;;2386:34:1;;-1:-1:-1;;;;;2090:32:27;;2386:34:1;;;2072:51:27;2045:18;;2386:34:1;1926:203:27;2335:96:1;2440:26;2459:6;2440:18;:26::i;:::-;2286:187;2244:229::o;10400:661:26:-;10634:9;-1:-1:-1;;;;;10616:27:26;:15;:27;10612:63;;;10652:23;;-1:-1:-1;;;10652:23:26;;-1:-1:-1;;;;;8636:31:27;;10652:23:26;;;8618:50:27;8591:18;;10652:23:26;8474:200:27;10612:63:26;10689:21;;;;:10;:21;;;;;;;;10685:61;;;10719:27;;-1:-1:-1;;;10719:27:26;;;;;2280:25:27;;;2253:18;;10719:27:26;2134:177:27;10685:61:26;10806:6;;10761:113;;-1:-1:-1;;;;;10806:6:26;10814:48;10826:9;10837:5;10844:6;10852:9;10814:11;:48::i;:::-;10864:9;;10761:44;:113::i;:::-;10756:171;;10897:19;;-1:-1:-1;;;10897:19:26;;;;;;;;;;;10756:171;10936:21;;;;:10;:21;;;;;:28;;-1:-1:-1;;10936:28:26;10960:4;10936:28;;;10974:23;10983:5;10990:6;10974:8;:23::i;:::-;11012:42;;;-1:-1:-1;;;;;12708:32:27;;12690:51;;12772:2;12757:18;;12750:34;;;11028:10:26;;11017:9;;11012:42;;12663:18:27;11012:42:26;;;;;;;10400:661;;;;;;:::o;5800:557:19:-;5898:13;5925:18;5957:21;5992:15;6021:25;6060:12;6086:27;6189:13;:11;:13::i;:::-;6216:16;:14;:16::i;:::-;6324;;;6308:1;6324:16;;;;;;;;;-1:-1:-1;;;6138:212:19;;;-1:-1:-1;6138:212:19;;-1:-1:-1;6246:13:19;;-1:-1:-1;6281:4:19;;-1:-1:-1;6308:1:19;-1:-1:-1;6324:16:19;-1:-1:-1;6138:212:19;-1:-1:-1;5800:557:19:o;15574:123:26:-;1531:13:0;:11;:13::i;:::-;15639:11:26::1;:17:::0;;-1:-1:-1;;;;15639:17:26::1;-1:-1:-1::0;;;;;;;;15639:17:26;::::1;::::0;;::::1;::::0;;;::::1;::::0;;;15671:19:::1;::::0;8618:50:27;;;15671:19:26::1;::::0;8606:2:27;8591:18;15671:19:26::1;;;;;;;15574:123:::0;:::o;8758:432::-;8980:17;-1:-1:-1;;;;;;9013:22:26;;;;;;:55;;-1:-1:-1;9066:1:26;9039:15;;;;:8;:15;:::i;:::-;-1:-1:-1;;;;;9039:29:26;;9013:55;9009:94;;;9077:26;;-1:-1:-1;;;9077:26:26;;;;;;;;;;;9009:94;9125:58;9134:6;9142:4;;9148:8;9158:9;9169:5;9176:6;9125:8;:58::i;:::-;9113:70;8758:432;-1:-1:-1;;;;;;;;8758:432:26:o;14901:178::-;1531:13:0;:11;:13::i;:::-;14995:15:26::1;::::0;;;:7:::1;:15;::::0;;;;;;;-1:-1:-1;;;;;14995:22:26;::::1;::::0;;;;;;;;;;:31;;;15041;2280:25:27;;;14995:15:26;;15041:31:::1;::::0;2253:18:27;15041:31:26::1;;;;;;;14901:178:::0;;;:::o;1649::1:-;1531:13:0;:11;:13::i;:::-;1738::1::1;:24:::0;;-1:-1:-1;;;;;1738:24:1;::::1;-1:-1:-1::0;;;;;;1738:24:1;;::::1;::::0;::::1;::::0;;;1802:7:::1;1684::0::0;1710:6;-1:-1:-1;;;;;1710:6:0;;1638:85;1802:7:1::1;-1:-1:-1::0;;;;;1777:43:1::1;;;;;;;;;;;1649:178:::0;:::o;11169:235:26:-;11332:63;;;4272:83;11332:63;;;13184:25:27;13225:18;;;13218:34;;;-1:-1:-1;;;;;13288:32:27;;13268:18;;;13261:60;13337:18;;;13330:34;;;-1:-1:-1;;;;;13401:31:27;;13380:19;;;13373:60;11279:7:26;;11305:92;;13156:19:27;;11332:63:26;;;;;;;;;;;;11322:74;;;;;;11305:16;:92::i;:::-;11298:99;;11169:235;;;;;;;:::o;9196:1104::-;9399:17;9444:15;;;:7;:15;;;;;;;;-1:-1:-1;;;;;9444:22:26;;;;;;;;;;9480:10;;;9476:51;;9499:28;;-1:-1:-1;;;9499:28:26;;;;;13618:25:27;;;-1:-1:-1;;;;;13679:32:27;;13659:18;;;13652:60;13591:18;;9499:28:26;13444:274:27;9476:51:26;9550:5;9541:6;:14;9537:53;;;9564:26;;-1:-1:-1;;;9564:26:26;;;;;11308:25:27;;;11349:18;;;11342:34;;;11281:18;;9564:26:26;11134:248:27;9537:53:26;9619:1;9604:16;;;9600:40;;9629:11;;-1:-1:-1;;;9629:11:26;;;;;;;;;;;9600:40;4026:6;9654:28;;9650:65;;;9691:24;;-1:-1:-1;;;9691:24:26;;;;;2280:25:27;;;2253:18;;9691:24:26;2134:177:27;9650:65:26;9858:13;9881:4;9890:5;;9888:7;;;;;:::i;:::-;;;;;-1:-1:-1;9847:49:26;;;;;;9888:7;9847:49;;14065:25:27;;;-1:-1:-1;;;;;14126:32:27;;;;14121:2;14106:18;;14099:60;14190:2;14175:18;;14168:34;14053:2;14038:18;;13863:345;9847:49:26;;;;-1:-1:-1;;9847:49:26;;;;;;;;;9837:60;;9847:49;9837:60;;;;9929:62;;;;;;9937:10;9929:62;;9837:60;;-1:-1:-1;9929:62:26;;;;9949:15;;;;:8;:15;:::i;:::-;-1:-1:-1;;;;;9929:62:26;;;;;9966:8;:17;;;;;;;;;;:::i;:::-;-1:-1:-1;;;;;;9929:62:26;;;;;9985:5;9929:62;;;;;;;9907:19;;;:8;:19;;;;;;;:84;;;;-1:-1:-1;;;;;9907:84:26;;;-1:-1:-1;;;;;;9907:84:26;;;;;;;;;;9929:62;9907:84;;;;;;;;;;;;;;;;;-1:-1:-1;;;9907:84:26;-1:-1:-1;;;;9907:84:26;;;;;-1:-1:-1;;;9907:84:26;-1:-1:-1;;;;;;9907:84:26;;;;;;;;;;;;;;;;;;;;;;;;;;10005:22;;;10001:68;;10029:28;;;;:17;:28;;;;;:40;;-1:-1:-1;;10029:40:26;;;;;;;;10001:68;10079:23;10088:5;10095:6;10079:8;:23::i;:::-;10150:6;10138:10;10127:9;10117:97;10158:4;;10164:15;;;;:8;:15;:::i;:::-;10181:17;;;;;;;;:::i;:::-;10200:5;10207:6;10117:97;;;;;;;;;;;:::i;:::-;;;;;;;;-1:-1:-1;;;;;;10228:22:26;;;10224:69;;10257:36;;-1:-1:-1;;;;;;407:33:27;;389:52;;10272:9:26;;10257:36;;377:2:27;362:18;10257:36:26;;;;;;;10224:69;9418:882;9196:1104;;;;;;;;;:::o;1796:162:0:-;1684:7;1710:6;-1:-1:-1;;;;;1710:6:0;735:10:13;1855:23:0;1851:101;;1901:40;;-1:-1:-1;;;1901:40:0;;735:10:13;1901:40:0;;;2072:51:27;2045:18;;1901:40:0;1926:203:27;2011:153:1;2100:13;2093:20;;-1:-1:-1;;;;;;2093:20:1;;;2123:34;2148:8;2123:24;:34::i;2016:485:21:-;2162:4;2182:6;-1:-1:-1;;;;;2182:18:21;;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;-1:-1:-1;;;;;2368:19:21;:9;-1:-1:-1;;;;;2368:19:21;;2331:56;2324:63;;;;;;2178:317;2425:59;2460:6;2468:4;2474:9;;2425:34;:59::i;:::-;2418:66;;;;15793:697:26;-1:-1:-1;;;;;15864:19:26;;15860:624;;15916:6;15903:9;:19;15899:61;;15931:29;;-1:-1:-1;;;15931:29:26;;;;;11308:25:27;;;15950:9:26;11349:18:27;;;11342:34;11281:18;;15931:29:26;11134:248:27;15899:61:26;16246:5;;:29;;16234:7;;-1:-1:-1;;;;;16246:5:26;;16264:6;;16234:7;16246:29;16234:7;16246:29;16264:6;16246:5;:29;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;16233:42;;;16294:2;16289:31;;16305:15;;-1:-1:-1;;;16305:15:26;;;;;;;;;;;16289:31;15885:446;15793:697;;:::o;15860:624::-;16355:9;:14;16351:51;;16378:24;;-1:-1:-1;;;16378:24:26;;16389:1;16378:24;;;11308:25:27;16392:9:26;11349:18:27;;;11342:34;11281:18;;16378:24:26;11134:248:27;16351:51:26;16459:5;;16416:57;;-1:-1:-1;;;;;16416:30:26;;;;16447:10;;16459:5;16466:6;16416:30;:57::i;:::-;15793:697;;:::o;6564:101:19:-;6610:13;6642:16;:5;:14;:16::i;:::-;6635:23;;6564:101;:::o;6878:107::-;6927:13;6959:19;:8;:17;:19::i;5589:176::-;5666:7;5692:66;5725:20;:18;:20::i;:::-;5747:10;4093:4:20;4087:11;-1:-1:-1;;;4111:23:20;;4163:4;4154:14;;4147:39;;;;4215:4;4206:14;;4199:34;4271:4;4256:20;;;3918:374;5692:66:19;5685:73;5589:176;-1:-1:-1;;5589:176:19:o;2912:187:0:-;2985:16;3004:6;;-1:-1:-1;;;;;3020:17:0;;;-1:-1:-1;;;;;;3020:17:0;;;;;;3052:40;;3004:6;;;;;;;3052:40;;2985:16;3052:40;2975:124;2912:187;:::o;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;4201:1343:21:-;4889:4;4883:11;;-1:-1:-1;;;4907:21:21;;;4957:4;4948:14;;4941:28;;;4998:4;4989:14;;4982:28;;;;5039:4;5030:14;;5023:30;;;4354:11;;4395:34;4456:9;;;;5088:4;5079:14;;5066:54;5169:1;5160:6;5153:4;5148:3;5144:14;5140:27;5133:38;5336:4;5328:6;5324:17;5321:1;5317:25;5314:1;5310:33;5300:43;;5428:4;5422;5415;5407:6;5403:17;5398:3;5390:6;5383:5;5372:61;5357:76;;5517:8;5510:4;5504:11;5501:25;5494:4;5476:16;5473:26;5469:58;5460:7;5456:72;5446:82;;;4508:1030;;4201:1343;;;;;;:::o;1733:232:11:-;1838:47;1856:5;1863:4;1869:2;1873:5;1880:4;1838:17;:47::i;:::-;1833:126;;1908:40;;-1:-1:-1;;;1908:40:11;;-1:-1:-1;;;;;2090:32:27;;1908:40:11;;;2072:51:27;2045:18;;1908:40:11;1926:203:27;1833:126:11;1733:232;;;;:::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;4517:262:19:-;4570:7;4601:4;-1:-1:-1;;;;;4610:11:19;4593:28;;:63;;;;;4642:14;4625:13;:31;4593:63;4589:184;;;-1:-1:-1;4679:22:19;;4517:262::o;4589:184::-;4739:23;4876:80;;;2424:95;4876:80;;;16281:25:27;4898:11:19;16322:18:27;;;16315:34;;;;4911:14:19;16365:18:27;;;16358:34;4927:13:19;16408:18:27;;;16401:34;4950:4:19;16451:19:27;;;16444:61;4840:7:19;;16253:19:27;;4876:80:19;;;;;;;;;;;;4866:91;;;;;;4859:98;;4785:179;;7117:1551:18;7243:17;;;8197:66;8184:79;;8180:164;;;-1:-1:-1;8295:1:18;;-1:-1:-1;8299:30:18;;-1:-1:-1;8331:1:18;8279:54;;8180:164;8455:24;;;8438:14;8455:24;;;;;;;;;15846:25:27;;;15919:4;15907:17;;15887:18;;;15880:45;;;;15941:18;;;15934:34;;;15984:18;;;15977:34;;;8455:24:18;;15818:19:27;;8455:24:18;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;8455:24:18;;-1:-1:-1;;8455:24:18;;;-1:-1:-1;;;;;;;8493:20:18;;8489:113;;-1:-1:-1;8545:1:18;;-1:-1:-1;8549:29:18;;-1:-1:-1;8545:1:18;;-1:-1:-1;8529:62:18;;8489:113;8620:6;-1:-1:-1;8628:20:18;;-1:-1:-1;8628:20:18;;-1:-1:-1;7117:1551:18;;;;;;;;;:::o;10814:1393:11:-;11109:4;11103:11;-1:-1:-1;;;10972:12:11;11127:22;;;-1:-1:-1;;;;;11175:26:11;;;11169:4;11162:40;11228:24;;11222:4;11215:38;11273:4;11266:19;;;10972:12;11349:4;10972:12;11337:4;10972:12;;11321:5;11314;11309:45;11298:56;;11566:1;11559:4;11553:11;11550:18;11541:7;11537:32;11527:606;;11698:6;11688:7;11681:15;11677:28;11674:165;;;11754:16;11748:4;11743:3;11728:43;11804:16;11799:3;11792:29;11674:165;12115:1;12107:5;12095:18;12092:25;12073:16;12066:24;12062:56;12053:7;12049:70;12038:81;;11527:606;12153:4;12146:17;-1:-1:-1;12189:1:11;12183:4;12176:15;10814:1393;;-1:-1:-1;;;;;10814:1393:11:o;2532:247:15:-;2593:7;2665:4;2629:40;;2692:4;2683:13;;2679:71;;;2719:20;;-1:-1:-1;;;2719:20:15;;;;;;;;;;;14:226:27;73:6;126:2;114:9;105:7;101:23;97:32;94:52;;;142:1;139;132:12;94:52;-1:-1:-1;187:23:27;;14:226;-1:-1:-1;14:226:27:o;452:348::-;504:8;514:6;568:3;561:4;553:6;549:17;545:27;535:55;;586:1;583;576:12;535:55;-1:-1:-1;609:20:27;;-1:-1:-1;;;;;641:30:27;;638:50;;;684:1;681;674:12;638:50;721:4;713:6;709:17;697:29;;773:3;766:4;757:6;749;745:19;741:30;738:39;735:59;;;790:1;787;780:12;735:59;452:348;;;;;:::o;805:1116::-;921:6;929;937;945;953;961;969;1022:3;1010:9;1001:7;997:23;993:33;990:53;;;1039:1;1036;1029:12;990:53;1084:23;;;-1:-1:-1;1183:2:27;1168:18;;1155:32;1231:4;1218:18;;1206:31;;1196:59;;1251:1;1248;1241:12;1196:59;1274:7;-1:-1:-1;1354:2:27;1339:18;;1326:32;;-1:-1:-1;1435:2:27;1420:18;;1407:32;-1:-1:-1;;;;;1451:30:27;;1448:50;;;1494:1;1491;1484:12;1448:50;1533:59;1584:7;1575:6;1564:9;1560:22;1533:59;:::i;:::-;1611:8;;-1:-1:-1;1507:85:27;-1:-1:-1;;1699:3:27;1684:19;;1671:33;-1:-1:-1;;;;;1716:32:27;;1713:52;;;1761:1;1758;1751:12;1713:52;1800:61;1853:7;1842:8;1831:9;1827:24;1800:61;:::i;:::-;805:1116;;;;-1:-1:-1;805:1116:27;;-1:-1:-1;805:1116:27;;;;1774:87;;-1:-1:-1;;;805:1116:27:o;2316:156::-;2377:5;2422:2;2413:6;2408:3;2404:16;2400:25;2397:45;;;2438:1;2435;2428:12;2397:45;-1:-1:-1;2460:6:27;2316:156;-1:-1:-1;2316:156:27:o;2477:173::-;2545:20;;-1:-1:-1;;;;;2594:31:27;;2584:42;;2574:70;;2640:1;2637;2630:12;2574:70;2477:173;;;:::o;2655:849::-;2789:6;2797;2805;2813;2821;2829;2882:3;2870:9;2861:7;2857:23;2853:33;2850:53;;;2899:1;2896;2889:12;2850:53;2944:23;;;-1:-1:-1;3042:2:27;3027:18;;3014:32;-1:-1:-1;;;;;3058:30:27;;3055:50;;;3101:1;3098;3091:12;3055:50;3140:59;3191:7;3182:6;3171:9;3167:22;3140:59;:::i;:::-;3218:8;;-1:-1:-1;3114:85:27;-1:-1:-1;3272:64:27;;-1:-1:-1;3328:7:27;3323:2;3308:18;;3272:64;:::i;:::-;3262:74;;3355:39;3389:3;3378:9;3374:19;3355:39;:::i;:::-;2655:849;;;;-1:-1:-1;2655:849:27;;;;;3467:3;3452:19;;;3439:33;;-1:-1:-1;;2655:849:27:o;3691:186::-;3750:6;3803:2;3791:9;3782:7;3778:23;3774:32;3771:52;;;3819:1;3816;3809:12;3771:52;3842:29;3861:9;3842:29;:::i;:::-;3832:39;3691:186;-1:-1:-1;;;3691:186:27:o;3882:300::-;3950:6;3958;4011:2;3999:9;3990:7;3986:23;3982:32;3979:52;;;4027:1;4024;4017:12;3979:52;4072:23;;;-1:-1:-1;4138:38:27;4172:2;4157:18;;4138:38;:::i;:::-;4128:48;;3882:300;;;;;:::o;4187:171::-;4254:20;;-1:-1:-1;;;;;4303:30:27;;4293:41;;4283:69;;4348:1;4345;4338:12;4363:792;4468:6;4476;4484;4492;4500;4508;4561:3;4549:9;4540:7;4536:23;4532:33;4529:53;;;4578:1;4575;4568:12;4529:53;4623:23;;;-1:-1:-1;4689:38:27;4723:2;4708:18;;4689:38;:::i;:::-;4679:48;-1:-1:-1;4800:2:27;4785:18;;4772:32;;-1:-1:-1;4849:37:27;4882:2;4867:18;;4849:37;:::i;:::-;4839:47;;4937:3;4926:9;4922:19;4909:33;-1:-1:-1;;;;;4957:6:27;4954:30;4951:50;;;4997:1;4994;4987:12;4951:50;5036:59;5087:7;5078:6;5067:9;5063:22;5036:59;:::i;:::-;4363:792;;;;-1:-1:-1;4363:792:27;;-1:-1:-1;4363:792:27;;5114:8;;4363:792;-1:-1:-1;;;4363:792:27:o;5160:289::-;5202:3;5240:5;5234:12;5267:6;5262:3;5255:19;5323:6;5316:4;5309:5;5305:16;5298:4;5293:3;5289:14;5283:47;5375:1;5368:4;5359:6;5354:3;5350:16;5346:27;5339:38;5438:4;5431:2;5427:7;5422:2;5414:6;5410:15;5406:29;5401:3;5397:39;5393:50;5386:57;;;5160:289;;;;:::o;5454:1238::-;5860:3;5855;5851:13;5843:6;5839:26;5828:9;5821:45;5902:3;5897:2;5886:9;5882:18;5875:31;5802:4;5929:46;5970:3;5959:9;5955:19;5947:6;5929:46;:::i;:::-;6023:9;6015:6;6011:22;6006:2;5995:9;5991:18;5984:50;6057:33;6083:6;6075;6057:33;:::i;:::-;6121:2;6106:18;;6099:34;;;-1:-1:-1;;;;;6170:32:27;;6164:3;6149:19;;6142:61;6190:3;6219:19;;6212:35;;;6284:22;;;6278:3;6263:19;;6256:51;6356:13;;6378:22;;;6428:2;6454:15;;;;-1:-1:-1;6416:15:27;;;;-1:-1:-1;6497:169:27;6511:6;6508:1;6505:13;6497:169;;;6572:13;;6560:26;;6615:2;6641:15;;;;6606:12;;;;6533:1;6526:9;6497:169;;;-1:-1:-1;6683:3:27;;5454:1238;-1:-1:-1;;;;;;;;;;;5454:1238:27:o;6697:184::-;6755:6;6808:2;6796:9;6787:7;6783:23;6779:32;6776:52;;;6824:1;6821;6814:12;6776:52;6847:28;6865:9;6847:28;:::i;6886:173::-;6953:20;;-1:-1:-1;;;;;;7002:32:27;;6992:43;;6982:71;;7049:1;7046;7039:12;7064:922;7206:6;7214;7222;7230;7238;7246;7254;7307:3;7295:9;7286:7;7282:23;7278:33;7275:53;;;7324:1;7321;7314:12;7275:53;7369:23;;;-1:-1:-1;7467:2:27;7452:18;;7439:32;-1:-1:-1;;;;;7483:30:27;;7480:50;;;7526:1;7523;7516:12;7480:50;7565:59;7616:7;7607:6;7596:9;7592:22;7565:59;:::i;:::-;7643:8;;-1:-1:-1;7539:85:27;-1:-1:-1;7697:64:27;;-1:-1:-1;7753:7:27;7748:2;7733:18;;7697:64;:::i;:::-;7687:74;;7780:38;7813:3;7802:9;7798:19;7780:38;:::i;:::-;7770:48;;7837:39;7871:3;7860:9;7856:19;7837:39;:::i;:::-;7064:922;;;;-1:-1:-1;7064:922:27;;;;;;;;-1:-1:-1;;7949:3:27;7934:19;;;7921:33;;7064:922::o;8679:420::-;8756:6;8764;8772;8825:2;8813:9;8804:7;8800:23;8796:32;8793:52;;;8841:1;8838;8831:12;8793:52;8886:23;;;-1:-1:-1;8952:38:27;8986:2;8971:18;;8952:38;:::i;:::-;8679:420;;8942:48;;-1:-1:-1;;;9063:2:27;9048:18;;;;9035:32;;8679:420::o;9104:493::-;9189:6;9197;9205;9213;9266:3;9254:9;9245:7;9241:23;9237:33;9234:53;;;9283:1;9280;9273:12;9234:53;9328:23;;;-1:-1:-1;9394:38:27;9428:2;9413:18;;9394:38;:::i;:::-;9384:48;-1:-1:-1;9505:2:27;9490:18;;9477:32;;-1:-1:-1;9554:37:27;9587:2;9572:18;;9554:37;:::i;:::-;9544:47;;9104:493;;;;;;;:::o;9794:331::-;9899:9;9910;9952:8;9940:10;9937:24;9934:44;;;9974:1;9971;9964:12;9934:44;10003:6;9993:8;9990:20;9987:40;;;10023:1;10020;10013:12;9987:40;-1:-1:-1;;10049:23:27;;;10094:25;;;;;-1:-1:-1;9794:331:27:o;10130:255::-;10250:19;;10289:2;10281:11;;10278:101;;;-1:-1:-1;;10350:2:27;10346:12;;;10343:1;10339:20;10335:33;10324:45;10130:255;;;;:::o;10650:127::-;10711:10;10706:3;10702:20;10699:1;10692:31;10742:4;10739:1;10732:15;10766:4;10763:1;10756:15;10782:217;10822:1;10848;10838:132;;10892:10;10887:3;10883:20;10880:1;10873:31;10927:4;10924:1;10917:15;10955:4;10952:1;10945:15;10838:132;-1:-1:-1;10984:9:27;;10782:217::o;11004:125::-;11069:9;;;11090:10;;;11087:36;;;11103:18;;:::i;11387:368::-;-1:-1:-1;;;;;;11582:33:27;;11570:46;;11659:6;11651;11647:1;11638:11;;11625:41;11552:3;11689:16;;11707:1;11685:24;11718:13;;;11685:24;11387:368;-1:-1:-1;;11387:368:27:o;11760:267::-;11849:6;11844:3;11837:19;11901:6;11894:5;11887:4;11882:3;11878:14;11865:43;-1:-1:-1;11953:1:27;11928:16;;;11946:4;11924:27;;;11917:38;;;;12009:2;11988:15;;;-1:-1:-1;;11984:29:27;11975:39;;;11971:50;;11760:267::o;12032:479::-;12277:4;12269:6;12265:17;12254:9;12247:36;12319:6;12314:2;12303:9;12299:18;12292:34;12362:3;12357:2;12346:9;12342:18;12335:31;12228:4;12383:63;12441:3;12430:9;12426:19;12418:6;12410;12383:63;:::i;:::-;12375:71;;12496:6;12489:14;12482:22;12477:2;12466:9;12462:18;12455:50;12032:479;;;;;;;;:::o;13723:135::-;13762:3;13783:17;;;13780:43;;13803:18;;:::i;:::-;-1:-1:-1;13850:1:27;13839:13;;13723:135::o;14213:184::-;14271:6;14324:2;14312:9;14303:7;14299:23;14295:32;14292:52;;;14340:1;14337;14330:12;14292:52;14363:28;14381:9;14363:28;:::i;14402:609::-;14669:3;14658:9;14651:22;14632:4;14690:63;14748:3;14737:9;14733:19;14725:6;14717;14690:63;:::i;:::-;-1:-1:-1;;;;;14789:32:27;;;14784:2;14769:18;;14762:60;-1:-1:-1;;;;;;14858:33:27;;;;14853:2;14838:18;;14831:61;-1:-1:-1;14928:32:27;;;;14923:2;14908:18;;14901:60;14992:3;14977:19;14970:35;;;;14682:71;14402:609;-1:-1:-1;;14402:609:27:o;15016:127::-;15077:10;15072:3;15068:20;15065:1;15058:31;15108:4;15105:1;15098:15;15132:4;15129:1;15122:15","linkReferences":{},"immutableReferences":{"4176":[{"start":5297,"length":32}],"4178":[{"start":5255,"length":32}],"4180":[{"start":5213,"length":32}],"4182":[{"start":5378,"length":32}],"4184":[{"start":5418,"length":32}],"4187":[{"start":4690,"length":32}],"4190":[{"start":4738,"length":32}]}}}}}}},"signatures":{"function":[{"signature":"acceptOwnership()","signatureHash4":"0x79ba5097","signatureHash32":"0x79ba5097e5519a381a52113cdcc59540d13f73fd9d26abc0453484a096cc96f2"},{"signature":"callbackGas()","signatureHash4":"0xa10132ad","signatureHash32":"0xa10132ad3ebfb61d80c2c9e7c265564048b2c1b4380143ccb5c027c87ce0f3a3"},{"signature":"complete(bytes32,uint8,bytes32,string,bytes)","signatureHash4":"0x0f6261af","signatureHash32":"0x0f6261af2204cefd600f59cc5e0b985ce0d6bd732eeb380a75a1b3e1601b2bdd"},{"signature":"eip712Domain()","signatureHash4":"0x84b0196e","signatureHash32":"0x84b0196e4b78e1918928c3b71e1f57a2bfc6d4a368fe07990ccc1367172719fb"},{"signature":"failureSelectorOf(bytes32)","signatureHash4":"0x0754d9e5","signatureHash32":"0x0754d9e5e958665a6568a82fb210dfd22e5ab754adf9c0d9f088b85f0aef7271"},{"signature":"MAX_BODY_BYTES()","signatureHash4":"0x2ade18c2","signatureHash32":"0x2ade18c2e9c8bf0703caf1468b4748011f1c8d511a615d8ab443c641acf7e5d7"},{"signature":"nonce()","signatureHash4":"0xaffed0e0","signatureHash32":"0xaffed0e0ba94adda3772e73093f9f42c54ccf7ebf1e7dabc728520a58f80bdf5"},{"signature":"owner()","signatureHash4":"0x8da5cb5b","signatureHash32":"0x8da5cb5b36e7f68c1d2e56001220cdbdd3ba2616072f718acfda4a06441a807d"},{"signature":"paidQuotes(bytes32)","signatureHash4":"0xfe41944a","signatureHash32":"0xfe41944a992f481a64ccca92dcb14ee3d01b2679db812dd4fcf4ba758ebbf589"},{"signature":"pay(bytes32,address,uint256,uint64,bytes)","signatureHash4":"0x7bea4a62","signatureHash32":"0x7bea4a6274b47d170d691b557b2a4819f3769d2b2edec3f39e4d77e2a716e827"},{"signature":"payTo()","signatureHash4":"0xb837c58e","signatureHash32":"0xb837c58ed79b6827a552272d7792eea9d78fdc8fe7a2f85ec35d0d5ae96323f4"},{"signature":"pendingOwner()","signatureHash4":"0xe30c3978","signatureHash32":"0xe30c3978ddd82956a01b5cb08d17f1a2d73e636aeefb7b36f896e41d4c2aab90"},{"signature":"priceOf(bytes32,address)","signatureHash4":"0x51102885","signatureHash32":"0x51102885ff2a2318f35666ed9cdb58d91f72ffe956848653b51c8dd977e382c7"},{"signature":"quoteDigest(bytes32,address,uint256,uint64)","signatureHash4":"0xfaf55adf","signatureHash32":"0xfaf55adf349582aa0f40bc368f8a3841952b1e6d935b4944697fa0b7af70173b"},{"signature":"QUOTE_TYPEHASH()","signatureHash4":"0xf7581615","signatureHash32":"0xf7581615049481b44ab6757241902bff286383960bb6ec5c3cc1a2c4a9db4efb"},{"signature":"renounceOwnership()","signatureHash4":"0x715018a6","signatureHash32":"0x715018a616b5f2044428f6fadb7deef4ce9ca76ef60ea57978964ad137bbe7ae"},{"signature":"request(bytes32,bytes,(address,bytes4),address,uint256)","signatureHash4":"0x380c2cda","signatureHash32":"0x380c2cdaadc9298bf62dba1b7be079f3d1bde9d9e78eff186697388fe2746378"},{"signature":"requests(bytes32)","signatureHash4":"0x9d866985","signatureHash32":"0x9d866985253892dccb76283f5373f023b0e749fd123686a9ac638b6e1101d6c7"},{"signature":"requestWithFailure(bytes32,bytes,(address,bytes4),bytes4,address,uint256)","signatureHash4":"0x9a78c321","signatureHash32":"0x9a78c32159979212d0c543719544bff4da11a03094a65f71fa58c6efebd7ed00"},{"signature":"setCallbackGas(uint64)","signatureHash4":"0x8fceb798","signatureHash32":"0x8fceb798e44f74441ee59fcc37f36bf6f3d19c031a3e65033e2edec402129e83"},{"signature":"setPayTo(address)","signatureHash4":"0x61b9739a","signatureHash32":"0x61b9739a12146002db97f5b8e3c2f7e7258db5803b690951cd2cd31f66877b8a"},{"signature":"setPrice(bytes32,address,uint256)","signatureHash4":"0xcab57414","signatureHash32":"0xcab5741411f0e35cf14bc755346f3cc9a92282fe33089c17ea2affb4babfcd7c"},{"signature":"setSigner(address)","signatureHash4":"0x6c19e783","signatureHash32":"0x6c19e78356e125aebdcfec8378fd6bdb3054637fe31d45dc274ed7d3a756f643"},{"signature":"setWriter(address)","signatureHash4":"0x39e20523","signatureHash32":"0x39e205235c1dedc74e75b4b56cf9479ce338cac5e2b42ce0efd1323a6387e646"},{"signature":"signer()","signatureHash4":"0x238ac933","signatureHash32":"0x238ac933815ecf0ebe2d25c09976ca5b27f626f968dd199d32461d76020097d8"},{"signature":"transferOwnership(address)","signatureHash4":"0xf2fde38b","signatureHash32":"0xf2fde38b092330466c661fc723d5289b90272a3e580e3187d1d7ef788506c557"},{"signature":"writer()","signatureHash4":"0x453a2abc","signatureHash32":"0x453a2abcb45bb41f195b0b39fada18fa46ef3d41ace0defd9d34dfcd2a9415d7"}],"event":[{"signature":"CallbackGasSet(uint64)","signatureHash4":"0xd1743b70","signatureHash32":"0xd1743b70ec1eaedca7e38dd4a2baa1f7ef02a7297ec10567337f8f794139eae8"},{"signature":"Completed(bytes32,uint8,bytes32,string,bool)","signatureHash4":"0xd4ad2d2e","signatureHash32":"0xd4ad2d2ef4e8ea9995103f34e322dbefb2534f3a52984a308f7db8e257b76fa1"},{"signature":"EIP712DomainChanged()","signatureHash4":"0x0a6387c9","signatureHash32":"0x0a6387c9ea3628b88a633bb4f3b151770f70085117a15f9bf3787cda53f13d31"},{"signature":"FailureHookSet(bytes32,bytes4)","signatureHash4":"0xf81fcc57","signatureHash32":"0xf81fcc576dbae5cfe8e4207ac87f503fb624fad6e2ff5d8698580154cdf2772c"},{"signature":"OwnershipTransferred(address,address)","signatureHash4":"0x8be0079c","signatureHash32":"0x8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0"},{"signature":"OwnershipTransferStarted(address,address)","signatureHash4":"0x38d16b8c","signatureHash32":"0x38d16b8cac22d99fc7c124b9cd0de2d3fa1faef420bfe791d8c362d765e22700"},{"signature":"Paid(bytes32,address,address,uint256)","signatureHash4":"0x37db9851","signatureHash32":"0x37db9851b6c9a32f8ddcf4734e6526de7c85268ef735f7883ea70dc8a39c9c85"},{"signature":"PayToSet(address)","signatureHash4":"0x40272fd8","signatureHash32":"0x40272fd86c4ebc054ef324405e09ad1084dab84e6df76a6c02ce718ec8c3b787"},{"signature":"PriceSet(bytes32,address,uint256)","signatureHash4":"0x75ea4f3c","signatureHash32":"0x75ea4f3cca0ef30fc9a35ae1e41db58633896003c96f3ab75f10e2e09d1910c3"},{"signature":"Requested(bytes32,address,bytes32,bytes,address,bytes4,address,uint256)","signatureHash4":"0x1c521a43","signatureHash32":"0x1c521a43c9b0f72a335bc80a6918abce08af7949ebbd1c41fe2a576074379063"},{"signature":"SignerSet(address)","signatureHash4":"0x9eaa8975","signatureHash32":"0x9eaa897564d022fb8c5efaf0acdb5d9d27b440b2aad44400b6e1c702e65b9ed3"},{"signature":"WriterSet(address)","signatureHash4":"0x2ca83404","signatureHash32":"0x2ca834043d3f150e971620c827d81322b2dbf06d960d561db9d0dc6f23adbca9"}],"error":[{"signature":"ActionNotSold(bytes32,address)","signatureHash4":"0x48231789","signatureHash32":"0x482317891045c740ba1b7909f538a8b3e1aa8558de3a4c7e85195e08cd4dee9f"},{"signature":"AlreadyCompleted(bytes32)","signatureHash4":"0x07948c78","signatureHash32":"0x07948c78c4de44115d2cd8d8de52589c5a416f71a31c9be0f4f9a79b3aaf0d01"},{"signature":"BadQuoteSignature()","signatureHash4":"0x1f667132","signatureHash32":"0x1f66713283e3fc75036026f9ba826db6751083d42e6c83c890b88f1be99feb4e"},{"signature":"BodyTooLong(uint256)","signatureHash4":"0xce672af1","signatureHash32":"0xce672af1d0f4c56cd9116eb1ef9054b3dad6b18d22901b35f03c9ae33ce92ab2"},{"signature":"CallbackGasShort(uint256,uint256)","signatureHash4":"0x8765ca01","signatureHash32":"0x8765ca01c31a8dcdcedaae4b5c8b9cda37ac9764579ae8b26e5f0e79ffd29a65"},{"signature":"EmptyBody()","signatureHash4":"0xda84d67d","signatureHash32":"0xda84d67d48ac1e51518f511444b00704a72c4630740fbba5cb29c68f5afa13da"},{"signature":"FailureArgsMismatch(bytes32,uint8)","signatureHash4":"0xc4309d7c","signatureHash32":"0xc4309d7c73967591878a18b2f5a7c598a958f061f17fac3bf9b72b2aaa21c29e"},{"signature":"FailureHookWithoutTarget()","signatureHash4":"0x25b383a6","signatureHash32":"0x25b383a62c1d35e2dae2ecaf2c34ec9a348d890dd1663662e1b37fc94bce9133"},{"signature":"ForwardFailed()","signatureHash4":"0x096dc0e1","signatureHash32":"0x096dc0e1200187fcb3e8a7a2cddac748dabf9eb2829c0a1e27a65011b034bd64"},{"signature":"InvalidShortString()","signatureHash4":"0xb3512b0c","signatureHash32":"0xb3512b0c6163e5f0bafab72bb631b9d58cd7a731b082f910338aa21c83d5c274"},{"signature":"NotWriter()","signatureHash4":"0x751a1cd0","signatureHash32":"0x751a1cd09604148c54cab4424910836402768adf54a25cb710e1e4dd5968768a"},{"signature":"OwnableInvalidOwner(address)","signatureHash4":"0x1e4fbdf7","signatureHash32":"0x1e4fbdf7f3ef8bcaa855599e3abf48b232380f183f08f6f813d9ffa5bd585188"},{"signature":"OwnableUnauthorizedAccount(address)","signatureHash4":"0x118cdaa7","signatureHash32":"0x118cdaa7a341953d1887a2245fd6665d741c67c8c50581daa59e1d03373fa188"},{"signature":"PriceNotMet(uint256,uint256)","signatureHash4":"0xbc03bccd","signatureHash32":"0xbc03bccd2645efe93dc0f1bf90fa41351fa7218c93616042bcc79bc334961dbb"},{"signature":"QuoteAlreadyPaid(bytes32)","signatureHash4":"0x0f6e6185","signatureHash32":"0x0f6e6185fbdeb2e71cb16c4ac5bd3f47444cd3d770853b3883707911107705d8"},{"signature":"QuoteExpired(uint64)","signatureHash4":"0x1f99570c","signatureHash32":"0x1f99570c19bcdcea4549a8d28534374e9a66ed2e9e9e8d0c9526bf3d1faa00e4"},{"signature":"SafeERC20FailedOperation(address)","signatureHash4":"0x5274afe7","signatureHash32":"0x5274afe73c98b4749fc91ffae6b7b574e7842cb2144a159e9377a5f20b32edf9"},{"signature":"StringTooLong(string)","signatureHash4":"0x305a27a9","signatureHash32":"0x305a27a93f8e33b7392df0a0f91d6fc63847395853c45991eec52dbf24d72381"},{"signature":"UnknownRequest(bytes32)","signatureHash4":"0x7bbe34c9","signatureHash32":"0x7bbe34c9053d934edfcee0212dafa8d890e3f195bd69a9d5952188773cb7ad36"},{"signature":"WrongValue(uint256,uint256)","signatureHash4":"0x195a3ca1","signatureHash32":"0x195a3ca12ac3744ef64727effb118b3b203c382e49c7a7d24d450eae5e3b889a"},{"signature":"ZeroAddress()","signatureHash4":"0xd92e233d","signatureHash32":"0xd92e233df2717d4a40030e20904abd27b68fcbeede117eaaccbbdac9618c8c73"}]},"proxyResolution":{"isProxy":false,"proxyType":null,"implementations":[]},"match":"match","chainId":"1","address":"0xa43e6F75ee006411F79Ac1C84120606C2330DE82"}