@keep-network/tbtc-v2 1.6.0-dev.21 → 1.6.0-dev.23

package/export/artifacts/contracts/test/TestTBTCDepositor.sol/MockTBTCVault.json

@@ -79,8 +79,8 @@
       "type": "function"
     }
   ],
-  "bytecode": "0x60806040526001805463ffffffff1916606417905534801561002057600080fd5b5061038f806100306000396000f3fe608060405234801561001057600080fd5b50600436106100675760003560e01c80636c626aa4116100505780636c626aa4146100ab578063d5b0b0ce1461011a578063db4aa6cb1461014457600080fd5b806309b53f511461006c578063477ffd6514610096575b600080fd5b60015461007c9063ffffffff1681565b60405163ffffffff90911681526020015b60405180910390f35b6100a96100a4366004610313565b610157565b005b6100f96100b9366004610313565b6000908152602081815260409182902082518084019093525467ffffffffffffffff80821680855268010000000000000000909204169290910182905291565b6040805167ffffffffffffffff93841681529290911660208301520161008d565b6100a961012836600461032c565b6001805463ffffffff191663ffffffff92909216919091179055565b6100a9610152366004610313565b6101ed565b60008181526020819052604090205467ffffffffffffffff16156101c25760405162461bcd60e51b815260206004820152601660248201527f5265717565737420616c7265616479206578697374730000000000000000000060448201526064015b60405180910390fd5b6000908152602081905260409020805467ffffffffffffffff19164267ffffffffffffffff16179055565b60008181526020819052604081205467ffffffffffffffff1690036102545760405162461bcd60e51b815260206004820152601660248201527f5265717565737420646f6573206e6f742065786973740000000000000000000060448201526064016101b9565b60008181526020819052604090205468010000000000000000900467ffffffffffffffff16156102c65760405162461bcd60e51b815260206004820152601960248201527f5265717565737420616c72656164792066696e616c697a65640000000000000060448201526064016101b9565b600090815260208190526040902080547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff16680100000000000000004267ffffffffffffffff1602179055565b60006020828403121561032557600080fd5b5035919050565b60006020828403121561033e57600080fd5b813563ffffffff8116811461035257600080fd5b939250505056fea264697066735822122055871f75984e605847d108927adce620ee53092ce1a8687c18894e27ec83fa8e64736f6c63430008110033",
-  "deployedBytecode": "0x608060405234801561001057600080fd5b50600436106100675760003560e01c80636c626aa4116100505780636c626aa4146100ab578063d5b0b0ce1461011a578063db4aa6cb1461014457600080fd5b806309b53f511461006c578063477ffd6514610096575b600080fd5b60015461007c9063ffffffff1681565b60405163ffffffff90911681526020015b60405180910390f35b6100a96100a4366004610313565b610157565b005b6100f96100b9366004610313565b6000908152602081815260409182902082518084019093525467ffffffffffffffff80821680855268010000000000000000909204169290910182905291565b6040805167ffffffffffffffff93841681529290911660208301520161008d565b6100a961012836600461032c565b6001805463ffffffff191663ffffffff92909216919091179055565b6100a9610152366004610313565b6101ed565b60008181526020819052604090205467ffffffffffffffff16156101c25760405162461bcd60e51b815260206004820152601660248201527f5265717565737420616c7265616479206578697374730000000000000000000060448201526064015b60405180910390fd5b6000908152602081905260409020805467ffffffffffffffff19164267ffffffffffffffff16179055565b60008181526020819052604081205467ffffffffffffffff1690036102545760405162461bcd60e51b815260206004820152601660248201527f5265717565737420646f6573206e6f742065786973740000000000000000000060448201526064016101b9565b60008181526020819052604090205468010000000000000000900467ffffffffffffffff16156102c65760405162461bcd60e51b815260206004820152601960248201527f5265717565737420616c72656164792066696e616c697a65640000000000000060448201526064016101b9565b600090815260208190526040902080547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff16680100000000000000004267ffffffffffffffff1602179055565b60006020828403121561032557600080fd5b5035919050565b60006020828403121561033e57600080fd5b813563ffffffff8116811461035257600080fd5b939250505056fea264697066735822122055871f75984e605847d108927adce620ee53092ce1a8687c18894e27ec83fa8e64736f6c63430008110033",
+  "bytecode": "0x60806040526001805463ffffffff1916606417905534801561002057600080fd5b5061038f806100306000396000f3fe608060405234801561001057600080fd5b50600436106100675760003560e01c80636c626aa4116100505780636c626aa4146100ab578063d5b0b0ce1461011a578063db4aa6cb1461014457600080fd5b806309b53f511461006c578063477ffd6514610096575b600080fd5b60015461007c9063ffffffff1681565b60405163ffffffff90911681526020015b60405180910390f35b6100a96100a4366004610313565b610157565b005b6100f96100b9366004610313565b6000908152602081815260409182902082518084019093525467ffffffffffffffff80821680855268010000000000000000909204169290910182905291565b6040805167ffffffffffffffff93841681529290911660208301520161008d565b6100a961012836600461032c565b6001805463ffffffff191663ffffffff92909216919091179055565b6100a9610152366004610313565b6101ed565b60008181526020819052604090205467ffffffffffffffff16156101c25760405162461bcd60e51b815260206004820152601660248201527f5265717565737420616c7265616479206578697374730000000000000000000060448201526064015b60405180910390fd5b6000908152602081905260409020805467ffffffffffffffff19164267ffffffffffffffff16179055565b60008181526020819052604081205467ffffffffffffffff1690036102545760405162461bcd60e51b815260206004820152601660248201527f5265717565737420646f6573206e6f742065786973740000000000000000000060448201526064016101b9565b60008181526020819052604090205468010000000000000000900467ffffffffffffffff16156102c65760405162461bcd60e51b815260206004820152601960248201527f5265717565737420616c72656164792066696e616c697a65640000000000000060448201526064016101b9565b600090815260208190526040902080547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff16680100000000000000004267ffffffffffffffff1602179055565b60006020828403121561032557600080fd5b5035919050565b60006020828403121561033e57600080fd5b813563ffffffff8116811461035257600080fd5b939250505056fea26469706673582212206f0dde750a92d5fbaff995b2dacf36fde5cbf75877fb2be6fd03c1db7747be3e64736f6c63430008110033",
+  "deployedBytecode": "0x608060405234801561001057600080fd5b50600436106100675760003560e01c80636c626aa4116100505780636c626aa4146100ab578063d5b0b0ce1461011a578063db4aa6cb1461014457600080fd5b806309b53f511461006c578063477ffd6514610096575b600080fd5b60015461007c9063ffffffff1681565b60405163ffffffff90911681526020015b60405180910390f35b6100a96100a4366004610313565b610157565b005b6100f96100b9366004610313565b6000908152602081815260409182902082518084019093525467ffffffffffffffff80821680855268010000000000000000909204169290910182905291565b6040805167ffffffffffffffff93841681529290911660208301520161008d565b6100a961012836600461032c565b6001805463ffffffff191663ffffffff92909216919091179055565b6100a9610152366004610313565b6101ed565b60008181526020819052604090205467ffffffffffffffff16156101c25760405162461bcd60e51b815260206004820152601660248201527f5265717565737420616c7265616479206578697374730000000000000000000060448201526064015b60405180910390fd5b6000908152602081905260409020805467ffffffffffffffff19164267ffffffffffffffff16179055565b60008181526020819052604081205467ffffffffffffffff1690036102545760405162461bcd60e51b815260206004820152601660248201527f5265717565737420646f6573206e6f742065786973740000000000000000000060448201526064016101b9565b60008181526020819052604090205468010000000000000000900467ffffffffffffffff16156102c65760405162461bcd60e51b815260206004820152601960248201527f5265717565737420616c72656164792066696e616c697a65640000000000000060448201526064016101b9565b600090815260208190526040902080547fffffffffffffffffffffffffffffffff0000000000000000ffffffffffffffff16680100000000000000004267ffffffffffffffff1602179055565b60006020828403121561032557600080fd5b5035919050565b60006020828403121561033e57600080fd5b813563ffffffff8116811461035257600080fd5b939250505056fea26469706673582212206f0dde750a92d5fbaff995b2dacf36fde5cbf75877fb2be6fd03c1db7747be3e64736f6c63430008110033",
   "linkReferences": {},
   "deployedLinkReferences": {},
   "devdoc": {
@@ -108,38 +108,38 @@
       "functionDebugData": {},
       "generatedSources": [],
       "linkReferences": {},
-      "opcodes": "PUSH1 0x80 PUSH1 0x40 MSTORE PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH1 0x64 OR SWAP1 SSTORE CALLVALUE DUP1 ISZERO PUSH2 0x20 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH2 0x38F DUP1 PUSH2 0x30 PUSH1 0x0 CODECOPY PUSH1 0x0 RETURN INVALID PUSH1 0x80 PUSH1 0x40 MSTORE CALLVALUE DUP1 ISZERO PUSH2 0x10 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH1 0x4 CALLDATASIZE LT PUSH2 0x67 JUMPI PUSH1 0x0 CALLDATALOAD PUSH1 0xE0 SHR DUP1 PUSH4 0x6C626AA4 GT PUSH2 0x50 JUMPI DUP1 PUSH4 0x6C626AA4 EQ PUSH2 0xAB JUMPI DUP1 PUSH4 0xD5B0B0CE EQ PUSH2 0x11A JUMPI DUP1 PUSH4 0xDB4AA6CB EQ PUSH2 0x144 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP1 PUSH4 0x9B53F51 EQ PUSH2 0x6C JUMPI DUP1 PUSH4 0x477FFD65 EQ PUSH2 0x96 JUMPI JUMPDEST PUSH1 0x0 DUP1 REVERT JUMPDEST PUSH1 0x1 SLOAD PUSH2 0x7C SWAP1 PUSH4 0xFFFFFFFF AND DUP2 JUMP JUMPDEST PUSH1 0x40 MLOAD PUSH4 0xFFFFFFFF SWAP1 SWAP2 AND DUP2 MSTORE PUSH1 0x20 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 RETURN JUMPDEST PUSH2 0xA9 PUSH2 0xA4 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x157 JUMP JUMPDEST STOP JUMPDEST PUSH2 0xF9 PUSH2 0xB9 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 DUP2 MSTORE PUSH1 0x40 SWAP2 DUP3 SWAP1 KECCAK256 DUP3 MLOAD DUP1 DUP5 ADD SWAP1 SWAP4 MSTORE SLOAD PUSH8 0xFFFFFFFFFFFFFFFF DUP1 DUP3 AND DUP1 DUP6 MSTORE PUSH9 0x10000000000000000 SWAP1 SWAP3 DIV AND SWAP3 SWAP1 SWAP2 ADD DUP3 SWAP1 MSTORE SWAP2 JUMP JUMPDEST PUSH1 0x40 DUP1 MLOAD PUSH8 0xFFFFFFFFFFFFFFFF SWAP4 DUP5 AND DUP2 MSTORE SWAP3 SWAP1 SWAP2 AND PUSH1 0x20 DUP4 ADD MSTORE ADD PUSH2 0x8D JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x128 CALLDATASIZE PUSH1 0x4 PUSH2 0x32C JUMP JUMPDEST PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH4 0xFFFFFFFF SWAP3 SWAP1 SWAP3 AND SWAP2 SWAP1 SWAP2 OR SWAP1 SSTORE JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x152 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x1ED JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x1C2 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792065786973747300000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 REVERT JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF NOT AND TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 DUP2 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND SWAP1 SUB PUSH2 0x254 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420646F6573206E6F7420657869737400000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH9 0x10000000000000000 SWAP1 DIV PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x2C6 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x19 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792066696E616C697A656400000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH32 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF AND PUSH9 0x10000000000000000 TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND MUL OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x325 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP CALLDATALOAD SWAP2 SWAP1 POP JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x33E JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP2 CALLDATALOAD PUSH4 0xFFFFFFFF DUP2 AND DUP2 EQ PUSH2 0x352 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST SWAP4 SWAP3 POP POP POP JUMP INVALID LOG2 PUSH5 0x6970667358 0x22 SLT KECCAK256 SSTORE DUP8 0x1F PUSH22 0x984E605847D108927ADCE620EE53092CE1A8687C1889 0x4E 0x27 0xEC DUP4 STATICCALL DUP15 PUSH5 0x736F6C6343 STOP ADDMOD GT STOP CALLER ",
-      "sourceMap": "4680:1784:123:-:0;;;4860:47;;;-1:-1:-1;;4860:47:123;4904:3;4860:47;;;4680:1784;;;;;;;;;;;;;;;;"
+      "opcodes": "PUSH1 0x80 PUSH1 0x40 MSTORE PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH1 0x64 OR SWAP1 SSTORE CALLVALUE DUP1 ISZERO PUSH2 0x20 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH2 0x38F DUP1 PUSH2 0x30 PUSH1 0x0 CODECOPY PUSH1 0x0 RETURN INVALID PUSH1 0x80 PUSH1 0x40 MSTORE CALLVALUE DUP1 ISZERO PUSH2 0x10 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH1 0x4 CALLDATASIZE LT PUSH2 0x67 JUMPI PUSH1 0x0 CALLDATALOAD PUSH1 0xE0 SHR DUP1 PUSH4 0x6C626AA4 GT PUSH2 0x50 JUMPI DUP1 PUSH4 0x6C626AA4 EQ PUSH2 0xAB JUMPI DUP1 PUSH4 0xD5B0B0CE EQ PUSH2 0x11A JUMPI DUP1 PUSH4 0xDB4AA6CB EQ PUSH2 0x144 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP1 PUSH4 0x9B53F51 EQ PUSH2 0x6C JUMPI DUP1 PUSH4 0x477FFD65 EQ PUSH2 0x96 JUMPI JUMPDEST PUSH1 0x0 DUP1 REVERT JUMPDEST PUSH1 0x1 SLOAD PUSH2 0x7C SWAP1 PUSH4 0xFFFFFFFF AND DUP2 JUMP JUMPDEST PUSH1 0x40 MLOAD PUSH4 0xFFFFFFFF SWAP1 SWAP2 AND DUP2 MSTORE PUSH1 0x20 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 RETURN JUMPDEST PUSH2 0xA9 PUSH2 0xA4 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x157 JUMP JUMPDEST STOP JUMPDEST PUSH2 0xF9 PUSH2 0xB9 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 DUP2 MSTORE PUSH1 0x40 SWAP2 DUP3 SWAP1 KECCAK256 DUP3 MLOAD DUP1 DUP5 ADD SWAP1 SWAP4 MSTORE SLOAD PUSH8 0xFFFFFFFFFFFFFFFF DUP1 DUP3 AND DUP1 DUP6 MSTORE PUSH9 0x10000000000000000 SWAP1 SWAP3 DIV AND SWAP3 SWAP1 SWAP2 ADD DUP3 SWAP1 MSTORE SWAP2 JUMP JUMPDEST PUSH1 0x40 DUP1 MLOAD PUSH8 0xFFFFFFFFFFFFFFFF SWAP4 DUP5 AND DUP2 MSTORE SWAP3 SWAP1 SWAP2 AND PUSH1 0x20 DUP4 ADD MSTORE ADD PUSH2 0x8D JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x128 CALLDATASIZE PUSH1 0x4 PUSH2 0x32C JUMP JUMPDEST PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH4 0xFFFFFFFF SWAP3 SWAP1 SWAP3 AND SWAP2 SWAP1 SWAP2 OR SWAP1 SSTORE JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x152 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x1ED JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x1C2 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792065786973747300000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 REVERT JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF NOT AND TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 DUP2 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND SWAP1 SUB PUSH2 0x254 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420646F6573206E6F7420657869737400000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH9 0x10000000000000000 SWAP1 DIV PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x2C6 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x19 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792066696E616C697A656400000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH32 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF AND PUSH9 0x10000000000000000 TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND MUL OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x325 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP CALLDATALOAD SWAP2 SWAP1 POP JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x33E JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP2 CALLDATALOAD PUSH4 0xFFFFFFFF DUP2 AND DUP2 EQ PUSH2 0x352 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST SWAP4 SWAP3 POP POP POP JUMP INVALID LOG2 PUSH5 0x6970667358 0x22 SLT KECCAK256 PUSH16 0xDDE750A92D5FBAFF995B2DACF36FDE5 0xCB 0xF7 PC PUSH24 0xFB2BE6FD03C1DB7747BE3E64736F6C634300081100330000 ",
+      "sourceMap": "4916:1784:123:-:0;;;5096:47;;;-1:-1:-1;;5096:47:123;5140:3;5096:47;;;4916:1784;;;;;;;;;;;;;;;;"
     },
     "deployedBytecode": {
       "functionDebugData": {
-        "@createOptimisticMintingRequest_41880": {
+        "@createOptimisticMintingRequest_41860": {
           "entryPoint": 343,
-          "id": 41880,
+          "id": 41860,
           "parameterSlots": 1,
           "returnSlots": 0
         },
-        "@finalizeOptimisticMintingRequest_41918": {
+        "@finalizeOptimisticMintingRequest_41898": {
           "entryPoint": 493,
-          "id": 41918,
+          "id": 41898,
           "parameterSlots": 1,
           "returnSlots": 0
         },
-        "@optimisticMintingFeeDivisor_41829": {
+        "@optimisticMintingFeeDivisor_41809": {
           "entryPoint": null,
-          "id": 41829,
+          "id": 41809,
           "parameterSlots": 0,
           "returnSlots": 0
         },
-        "@optimisticMintingRequests_41852": {
+        "@optimisticMintingRequests_41832": {
           "entryPoint": null,
-          "id": 41852,
+          "id": 41832,
           "parameterSlots": 1,
           "returnSlots": 2
         },
-        "@setOptimisticMintingFeeDivisor_41928": {
+        "@setOptimisticMintingFeeDivisor_41908": {
           "entryPoint": null,
-          "id": 41928,
+          "id": 41908,
           "parameterSlots": 1,
           "returnSlots": 0
         },
@@ -1428,8 +1428,8 @@
       ],
       "immutableReferences": {},
       "linkReferences": {},
-      "opcodes": "PUSH1 0x80 PUSH1 0x40 MSTORE CALLVALUE DUP1 ISZERO PUSH2 0x10 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH1 0x4 CALLDATASIZE LT PUSH2 0x67 JUMPI PUSH1 0x0 CALLDATALOAD PUSH1 0xE0 SHR DUP1 PUSH4 0x6C626AA4 GT PUSH2 0x50 JUMPI DUP1 PUSH4 0x6C626AA4 EQ PUSH2 0xAB JUMPI DUP1 PUSH4 0xD5B0B0CE EQ PUSH2 0x11A JUMPI DUP1 PUSH4 0xDB4AA6CB EQ PUSH2 0x144 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP1 PUSH4 0x9B53F51 EQ PUSH2 0x6C JUMPI DUP1 PUSH4 0x477FFD65 EQ PUSH2 0x96 JUMPI JUMPDEST PUSH1 0x0 DUP1 REVERT JUMPDEST PUSH1 0x1 SLOAD PUSH2 0x7C SWAP1 PUSH4 0xFFFFFFFF AND DUP2 JUMP JUMPDEST PUSH1 0x40 MLOAD PUSH4 0xFFFFFFFF SWAP1 SWAP2 AND DUP2 MSTORE PUSH1 0x20 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 RETURN JUMPDEST PUSH2 0xA9 PUSH2 0xA4 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x157 JUMP JUMPDEST STOP JUMPDEST PUSH2 0xF9 PUSH2 0xB9 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 DUP2 MSTORE PUSH1 0x40 SWAP2 DUP3 SWAP1 KECCAK256 DUP3 MLOAD DUP1 DUP5 ADD SWAP1 SWAP4 MSTORE SLOAD PUSH8 0xFFFFFFFFFFFFFFFF DUP1 DUP3 AND DUP1 DUP6 MSTORE PUSH9 0x10000000000000000 SWAP1 SWAP3 DIV AND SWAP3 SWAP1 SWAP2 ADD DUP3 SWAP1 MSTORE SWAP2 JUMP JUMPDEST PUSH1 0x40 DUP1 MLOAD PUSH8 0xFFFFFFFFFFFFFFFF SWAP4 DUP5 AND DUP2 MSTORE SWAP3 SWAP1 SWAP2 AND PUSH1 0x20 DUP4 ADD MSTORE ADD PUSH2 0x8D JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x128 CALLDATASIZE PUSH1 0x4 PUSH2 0x32C JUMP JUMPDEST PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH4 0xFFFFFFFF SWAP3 SWAP1 SWAP3 AND SWAP2 SWAP1 SWAP2 OR SWAP1 SSTORE JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x152 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x1ED JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x1C2 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792065786973747300000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 REVERT JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF NOT AND TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 DUP2 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND SWAP1 SUB PUSH2 0x254 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420646F6573206E6F7420657869737400000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH9 0x10000000000000000 SWAP1 DIV PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x2C6 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x19 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792066696E616C697A656400000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH32 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF AND PUSH9 0x10000000000000000 TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND MUL OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x325 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP CALLDATALOAD SWAP2 SWAP1 POP JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x33E JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP2 CALLDATALOAD PUSH4 0xFFFFFFFF DUP2 AND DUP2 EQ PUSH2 0x352 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST SWAP4 SWAP3 POP POP POP JUMP INVALID LOG2 PUSH5 0x6970667358 0x22 SLT KECCAK256 SSTORE DUP8 0x1F PUSH22 0x984E605847D108927ADCE620EE53092CE1A8687C1889 0x4E 0x27 0xEC DUP4 STATICCALL DUP15 PUSH5 0x736F6C6343 STOP ADDMOD GT STOP CALLER ",
-      "sourceMap": "4680:1784:123:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4860:47;;;;;;;;;;;;188:10:130;176:23;;;158:42;;146:2;131:18;4860:47:123;;;;;;;;5362:325;;;;;;:::i;:::-;;:::i;:::-;;4920:255;;;;;;:::i;:::-;5009:18;5088:21;;;;;;;;;;;;5063:46;;;;;;;;;;;;;;;;;;;;;;;;;;;;;4920:255;;;;;576:18:130;621:15;;;603:34;;673:15;;;;668:2;653:18;;646:43;539:18;4920:255:123;396:299:130;6347:115:123;;;;;;:::i;:::-;6420:27;:35;;-1:-1:-1;;6420:35:123;;;;;;;;;;;;6347:115;5874:467;;;;;;:::i;:::-;;:::i;5362:325::-;5468:9;:21;;;;;;;;;;:33;;;:38;5447:107;;;;-1:-1:-1;;;5447:107:123;;1183:2:130;5447:107:123;;;1165:21:130;1222:2;1202:18;;;1195:30;1261:24;1241:18;;;1234:52;1303:18;;5447:107:123;;;;;;;;;5621:9;:21;;;;;;;;;;:59;;-1:-1:-1;;5621:59:123;5664:15;5621:59;;;;;5362:325::o;5874:467::-;6002:9;:21;;;;;;;;;;:33;;;:38;;5981:107;;;;-1:-1:-1;;;5981:107:123;;1534:2:130;5981:107:123;;;1516:21:130;1573:2;1553:18;;;1546:30;1612:24;1592:18;;;1585:52;1654:18;;5981:107:123;1332:346:130;5981:107:123;6119:9;:21;;;;;;;;;;:33;;;;;;:38;6098:110;;;;-1:-1:-1;;;6098:110:123;;1885:2:130;6098:110:123;;;1867:21:130;1924:2;1904:18;;;1897:30;1963:27;1943:18;;;1936:55;2008:18;;6098:110:123;1683:349:130;6098:110:123;6275:9;:21;;;;;;;;;;:59;;;;;6318:15;6275:59;;;;;;5874:467::o;211:180:130:-;270:6;323:2;311:9;302:7;298:23;294:32;291:52;;;339:1;336;329:12;291:52;-1:-1:-1;362:23:130;;211:180;-1:-1:-1;211:180:130:o;700:276::-;758:6;811:2;799:9;790:7;786:23;782:32;779:52;;;827:1;824;817:12;779:52;866:9;853:23;916:10;909:5;905:22;898:5;895:33;885:61;;942:1;939;932:12;885:61;965:5;700:276;-1:-1:-1;;;700:276:130:o"
+      "opcodes": "PUSH1 0x80 PUSH1 0x40 MSTORE CALLVALUE DUP1 ISZERO PUSH2 0x10 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP PUSH1 0x4 CALLDATASIZE LT PUSH2 0x67 JUMPI PUSH1 0x0 CALLDATALOAD PUSH1 0xE0 SHR DUP1 PUSH4 0x6C626AA4 GT PUSH2 0x50 JUMPI DUP1 PUSH4 0x6C626AA4 EQ PUSH2 0xAB JUMPI DUP1 PUSH4 0xD5B0B0CE EQ PUSH2 0x11A JUMPI DUP1 PUSH4 0xDB4AA6CB EQ PUSH2 0x144 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP1 PUSH4 0x9B53F51 EQ PUSH2 0x6C JUMPI DUP1 PUSH4 0x477FFD65 EQ PUSH2 0x96 JUMPI JUMPDEST PUSH1 0x0 DUP1 REVERT JUMPDEST PUSH1 0x1 SLOAD PUSH2 0x7C SWAP1 PUSH4 0xFFFFFFFF AND DUP2 JUMP JUMPDEST PUSH1 0x40 MLOAD PUSH4 0xFFFFFFFF SWAP1 SWAP2 AND DUP2 MSTORE PUSH1 0x20 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 RETURN JUMPDEST PUSH2 0xA9 PUSH2 0xA4 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x157 JUMP JUMPDEST STOP JUMPDEST PUSH2 0xF9 PUSH2 0xB9 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 DUP2 MSTORE PUSH1 0x40 SWAP2 DUP3 SWAP1 KECCAK256 DUP3 MLOAD DUP1 DUP5 ADD SWAP1 SWAP4 MSTORE SLOAD PUSH8 0xFFFFFFFFFFFFFFFF DUP1 DUP3 AND DUP1 DUP6 MSTORE PUSH9 0x10000000000000000 SWAP1 SWAP3 DIV AND SWAP3 SWAP1 SWAP2 ADD DUP3 SWAP1 MSTORE SWAP2 JUMP JUMPDEST PUSH1 0x40 DUP1 MLOAD PUSH8 0xFFFFFFFFFFFFFFFF SWAP4 DUP5 AND DUP2 MSTORE SWAP3 SWAP1 SWAP2 AND PUSH1 0x20 DUP4 ADD MSTORE ADD PUSH2 0x8D JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x128 CALLDATASIZE PUSH1 0x4 PUSH2 0x32C JUMP JUMPDEST PUSH1 0x1 DUP1 SLOAD PUSH4 0xFFFFFFFF NOT AND PUSH4 0xFFFFFFFF SWAP3 SWAP1 SWAP3 AND SWAP2 SWAP1 SWAP2 OR SWAP1 SSTORE JUMP JUMPDEST PUSH2 0xA9 PUSH2 0x152 CALLDATASIZE PUSH1 0x4 PUSH2 0x313 JUMP JUMPDEST PUSH2 0x1ED JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x1C2 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792065786973747300000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD JUMPDEST PUSH1 0x40 MLOAD DUP1 SWAP2 SUB SWAP1 REVERT JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF NOT AND TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 DUP2 KECCAK256 SLOAD PUSH8 0xFFFFFFFFFFFFFFFF AND SWAP1 SUB PUSH2 0x254 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x16 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420646F6573206E6F7420657869737400000000000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 DUP2 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 SLOAD PUSH9 0x10000000000000000 SWAP1 DIV PUSH8 0xFFFFFFFFFFFFFFFF AND ISZERO PUSH2 0x2C6 JUMPI PUSH1 0x40 MLOAD PUSH3 0x461BCD PUSH1 0xE5 SHL DUP2 MSTORE PUSH1 0x20 PUSH1 0x4 DUP3 ADD MSTORE PUSH1 0x19 PUSH1 0x24 DUP3 ADD MSTORE PUSH32 0x5265717565737420616C72656164792066696E616C697A656400000000000000 PUSH1 0x44 DUP3 ADD MSTORE PUSH1 0x64 ADD PUSH2 0x1B9 JUMP JUMPDEST PUSH1 0x0 SWAP1 DUP2 MSTORE PUSH1 0x20 DUP2 SWAP1 MSTORE PUSH1 0x40 SWAP1 KECCAK256 DUP1 SLOAD PUSH32 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF AND PUSH9 0x10000000000000000 TIMESTAMP PUSH8 0xFFFFFFFFFFFFFFFF AND MUL OR SWAP1 SSTORE JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x325 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST POP CALLDATALOAD SWAP2 SWAP1 POP JUMP JUMPDEST PUSH1 0x0 PUSH1 0x20 DUP3 DUP5 SUB SLT ISZERO PUSH2 0x33E JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST DUP2 CALLDATALOAD PUSH4 0xFFFFFFFF DUP2 AND DUP2 EQ PUSH2 0x352 JUMPI PUSH1 0x0 DUP1 REVERT JUMPDEST SWAP4 SWAP3 POP POP POP JUMP INVALID LOG2 PUSH5 0x6970667358 0x22 SLT KECCAK256 PUSH16 0xDDE750A92D5FBAFF995B2DACF36FDE5 0xCB 0xF7 PC PUSH24 0xFB2BE6FD03C1DB7747BE3E64736F6C634300081100330000 ",
+      "sourceMap": "4916:1784:123:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;5096:47;;;;;;;;;;;;188:10:130;176:23;;;158:42;;146:2;131:18;5096:47:123;;;;;;;;5598:325;;;;;;:::i;:::-;;:::i;:::-;;5156:255;;;;;;:::i;:::-;5245:18;5324:21;;;;;;;;;;;;5299:46;;;;;;;;;;;;;;;;;;;;;;;;;;;;;5156:255;;;;;576:18:130;621:15;;;603:34;;673:15;;;;668:2;653:18;;646:43;539:18;5156:255:123;396:299:130;6583:115:123;;;;;;:::i;:::-;6656:27;:35;;-1:-1:-1;;6656:35:123;;;;;;;;;;;;6583:115;6110:467;;;;;;:::i;:::-;;:::i;5598:325::-;5704:9;:21;;;;;;;;;;:33;;;:38;5683:107;;;;-1:-1:-1;;;5683:107:123;;1183:2:130;5683:107:123;;;1165:21:130;1222:2;1202:18;;;1195:30;1261:24;1241:18;;;1234:52;1303:18;;5683:107:123;;;;;;;;;5857:9;:21;;;;;;;;;;:59;;-1:-1:-1;;5857:59:123;5900:15;5857:59;;;;;5598:325::o;6110:467::-;6238:9;:21;;;;;;;;;;:33;;;:38;;6217:107;;;;-1:-1:-1;;;6217:107:123;;1534:2:130;6217:107:123;;;1516:21:130;1573:2;1553:18;;;1546:30;1612:24;1592:18;;;1585:52;1654:18;;6217:107:123;1332:346:130;6217:107:123;6355:9;:21;;;;;;;;;;:33;;;;;;:38;6334:110;;;;-1:-1:-1;;;6334:110:123;;1885:2:130;6334:110:123;;;1867:21:130;1924:2;1904:18;;;1897:30;1963:27;1943:18;;;1936:55;2008:18;;6334:110:123;1683:349:130;6334:110:123;6511:9;:21;;;;;;;;;;:59;;;;;6554:15;6511:59;;;;;;6110:467::o;211:180:130:-;270:6;323:2;311:9;302:7;298:23;294:32;291:52;;;339:1;336;329:12;291:52;-1:-1:-1;362:23:130;;211:180;-1:-1:-1;211:180:130:o;700:276::-;758:6;811:2;799:9;790:7;786:23;782:32;779:52;;;827:1;824;817:12;779:52;866:9;853:23;916:10;909:5;905:22;898:5;895:33;885:61;;942:1;939;932:12;885:61;965:5;700:276;-1:-1:-1;;;700:276:130:o"
     },
     "gasEstimates": {
       "creation": {
@@ -1453,19 +1453,19 @@
       "setOptimisticMintingFeeDivisor(uint32)": "d5b0b0ce"
     }
   },
-  "metadata": "{\"compiler\":{\"version\":\"0.8.17+commit.8df45f5f\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"createOptimisticMintingRequest\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"finalizeOptimisticMintingRequest\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"optimisticMintingFeeDivisor\",\"outputs\":[{\"internalType\":\"uint32\",\"name\":\"\",\"type\":\"uint32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"optimisticMintingRequests\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"requestedAt\",\"type\":\"uint64\"},{\"internalType\":\"uint64\",\"name\":\"finalizedAt\",\"type\":\"uint64\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint32\",\"name\":\"value\",\"type\":\"uint32\"}],\"name\":\"setOptimisticMintingFeeDivisor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{\"createOptimisticMintingRequest(uint256)\":{\"details\":\"The function is virtual to allow other projects using this mock      for AbtractTBTCDepositor-based contract tests to add any custom      logic needed.\"},\"finalizeOptimisticMintingRequest(uint256)\":{\"details\":\"The function is virtual to allow other projects using this mock      for AbtractTBTCDepositor-based contract tests to add any custom      logic needed.\"},\"optimisticMintingRequests(uint256)\":{\"details\":\"See {TBTCVault#optimisticMintingRequests}\"}},\"stateVariables\":{\"optimisticMintingFeeDivisor\":{\"details\":\"See {TBTCVault#optimisticMintingFeeDivisor}\"}},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/test/TestTBTCDepositor.sol\":\"MockTBTCVault\"},\"evmVersion\":\"london\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[]},\"sources\":{\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title BitcoinSPV */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\n\\nlibrary BTCUtils {\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    // The target at minimum Difficulty. Also the target of the genesis block\\n    uint256 public constant DIFF1_TARGET = 0xffff0000000000000000000000000000000000000000000000000000;\\n\\n    uint256 public constant RETARGET_PERIOD = 2 * 7 * 24 * 60 * 60;  // 2 weeks in seconds\\n    uint256 public constant RETARGET_PERIOD_BLOCKS = 2016;  // 2 weeks in blocks\\n\\n    uint256 public constant ERR_BAD_ARG = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n\\n    /* ***** */\\n    /* UTILS */\\n    /* ***** */\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _flag    The first byte of a VarInt\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLength(bytes memory _flag) internal pure returns (uint8) {\\n        return determineVarIntDataLengthAt(_flag, 0);\\n    }\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _b       The byte array containing a VarInt\\n    /// @param _at      The position of the VarInt in the array\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLengthAt(bytes memory _b, uint256 _at) internal pure returns (uint8) {\\n        if (uint8(_b[_at]) == 0xff) {\\n            return 8;  // one-byte flag, 8 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfe) {\\n            return 4;  // one-byte flag, 4 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfd) {\\n            return 2;  // one-byte flag, 2 bytes data\\n        }\\n\\n        return 0;  // flag is data\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string starting with a VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarInt(bytes memory _b) internal pure returns (uint256, uint256) {\\n        return parseVarIntAt(_b, 0);\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string containing a VarInt\\n    /// @param _at  The position of the VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarIntAt(bytes memory _b, uint256 _at) internal pure returns (uint256, uint256) {\\n        uint8 _dataLen = determineVarIntDataLengthAt(_b, _at);\\n\\n        if (_dataLen == 0) {\\n            return (0, uint8(_b[_at]));\\n        }\\n        if (_b.length < 1 + _dataLen + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n        uint256 _number;\\n        if (_dataLen == 2) {\\n            _number = reverseUint16(uint16(_b.slice2(1 + _at)));\\n        } else if (_dataLen == 4) {\\n            _number = reverseUint32(uint32(_b.slice4(1 + _at)));\\n        } else if (_dataLen == 8) {\\n            _number = reverseUint64(uint64(_b.slice8(1 + _at)));\\n        }\\n        return (_dataLen, _number);\\n    }\\n\\n    /// @notice          Changes the endianness of a byte array\\n    /// @dev             Returns a new, backwards, bytes\\n    /// @param _b        The bytes to reverse\\n    /// @return          The reversed bytes\\n    function reverseEndianness(bytes memory _b) internal pure returns (bytes memory) {\\n        bytes memory _newValue = new bytes(_b.length);\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _newValue[_b.length - i - 1] = _b[i];\\n        }\\n\\n        return _newValue;\\n    }\\n\\n    /// @notice          Changes the endianness of a uint256\\n    /// @dev             https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint256(uint256 _b) internal pure returns (uint256 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = ((v >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\\n            ((v & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\\n        // swap 8-byte long pairs\\n        v = ((v >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\\n            ((v & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\\n        // swap 16-byte long pairs\\n        v = (v >> 128) | (v << 128);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint64\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint64(uint64 _b) internal pure returns (uint64 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = (v >> 32) | (v << 32);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint32\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint32(uint32 _b) internal pure returns (uint32 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF) |\\n            ((v & 0x00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = (v >> 16) | (v << 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint24\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint24(uint24 _b) internal pure returns (uint24 v) {\\n        v =  (_b << 16) | (_b & 0x00FF00) | (_b >> 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint16\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint16(uint16 _b) internal pure returns (uint16 v) {\\n        v =  (_b << 8) | (_b >> 8);\\n    }\\n\\n\\n    /// @notice          Converts big-endian bytes to a uint\\n    /// @dev             Traverses the byte array and sums the bytes\\n    /// @param _b        The big-endian bytes-encoded integer\\n    /// @return          The integer representation\\n    function bytesToUint(bytes memory _b) internal pure returns (uint256) {\\n        uint256 _number;\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _number = _number + uint8(_b[i]) * (2 ** (8 * (_b.length - (i + 1))));\\n        }\\n\\n        return _number;\\n    }\\n\\n    /// @notice          Get the last _num bytes from a byte array\\n    /// @param _b        The byte array to slice\\n    /// @param _num      The number of bytes to extract from the end\\n    /// @return          The last _num bytes of _b\\n    function lastBytes(bytes memory _b, uint256 _num) internal pure returns (bytes memory) {\\n        uint256 _start = _b.length.sub(_num);\\n\\n        return _b.slice(_start, _num);\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (rmd160(sha2()))\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash160(bytes memory _b) internal pure returns (bytes memory) {\\n        return abi.encodePacked(ripemd160(abi.encodePacked(sha256(_b))));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (sha2 + ripemd160)\\n    /// @dev             sha2 precompile at address(2), ripemd160 at address(3)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash160View(bytes memory _b) internal view returns (bytes20 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 3, 0x00, 32, 0x00, 32))\\n            // read from position 12 = 0c\\n            res := mload(0x0c)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash256(bytes memory _b) internal pure returns (bytes32) {\\n        return sha256(abi.encodePacked(sha256(_b)));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash256View(bytes memory _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 on a pair of bytes32\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _a        The first bytes32 of the pre-image\\n    /// @param _b        The second bytes32 of the pre-image\\n    /// @return res      The digest\\n    function hash256Pair(bytes32 _a, bytes32 _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            mstore(0x00, _a)\\n            mstore(0x20, _b)\\n            pop(staticcall(gas(), 2, 0x00, 64, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The array containing the pre-image\\n    /// @param at        The start of the pre-image\\n    /// @param len       The length of the pre-image\\n    /// @return res      The digest\\n    function hash256Slice(\\n        bytes memory _b,\\n        uint256 at,\\n        uint256 len\\n    ) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, add(32, at)), len, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /* ************ */\\n    /* Legacy Input */\\n    /* ************ */\\n\\n    /// @notice          Extracts the nth input from the vin (0-indexed)\\n    /// @dev             Iterates over the vin. If you need to extract several, write a custom function\\n    /// @param _vin      The vin as a tightly-packed byte array\\n    /// @param _index    The 0-indexed location of the input to extract\\n    /// @return          The input as a byte array\\n    function extractInputAtIndex(bytes memory _vin, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nIns, \\\"Vin read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineInputLengthAt(_vin, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n            _offset = _offset + _len;\\n        }\\n\\n        _len = determineInputLengthAt(_vin, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _vin.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Determines whether an input is legacy\\n    /// @dev             False if no scriptSig, otherwise True\\n    /// @param _input    The input\\n    /// @return          True for legacy, False for witness\\n    function isLegacyInput(bytes memory _input) internal pure returns (bool) {\\n        return _input[36] != hex\\\"00\\\";\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The LEGACY input\\n    /// @return          The length of the script sig\\n    function extractScriptSigLen(bytes memory _input) internal pure returns (uint256, uint256) {\\n        return extractScriptSigLenAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    ///                  starting at the specified position\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The byte array containing the LEGACY input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the script sig\\n    function extractScriptSigLenAt(bytes memory _input, uint256 _at) internal pure returns (uint256, uint256) {\\n        if (_input.length < 37 + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = parseVarIntAt(_input, _at + 36);\\n\\n        return (_varIntDataLen, _scriptSigLen);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The input\\n    /// @return          The length of the input in bytes\\n    function determineInputLength(bytes memory _input) internal pure returns (uint256) {\\n        return determineInputLengthAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig,\\n    ///                  starting at the specified position\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the input in bytes\\n    function determineInputLengthAt(bytes memory _input, uint256 _at) internal pure returns (uint256) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLenAt(_input, _at);\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        return 36 + 1 + _varIntDataLen + _scriptSigLen + 4;\\n    }\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLELegacy(bytes memory _input) internal pure returns (bytes4) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice4(36 + 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceLegacy(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLELegacy(_input));\\n        uint32 _beSequence = reverseUint32(_leSeqence);\\n        return _beSequence;\\n    }\\n    /// @notice          Extracts the VarInt-prepended scriptSig from the input in a tx\\n    /// @dev             Will return hex\\\"00\\\" if passed a witness input\\n    /// @param _input    The LEGACY input\\n    /// @return          The length-prepended scriptSig\\n    function extractScriptSig(bytes memory _input) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice(36, 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n\\n    /* ************* */\\n    /* Witness Input */\\n    /* ************* */\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLEWitness(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(37);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input in a tx\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceWitness(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLEWitness(_input));\\n        uint32 _inputeSequence = reverseUint32(_leSeqence);\\n        return _inputeSequence;\\n    }\\n\\n    /// @notice          Extracts the outpoint from the input in a tx\\n    /// @dev             32-byte tx id with 4-byte index\\n    /// @param _input    The input\\n    /// @return          The outpoint (LE bytes of prev tx hash + LE bytes of prev tx index)\\n    function extractOutpoint(bytes memory _input) internal pure returns (bytes memory) {\\n        return _input.slice(0, 36);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    /// @dev             32-byte tx id\\n    /// @param _input    The input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLE(bytes memory _input) internal pure returns (bytes32) {\\n        return _input.slice32(0);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    ///                  starting at the specified position\\n    /// @dev             32-byte tx id\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes32) {\\n        return _input.slice32(_at);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    /// @dev             4-byte tx index\\n    /// @param _input    The input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLE(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(32);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    ///                  starting at the specified position\\n    /// @dev             4-byte tx index\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes4) {\\n        return _input.slice4(32 + _at);\\n    }\\n\\n    /* ****** */\\n    /* Output */\\n    /* ****** */\\n\\n    /// @notice          Determines the length of an output\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLength(bytes memory _output) internal pure returns (uint256) {\\n        return determineOutputLengthAt(_output, 0);\\n    }\\n\\n    /// @notice          Determines the length of an output\\n    ///                  starting at the specified position\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The position of the output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLengthAt(bytes memory _output, uint256 _at) internal pure returns (uint256) {\\n        if (_output.length < 9 + _at) {\\n            return ERR_BAD_ARG;\\n        }\\n        uint256 _varIntDataLen;\\n        uint256 _scriptPubkeyLength;\\n        (_varIntDataLen, _scriptPubkeyLength) = parseVarIntAt(_output, 8 + _at);\\n\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        // 8-byte value, 1-byte for tag itself\\n        return 8 + 1 + _varIntDataLen + _scriptPubkeyLength;\\n    }\\n\\n    /// @notice          Extracts the output at a given index in the TxOuts vector\\n    /// @dev             Iterates over the vout. If you need to extract multiple, write a custom function\\n    /// @param _vout     The _vout to extract from\\n    /// @param _index    The 0-indexed location of the output to extract\\n    /// @return          The specified output\\n    function extractOutputAtIndex(bytes memory _vout, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nOuts, \\\"Vout read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineOutputLengthAt(_vout, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n            _offset += _len;\\n        }\\n\\n        _len = determineOutputLengthAt(_vout, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n        return _vout.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Extracts the value bytes from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value as LE bytes\\n    function extractValueLE(bytes memory _output) internal pure returns (bytes8) {\\n        return _output.slice8(0);\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value\\n    function extractValue(bytes memory _output) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(extractValueLE(_output));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The starting index of the output in the array\\n    /// @return          The output value\\n    function extractValueAt(bytes memory _output, uint256 _at) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(_output.slice8(_at));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the data from an op return output\\n    /// @dev             Returns hex\\\"\\\" if no data or not an op return\\n    /// @param _output   The output\\n    /// @return          Any data contained in the opreturn output, null if not an op return\\n    function extractOpReturnData(bytes memory _output) internal pure returns (bytes memory) {\\n        if (_output[9] != hex\\\"6a\\\") {\\n            return hex\\\"\\\";\\n        }\\n        bytes1 _dataLen = _output[10];\\n        return _output.slice(11, uint256(uint8(_dataLen)));\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The output\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHash(bytes memory _output) internal pure returns (bytes memory) {\\n        return extractHashAt(_output, 8, _output.length - 8);\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The starting index of the output script in the array\\n    ///                  (output start + 8)\\n    /// @param _len      The length of the output script\\n    ///                  (output length - 8)\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHashAt(\\n        bytes memory _output,\\n        uint256 _at,\\n        uint256 _len\\n    ) internal pure returns (bytes memory) {\\n        uint8 _scriptLen = uint8(_output[_at]);\\n\\n        // don't have to worry about overflow here.\\n        // if _scriptLen + 1 overflows, then output length would have to be < 1\\n        // for this check to pass. if it's < 1, then we errored when assigning\\n        // _scriptLen\\n        if (_scriptLen + 1 != _len) {\\n            return hex\\\"\\\";\\n        }\\n\\n        if (uint8(_output[_at + 1]) == 0) {\\n            if (_scriptLen < 2) {\\n                return hex\\\"\\\";\\n            }\\n            uint256 _payloadLen = uint8(_output[_at + 2]);\\n            // Check for maliciously formatted witness outputs.\\n            // No need to worry about underflow as long b/c of the `< 2` check\\n            if (_payloadLen != _scriptLen - 2 || (_payloadLen != 0x20 && _payloadLen != 0x14)) {\\n                return hex\\\"\\\";\\n            }\\n            return _output.slice(_at + 3, _payloadLen);\\n        } else {\\n            bytes3 _tag = _output.slice3(_at);\\n            // p2pkh\\n            if (_tag == hex\\\"1976a9\\\") {\\n                // Check for maliciously formatted p2pkh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_at + 3]) != 0x14 ||\\n                    _output.slice2(_at + _len - 2) != hex\\\"88ac\\\") {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(_at + 4, 20);\\n            //p2sh\\n            } else if (_tag == hex\\\"17a914\\\") {\\n                // Check for maliciously formatted p2sh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_at + _len - 1]) != 0x87) {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(_at + 3, 20);\\n            }\\n        }\\n        return hex\\\"\\\";  /* NB: will trigger on OPRETURN and any non-standard that doesn't overrun */\\n    }\\n\\n    /* ********** */\\n    /* Witness TX */\\n    /* ********** */\\n\\n\\n    /// @notice      Checks that the vin passed up is properly formatted\\n    /// @dev         Consider a vin with a valid vout in its scriptsig\\n    /// @param _vin  Raw bytes length-prefixed input vector\\n    /// @return      True if it represents a validly formatted vin\\n    function validateVin(bytes memory _vin) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n\\n        // Not valid if it says there are too many or no inputs\\n        if (_nIns == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nIns; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vin.length) {\\n                return false;\\n            }\\n\\n            // Grab the next input and determine its length.\\n            uint256 _nextLen = determineInputLengthAt(_vin, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            // Increase the offset by that much\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vin.length;\\n    }\\n\\n    /// @notice      Checks that the vout passed up is properly formatted\\n    /// @dev         Consider a vout with a valid scriptpubkey\\n    /// @param _vout Raw bytes length-prefixed output vector\\n    /// @return      True if it represents a validly formatted vout\\n    function validateVout(bytes memory _vout) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n\\n        // Not valid if it says there are too many or no outputs\\n        if (_nOuts == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nOuts; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vout.length) {\\n                return false;\\n            }\\n\\n            // Grab the next output and determine its length.\\n            // Increase the offset by that much\\n            uint256 _nextLen = determineOutputLengthAt(_vout, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vout.length;\\n    }\\n\\n\\n\\n    /* ************ */\\n    /* Block Header */\\n    /* ************ */\\n\\n    /// @notice          Extracts the transaction merkle root from a block header\\n    /// @dev             Use verifyHash256Merkle to verify proofs with this root\\n    /// @param _header   The header\\n    /// @return          The merkle root (little-endian)\\n    function extractMerkleRootLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(36);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The header\\n    /// @return          The target threshold\\n    function extractTarget(bytes memory _header) internal pure returns (uint256) {\\n        return extractTargetAt(_header, 0);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The array containing the header\\n    /// @param at        The start of the header\\n    /// @return          The target threshold\\n    function extractTargetAt(bytes memory _header, uint256 at) internal pure returns (uint256) {\\n        uint24 _m = uint24(_header.slice3(72 + at));\\n        uint8 _e = uint8(_header[75 + at]);\\n        uint256 _mantissa = uint256(reverseUint24(_m));\\n        uint _exponent = _e - 3;\\n\\n        return _mantissa * (256 ** _exponent);\\n    }\\n\\n    /// @notice          Calculate difficulty from the difficulty 1 target and current target\\n    /// @dev             Difficulty 1 is 0x1d00ffff on mainnet and testnet\\n    /// @dev             Difficulty 1 is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _target   The current target\\n    /// @return          The block difficulty (bdiff)\\n    function calculateDifficulty(uint256 _target) internal pure returns (uint256) {\\n        // Difficulty 1 calculated from 0x1d00ffff\\n        return DIFF1_TARGET.div(_target);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(4);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The array containing the header\\n    /// @param at        The start of the header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLEAt(\\n        bytes memory _header,\\n        uint256 at\\n    ) internal pure returns (bytes32) {\\n        return _header.slice32(4 + at);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (little-endian bytes)\\n    function extractTimestampLE(bytes memory _header) internal pure returns (bytes4) {\\n        return _header.slice4(68);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (uint)\\n    function extractTimestamp(bytes memory _header) internal pure returns (uint32) {\\n        return reverseUint32(uint32(extractTimestampLE(_header)));\\n    }\\n\\n    /// @notice          Extracts the expected difficulty from a block header\\n    /// @dev             Does NOT verify the work\\n    /// @param _header   The header\\n    /// @return          The difficulty as an integer\\n    function extractDifficulty(bytes memory _header) internal pure returns (uint256) {\\n        return calculateDifficulty(extractTarget(_header));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes memory _a, bytes memory _b) internal view returns (bytes32) {\\n        return hash256View(abi.encodePacked(_a, _b));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes32 _a, bytes32 _b) internal view returns (bytes32) {\\n        return hash256Pair(_a, _b);\\n    }\\n\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Inefficient version.\\n    /// @param _proof    The proof. Tightly packed LE sha256 hashes. The last hash is the root\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(bytes memory _proof, uint _index) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_proof.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Special case for coinbase-only blocks\\n        if (_proof.length == 32) {\\n            return true;\\n        }\\n\\n        // Should never occur\\n        if (_proof.length == 64) {\\n            return false;\\n        }\\n\\n        bytes32 _root = _proof.slice32(_proof.length - 32);\\n        bytes32 _current = _proof.slice32(0);\\n        bytes memory _tree = _proof.slice(32, _proof.length - 64);\\n\\n        return verifyHash256Merkle(_current, _tree, _root, _index);\\n    }\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Efficient version.\\n    /// @param _leaf     The leaf of the proof. LE sha256 hash.\\n    /// @param _tree     The intermediate nodes in the proof.\\n    ///                  Tightly packed LE sha256 hashes.\\n    /// @param _root     The root of the proof. LE sha256 hash.\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(\\n        bytes32 _leaf,\\n        bytes memory _tree,\\n        bytes32 _root,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_tree.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Should never occur\\n        if (_tree.length == 0) {\\n            return false;\\n        }\\n\\n        uint _idx = _index;\\n        bytes32 _current = _leaf;\\n\\n        // i moves in increments of 32\\n        for (uint i = 0; i < _tree.length; i += 32) {\\n            if (_idx % 2 == 1) {\\n                _current = _hash256MerkleStep(_tree.slice32(i), _current);\\n            } else {\\n                _current = _hash256MerkleStep(_current, _tree.slice32(i));\\n            }\\n            _idx = _idx >> 1;\\n        }\\n        return _current == _root;\\n    }\\n\\n    /*\\n    NB: https://github.com/bitcoin/bitcoin/blob/78dae8caccd82cfbfd76557f1fb7d7557c7b5edb/src/pow.cpp#L49-L72\\n    NB: We get a full-bitlength target from this. For comparison with\\n        header-encoded targets we need to mask it with the header target\\n        e.g. (full & truncated) == truncated\\n    */\\n    /// @notice                 performs the bitcoin difficulty retarget\\n    /// @dev                    implements the Bitcoin algorithm precisely\\n    /// @param _previousTarget  the target of the previous period\\n    /// @param _firstTimestamp  the timestamp of the first block in the difficulty period\\n    /// @param _secondTimestamp the timestamp of the last block in the difficulty period\\n    /// @return                 the new period's target threshold\\n    function retargetAlgorithm(\\n        uint256 _previousTarget,\\n        uint256 _firstTimestamp,\\n        uint256 _secondTimestamp\\n    ) internal pure returns (uint256) {\\n        uint256 _elapsedTime = _secondTimestamp.sub(_firstTimestamp);\\n\\n        // Normalize ratio to factor of 4 if very long or very short\\n        if (_elapsedTime < RETARGET_PERIOD.div(4)) {\\n            _elapsedTime = RETARGET_PERIOD.div(4);\\n        }\\n        if (_elapsedTime > RETARGET_PERIOD.mul(4)) {\\n            _elapsedTime = RETARGET_PERIOD.mul(4);\\n        }\\n\\n        /*\\n          NB: high targets e.g. ffff0020 can cause overflows here\\n              so we divide it by 256**2, then multiply by 256**2 later\\n              we know the target is evenly divisible by 256**2, so this isn't an issue\\n        */\\n\\n        uint256 _adjusted = _previousTarget.div(65536).mul(_elapsedTime);\\n        return _adjusted.div(RETARGET_PERIOD).mul(65536);\\n    }\\n}\\n\",\"keccak256\":\"0x439eaa97e9239705f3d31e8d39dccbad32311f1f119e295d53c65e0ae3c5a5fc\"},\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\n\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\n\\nThis is free and unencumbered software released into the public domain.\\n\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\n\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\n\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concat(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bytes memory) {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(0x40, and(\\n                add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                not(31) // Round down to the nearest 32 bytes.\\n            ))\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                        ),\\n                        // and now shift left the number of bytes to\\n                        // leave space for the length in the slot\\n                        exp(0x100, sub(32, newlength))\\n                        ),\\n                        // increase length by the double of the memory\\n                        // bytes length\\n                        mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                    ),\\n                    and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let mlengthmod := mod(mlength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function slice(bytes memory _bytes, uint _start, uint _length) internal  pure returns (bytes memory res) {\\n        if (_length == 0) {\\n            return hex\\\"\\\";\\n        }\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    /// @notice Take a slice of the byte array, overwriting the destination.\\n    /// The length of the slice will equal the length of the destination array.\\n    /// @dev Make sure the destination array has afterspace if required.\\n    /// @param _bytes The source array\\n    /// @param _dest The destination array.\\n    /// @param _start The location to start in the source array.\\n    function sliceInPlace(\\n        bytes memory _bytes,\\n        bytes memory _dest,\\n        uint _start\\n    ) internal pure {\\n        uint _length = _dest.length;\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let res := add(_dest, 32)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n                res := add(res, 32)\\n            } {\\n                mstore(res, mload(src))\\n            }\\n        }\\n    }\\n\\n    // Static slice functions, no bounds checking\\n    /// @notice take a 32-byte slice from the specified position\\n    function slice32(bytes memory _bytes, uint _start) internal pure returns (bytes32 res) {\\n        assembly {\\n            res := mload(add(add(_bytes, 32), _start))\\n        }\\n    }\\n\\n    /// @notice take a 20-byte slice from the specified position\\n    function slice20(bytes memory _bytes, uint _start) internal pure returns (bytes20) {\\n        return bytes20(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 8-byte slice from the specified position\\n    function slice8(bytes memory _bytes, uint _start) internal pure returns (bytes8) {\\n        return bytes8(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 4-byte slice from the specified position\\n    function slice4(bytes memory _bytes, uint _start) internal pure returns (bytes4) {\\n        return bytes4(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 3-byte slice from the specified position\\n    function slice3(bytes memory _bytes, uint _start) internal pure returns (bytes3) {\\n        return bytes3(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 2-byte slice from the specified position\\n    function slice2(bytes memory _bytes, uint _start) internal pure returns (bytes2) {\\n        return bytes2(slice32(_bytes, _start));\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint _start) internal  pure returns (address) {\\n        uint _totalLen = _start + 20;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Address conversion out of bounds.\\\");\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000)\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint _start) internal  pure returns (uint256) {\\n        uint _totalLen = _start + 32;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Uint conversion out of bounds.\\\");\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes) internal view returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {} eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source) pure internal returns (bytes32 result) {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(bytes memory _bytes, uint _start, uint _length) pure internal returns (bytes32 result) {\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x43e0f3b3b23c861bd031588bf410dfdd02e2af17941a89aa38d70e534e0380d1\"},\"@keep-network/bitcoin-spv-sol/contracts/SafeMath.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\nThe MIT License (MIT)\\n\\nCopyright (c) 2016 Smart Contract Solutions, Inc.\\n\\nPermission is hereby granted, free of charge, to any person obtaining\\na copy of this software and associated documentation files (the\\n\\\"Software\\\"), to deal in the Software without restriction, including\\nwithout limitation the rights to use, copy, modify, merge, publish,\\ndistribute, sublicense, and/or sell copies of the Software, and to\\npermit persons to whom the Software is furnished to do so, subject to\\nthe following conditions:\\n\\nThe above copyright notice and this permission notice shall be included\\nin all copies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n*/\\n\\n\\n/**\\n * @title SafeMath\\n * @dev Math operations with safety checks that throw on error\\n */\\nlibrary SafeMath {\\n\\n    /**\\n     * @dev Multiplies two numbers, throws on overflow.\\n     */\\n    function mul(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        // Gas optimization: this is cheaper than asserting 'a' not being zero, but the\\n        // benefit is lost if 'b' is also tested.\\n        // See: https://github.com/OpenZeppelin/openzeppelin-solidity/pull/522\\n        if (_a == 0) {\\n            return 0;\\n        }\\n\\n        c = _a * _b;\\n        require(c / _a == _b, \\\"Overflow during multiplication.\\\");\\n        return c;\\n    }\\n\\n    /**\\n     * @dev Integer division of two numbers, truncating the quotient.\\n     */\\n    function div(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        // assert(_b > 0); // Solidity automatically throws when dividing by 0\\n        // uint256 c = _a / _b;\\n        // assert(_a == _b * c + _a % _b); // There is no case in which this doesn't hold\\n        return _a / _b;\\n    }\\n\\n    /**\\n     * @dev Subtracts two numbers, throws on overflow (i.e. if subtrahend is greater than minuend).\\n     */\\n    function sub(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        require(_b <= _a, \\\"Underflow during subtraction.\\\");\\n        return _a - _b;\\n    }\\n\\n    /**\\n     * @dev Adds two numbers, throws on overflow.\\n     */\\n    function add(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        c = _a + _b;\\n        require(c >= _a, \\\"Overflow during addition.\\\");\\n        return c;\\n    }\\n}\\n\",\"keccak256\":\"0x35930d982394c7ffde439b82e5e696c5b21a6f09699d44861dfe409ef64084a3\"},\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 standard as defined in the EIP.\\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 amount of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the amount of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves `amount` 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 amount) 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 `amount` as the allowance of `spender` over the 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 amount) external returns (bool);\\n\\n    /**\\n     * @dev Moves `amount` tokens from `from` to `to` using the\\n     * allowance mechanism. `amount` 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(\\n        address from,\\n        address to,\\n        uint256 amount\\n    ) external returns (bool);\\n}\\n\",\"keccak256\":\"0x9750c6b834f7b43000631af5cc30001c5f547b3ceb3635488f140f60e897ea6b\",\"license\":\"MIT\"},\"contracts/integrator/AbstractTBTCDepositor.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\n\\nimport \\\"./IBridge.sol\\\";\\nimport \\\"./ITBTCVault.sol\\\";\\n\\n/// @title Abstract AbstractTBTCDepositor contract.\\n/// @notice This abstract contract is meant to facilitate integration of protocols\\n///         aiming to use tBTC as an underlying Bitcoin bridge.\\n///\\n///         Such an integrator is supposed to:\\n///         - Create a child contract inheriting from this abstract contract\\n///         - Call the `__AbstractTBTCDepositor_initialize` initializer function\\n///         - Use the `_initializeDeposit` and `_finalizeDeposit` as part of their\\n///           business logic in order to initialize and finalize deposits.\\n///\\n/// @dev Example usage:\\n///      ```\\n///      // Example upgradeable integrator contract.\\n///      contract ExampleTBTCIntegrator is AbstractTBTCDepositor, Initializable {\\n///          /// @custom:oz-upgrades-unsafe-allow constructor\\n///          constructor() {\\n///              // Prevents the contract from being initialized again.\\n///              _disableInitializers();\\n///          }\\n///\\n///          function initialize(\\n///              address _bridge,\\n///              address _tbtcVault\\n///          ) external initializer {\\n///              __AbstractTBTCDepositor_initialize(_bridge, _tbtcVault);\\n///          }\\n///\\n///          function startProcess(\\n///              IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n///              IBridgeTypes.DepositRevealInfo calldata reveal\\n///          ) external {\\n///              // Embed necessary context as extra data.\\n///              bytes32 extraData = ...;\\n///\\n///              uint256 depositKey = _initializeDeposit(\\n///                  fundingTx,\\n///                  reveal,\\n///                  extraData\\n///              );\\n///\\n///              // Use the depositKey to track the process.\\n///          }\\n///\\n///          function finalizeProcess(uint256 depositKey) external {\\n///              // Ensure the function cannot be called for the same deposit\\n///              // twice.\\n///\\n///              (\\n///                  uint256 initialDepositAmount,\\n///                  uint256 tbtcAmount,\\n///                  bytes32 extraData\\n///              ) = _finalizeDeposit(depositKey);\\n///\\n///              // Do something with the minted TBTC using context\\n///              // embedded in the extraData.\\n///          }\\n///      }\\nabstract contract AbstractTBTCDepositor {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Multiplier to convert satoshi to TBTC token units.\\n    uint256 public constant SATOSHI_MULTIPLIER = 10**10;\\n\\n    /// @notice Bridge contract address.\\n    IBridge public bridge;\\n    /// @notice TBTCVault contract address.\\n    ITBTCVault public tbtcVault;\\n\\n    // Reserved storage space that allows adding more variables without affecting\\n    // the storage layout of the child contracts. The convention from OpenZeppelin\\n    // suggests the storage space should add up to 50 slots. If more variables are\\n    // added in the upcoming versions one need to reduce the array size accordingly.\\n    // See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\\n    // slither-disable-next-line unused-state\\n    uint256[47] private __gap;\\n\\n    event DepositInitialized(uint256 indexed depositKey, uint32 initializedAt);\\n\\n    event DepositFinalized(\\n        uint256 indexed depositKey,\\n        uint256 tbtcAmount,\\n        uint32 finalizedAt\\n    );\\n\\n    /// @notice Initializes the contract. MUST BE CALLED from the child\\n    ///         contract initializer.\\n    // slither-disable-next-line dead-code\\n    function __AbstractTBTCDepositor_initialize(\\n        address _bridge,\\n        address _tbtcVault\\n    ) internal {\\n        require(\\n            address(bridge) == address(0) && address(tbtcVault) == address(0),\\n            \\\"AbstractTBTCDepositor already initialized\\\"\\n        );\\n\\n        require(_bridge != address(0), \\\"Bridge address cannot be zero\\\");\\n        require(_tbtcVault != address(0), \\\"TBTCVault address cannot be zero\\\");\\n\\n        bridge = IBridge(_bridge);\\n        tbtcVault = ITBTCVault(_tbtcVault);\\n    }\\n\\n    /// @notice Initializes a deposit by revealing it to the Bridge.\\n    /// @param fundingTx Bitcoin funding transaction data, see `IBridgeTypes.BitcoinTxInfo`.\\n    /// @param reveal Deposit reveal data, see `IBridgeTypes.DepositRevealInfo` struct.\\n    /// @param extraData 32-byte deposit extra data.\\n    /// @return depositKey Deposit key computed as\\n    ///         `keccak256(fundingTxHash | reveal.fundingOutputIndex)`. This\\n    ///         key can be used to refer to the deposit in the Bridge and\\n    ///         TBTCVault contracts.\\n    /// @dev Requirements:\\n    ///      - The revealed vault address must match the TBTCVault address,\\n    ///      - All requirements from {Bridge#revealDepositWithExtraData}\\n    ///        function must be met.\\n    /// @dev This function doesn't validate if a deposit has been initialized before,\\n    ///      as the Bridge won't allow the same deposit to be revealed twice.\\n    // slither-disable-next-line dead-code\\n    function _initializeDeposit(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) internal returns (uint256) {\\n        require(reveal.vault == address(tbtcVault), \\\"Vault address mismatch\\\");\\n\\n        uint256 depositKey = _calculateDepositKey(\\n            _calculateBitcoinTxHash(fundingTx),\\n            reveal.fundingOutputIndex\\n        );\\n\\n        emit DepositInitialized(\\n            depositKey,\\n            /* solhint-disable-next-line not-rely-on-time */\\n            uint32(block.timestamp)\\n        );\\n\\n        // The Bridge does not allow to reveal the same deposit twice and\\n        // revealed deposits stay there forever. The transaction will revert\\n        // if the deposit has already been revealed so, there is no need to do\\n        // an explicit check here.\\n        bridge.revealDepositWithExtraData(fundingTx, reveal, extraData);\\n\\n        return depositKey;\\n    }\\n\\n    /// @notice Finalizes a deposit by calculating the amount of TBTC minted\\n    ///         for the deposit.\\n    /// @param depositKey Deposit key identifying the deposit.\\n    /// @return initialDepositAmount Amount of funding transaction deposit. In\\n    ///         TBTC token decimals precision.\\n    /// @return tbtcAmount Approximate amount of TBTC minted for the deposit. In\\n    ///         TBTC token decimals precision.\\n    /// @return extraData 32-byte deposit extra data.\\n    /// @dev Requirements:\\n    ///      - The deposit must be initialized but not finalized\\n    ///        (in the context of this contract) yet.\\n    ///      - The deposit must be finalized on the Bridge side. That means the\\n    ///        deposit must be either swept or optimistically minted.\\n    /// @dev THIS FUNCTION DOESN'T VALIDATE IF A DEPOSIT HAS BEEN FINALIZED BEFORE,\\n    ///      IT IS A RESPONSIBILITY OF THE IMPLEMENTING CONTRACT TO ENSURE THIS\\n    ///      FUNCTION WON'T BE CALLED TWICE FOR THE SAME DEPOSIT.\\n    /// @dev IMPORTANT NOTE: The tbtcAmount returned by this function is an\\n    ///      approximation. See documentation of the `calculateTbtcAmount`\\n    ///      responsible for calculating this value for more details.\\n    // slither-disable-next-line dead-code\\n    function _finalizeDeposit(uint256 depositKey)\\n        internal\\n        returns (\\n            uint256 initialDepositAmount,\\n            uint256 tbtcAmount,\\n            bytes32 extraData\\n        )\\n    {\\n        IBridgeTypes.DepositRequest memory deposit = bridge.deposits(\\n            depositKey\\n        );\\n        require(deposit.revealedAt != 0, \\\"Deposit not initialized\\\");\\n\\n        (, uint64 finalizedAt) = tbtcVault.optimisticMintingRequests(\\n            depositKey\\n        );\\n\\n        require(\\n            deposit.sweptAt != 0 || finalizedAt != 0,\\n            \\\"Deposit not finalized by the bridge\\\"\\n        );\\n\\n        initialDepositAmount = deposit.amount * SATOSHI_MULTIPLIER;\\n\\n        tbtcAmount = _calculateTbtcAmount(deposit.amount, deposit.treasuryFee);\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit DepositFinalized(\\n            depositKey,\\n            tbtcAmount,\\n            /* solhint-disable-next-line not-rely-on-time */\\n            uint32(block.timestamp)\\n        );\\n\\n        extraData = deposit.extraData;\\n    }\\n\\n    /// @notice Calculates the amount of TBTC minted for the deposit.\\n    /// @param depositAmountSat Deposit amount in satoshi (1e8 precision).\\n    ///        This is the actual amount deposited by the deposit creator, i.e.\\n    ///        the gross amount the Bridge's fees are cut from.\\n    /// @param depositTreasuryFeeSat Deposit treasury fee in satoshi (1e8 precision).\\n    ///        This is an accurate value of the treasury fee that was actually\\n    ///        cut upon minting.\\n    /// @return tbtcAmount Approximate amount of TBTC minted for the deposit.\\n    /// @dev IMPORTANT NOTE: The tbtcAmount returned by this function may\\n    ///      not correspond to the actual amount of TBTC minted for the deposit.\\n    ///      Although the treasury fee cut upon minting is known precisely,\\n    ///      this is not the case for the optimistic minting fee and the Bitcoin\\n    ///      transaction fee. To overcome that problem, this function just takes\\n    ///      the current maximum allowed values of both fees, at the moment of deposit\\n    ///      finalization. For the great majority of the deposits, such an\\n    ///      algorithm will return a tbtcAmount slightly lesser than the\\n    ///      actual amount of TBTC minted for the deposit. This will cause\\n    ///      some TBTC to be left in the contract and ensure there is enough\\n    ///      liquidity to finalize the deposit. However, in some rare cases,\\n    ///      where the actual values of those fees change between the deposit\\n    ///      minting and finalization, the tbtcAmount returned by this function\\n    ///      may be greater than the actual amount of TBTC minted for the deposit.\\n    ///      If this happens and the reserve coming from previous deposits\\n    ///      leftovers does not provide enough liquidity, the deposit will have\\n    ///      to wait for finalization until the reserve is refilled by subsequent\\n    ///      deposits or a manual top-up. The integrator is responsible for\\n    ///      handling such cases.\\n    // slither-disable-next-line dead-code\\n    function _calculateTbtcAmount(\\n        uint64 depositAmountSat,\\n        uint64 depositTreasuryFeeSat\\n    ) internal view virtual returns (uint256) {\\n        // Both deposit amount and treasury fee are in the 1e8 satoshi precision.\\n        // We need to convert them to the 1e18 TBTC precision.\\n        uint256 amountSubTreasury = (depositAmountSat - depositTreasuryFeeSat) *\\n            SATOSHI_MULTIPLIER;\\n\\n        uint256 omFeeDivisor = tbtcVault.optimisticMintingFeeDivisor();\\n        uint256 omFee = omFeeDivisor > 0\\n            ? (amountSubTreasury / omFeeDivisor)\\n            : 0;\\n\\n        // The deposit transaction max fee is in the 1e8 satoshi precision.\\n        // We need to convert them to the 1e18 TBTC precision.\\n        (, , uint64 depositTxMaxFee, ) = bridge.depositParameters();\\n        uint256 txMaxFee = depositTxMaxFee * SATOSHI_MULTIPLIER;\\n\\n        return amountSubTreasury - omFee - txMaxFee;\\n    }\\n\\n    /// @notice Calculates the deposit key for the given funding transaction\\n    ///         hash and funding output index.\\n    /// @param fundingTxHash Funding transaction hash.\\n    /// @param fundingOutputIndex Funding output index.\\n    /// @return depositKey Deposit key computed as\\n    ///         `keccak256(fundingTxHash | reveal.fundingOutputIndex)`. This\\n    ///         key can be used to refer to the deposit in the Bridge and\\n    ///         TBTCVault contracts.\\n    // slither-disable-next-line dead-code\\n    function _calculateDepositKey(\\n        bytes32 fundingTxHash,\\n        uint32 fundingOutputIndex\\n    ) internal pure returns (uint256) {\\n        return\\n            uint256(\\n                keccak256(abi.encodePacked(fundingTxHash, fundingOutputIndex))\\n            );\\n    }\\n\\n    /// @notice Calculates the Bitcoin transaction hash for the given Bitcoin\\n    ///         transaction data.\\n    /// @param txInfo Bitcoin transaction data, see `IBridgeTypes.BitcoinTxInfo` struct.\\n    /// @return txHash Bitcoin transaction hash.\\n    // slither-disable-next-line dead-code\\n    function _calculateBitcoinTxHash(IBridgeTypes.BitcoinTxInfo calldata txInfo)\\n        internal\\n        view\\n        returns (bytes32)\\n    {\\n        return\\n            abi\\n                .encodePacked(\\n                    txInfo.version,\\n                    txInfo.inputVector,\\n                    txInfo.outputVector,\\n                    txInfo.locktime\\n                )\\n                .hash256View();\\n    }\\n}\\n\",\"keccak256\":\"0x0cfd2215c106fc17c8166a31839243ad1575806401de60f80d0a4857a2a60078\",\"license\":\"GPL-3.0-only\"},\"contracts/integrator/IBridge.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\n/// @notice Namespace which groups all types relevant to the IBridge interface.\\n/// @dev This is a mirror of the real types used in the Bridge contract.\\n///      This way, the `integrator` subpackage does not need to import\\n///      anything from the `bridge` subpackage and explicitly depend on it.\\n///      This simplifies the dependency graph for integrators.\\nlibrary IBridgeTypes {\\n    /// @dev See bridge/BitcoinTx.sol#Info\\n    struct BitcoinTxInfo {\\n        bytes4 version;\\n        bytes inputVector;\\n        bytes outputVector;\\n        bytes4 locktime;\\n    }\\n\\n    /// @dev See bridge/Deposit.sol#DepositRevealInfo\\n    struct DepositRevealInfo {\\n        uint32 fundingOutputIndex;\\n        bytes8 blindingFactor;\\n        bytes20 walletPubKeyHash;\\n        bytes20 refundPubKeyHash;\\n        bytes4 refundLocktime;\\n        address vault;\\n    }\\n\\n    /// @dev See bridge/Deposit.sol#DepositRequest\\n    struct DepositRequest {\\n        address depositor;\\n        uint64 amount;\\n        uint32 revealedAt;\\n        address vault;\\n        uint64 treasuryFee;\\n        uint32 sweptAt;\\n        bytes32 extraData;\\n    }\\n}\\n\\n/// @notice Interface of the Bridge contract.\\n/// @dev See bridge/Bridge.sol\\ninterface IBridge {\\n    /// @dev See {Bridge#revealDepositWithExtraData}\\n    function revealDepositWithExtraData(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external;\\n\\n    /// @dev See {Bridge#deposits}\\n    function deposits(uint256 depositKey)\\n        external\\n        view\\n        returns (IBridgeTypes.DepositRequest memory);\\n\\n    /// @dev See {Bridge#depositParameters}\\n    function depositParameters()\\n        external\\n        view\\n        returns (\\n            uint64 depositDustThreshold,\\n            uint64 depositTreasuryFeeDivisor,\\n            uint64 depositTxMaxFee,\\n            uint32 depositRevealAheadPeriod\\n        );\\n}\\n\",\"keccak256\":\"0x4e598d96404a19609f511f10503e80f457602ad694d081df739571f67f6e0c4e\",\"license\":\"GPL-3.0-only\"},\"contracts/integrator/ITBTCVault.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\n/// @notice Interface of the TBTCVault contract.\\n/// @dev See vault/TBTCVault.sol\\ninterface ITBTCVault {\\n    /// @dev See {TBTCVault#optimisticMintingRequests}\\n    function optimisticMintingRequests(uint256 depositKey)\\n        external\\n        returns (uint64 requestedAt, uint64 finalizedAt);\\n\\n    /// @dev See {TBTCVault#optimisticMintingFeeDivisor}\\n    function optimisticMintingFeeDivisor() external view returns (uint32);\\n}\\n\",\"keccak256\":\"0xf259d64c1040e2cbc3d17653491e45c5c3da17f575dac1c175c63c8a5308908e\",\"license\":\"GPL-3.0-only\"},\"contracts/test/TestTBTCDepositor.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\npragma solidity ^0.8.0;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\n\\nimport \\\"../integrator/AbstractTBTCDepositor.sol\\\";\\nimport \\\"../integrator/IBridge.sol\\\";\\nimport \\\"../integrator/ITBTCVault.sol\\\";\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\ncontract TestTBTCDepositor is AbstractTBTCDepositor {\\n    event InitializeDepositReturned(uint256 depositKey);\\n\\n    event FinalizeDepositReturned(\\n        uint256 initialDepositAmount,\\n        uint256 tbtcAmount,\\n        bytes32 extraData\\n    );\\n\\n    function initialize(address _bridge, address _tbtcVault) external {\\n        __AbstractTBTCDepositor_initialize(_bridge, _tbtcVault);\\n    }\\n\\n    function initializeDepositPublic(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external {\\n        uint256 depositKey = _initializeDeposit(fundingTx, reveal, extraData);\\n        emit InitializeDepositReturned(depositKey);\\n    }\\n\\n    function finalizeDepositPublic(uint256 depositKey) external {\\n        (\\n            uint256 initialDepositAmount,\\n            uint256 tbtcAmount,\\n            bytes32 extraData\\n        ) = _finalizeDeposit(depositKey);\\n        emit FinalizeDepositReturned(\\n            initialDepositAmount,\\n            tbtcAmount,\\n            extraData\\n        );\\n    }\\n\\n    function calculateTbtcAmountPublic(\\n        uint64 depositAmountSat,\\n        uint64 depositTreasuryFeeSat\\n    ) external view returns (uint256) {\\n        return _calculateTbtcAmount(depositAmountSat, depositTreasuryFeeSat);\\n    }\\n}\\n\\ncontract MockBridge is IBridge {\\n    using BTCUtils for bytes;\\n\\n    mapping(uint256 => IBridgeTypes.DepositRequest) internal _deposits;\\n\\n    uint64 internal _depositTreasuryFeeDivisor = 50; // 1/50 == 100 bps == 2% == 0.02\\n    uint64 internal _depositTxMaxFee = 1000; // 1000 satoshi = 0.00001 BTC\\n\\n    event DepositRevealed(uint256 depositKey);\\n\\n    function revealDepositWithExtraData(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external {\\n        bytes32 fundingTxHash = abi\\n            .encodePacked(\\n                fundingTx.version,\\n                fundingTx.inputVector,\\n                fundingTx.outputVector,\\n                fundingTx.locktime\\n            )\\n            .hash256View();\\n\\n        uint256 depositKey = uint256(\\n            keccak256(\\n                abi.encodePacked(fundingTxHash, reveal.fundingOutputIndex)\\n            )\\n        );\\n\\n        require(\\n            _deposits[depositKey].revealedAt == 0,\\n            \\\"Deposit already revealed\\\"\\n        );\\n\\n        bytes memory fundingOutput = fundingTx\\n            .outputVector\\n            .extractOutputAtIndex(reveal.fundingOutputIndex);\\n\\n        uint64 fundingOutputAmount = fundingOutput.extractValue();\\n\\n        IBridgeTypes.DepositRequest memory request;\\n\\n        request.depositor = msg.sender;\\n        request.amount = fundingOutputAmount;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        request.revealedAt = uint32(block.timestamp);\\n        request.vault = reveal.vault;\\n        request.treasuryFee = _depositTreasuryFeeDivisor > 0\\n            ? fundingOutputAmount / _depositTreasuryFeeDivisor\\n            : 0;\\n        request.sweptAt = 0;\\n        request.extraData = extraData;\\n\\n        _deposits[depositKey] = request;\\n\\n        emit DepositRevealed(depositKey);\\n    }\\n\\n    function sweepDeposit(uint256 depositKey) public {\\n        require(_deposits[depositKey].revealedAt != 0, \\\"Deposit not revealed\\\");\\n        require(_deposits[depositKey].sweptAt == 0, \\\"Deposit already swept\\\");\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _deposits[depositKey].sweptAt = uint32(block.timestamp);\\n    }\\n\\n    function deposits(uint256 depositKey)\\n        external\\n        view\\n        returns (IBridgeTypes.DepositRequest memory)\\n    {\\n        return _deposits[depositKey];\\n    }\\n\\n    function depositParameters()\\n        external\\n        view\\n        returns (\\n            uint64 depositDustThreshold,\\n            uint64 depositTreasuryFeeDivisor,\\n            uint64 depositTxMaxFee,\\n            uint32 depositRevealAheadPeriod\\n        )\\n    {\\n        depositDustThreshold = 0;\\n        depositTreasuryFeeDivisor = 0;\\n        depositTxMaxFee = _depositTxMaxFee;\\n        depositRevealAheadPeriod = 0;\\n    }\\n\\n    function setDepositTreasuryFeeDivisor(uint64 value) external {\\n        _depositTreasuryFeeDivisor = value;\\n    }\\n\\n    function setDepositTxMaxFee(uint64 value) external {\\n        _depositTxMaxFee = value;\\n    }\\n}\\n\\ncontract MockTBTCVault is ITBTCVault {\\n    struct Request {\\n        uint64 requestedAt;\\n        uint64 finalizedAt;\\n    }\\n\\n    mapping(uint256 => Request) internal _requests;\\n\\n    uint32 public optimisticMintingFeeDivisor = 100; // 1%\\n\\n    function optimisticMintingRequests(uint256 depositKey)\\n        external\\n        returns (uint64 requestedAt, uint64 finalizedAt)\\n    {\\n        Request memory request = _requests[depositKey];\\n        return (request.requestedAt, request.finalizedAt);\\n    }\\n\\n    /// @dev The function is virtual to allow other projects using this mock\\n    ///      for AbtractTBTCDepositor-based contract tests to add any custom\\n    ///      logic needed.\\n    function createOptimisticMintingRequest(uint256 depositKey) public virtual {\\n        require(\\n            _requests[depositKey].requestedAt == 0,\\n            \\\"Request already exists\\\"\\n        );\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _requests[depositKey].requestedAt = uint64(block.timestamp);\\n    }\\n\\n    /// @dev The function is virtual to allow other projects using this mock\\n    ///      for AbtractTBTCDepositor-based contract tests to add any custom\\n    ///      logic needed.\\n    function finalizeOptimisticMintingRequest(uint256 depositKey)\\n        public\\n        virtual\\n    {\\n        require(\\n            _requests[depositKey].requestedAt != 0,\\n            \\\"Request does not exist\\\"\\n        );\\n        require(\\n            _requests[depositKey].finalizedAt == 0,\\n            \\\"Request already finalized\\\"\\n        );\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _requests[depositKey].finalizedAt = uint64(block.timestamp);\\n    }\\n\\n    function setOptimisticMintingFeeDivisor(uint32 value) external {\\n        optimisticMintingFeeDivisor = value;\\n    }\\n}\\n\",\"keccak256\":\"0x7eebb43774f325970d250ceb9e11c6f9f8996b9f2f8f5e3d529f9c5fb94e572f\",\"license\":\"GPL-3.0-only\"}},\"version\":1}",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.17+commit.8df45f5f\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"createOptimisticMintingRequest\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"finalizeOptimisticMintingRequest\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"optimisticMintingFeeDivisor\",\"outputs\":[{\"internalType\":\"uint32\",\"name\":\"\",\"type\":\"uint32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"depositKey\",\"type\":\"uint256\"}],\"name\":\"optimisticMintingRequests\",\"outputs\":[{\"internalType\":\"uint64\",\"name\":\"requestedAt\",\"type\":\"uint64\"},{\"internalType\":\"uint64\",\"name\":\"finalizedAt\",\"type\":\"uint64\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint32\",\"name\":\"value\",\"type\":\"uint32\"}],\"name\":\"setOptimisticMintingFeeDivisor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{\"createOptimisticMintingRequest(uint256)\":{\"details\":\"The function is virtual to allow other projects using this mock      for AbtractTBTCDepositor-based contract tests to add any custom      logic needed.\"},\"finalizeOptimisticMintingRequest(uint256)\":{\"details\":\"The function is virtual to allow other projects using this mock      for AbtractTBTCDepositor-based contract tests to add any custom      logic needed.\"},\"optimisticMintingRequests(uint256)\":{\"details\":\"See {TBTCVault#optimisticMintingRequests}\"}},\"stateVariables\":{\"optimisticMintingFeeDivisor\":{\"details\":\"See {TBTCVault#optimisticMintingFeeDivisor}\"}},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/test/TestTBTCDepositor.sol\":\"MockTBTCVault\"},\"evmVersion\":\"london\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[]},\"sources\":{\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title BitcoinSPV */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\n\\nlibrary BTCUtils {\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    // The target at minimum Difficulty. Also the target of the genesis block\\n    uint256 public constant DIFF1_TARGET = 0xffff0000000000000000000000000000000000000000000000000000;\\n\\n    uint256 public constant RETARGET_PERIOD = 2 * 7 * 24 * 60 * 60;  // 2 weeks in seconds\\n    uint256 public constant RETARGET_PERIOD_BLOCKS = 2016;  // 2 weeks in blocks\\n\\n    uint256 public constant ERR_BAD_ARG = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n\\n    /* ***** */\\n    /* UTILS */\\n    /* ***** */\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _flag    The first byte of a VarInt\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLength(bytes memory _flag) internal pure returns (uint8) {\\n        return determineVarIntDataLengthAt(_flag, 0);\\n    }\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _b       The byte array containing a VarInt\\n    /// @param _at      The position of the VarInt in the array\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLengthAt(bytes memory _b, uint256 _at) internal pure returns (uint8) {\\n        if (uint8(_b[_at]) == 0xff) {\\n            return 8;  // one-byte flag, 8 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfe) {\\n            return 4;  // one-byte flag, 4 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfd) {\\n            return 2;  // one-byte flag, 2 bytes data\\n        }\\n\\n        return 0;  // flag is data\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string starting with a VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarInt(bytes memory _b) internal pure returns (uint256, uint256) {\\n        return parseVarIntAt(_b, 0);\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string containing a VarInt\\n    /// @param _at  The position of the VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarIntAt(bytes memory _b, uint256 _at) internal pure returns (uint256, uint256) {\\n        uint8 _dataLen = determineVarIntDataLengthAt(_b, _at);\\n\\n        if (_dataLen == 0) {\\n            return (0, uint8(_b[_at]));\\n        }\\n        if (_b.length < 1 + _dataLen + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n        uint256 _number;\\n        if (_dataLen == 2) {\\n            _number = reverseUint16(uint16(_b.slice2(1 + _at)));\\n        } else if (_dataLen == 4) {\\n            _number = reverseUint32(uint32(_b.slice4(1 + _at)));\\n        } else if (_dataLen == 8) {\\n            _number = reverseUint64(uint64(_b.slice8(1 + _at)));\\n        }\\n        return (_dataLen, _number);\\n    }\\n\\n    /// @notice          Changes the endianness of a byte array\\n    /// @dev             Returns a new, backwards, bytes\\n    /// @param _b        The bytes to reverse\\n    /// @return          The reversed bytes\\n    function reverseEndianness(bytes memory _b) internal pure returns (bytes memory) {\\n        bytes memory _newValue = new bytes(_b.length);\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _newValue[_b.length - i - 1] = _b[i];\\n        }\\n\\n        return _newValue;\\n    }\\n\\n    /// @notice          Changes the endianness of a uint256\\n    /// @dev             https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint256(uint256 _b) internal pure returns (uint256 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = ((v >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\\n            ((v & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\\n        // swap 8-byte long pairs\\n        v = ((v >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\\n            ((v & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\\n        // swap 16-byte long pairs\\n        v = (v >> 128) | (v << 128);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint64\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint64(uint64 _b) internal pure returns (uint64 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = (v >> 32) | (v << 32);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint32\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint32(uint32 _b) internal pure returns (uint32 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF) |\\n            ((v & 0x00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = (v >> 16) | (v << 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint24\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint24(uint24 _b) internal pure returns (uint24 v) {\\n        v =  (_b << 16) | (_b & 0x00FF00) | (_b >> 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint16\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint16(uint16 _b) internal pure returns (uint16 v) {\\n        v =  (_b << 8) | (_b >> 8);\\n    }\\n\\n\\n    /// @notice          Converts big-endian bytes to a uint\\n    /// @dev             Traverses the byte array and sums the bytes\\n    /// @param _b        The big-endian bytes-encoded integer\\n    /// @return          The integer representation\\n    function bytesToUint(bytes memory _b) internal pure returns (uint256) {\\n        uint256 _number;\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _number = _number + uint8(_b[i]) * (2 ** (8 * (_b.length - (i + 1))));\\n        }\\n\\n        return _number;\\n    }\\n\\n    /// @notice          Get the last _num bytes from a byte array\\n    /// @param _b        The byte array to slice\\n    /// @param _num      The number of bytes to extract from the end\\n    /// @return          The last _num bytes of _b\\n    function lastBytes(bytes memory _b, uint256 _num) internal pure returns (bytes memory) {\\n        uint256 _start = _b.length.sub(_num);\\n\\n        return _b.slice(_start, _num);\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (rmd160(sha2()))\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash160(bytes memory _b) internal pure returns (bytes memory) {\\n        return abi.encodePacked(ripemd160(abi.encodePacked(sha256(_b))));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (sha2 + ripemd160)\\n    /// @dev             sha2 precompile at address(2), ripemd160 at address(3)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash160View(bytes memory _b) internal view returns (bytes20 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 3, 0x00, 32, 0x00, 32))\\n            // read from position 12 = 0c\\n            res := mload(0x0c)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash256(bytes memory _b) internal pure returns (bytes32) {\\n        return sha256(abi.encodePacked(sha256(_b)));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash256View(bytes memory _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 on a pair of bytes32\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _a        The first bytes32 of the pre-image\\n    /// @param _b        The second bytes32 of the pre-image\\n    /// @return res      The digest\\n    function hash256Pair(bytes32 _a, bytes32 _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            mstore(0x00, _a)\\n            mstore(0x20, _b)\\n            pop(staticcall(gas(), 2, 0x00, 64, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The array containing the pre-image\\n    /// @param at        The start of the pre-image\\n    /// @param len       The length of the pre-image\\n    /// @return res      The digest\\n    function hash256Slice(\\n        bytes memory _b,\\n        uint256 at,\\n        uint256 len\\n    ) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, add(32, at)), len, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /* ************ */\\n    /* Legacy Input */\\n    /* ************ */\\n\\n    /// @notice          Extracts the nth input from the vin (0-indexed)\\n    /// @dev             Iterates over the vin. If you need to extract several, write a custom function\\n    /// @param _vin      The vin as a tightly-packed byte array\\n    /// @param _index    The 0-indexed location of the input to extract\\n    /// @return          The input as a byte array\\n    function extractInputAtIndex(bytes memory _vin, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nIns, \\\"Vin read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineInputLengthAt(_vin, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n            _offset = _offset + _len;\\n        }\\n\\n        _len = determineInputLengthAt(_vin, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _vin.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Determines whether an input is legacy\\n    /// @dev             False if no scriptSig, otherwise True\\n    /// @param _input    The input\\n    /// @return          True for legacy, False for witness\\n    function isLegacyInput(bytes memory _input) internal pure returns (bool) {\\n        return _input[36] != hex\\\"00\\\";\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The LEGACY input\\n    /// @return          The length of the script sig\\n    function extractScriptSigLen(bytes memory _input) internal pure returns (uint256, uint256) {\\n        return extractScriptSigLenAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    ///                  starting at the specified position\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The byte array containing the LEGACY input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the script sig\\n    function extractScriptSigLenAt(bytes memory _input, uint256 _at) internal pure returns (uint256, uint256) {\\n        if (_input.length < 37 + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = parseVarIntAt(_input, _at + 36);\\n\\n        return (_varIntDataLen, _scriptSigLen);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The input\\n    /// @return          The length of the input in bytes\\n    function determineInputLength(bytes memory _input) internal pure returns (uint256) {\\n        return determineInputLengthAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig,\\n    ///                  starting at the specified position\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the input in bytes\\n    function determineInputLengthAt(bytes memory _input, uint256 _at) internal pure returns (uint256) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLenAt(_input, _at);\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        return 36 + 1 + _varIntDataLen + _scriptSigLen + 4;\\n    }\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLELegacy(bytes memory _input) internal pure returns (bytes4) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice4(36 + 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceLegacy(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLELegacy(_input));\\n        uint32 _beSequence = reverseUint32(_leSeqence);\\n        return _beSequence;\\n    }\\n    /// @notice          Extracts the VarInt-prepended scriptSig from the input in a tx\\n    /// @dev             Will return hex\\\"00\\\" if passed a witness input\\n    /// @param _input    The LEGACY input\\n    /// @return          The length-prepended scriptSig\\n    function extractScriptSig(bytes memory _input) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice(36, 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n\\n    /* ************* */\\n    /* Witness Input */\\n    /* ************* */\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLEWitness(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(37);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input in a tx\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceWitness(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLEWitness(_input));\\n        uint32 _inputeSequence = reverseUint32(_leSeqence);\\n        return _inputeSequence;\\n    }\\n\\n    /// @notice          Extracts the outpoint from the input in a tx\\n    /// @dev             32-byte tx id with 4-byte index\\n    /// @param _input    The input\\n    /// @return          The outpoint (LE bytes of prev tx hash + LE bytes of prev tx index)\\n    function extractOutpoint(bytes memory _input) internal pure returns (bytes memory) {\\n        return _input.slice(0, 36);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    /// @dev             32-byte tx id\\n    /// @param _input    The input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLE(bytes memory _input) internal pure returns (bytes32) {\\n        return _input.slice32(0);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    ///                  starting at the specified position\\n    /// @dev             32-byte tx id\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes32) {\\n        return _input.slice32(_at);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    /// @dev             4-byte tx index\\n    /// @param _input    The input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLE(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(32);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    ///                  starting at the specified position\\n    /// @dev             4-byte tx index\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes4) {\\n        return _input.slice4(32 + _at);\\n    }\\n\\n    /* ****** */\\n    /* Output */\\n    /* ****** */\\n\\n    /// @notice          Determines the length of an output\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLength(bytes memory _output) internal pure returns (uint256) {\\n        return determineOutputLengthAt(_output, 0);\\n    }\\n\\n    /// @notice          Determines the length of an output\\n    ///                  starting at the specified position\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The position of the output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLengthAt(bytes memory _output, uint256 _at) internal pure returns (uint256) {\\n        if (_output.length < 9 + _at) {\\n            return ERR_BAD_ARG;\\n        }\\n        uint256 _varIntDataLen;\\n        uint256 _scriptPubkeyLength;\\n        (_varIntDataLen, _scriptPubkeyLength) = parseVarIntAt(_output, 8 + _at);\\n\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        // 8-byte value, 1-byte for tag itself\\n        return 8 + 1 + _varIntDataLen + _scriptPubkeyLength;\\n    }\\n\\n    /// @notice          Extracts the output at a given index in the TxOuts vector\\n    /// @dev             Iterates over the vout. If you need to extract multiple, write a custom function\\n    /// @param _vout     The _vout to extract from\\n    /// @param _index    The 0-indexed location of the output to extract\\n    /// @return          The specified output\\n    function extractOutputAtIndex(bytes memory _vout, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nOuts, \\\"Vout read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineOutputLengthAt(_vout, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n            _offset += _len;\\n        }\\n\\n        _len = determineOutputLengthAt(_vout, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n        return _vout.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Extracts the value bytes from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value as LE bytes\\n    function extractValueLE(bytes memory _output) internal pure returns (bytes8) {\\n        return _output.slice8(0);\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value\\n    function extractValue(bytes memory _output) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(extractValueLE(_output));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The starting index of the output in the array\\n    /// @return          The output value\\n    function extractValueAt(bytes memory _output, uint256 _at) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(_output.slice8(_at));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the data from an op return output\\n    /// @dev             Returns hex\\\"\\\" if no data or not an op return\\n    /// @param _output   The output\\n    /// @return          Any data contained in the opreturn output, null if not an op return\\n    function extractOpReturnData(bytes memory _output) internal pure returns (bytes memory) {\\n        if (_output[9] != hex\\\"6a\\\") {\\n            return hex\\\"\\\";\\n        }\\n        bytes1 _dataLen = _output[10];\\n        return _output.slice(11, uint256(uint8(_dataLen)));\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The output\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHash(bytes memory _output) internal pure returns (bytes memory) {\\n        return extractHashAt(_output, 8, _output.length - 8);\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The starting index of the output script in the array\\n    ///                  (output start + 8)\\n    /// @param _len      The length of the output script\\n    ///                  (output length - 8)\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHashAt(\\n        bytes memory _output,\\n        uint256 _at,\\n        uint256 _len\\n    ) internal pure returns (bytes memory) {\\n        uint8 _scriptLen = uint8(_output[_at]);\\n\\n        // don't have to worry about overflow here.\\n        // if _scriptLen + 1 overflows, then output length would have to be < 1\\n        // for this check to pass. if it's < 1, then we errored when assigning\\n        // _scriptLen\\n        if (_scriptLen + 1 != _len) {\\n            return hex\\\"\\\";\\n        }\\n\\n        if (uint8(_output[_at + 1]) == 0) {\\n            if (_scriptLen < 2) {\\n                return hex\\\"\\\";\\n            }\\n            uint256 _payloadLen = uint8(_output[_at + 2]);\\n            // Check for maliciously formatted witness outputs.\\n            // No need to worry about underflow as long b/c of the `< 2` check\\n            if (_payloadLen != _scriptLen - 2 || (_payloadLen != 0x20 && _payloadLen != 0x14)) {\\n                return hex\\\"\\\";\\n            }\\n            return _output.slice(_at + 3, _payloadLen);\\n        } else {\\n            bytes3 _tag = _output.slice3(_at);\\n            // p2pkh\\n            if (_tag == hex\\\"1976a9\\\") {\\n                // Check for maliciously formatted p2pkh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_at + 3]) != 0x14 ||\\n                    _output.slice2(_at + _len - 2) != hex\\\"88ac\\\") {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(_at + 4, 20);\\n            //p2sh\\n            } else if (_tag == hex\\\"17a914\\\") {\\n                // Check for maliciously formatted p2sh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_at + _len - 1]) != 0x87) {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(_at + 3, 20);\\n            }\\n        }\\n        return hex\\\"\\\";  /* NB: will trigger on OPRETURN and any non-standard that doesn't overrun */\\n    }\\n\\n    /* ********** */\\n    /* Witness TX */\\n    /* ********** */\\n\\n\\n    /// @notice      Checks that the vin passed up is properly formatted\\n    /// @dev         Consider a vin with a valid vout in its scriptsig\\n    /// @param _vin  Raw bytes length-prefixed input vector\\n    /// @return      True if it represents a validly formatted vin\\n    function validateVin(bytes memory _vin) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n\\n        // Not valid if it says there are too many or no inputs\\n        if (_nIns == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nIns; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vin.length) {\\n                return false;\\n            }\\n\\n            // Grab the next input and determine its length.\\n            uint256 _nextLen = determineInputLengthAt(_vin, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            // Increase the offset by that much\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vin.length;\\n    }\\n\\n    /// @notice      Checks that the vout passed up is properly formatted\\n    /// @dev         Consider a vout with a valid scriptpubkey\\n    /// @param _vout Raw bytes length-prefixed output vector\\n    /// @return      True if it represents a validly formatted vout\\n    function validateVout(bytes memory _vout) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n\\n        // Not valid if it says there are too many or no outputs\\n        if (_nOuts == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nOuts; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vout.length) {\\n                return false;\\n            }\\n\\n            // Grab the next output and determine its length.\\n            // Increase the offset by that much\\n            uint256 _nextLen = determineOutputLengthAt(_vout, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vout.length;\\n    }\\n\\n\\n\\n    /* ************ */\\n    /* Block Header */\\n    /* ************ */\\n\\n    /// @notice          Extracts the transaction merkle root from a block header\\n    /// @dev             Use verifyHash256Merkle to verify proofs with this root\\n    /// @param _header   The header\\n    /// @return          The merkle root (little-endian)\\n    function extractMerkleRootLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(36);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The header\\n    /// @return          The target threshold\\n    function extractTarget(bytes memory _header) internal pure returns (uint256) {\\n        return extractTargetAt(_header, 0);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The array containing the header\\n    /// @param at        The start of the header\\n    /// @return          The target threshold\\n    function extractTargetAt(bytes memory _header, uint256 at) internal pure returns (uint256) {\\n        uint24 _m = uint24(_header.slice3(72 + at));\\n        uint8 _e = uint8(_header[75 + at]);\\n        uint256 _mantissa = uint256(reverseUint24(_m));\\n        uint _exponent = _e - 3;\\n\\n        return _mantissa * (256 ** _exponent);\\n    }\\n\\n    /// @notice          Calculate difficulty from the difficulty 1 target and current target\\n    /// @dev             Difficulty 1 is 0x1d00ffff on mainnet and testnet\\n    /// @dev             Difficulty 1 is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _target   The current target\\n    /// @return          The block difficulty (bdiff)\\n    function calculateDifficulty(uint256 _target) internal pure returns (uint256) {\\n        // Difficulty 1 calculated from 0x1d00ffff\\n        return DIFF1_TARGET.div(_target);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(4);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The array containing the header\\n    /// @param at        The start of the header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLEAt(\\n        bytes memory _header,\\n        uint256 at\\n    ) internal pure returns (bytes32) {\\n        return _header.slice32(4 + at);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (little-endian bytes)\\n    function extractTimestampLE(bytes memory _header) internal pure returns (bytes4) {\\n        return _header.slice4(68);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (uint)\\n    function extractTimestamp(bytes memory _header) internal pure returns (uint32) {\\n        return reverseUint32(uint32(extractTimestampLE(_header)));\\n    }\\n\\n    /// @notice          Extracts the expected difficulty from a block header\\n    /// @dev             Does NOT verify the work\\n    /// @param _header   The header\\n    /// @return          The difficulty as an integer\\n    function extractDifficulty(bytes memory _header) internal pure returns (uint256) {\\n        return calculateDifficulty(extractTarget(_header));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes memory _a, bytes memory _b) internal view returns (bytes32) {\\n        return hash256View(abi.encodePacked(_a, _b));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes32 _a, bytes32 _b) internal view returns (bytes32) {\\n        return hash256Pair(_a, _b);\\n    }\\n\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Inefficient version.\\n    /// @param _proof    The proof. Tightly packed LE sha256 hashes. The last hash is the root\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(bytes memory _proof, uint _index) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_proof.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Special case for coinbase-only blocks\\n        if (_proof.length == 32) {\\n            return true;\\n        }\\n\\n        // Should never occur\\n        if (_proof.length == 64) {\\n            return false;\\n        }\\n\\n        bytes32 _root = _proof.slice32(_proof.length - 32);\\n        bytes32 _current = _proof.slice32(0);\\n        bytes memory _tree = _proof.slice(32, _proof.length - 64);\\n\\n        return verifyHash256Merkle(_current, _tree, _root, _index);\\n    }\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Efficient version.\\n    /// @param _leaf     The leaf of the proof. LE sha256 hash.\\n    /// @param _tree     The intermediate nodes in the proof.\\n    ///                  Tightly packed LE sha256 hashes.\\n    /// @param _root     The root of the proof. LE sha256 hash.\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(\\n        bytes32 _leaf,\\n        bytes memory _tree,\\n        bytes32 _root,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_tree.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Should never occur\\n        if (_tree.length == 0) {\\n            return false;\\n        }\\n\\n        uint _idx = _index;\\n        bytes32 _current = _leaf;\\n\\n        // i moves in increments of 32\\n        for (uint i = 0; i < _tree.length; i += 32) {\\n            if (_idx % 2 == 1) {\\n                _current = _hash256MerkleStep(_tree.slice32(i), _current);\\n            } else {\\n                _current = _hash256MerkleStep(_current, _tree.slice32(i));\\n            }\\n            _idx = _idx >> 1;\\n        }\\n        return _current == _root;\\n    }\\n\\n    /*\\n    NB: https://github.com/bitcoin/bitcoin/blob/78dae8caccd82cfbfd76557f1fb7d7557c7b5edb/src/pow.cpp#L49-L72\\n    NB: We get a full-bitlength target from this. For comparison with\\n        header-encoded targets we need to mask it with the header target\\n        e.g. (full & truncated) == truncated\\n    */\\n    /// @notice                 performs the bitcoin difficulty retarget\\n    /// @dev                    implements the Bitcoin algorithm precisely\\n    /// @param _previousTarget  the target of the previous period\\n    /// @param _firstTimestamp  the timestamp of the first block in the difficulty period\\n    /// @param _secondTimestamp the timestamp of the last block in the difficulty period\\n    /// @return                 the new period's target threshold\\n    function retargetAlgorithm(\\n        uint256 _previousTarget,\\n        uint256 _firstTimestamp,\\n        uint256 _secondTimestamp\\n    ) internal pure returns (uint256) {\\n        uint256 _elapsedTime = _secondTimestamp.sub(_firstTimestamp);\\n\\n        // Normalize ratio to factor of 4 if very long or very short\\n        if (_elapsedTime < RETARGET_PERIOD.div(4)) {\\n            _elapsedTime = RETARGET_PERIOD.div(4);\\n        }\\n        if (_elapsedTime > RETARGET_PERIOD.mul(4)) {\\n            _elapsedTime = RETARGET_PERIOD.mul(4);\\n        }\\n\\n        /*\\n          NB: high targets e.g. ffff0020 can cause overflows here\\n              so we divide it by 256**2, then multiply by 256**2 later\\n              we know the target is evenly divisible by 256**2, so this isn't an issue\\n        */\\n\\n        uint256 _adjusted = _previousTarget.div(65536).mul(_elapsedTime);\\n        return _adjusted.div(RETARGET_PERIOD).mul(65536);\\n    }\\n}\\n\",\"keccak256\":\"0x439eaa97e9239705f3d31e8d39dccbad32311f1f119e295d53c65e0ae3c5a5fc\"},\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\n\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\n\\nThis is free and unencumbered software released into the public domain.\\n\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\n\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\n\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concat(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bytes memory) {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(0x40, and(\\n                add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                not(31) // Round down to the nearest 32 bytes.\\n            ))\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                        ),\\n                        // and now shift left the number of bytes to\\n                        // leave space for the length in the slot\\n                        exp(0x100, sub(32, newlength))\\n                        ),\\n                        // increase length by the double of the memory\\n                        // bytes length\\n                        mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                    ),\\n                    and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let mlengthmod := mod(mlength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function slice(bytes memory _bytes, uint _start, uint _length) internal  pure returns (bytes memory res) {\\n        if (_length == 0) {\\n            return hex\\\"\\\";\\n        }\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    /// @notice Take a slice of the byte array, overwriting the destination.\\n    /// The length of the slice will equal the length of the destination array.\\n    /// @dev Make sure the destination array has afterspace if required.\\n    /// @param _bytes The source array\\n    /// @param _dest The destination array.\\n    /// @param _start The location to start in the source array.\\n    function sliceInPlace(\\n        bytes memory _bytes,\\n        bytes memory _dest,\\n        uint _start\\n    ) internal pure {\\n        uint _length = _dest.length;\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let res := add(_dest, 32)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n                res := add(res, 32)\\n            } {\\n                mstore(res, mload(src))\\n            }\\n        }\\n    }\\n\\n    // Static slice functions, no bounds checking\\n    /// @notice take a 32-byte slice from the specified position\\n    function slice32(bytes memory _bytes, uint _start) internal pure returns (bytes32 res) {\\n        assembly {\\n            res := mload(add(add(_bytes, 32), _start))\\n        }\\n    }\\n\\n    /// @notice take a 20-byte slice from the specified position\\n    function slice20(bytes memory _bytes, uint _start) internal pure returns (bytes20) {\\n        return bytes20(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 8-byte slice from the specified position\\n    function slice8(bytes memory _bytes, uint _start) internal pure returns (bytes8) {\\n        return bytes8(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 4-byte slice from the specified position\\n    function slice4(bytes memory _bytes, uint _start) internal pure returns (bytes4) {\\n        return bytes4(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 3-byte slice from the specified position\\n    function slice3(bytes memory _bytes, uint _start) internal pure returns (bytes3) {\\n        return bytes3(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 2-byte slice from the specified position\\n    function slice2(bytes memory _bytes, uint _start) internal pure returns (bytes2) {\\n        return bytes2(slice32(_bytes, _start));\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint _start) internal  pure returns (address) {\\n        uint _totalLen = _start + 20;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Address conversion out of bounds.\\\");\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000)\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint _start) internal  pure returns (uint256) {\\n        uint _totalLen = _start + 32;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Uint conversion out of bounds.\\\");\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes) internal view returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {} eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source) pure internal returns (bytes32 result) {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(bytes memory _bytes, uint _start, uint _length) pure internal returns (bytes32 result) {\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x43e0f3b3b23c861bd031588bf410dfdd02e2af17941a89aa38d70e534e0380d1\"},\"@keep-network/bitcoin-spv-sol/contracts/SafeMath.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\nThe MIT License (MIT)\\n\\nCopyright (c) 2016 Smart Contract Solutions, Inc.\\n\\nPermission is hereby granted, free of charge, to any person obtaining\\na copy of this software and associated documentation files (the\\n\\\"Software\\\"), to deal in the Software without restriction, including\\nwithout limitation the rights to use, copy, modify, merge, publish,\\ndistribute, sublicense, and/or sell copies of the Software, and to\\npermit persons to whom the Software is furnished to do so, subject to\\nthe following conditions:\\n\\nThe above copyright notice and this permission notice shall be included\\nin all copies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n*/\\n\\n\\n/**\\n * @title SafeMath\\n * @dev Math operations with safety checks that throw on error\\n */\\nlibrary SafeMath {\\n\\n    /**\\n     * @dev Multiplies two numbers, throws on overflow.\\n     */\\n    function mul(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        // Gas optimization: this is cheaper than asserting 'a' not being zero, but the\\n        // benefit is lost if 'b' is also tested.\\n        // See: https://github.com/OpenZeppelin/openzeppelin-solidity/pull/522\\n        if (_a == 0) {\\n            return 0;\\n        }\\n\\n        c = _a * _b;\\n        require(c / _a == _b, \\\"Overflow during multiplication.\\\");\\n        return c;\\n    }\\n\\n    /**\\n     * @dev Integer division of two numbers, truncating the quotient.\\n     */\\n    function div(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        // assert(_b > 0); // Solidity automatically throws when dividing by 0\\n        // uint256 c = _a / _b;\\n        // assert(_a == _b * c + _a % _b); // There is no case in which this doesn't hold\\n        return _a / _b;\\n    }\\n\\n    /**\\n     * @dev Subtracts two numbers, throws on overflow (i.e. if subtrahend is greater than minuend).\\n     */\\n    function sub(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        require(_b <= _a, \\\"Underflow during subtraction.\\\");\\n        return _a - _b;\\n    }\\n\\n    /**\\n     * @dev Adds two numbers, throws on overflow.\\n     */\\n    function add(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        c = _a + _b;\\n        require(c >= _a, \\\"Overflow during addition.\\\");\\n        return c;\\n    }\\n}\\n\",\"keccak256\":\"0x35930d982394c7ffde439b82e5e696c5b21a6f09699d44861dfe409ef64084a3\"},\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 standard as defined in the EIP.\\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 amount of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the amount of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves `amount` 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 amount) 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 `amount` as the allowance of `spender` over the 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 amount) external returns (bool);\\n\\n    /**\\n     * @dev Moves `amount` tokens from `from` to `to` using the\\n     * allowance mechanism. `amount` 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(\\n        address from,\\n        address to,\\n        uint256 amount\\n    ) external returns (bool);\\n}\\n\",\"keccak256\":\"0x9750c6b834f7b43000631af5cc30001c5f547b3ceb3635488f140f60e897ea6b\",\"license\":\"MIT\"},\"contracts/integrator/AbstractTBTCDepositor.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\n\\nimport \\\"./IBridge.sol\\\";\\nimport \\\"./ITBTCVault.sol\\\";\\n\\n/// @title Abstract AbstractTBTCDepositor contract.\\n/// @notice This abstract contract is meant to facilitate integration of protocols\\n///         aiming to use tBTC as an underlying Bitcoin bridge.\\n///\\n///         Such an integrator is supposed to:\\n///         - Create a child contract inheriting from this abstract contract\\n///         - Call the `__AbstractTBTCDepositor_initialize` initializer function\\n///         - Use the `_initializeDeposit` and `_finalizeDeposit` as part of their\\n///           business logic in order to initialize and finalize deposits.\\n///\\n/// @dev Example usage:\\n///      ```\\n///      // Example upgradeable integrator contract.\\n///      contract ExampleTBTCIntegrator is AbstractTBTCDepositor, Initializable {\\n///          /// @custom:oz-upgrades-unsafe-allow constructor\\n///          constructor() {\\n///              // Prevents the contract from being initialized again.\\n///              _disableInitializers();\\n///          }\\n///\\n///          function initialize(\\n///              address _bridge,\\n///              address _tbtcVault\\n///          ) external initializer {\\n///              __AbstractTBTCDepositor_initialize(_bridge, _tbtcVault);\\n///          }\\n///\\n///          function startProcess(\\n///              IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n///              IBridgeTypes.DepositRevealInfo calldata reveal\\n///          ) external {\\n///              // Embed necessary context as extra data.\\n///              bytes32 extraData = ...;\\n///\\n///              uint256 depositKey = _initializeDeposit(\\n///                  fundingTx,\\n///                  reveal,\\n///                  extraData\\n///              );\\n///\\n///              // Use the depositKey to track the process.\\n///          }\\n///\\n///          function finalizeProcess(uint256 depositKey) external {\\n///              // Ensure the function cannot be called for the same deposit\\n///              // twice.\\n///\\n///              (\\n///                  uint256 initialDepositAmount,\\n///                  uint256 tbtcAmount,\\n///                  bytes32 extraData\\n///              ) = _finalizeDeposit(depositKey);\\n///\\n///              // Do something with the minted TBTC using context\\n///              // embedded in the extraData.\\n///          }\\n///      }\\nabstract contract AbstractTBTCDepositor {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Multiplier to convert satoshi to TBTC token units.\\n    uint256 public constant SATOSHI_MULTIPLIER = 10**10;\\n\\n    /// @notice Bridge contract address.\\n    IBridge public bridge;\\n    /// @notice TBTCVault contract address.\\n    ITBTCVault public tbtcVault;\\n\\n    // Reserved storage space that allows adding more variables without affecting\\n    // the storage layout of the child contracts. The convention from OpenZeppelin\\n    // suggests the storage space should add up to 50 slots. If more variables are\\n    // added in the upcoming versions one need to reduce the array size accordingly.\\n    // See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\\n    // slither-disable-next-line unused-state\\n    uint256[47] private __gap;\\n\\n    /// @notice Initializes the contract. MUST BE CALLED from the child\\n    ///         contract initializer.\\n    // slither-disable-next-line dead-code\\n    function __AbstractTBTCDepositor_initialize(\\n        address _bridge,\\n        address _tbtcVault\\n    ) internal {\\n        require(\\n            address(bridge) == address(0) && address(tbtcVault) == address(0),\\n            \\\"AbstractTBTCDepositor already initialized\\\"\\n        );\\n\\n        require(_bridge != address(0), \\\"Bridge address cannot be zero\\\");\\n        require(_tbtcVault != address(0), \\\"TBTCVault address cannot be zero\\\");\\n\\n        bridge = IBridge(_bridge);\\n        tbtcVault = ITBTCVault(_tbtcVault);\\n    }\\n\\n    /// @notice Initializes a deposit by revealing it to the Bridge.\\n    /// @param fundingTx Bitcoin funding transaction data, see `IBridgeTypes.BitcoinTxInfo`.\\n    /// @param reveal Deposit reveal data, see `IBridgeTypes.DepositRevealInfo` struct.\\n    /// @param extraData 32-byte deposit extra data.\\n    /// @return depositKey Deposit key computed as\\n    ///         `keccak256(fundingTxHash | reveal.fundingOutputIndex)`. This\\n    ///         key can be used to refer to the deposit in the Bridge and\\n    ///         TBTCVault contracts.\\n    /// @dev Requirements:\\n    ///      - The revealed vault address must match the TBTCVault address,\\n    ///      - All requirements from {Bridge#revealDepositWithExtraData}\\n    ///        function must be met.\\n    /// @dev This function doesn't validate if a deposit has been initialized before,\\n    ///      as the Bridge won't allow the same deposit to be revealed twice.\\n    // slither-disable-next-line dead-code\\n    function _initializeDeposit(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) internal returns (uint256) {\\n        require(reveal.vault == address(tbtcVault), \\\"Vault address mismatch\\\");\\n\\n        uint256 depositKey = _calculateDepositKey(\\n            _calculateBitcoinTxHash(fundingTx),\\n            reveal.fundingOutputIndex\\n        );\\n\\n        // The Bridge does not allow to reveal the same deposit twice and\\n        // revealed deposits stay there forever. The transaction will revert\\n        // if the deposit has already been revealed so, there is no need to do\\n        // an explicit check here.\\n        bridge.revealDepositWithExtraData(fundingTx, reveal, extraData);\\n\\n        return depositKey;\\n    }\\n\\n    /// @notice Finalizes a deposit by calculating the amount of TBTC minted\\n    ///         for the deposit.\\n    /// @param depositKey Deposit key identifying the deposit.\\n    /// @return initialDepositAmount Amount of funding transaction deposit. In\\n    ///         TBTC token decimals precision.\\n    /// @return tbtcAmount Approximate amount of TBTC minted for the deposit. In\\n    ///         TBTC token decimals precision.\\n    /// @return extraData 32-byte deposit extra data.\\n    /// @dev Requirements:\\n    ///      - The deposit must be initialized but not finalized\\n    ///        (in the context of this contract) yet.\\n    ///      - The deposit must be finalized on the Bridge side. That means the\\n    ///        deposit must be either swept or optimistically minted.\\n    /// @dev THIS FUNCTION DOESN'T VALIDATE IF A DEPOSIT HAS BEEN FINALIZED BEFORE,\\n    ///      IT IS A RESPONSIBILITY OF THE IMPLEMENTING CONTRACT TO ENSURE THIS\\n    ///      FUNCTION WON'T BE CALLED TWICE FOR THE SAME DEPOSIT.\\n    /// @dev IMPORTANT NOTE: The tbtcAmount returned by this function is an\\n    ///      approximation. See documentation of the `calculateTbtcAmount`\\n    ///      responsible for calculating this value for more details.\\n    // slither-disable-next-line dead-code\\n    function _finalizeDeposit(uint256 depositKey)\\n        internal\\n        returns (\\n            uint256 initialDepositAmount,\\n            uint256 tbtcAmount,\\n            bytes32 extraData\\n        )\\n    {\\n        IBridgeTypes.DepositRequest memory deposit = bridge.deposits(\\n            depositKey\\n        );\\n        require(deposit.revealedAt != 0, \\\"Deposit not initialized\\\");\\n\\n        (, uint64 finalizedAt) = tbtcVault.optimisticMintingRequests(\\n            depositKey\\n        );\\n\\n        require(\\n            deposit.sweptAt != 0 || finalizedAt != 0,\\n            \\\"Deposit not finalized by the bridge\\\"\\n        );\\n\\n        initialDepositAmount = deposit.amount * SATOSHI_MULTIPLIER;\\n\\n        tbtcAmount = _calculateTbtcAmount(deposit.amount, deposit.treasuryFee);\\n\\n        extraData = deposit.extraData;\\n    }\\n\\n    /// @notice Calculates the amount of TBTC minted for the deposit.\\n    /// @param depositAmountSat Deposit amount in satoshi (1e8 precision).\\n    ///        This is the actual amount deposited by the deposit creator, i.e.\\n    ///        the gross amount the Bridge's fees are cut from.\\n    /// @param depositTreasuryFeeSat Deposit treasury fee in satoshi (1e8 precision).\\n    ///        This is an accurate value of the treasury fee that was actually\\n    ///        cut upon minting.\\n    /// @return tbtcAmount Approximate amount of TBTC minted for the deposit.\\n    /// @dev IMPORTANT NOTE: The tbtcAmount returned by this function may\\n    ///      not correspond to the actual amount of TBTC minted for the deposit.\\n    ///      Although the treasury fee cut upon minting is known precisely,\\n    ///      this is not the case for the optimistic minting fee and the Bitcoin\\n    ///      transaction fee. To overcome that problem, this function just takes\\n    ///      the current maximum allowed values of both fees, at the moment of deposit\\n    ///      finalization. For the great majority of the deposits, such an\\n    ///      algorithm will return a tbtcAmount slightly lesser than the\\n    ///      actual amount of TBTC minted for the deposit. This will cause\\n    ///      some TBTC to be left in the contract and ensure there is enough\\n    ///      liquidity to finalize the deposit. However, in some rare cases,\\n    ///      where the actual values of those fees change between the deposit\\n    ///      minting and finalization, the tbtcAmount returned by this function\\n    ///      may be greater than the actual amount of TBTC minted for the deposit.\\n    ///      If this happens and the reserve coming from previous deposits\\n    ///      leftovers does not provide enough liquidity, the deposit will have\\n    ///      to wait for finalization until the reserve is refilled by subsequent\\n    ///      deposits or a manual top-up. The integrator is responsible for\\n    ///      handling such cases.\\n    // slither-disable-next-line dead-code\\n    function _calculateTbtcAmount(\\n        uint64 depositAmountSat,\\n        uint64 depositTreasuryFeeSat\\n    ) internal view virtual returns (uint256) {\\n        // Both deposit amount and treasury fee are in the 1e8 satoshi precision.\\n        // We need to convert them to the 1e18 TBTC precision.\\n        uint256 amountSubTreasury = (depositAmountSat - depositTreasuryFeeSat) *\\n            SATOSHI_MULTIPLIER;\\n\\n        uint256 omFeeDivisor = tbtcVault.optimisticMintingFeeDivisor();\\n        uint256 omFee = omFeeDivisor > 0\\n            ? (amountSubTreasury / omFeeDivisor)\\n            : 0;\\n\\n        // The deposit transaction max fee is in the 1e8 satoshi precision.\\n        // We need to convert them to the 1e18 TBTC precision.\\n        (, , uint64 depositTxMaxFee, ) = bridge.depositParameters();\\n        uint256 txMaxFee = depositTxMaxFee * SATOSHI_MULTIPLIER;\\n\\n        return amountSubTreasury - omFee - txMaxFee;\\n    }\\n\\n    /// @notice Calculates the deposit key for the given funding transaction\\n    ///         hash and funding output index.\\n    /// @param fundingTxHash Funding transaction hash.\\n    /// @param fundingOutputIndex Funding output index.\\n    /// @return depositKey Deposit key computed as\\n    ///         `keccak256(fundingTxHash | reveal.fundingOutputIndex)`. This\\n    ///         key can be used to refer to the deposit in the Bridge and\\n    ///         TBTCVault contracts.\\n    // slither-disable-next-line dead-code\\n    function _calculateDepositKey(\\n        bytes32 fundingTxHash,\\n        uint32 fundingOutputIndex\\n    ) internal pure returns (uint256) {\\n        return\\n            uint256(\\n                keccak256(abi.encodePacked(fundingTxHash, fundingOutputIndex))\\n            );\\n    }\\n\\n    /// @notice Calculates the Bitcoin transaction hash for the given Bitcoin\\n    ///         transaction data.\\n    /// @param txInfo Bitcoin transaction data, see `IBridgeTypes.BitcoinTxInfo` struct.\\n    /// @return txHash Bitcoin transaction hash.\\n    // slither-disable-next-line dead-code\\n    function _calculateBitcoinTxHash(IBridgeTypes.BitcoinTxInfo calldata txInfo)\\n        internal\\n        view\\n        returns (bytes32)\\n    {\\n        return\\n            abi\\n                .encodePacked(\\n                    txInfo.version,\\n                    txInfo.inputVector,\\n                    txInfo.outputVector,\\n                    txInfo.locktime\\n                )\\n                .hash256View();\\n    }\\n}\\n\",\"keccak256\":\"0x9092454b9143f1fc2bc45faad9dec83126a0a54c743ded48a6dfb0b260fef58d\",\"license\":\"GPL-3.0-only\"},\"contracts/integrator/IBridge.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\n/// @notice Namespace which groups all types relevant to the IBridge interface.\\n/// @dev This is a mirror of the real types used in the Bridge contract.\\n///      This way, the `integrator` subpackage does not need to import\\n///      anything from the `bridge` subpackage and explicitly depend on it.\\n///      This simplifies the dependency graph for integrators.\\nlibrary IBridgeTypes {\\n    /// @dev See bridge/BitcoinTx.sol#Info\\n    struct BitcoinTxInfo {\\n        bytes4 version;\\n        bytes inputVector;\\n        bytes outputVector;\\n        bytes4 locktime;\\n    }\\n\\n    /// @dev See bridge/Deposit.sol#DepositRevealInfo\\n    struct DepositRevealInfo {\\n        uint32 fundingOutputIndex;\\n        bytes8 blindingFactor;\\n        bytes20 walletPubKeyHash;\\n        bytes20 refundPubKeyHash;\\n        bytes4 refundLocktime;\\n        address vault;\\n    }\\n\\n    /// @dev See bridge/Deposit.sol#DepositRequest\\n    struct DepositRequest {\\n        address depositor;\\n        uint64 amount;\\n        uint32 revealedAt;\\n        address vault;\\n        uint64 treasuryFee;\\n        uint32 sweptAt;\\n        bytes32 extraData;\\n    }\\n}\\n\\n/// @notice Interface of the Bridge contract.\\n/// @dev See bridge/Bridge.sol\\ninterface IBridge {\\n    /// @dev See {Bridge#revealDepositWithExtraData}\\n    function revealDepositWithExtraData(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external;\\n\\n    /// @dev See {Bridge#deposits}\\n    function deposits(uint256 depositKey)\\n        external\\n        view\\n        returns (IBridgeTypes.DepositRequest memory);\\n\\n    /// @dev See {Bridge#depositParameters}\\n    function depositParameters()\\n        external\\n        view\\n        returns (\\n            uint64 depositDustThreshold,\\n            uint64 depositTreasuryFeeDivisor,\\n            uint64 depositTxMaxFee,\\n            uint32 depositRevealAheadPeriod\\n        );\\n}\\n\",\"keccak256\":\"0x4e598d96404a19609f511f10503e80f457602ad694d081df739571f67f6e0c4e\",\"license\":\"GPL-3.0-only\"},\"contracts/integrator/ITBTCVault.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.0;\\n\\n/// @notice Interface of the TBTCVault contract.\\n/// @dev See vault/TBTCVault.sol\\ninterface ITBTCVault {\\n    /// @dev See {TBTCVault#optimisticMintingRequests}\\n    function optimisticMintingRequests(uint256 depositKey)\\n        external\\n        returns (uint64 requestedAt, uint64 finalizedAt);\\n\\n    /// @dev See {TBTCVault#optimisticMintingFeeDivisor}\\n    function optimisticMintingFeeDivisor() external view returns (uint32);\\n}\\n\",\"keccak256\":\"0xf259d64c1040e2cbc3d17653491e45c5c3da17f575dac1c175c63c8a5308908e\",\"license\":\"GPL-3.0-only\"},\"contracts/test/TestTBTCDepositor.sol\":{\"content\":\"// SPDX-License-Identifier: GPL-3.0-only\\n\\npragma solidity ^0.8.0;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\n\\nimport \\\"../integrator/AbstractTBTCDepositor.sol\\\";\\nimport \\\"../integrator/IBridge.sol\\\";\\nimport \\\"../integrator/ITBTCVault.sol\\\";\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\ncontract TestTBTCDepositor is AbstractTBTCDepositor {\\n    event InitializeDepositReturned(uint256 depositKey);\\n\\n    event FinalizeDepositReturned(\\n        uint256 initialDepositAmount,\\n        uint256 tbtcAmount,\\n        bytes32 extraData\\n    );\\n\\n    function initialize(address _bridge, address _tbtcVault) external {\\n        __AbstractTBTCDepositor_initialize(_bridge, _tbtcVault);\\n    }\\n\\n    function initializeDepositPublic(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external {\\n        uint256 depositKey = _initializeDeposit(fundingTx, reveal, extraData);\\n        emit InitializeDepositReturned(depositKey);\\n    }\\n\\n    function finalizeDepositPublic(uint256 depositKey) external {\\n        (\\n            uint256 initialDepositAmount,\\n            uint256 tbtcAmount,\\n            bytes32 extraData\\n        ) = _finalizeDeposit(depositKey);\\n        emit FinalizeDepositReturned(\\n            initialDepositAmount,\\n            tbtcAmount,\\n            extraData\\n        );\\n    }\\n\\n    function calculateTbtcAmountPublic(\\n        uint64 depositAmountSat,\\n        uint64 depositTreasuryFeeSat\\n    ) external view returns (uint256) {\\n        return _calculateTbtcAmount(depositAmountSat, depositTreasuryFeeSat);\\n    }\\n}\\n\\ncontract MockBridge is IBridge {\\n    using BTCUtils for bytes;\\n\\n    mapping(uint256 => IBridgeTypes.DepositRequest) internal _deposits;\\n\\n    uint64 internal _depositDustThreshold = 1000000; // 1000000 satoshi = 0.01 BTC\\n    uint64 internal _depositTreasuryFeeDivisor = 50; // 1/50 == 100 bps == 2% == 0.02\\n    uint64 internal _depositTxMaxFee = 1000; // 1000 satoshi = 0.00001 BTC\\n\\n    event DepositRevealed(uint256 depositKey);\\n\\n    function revealDepositWithExtraData(\\n        IBridgeTypes.BitcoinTxInfo calldata fundingTx,\\n        IBridgeTypes.DepositRevealInfo calldata reveal,\\n        bytes32 extraData\\n    ) external {\\n        bytes32 fundingTxHash = abi\\n            .encodePacked(\\n                fundingTx.version,\\n                fundingTx.inputVector,\\n                fundingTx.outputVector,\\n                fundingTx.locktime\\n            )\\n            .hash256View();\\n\\n        uint256 depositKey = uint256(\\n            keccak256(\\n                abi.encodePacked(fundingTxHash, reveal.fundingOutputIndex)\\n            )\\n        );\\n\\n        require(\\n            _deposits[depositKey].revealedAt == 0,\\n            \\\"Deposit already revealed\\\"\\n        );\\n\\n        bytes memory fundingOutput = fundingTx\\n            .outputVector\\n            .extractOutputAtIndex(reveal.fundingOutputIndex);\\n\\n        uint64 fundingOutputAmount = fundingOutput.extractValue();\\n\\n        IBridgeTypes.DepositRequest memory request;\\n\\n        request.depositor = msg.sender;\\n        request.amount = fundingOutputAmount;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        request.revealedAt = uint32(block.timestamp);\\n        request.vault = reveal.vault;\\n        request.treasuryFee = _depositTreasuryFeeDivisor > 0\\n            ? fundingOutputAmount / _depositTreasuryFeeDivisor\\n            : 0;\\n        request.sweptAt = 0;\\n        request.extraData = extraData;\\n\\n        _deposits[depositKey] = request;\\n\\n        emit DepositRevealed(depositKey);\\n    }\\n\\n    function sweepDeposit(uint256 depositKey) public {\\n        require(_deposits[depositKey].revealedAt != 0, \\\"Deposit not revealed\\\");\\n        require(_deposits[depositKey].sweptAt == 0, \\\"Deposit already swept\\\");\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _deposits[depositKey].sweptAt = uint32(block.timestamp);\\n    }\\n\\n    function deposits(uint256 depositKey)\\n        external\\n        view\\n        returns (IBridgeTypes.DepositRequest memory)\\n    {\\n        return _deposits[depositKey];\\n    }\\n\\n    function depositParameters()\\n        external\\n        view\\n        returns (\\n            uint64 depositDustThreshold,\\n            uint64 depositTreasuryFeeDivisor,\\n            uint64 depositTxMaxFee,\\n            uint32 depositRevealAheadPeriod\\n        )\\n    {\\n        depositDustThreshold = _depositDustThreshold;\\n        depositTreasuryFeeDivisor = _depositTreasuryFeeDivisor;\\n        depositTxMaxFee = _depositTxMaxFee;\\n        depositRevealAheadPeriod = 0;\\n    }\\n\\n    function setDepositDustThreshold(uint64 value) external {\\n        _depositDustThreshold = value;\\n    }\\n\\n    function setDepositTreasuryFeeDivisor(uint64 value) external {\\n        _depositTreasuryFeeDivisor = value;\\n    }\\n\\n    function setDepositTxMaxFee(uint64 value) external {\\n        _depositTxMaxFee = value;\\n    }\\n}\\n\\ncontract MockTBTCVault is ITBTCVault {\\n    struct Request {\\n        uint64 requestedAt;\\n        uint64 finalizedAt;\\n    }\\n\\n    mapping(uint256 => Request) internal _requests;\\n\\n    uint32 public optimisticMintingFeeDivisor = 100; // 1%\\n\\n    function optimisticMintingRequests(uint256 depositKey)\\n        external\\n        returns (uint64 requestedAt, uint64 finalizedAt)\\n    {\\n        Request memory request = _requests[depositKey];\\n        return (request.requestedAt, request.finalizedAt);\\n    }\\n\\n    /// @dev The function is virtual to allow other projects using this mock\\n    ///      for AbtractTBTCDepositor-based contract tests to add any custom\\n    ///      logic needed.\\n    function createOptimisticMintingRequest(uint256 depositKey) public virtual {\\n        require(\\n            _requests[depositKey].requestedAt == 0,\\n            \\\"Request already exists\\\"\\n        );\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _requests[depositKey].requestedAt = uint64(block.timestamp);\\n    }\\n\\n    /// @dev The function is virtual to allow other projects using this mock\\n    ///      for AbtractTBTCDepositor-based contract tests to add any custom\\n    ///      logic needed.\\n    function finalizeOptimisticMintingRequest(uint256 depositKey)\\n        public\\n        virtual\\n    {\\n        require(\\n            _requests[depositKey].requestedAt != 0,\\n            \\\"Request does not exist\\\"\\n        );\\n        require(\\n            _requests[depositKey].finalizedAt == 0,\\n            \\\"Request already finalized\\\"\\n        );\\n        /* solhint-disable-next-line not-rely-on-time */\\n        _requests[depositKey].finalizedAt = uint64(block.timestamp);\\n    }\\n\\n    function setOptimisticMintingFeeDivisor(uint32 value) external {\\n        optimisticMintingFeeDivisor = value;\\n    }\\n}\\n\",\"keccak256\":\"0x325b87a52a0287e02cf63804c05d69379bc4a424fa656d93b3f285d4b4e72dfd\",\"license\":\"GPL-3.0-only\"}},\"version\":1}",
   "storageLayout": {
     "storage": [
       {
-        "astId": 41826,
+        "astId": 41806,
         "contract": "contracts/test/TestTBTCDepositor.sol:MockTBTCVault",
         "label": "_requests",
         "offset": 0,
         "slot": "0",
-        "type": "t_mapping(t_uint256,t_struct(Request)41821_storage)"
+        "type": "t_mapping(t_uint256,t_struct(Request)41801_storage)"
       },
       {
-        "astId": 41829,
+        "astId": 41809,
         "contract": "contracts/test/TestTBTCDepositor.sol:MockTBTCVault",
         "label": "optimisticMintingFeeDivisor",
         "offset": 0,
@@ -1474,19 +1474,19 @@
       }
     ],
     "types": {
-      "t_mapping(t_uint256,t_struct(Request)41821_storage)": {
+      "t_mapping(t_uint256,t_struct(Request)41801_storage)": {
         "encoding": "mapping",
         "key": "t_uint256",
         "label": "mapping(uint256 => struct MockTBTCVault.Request)",
         "numberOfBytes": "32",
-        "value": "t_struct(Request)41821_storage"
+        "value": "t_struct(Request)41801_storage"
       },
-      "t_struct(Request)41821_storage": {
+      "t_struct(Request)41801_storage": {
         "encoding": "inplace",
         "label": "struct MockTBTCVault.Request",
         "members": [
           {
-            "astId": 41818,
+            "astId": 41798,
             "contract": "contracts/test/TestTBTCDepositor.sol:MockTBTCVault",
             "label": "requestedAt",
             "offset": 0,
@@ -1494,7 +1494,7 @@
             "type": "t_uint64"
           },
           {
-            "astId": 41820,
+            "astId": 41800,
             "contract": "contracts/test/TestTBTCDepositor.sol:MockTBTCVault",
             "label": "finalizedAt",
             "offset": 8,