Search for projects by name or address
Multichain token framework using the CCIP messaging protocol, validated by Chainlink's offchain reporting (OCR) and 'decentralised oracle network' (DON).
Multichain token framework using the CCIP messaging protocol, validated by Chainlink's offchain reporting (OCR) and 'decentralised oracle network' (DON).
Multichain token framework using the CCIP messaging protocol, validated by Chainlink’s offchain reporting (OCR) and ‘decentralised oracle network’ (DON).
All crosschain messages in Chainlink CCIP are (supposed to be) validated and signed by a fixed signer set (OCR), currently equivalent to a 6/16 multisig on Ethereum. The router is the main entrypoint of the system, used to send messages to other chains or receive them. While in this page we only analyze the contracts and permissions on Ethereum, it’s important to understand that a full risk assessment requires reviewing all contracts on all supported chains, as a single misconfiguration or compromise on a single chain can cause loss of funds on other chains too. At the time of writing, CCIP supports more than 70 chains.
Outgoing messages go through an “OnRamp” contract, which is tasked to perform fee estimation through a “FeeQuoter” contract, and fetch the proper token pool to ultimately redirect funds through a “TokenAdminRegistry” contract. The pool either locks or burns the funds, depending on the specific pool contract logic. Pools can be managed either by Chainlink or the actual token owner, and can therefore have custom governance which needs to be additionally assessed per token. Some pools, but not all, implement crosschain rate limiters. The OnRamp may also enable “filterers” to exclude the relaying of messages based on sender or content.
Incoming messages go through an “OffRamp” contract, which checks whether they have been validated by the OCR set. Tokens are then either released or minted from the proper pool, depending on the specific pool contract logic. Standard non-token messages go through the main Router first before the external call is actually performed. Messages can only be executed by a set of permissioned “transmitters” within 1h, otherwise anyone can do it.
The OCR set corresponds to a 6/16 multisig on Ethereum. The owner of the OffRamp can arbitrarily update the threshold and signer set used to validate messages, so trust in this permissioned actor is required. The actual permission structure behind this role is complex, see the Permissions section for more details.
The FeeQuoter contract holds configuration for each destination chain such as whether the route is enabled, maximum message size and gas limit, gas overheads, a flat per-byte gas rate, a flat network fee and a LINK fee discount. It also stores token prices and destination chain gas prices to estimate fees, without checking them for staleness. A whitelist of addresses is permissioned to update such prices, and any token they price is automatically accepted as a fee token.
The Risk Management Network (RMN) is a contract that allows to blacklist either all paths with a universal “curse” or specific paths with more targeted curses. The RMN is represented by its own timelock and set of multisigs that can either propose, cancel, or immediately execute, bypassing any delay. The network can both block incoming and outgoing messages concerning all or specific chains. See Permissions section for more details.
While in v1.6 many source and destination chains can use share the same OnRamp and OffRamp, in v1.5 there is one OnRamp and one OffRamp for each active path. The current analysis only covers v1.6, but token pools can accept incoming messages from both v1.5 and v1.6 OffRamps at the same time. A complete risk assessment for a token requires looking into all OffRamps.
Chainlink provides an explorer for crosschain transactions and a directory for registered offramps and onramps, both globally and by token, but doesn’t present sufficient information around permissioned actors involved when interacting with a token using CCIP.
Symbol | Last 24h
Volume | Last 24h
transfer count | Last 24h avg.
transfer time | Last 24h avg.
transfer value | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Timestamp | Tokens | Value | Transfer time | Chains | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 8 signatures across 67 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 8-of-67 multisig and is strictly more constrained. Root: 3-of-3, childGroups=(1,5,6). Group 1: 2-of-3, parent=0, childGroups=(2,3,4) | Group 2: 2-of-14, parent=1, signers=14 | Group 3: 2-of-12, parent=1, signers=12 | Group 4: 2-of-5, parent=1, signers=5 | Group 5: 1-of-7, parent=0, signers=7 | Group 6: 3-of-16, parent=0, childGroups=(7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22) | Group 7: 1-of-2, parent=6, signers=2 | Group 8: 1-of-2, parent=6, signers=2 | Group 9: 1-of-2, parent=6, signers=2 | Group 10: 1-of-1, parent=6, signers=1 | Group 11: 1-of-2, parent=6, signers=2 | Group 12: 1-of-2, parent=6, signers=2 | Group 13: 1-of-4, parent=6, signers=4 | Group 14: 1-of-1, parent=6, signers=1 | Group 15: 1-of-1, parent=6, signers=1 | Group 16: 1-of-1, parent=6, signers=1 | Group 17: 1-of-1, parent=6, signers=1 | Group 18: 1-of-3, parent=6, signers=3 | Group 19: 1-of-1, parent=6, signers=1 | Group 20: 1-of-1, parent=6, signers=1 | Group 21: 1-of-3, parent=6, signers=3 | Group 22: 1-of-2, parent=6, signers=2. The owner can rotate the entire signer tree.
Participants (67):
0x013D…7e340x0D27…b4720x124B…3D600x15C5…1eB00x1620…16BF0x1A19…6e940x1BD4…e1420x1E2c…a8870x266a…C1120x29c5…D8450x2b73…7Fd80x2B88…52A00x2bbB…d1D60x34e4…62740x3C6c…8dE30x3Ce0…75d80x4189…06880x41eA…e69D0x4364…76aA0x4833…D4bf0x48A0…66280x4c29…92530x4D12…A2b60x4e50…C9260x5326…8B1c0x5408…d4E00x570F…a6950x5AA4…776C0x5bD3…92d60x5BF2…d29F0x5C33…B1c80x60Fe…9F2e0x615B…94Ee0x6924…Ecf70x6943…32260x6B0f…afae0x6bfB…e5f40x70C2…b9A50x70f4…73E60x7b40…bdB20x7eFF…43740x8437…D14a0x8932…aDE70x9079…2A360x925d…8C790x9453…2d1D0x9B39…F3c60xA317…B7cF0xa35B…a4fB0xa42c…5b7D0xa53a…24dD0xa859…9F870xb122…90B90xB89F…50F20xC6fA…96240xd107…02aF0xd309…22640xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xF721…c4b70xfBB1…50280xFc66…8d290xFccD…F271A Multisig with 6/12 threshold.
Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 4 signatures across 38 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 4-of-38 multisig and is strictly more constrained. Root: 2-of-4, childGroups=(1,2,3,4). Group 1: 2-of-14, parent=0, signers=14 | Group 2: 2-of-12, parent=0, signers=12 | Group 3: 2-of-5, parent=0, signers=5 | Group 4: 2-of-7, parent=0, signers=7. The owner can rotate the entire signer tree.
Participants (38):
0x013D…7e340x0D27…b4720x15C5…1eB00x1A19…6e940x1BD4…e1420x1E2c…a8870x29c5…D8450x34e4…62740x3Ce0…75d80x41eA…e69D0x4833…D4bf0x4c29…92530x4D12…A2b60x5326…8B1c0x5408…d4E00x5AA4…776C0x60Fe…9F2e0x615B…94Ee0x6943…32260x6bfB…e5f40x70f4…73E60x7b40…bdB20x8437…D14a0x8932…aDE70x9B39…F3c60xa42c…5b7D0xa53a…24dD0xB89F…50F20xd107…02aF0xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xfBB1…50280xFc66…8d290xFccD…F271Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 4 signatures across 38 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 4-of-38 multisig and is strictly more constrained. Root: 2-of-4, childGroups=(1,2,3,4). Group 1: 2-of-14, parent=0, signers=14 | Group 2: 2-of-12, parent=0, signers=12 | Group 3: 2-of-5, parent=0, signers=5 | Group 4: 2-of-7, parent=0, signers=7. The owner can rotate the entire signer tree.
Participants (38):
0x013D…7e340x0D27…b4720x15C5…1eB00x1A19…6e940x1BD4…e1420x1E2c…a8870x29c5…D8450x34e4…62740x3Ce0…75d80x41eA…e69D0x4833…D4bf0x4c29…92530x4D12…A2b60x5326…8B1c0x5408…d4E00x5AA4…776C0x60Fe…9F2e0x615B…94Ee0x6943…32260x6bfB…e5f40x70f4…73E60x7b40…bdB20x8437…D14a0x8932…aDE70x9B39…F3c60xa42c…5b7D0xa53a…24dD0xB89F…50F20xd107…02aF0xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xfBB1…50280xFc66…8d290xFccD…F271Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 4 signatures across 41 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 4-of-41 multisig and is strictly more constrained. Root: 2-of-4, childGroups=(1,2,3,4). Group 1: 2-of-15, parent=0, signers=15 | Group 2: 2-of-14, parent=0, signers=14 | Group 3: 2-of-5, parent=0, signers=5 | Group 4: 2-of-7, parent=0, signers=7. The owner can rotate the entire signer tree.
Participants (41):
0x013D…7e340x0D27…b4720x15C5…1eB00x1A19…6e940x1BD4…e1420x1E2c…a8870x29c5…D8450x34e4…62740x3Ce0…75d80x41eA…e69D0x4833…D4bf0x4c29…92530x4D12…A2b60x5326…8B1c0x5408…d4E00x5AA4…776C0x60Fe…9F2e0x615B…94Ee0x6943…32260x6bfB…e5f40x70f4…73E60x7b40…bdB20x8437…D14a0x8932…aDE70x8E0e…66390x9B39…F3c60xa42c…5b7D0xa53a…24dD0xB89F…50F20xb8C1…051F0xBA77…40090xd107…02aF0xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xfBB1…50280xFc66…8d290xFccD…F271Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 5 signatures across 40 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 5-of-40 multisig and is strictly more constrained. Root: 2-of-2, childGroups=(1,2). Group 1: 1-of-7, parent=0, signers=7 | Group 2: 2-of-3, parent=0, childGroups=(3,4,5) | Group 3: 2-of-15, parent=2, signers=15 | Group 4: 2-of-13, parent=2, signers=13 | Group 5: 2-of-5, parent=2, signers=5. The owner can rotate the entire signer tree.
Participants (40):
0x013D…7e340x0D27…b4720x15C5…1eB00x1A19…6e940x1BD4…e1420x1E2c…a8870x29c5…D8450x34e4…62740x3Ce0…75d80x41eA…e69D0x4833…D4bf0x4c29…92530x4D12…A2b60x5326…8B1c0x5408…d4E00x5AA4…776C0x60Fe…9F2e0x615B…94Ee0x6bfB…e5f40x70f4…73E60x7b40…bdB20x8437…D14a0x8932…aDE70x8E0e…66390x9B39…F3c60xa42c…5b7D0xa53a…24dD0xB89F…50F20xb8C1…051F0xBA77…40090xd107…02aF0xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xfBB1…50280xFc66…8d290xFccD…F271Anyone can call this contract to execute scheduled transactions that have passed the delay.
Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 2 signatures across 67 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 2-of-67 multisig and is strictly more constrained. Root: 1-of-2, childGroups=(1,2). Group 1: 2-of-41, parent=0, signers=41 | Group 2: 6-of-16, parent=0, childGroups=(3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18) | Group 3: 1-of-2, parent=2, signers=2 | Group 4: 1-of-2, parent=2, signers=2 | Group 5: 1-of-2, parent=2, signers=2 | Group 6: 1-of-1, parent=2, signers=1 | Group 7: 1-of-2, parent=2, signers=2 | Group 8: 1-of-1, parent=2, signers=1 | Group 9: 1-of-3, parent=2, signers=3 | Group 10: 1-of-1, parent=2, signers=1 | Group 11: 1-of-1, parent=2, signers=1 | Group 12: 1-of-1, parent=2, signers=1 | Group 13: 1-of-1, parent=2, signers=1 | Group 14: 1-of-3, parent=2, signers=3 | Group 15: 1-of-1, parent=2, signers=1 | Group 16: 1-of-1, parent=2, signers=1 | Group 17: 1-of-2, parent=2, signers=2 | Group 18: 1-of-2, parent=2, signers=2. The owner can rotate the entire signer tree.
Participants (67):
0x013D…7e340x0418…80680x0D27…b4720x124B…3D600x146C…89520x15C5…1eB00x1801…EB670x1A19…6e940x1BD4…e1420x1E2c…a8870x29c5…D8450x2b73…7Fd80x2B88…52A00x2bbB…d1D60x34e4…62740x3C6c…8dE30x3Ce0…75d80x41eA…e69D0x4364…76aA0x4833…D4bf0x48A0…66280x4c29…92530x4D12…A2b60x4e50…C9260x5326…8B1c0x5408…d4E00x570F…a6950x5AA4…776C0x5bD3…92d60x5C33…B1c80x60Fe…9F2e0x615B…94Ee0x6924…Ecf70x6943…32260x6B0f…afae0x6bfB…e5f40x70C2…b9A50x70f4…73E60x7b40…bdB20x7eFF…43740x8437…D14a0x8932…aDE70x8E0e…66390x9079…2A360x925d…8C790x9453…2d1D0x9B39…F3c60xA317…B7cF0xa35B…a4fB0xa42c…5b7D0xa53a…24dD0xb122…90B90xB89F…50F20xb8C1…051F0xBA77…40090xd107…02aF0xd309…22640xd3E2…51E70xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xfBB1…50280xFc66…8d290xFccD…F271Anyone can call this contract to execute scheduled transactions that have passed the delay.
Tree-quorum multisig used to gate CCIP governance actions. Signers belong to leaf groups; each interior group has its own M-of-N quorum and counts how many of its children (signers or sub-groups) have succeeded. A call is accepted only if the root group reaches its quorum. Minimum 2 signatures across 67 total signers, but those signatures must come from the specific groups required by the tree; this is NOT equivalent to a flat 2-of-67 multisig and is strictly more constrained. Root: 1-of-2, childGroups=(1,2). Group 1: 2-of-38, parent=0, signers=38 | Group 2: 3-of-16, parent=0, childGroups=(3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18) | Group 3: 1-of-2, parent=2, signers=2 | Group 4: 1-of-2, parent=2, signers=2 | Group 5: 1-of-2, parent=2, signers=2 | Group 6: 1-of-1, parent=2, signers=1 | Group 7: 1-of-2, parent=2, signers=2 | Group 8: 1-of-2, parent=2, signers=2 | Group 9: 1-of-4, parent=2, signers=4 | Group 10: 1-of-1, parent=2, signers=1 | Group 11: 1-of-1, parent=2, signers=1 | Group 12: 1-of-1, parent=2, signers=1 | Group 13: 1-of-1, parent=2, signers=1 | Group 14: 1-of-3, parent=2, signers=3 | Group 15: 1-of-1, parent=2, signers=1 | Group 16: 1-of-1, parent=2, signers=1 | Group 17: 1-of-3, parent=2, signers=3 | Group 18: 1-of-2, parent=2, signers=2. The owner can rotate the entire signer tree.
Participants (67):
0x013D…7e340x0D27…b4720x124B…3D600x15C5…1eB00x1620…16BF0x1A19…6e940x1BD4…e1420x1E2c…a8870x266a…C1120x29c5…D8450x2b73…7Fd80x2B88…52A00x2bbB…d1D60x34e4…62740x3C6c…8dE30x3Ce0…75d80x4189…06880x41eA…e69D0x4364…76aA0x4833…D4bf0x48A0…66280x4c29…92530x4D12…A2b60x4e50…C9260x5326…8B1c0x5408…d4E00x570F…a6950x5AA4…776C0x5bD3…92d60x5BF2…d29F0x5C33…B1c80x60Fe…9F2e0x615B…94Ee0x6924…Ecf70x6943…32260x6B0f…afae0x6bfB…e5f40x70C2…b9A50x70f4…73E60x7b40…bdB20x7eFF…43740x8437…D14a0x8932…aDE70x9079…2A360x925d…8C790x9453…2d1D0x9B39…F3c60xA317…B7cF0xa35B…a4fB0xa42c…5b7D0xa53a…24dD0xa859…9F870xb122…90B90xB89F…50F20xC6fA…96240xd107…02aF0xd309…22640xD924…814C0xE062…0f880xE3fe…71620xE5e1…9cc80xEA62…ddc60xF278…4BF60xF721…c4b70xfBB1…50280xFc66…8d290xFccD…F271Proxy pointing to the active ARM/RMN contract used by CCIP to report whether routes are cursed.
USD price oracle used by CCIP OnRamps and CommitStores to value gas and tokens for fee calculation. Maintains a set of fee tokens, a set of authorized price updaters, and per-token / per-destination-chain prices written by the updaters and consumed by OnRamps for fee quoting and CommitStores for piggybacked price updates.

v1.6 OffRamp on Arbitrum One.
v1.6 OffRamp on Base.
v1.6 OffRamp on BNB Chain.
OffRamp used to receive messages on Ethereum from other chains. It stores the list and threshold of “OCR” signers that authorize the commitment of crosschain messages and the list of “transmitters”, i.e. addresses can relay messages signed by the signers. Currently 16 signers are configured with F=5, so 5+1 signatures are required on every commit report. Committed message are usually executed by whitelisted “execution transmitters”. If they are not executed within 1h, anyone can execute them.
Fee oracle and price registry for CCIP. Holds the per-destination-chain fee config (size and gas limits, gas overheads, flat per-byte gas rate, flat network fee, LINK fee multiplier percent, chain-family selector), the per-(destChain, token) flat transfer fee overrides, and the USD price tables for tokens and destination gas pushed by authorized callers through updatePrices(). Prices are not staleness-checked: quoting only requires that a price was set at least once. Exposes both the CCIP 2.0 quoting interface (quoteGasForExec, getTokenTransferFee, resolveLegacyArgs) and the legacy 1.6 one (getValidatedFee, processMessageArgs), so both ramp generations can use it.
Permissionless registry-module wrapper. Anyone can call it, but each entry-point succeeds only when msg.sender is the token’s own admin/owner, assuming they implement the proper interfaces (e.g. IOwner).
Permissionless registry-module wrapper. Anyone can call it, but each entry-point succeeds only when msg.sender is the token’s own admin/owner, assuming they implement the proper interfaces (e.g. IOwner).
Role based timelock used to administer CCIP contracts.
Role based timelock used to administer CCIP contracts.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
GHO lock-and-release token pool on Ethereum. It trusts configured remote pools and only accepts inbound token releases routed through CCIP OffRamps.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Contract maintaining message nonces, which are updated by the OnRamp and OffRamps.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Deprecated router used by BSC.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Token accepted as fee token for sending outgoing messages.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Ethereum CCIP Router for this route. Users call it to send and receive messages from other chains. It dispatches to the appropriate OnRamp or OffRamp based on source or destination chain.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Contract used to send outgoing messages to other chains. It saves destination chain configs, storing the router that is allowed to call the OnRamp and whether a whitelist is enabled to send messages.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Central token registry that defines token pools and administrative rights to change such token pools. Tokens can either be centrally administered by Chainlink, or by the actual token admin / issuer.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Token accepted as fee token for sending outgoing messages.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Remote Risk Management Network contract used by CCIP to verify RMN reports and expose cursed subjects.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
Its OCR commit reports publish Merkle roots for source messages; execution is possible only for leaves under roots that are both committed here and blessed by RMN through the ARM proxy.
v1.6 OffRamp on Polygon PoS.
v1.6 OffRamp on OP Mainnet.
The current deployment carries some associated risks:
Funds can be stolen if a contract receives a malicious code upgrade. There is no delay on code upgrades (CRITICAL).