d1e9aee5 (main)
and
ab81d793 (PR)
+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"warning": {
"value": "The central operator can censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 1800,
"challengeDelay": 1800,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "1h challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "30m challenge period\n+ 30m execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -3600
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. The sequencer is publishing data to EigenDA v2. Sequencer transaction data roots are not checked against the DACert Verifier onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 6 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 6,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 5/7 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.7142857142857143
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -259200
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 3d delay on this operation.",
"sentiment": "good",
"orderHint": 259200,
"secondLine": "3d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 5/7 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.7142857142857143
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -259200
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 3/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6
},
"exitWindow": {
"value": "1d",
"description": "Users have 1d to exit funds in case of an unwanted upgrade. There is a 8d delay before a upgrade is applied, and withdrawals can take up to 7d to be processed.",
"sentiment": "bad",
"orderHint": 86400
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a trade or a withdrawal transaction by submitting a request through L1. If the sequencer censors or is down for 7d, users can use the exit hatch to withdraw their funds. Users are required to find a counterparty for the trade by out of system means.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. Positions will be closed using the average price from the last batch state update.",
"sentiment": "good",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -259200
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 3d delay on this operation.",
"sentiment": "good",
"orderHint": 259200,
"secondLine": "3d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+10 -2
+10 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 3/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": false,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": false,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "10d",
"sentiment": "warning",
"description": "Users have 10d to exit funds in case of an unwanted upgrade. There is a 1mo delay before an upgrade is applied, and withdrawal inclusion via the decentralized sequencer set is probabilistic and simulated to take up to 20d to be processed. Although core contracts are immutable, the onchain Governance system can designate a new 'canonical' rollup with a 1mo delay and has access to critical configuration permissions that can freeze or compromise the Rollup system, counting as an upgrade for the exit window."
},
"sequencerFailure": {
"value": "Decentralized Sequencer Set",
"sentiment": "good",
"description": "Users can permissionlessly become a sequencer by staking 200 K AZTEC to join the queue and wait to obtain committee-based block production rights. If the pseudo-randomly sampled committees censor proposals, anyone who bonds 332 M AZTEC will join the escape hatch candidate set. Every 2d 23h, a candidate is pseudo-randomly selected to propose and prove checkpoints fully autonomously. A candidate remains in the set until they are selected or leave voluntarily."
},
"proposerFailure": {
"value": "Self Propose",
"sentiment": "good",
"description": "Checkpoint proposals come from the open sequencer set, with the escape hatch providing a bonded fallback if the sampled committees are censoring or unavailable. Anyone with access to the required hardware can submit epoch root proofs which finalize the proven checkpoints."
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 5 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 5,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 5 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 5,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Single round proofs (1R) prove the validity of a state proposal, only requiring a single transaction to resolve. A fault proof eliminates a state proposal by proving that any intermediate state transition in the proposal results in a different state root. For either, a ZK proof is used.",
"sentiment": "good",
"orderHint": null,
"executionDelay": 86400,
"challengeDelay": 259200,
"initialBond": "0.5",
"secondLine": "4d challenge + execution delay"
"initialBond": {
"value": "0.5"
},
"permissioned": false,
"defenderAdvantage": "not-assessed",
"secondLine": "3d challenge period\n+ 1d execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"proposerFailure": {
"value": "Self propose",
"description": "The primary whitelisted proposer currently has no optimistic advantage (`vanguardAdvantage = 0`), so this privilege is disabled (not active). Anyone can leverage the source available zk prover to prove a fault or a conflicting valid proposal to win against the privileged proposer and/or supply a bond and make a counter proposal immediately.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+4 -1
+4 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/4 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There is no delay on this operation.",
"sentiment": "good",
"orderHint": 0
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on the base chain, which ultimately gets published on Ethereum.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. NFTs will be minted on L1 to exit.",
"sentiment": "good",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -259200
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 3d delay on this operation.",
"sentiment": "good",
"orderHint": 259200,
"secondLine": "3d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+8 -1
+8 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 0,
"challengeDelay": 608400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.0",
"initialBond": {
"value": "0.0"
},
"permissioned": false,
"defenderAdvantage": {
"shape": "log"
},
"secondLine": "7d 1h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "Not applicable",
"description": "Users cannot exit their funds as all deposits are considered donations.",
"sentiment": "neutral",
"orderHint": null,
"warning": {
"value": "Bug bounty Appchain: The single hardcoded address can withdraw all funds.",
"sentiment": "bad"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "Users can self sequence transactions by sending them on L1. There is no privileged operator.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
}
}+8 -1
+8 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 0,
"challengeDelay": 608400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.23219805",
"initialBond": {
"value": "0.23219805"
},
"permissioned": false,
"defenderAdvantage": {
"shape": "log"
},
"secondLine": "7d 1h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "Not applicable",
"description": "Users cannot exit their funds as all deposits are considered donations.",
"sentiment": "neutral",
"orderHint": null,
"warning": {
"value": "Bug bounty Appchain: The single hardcoded address can withdraw all funds.",
"sentiment": "bad"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "Users can self sequence transactions by sending them on L1. There is no privileged operator.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Single round proofs (1R) only require a single transaction to resolve. ZK proofs are used to prove the correctness of the state transition. The system currently operates with at least 5 whitelisted challengers external to the team.",
"sentiment": "warning",
"orderHint": null,
"executionDelay": 302400,
"challengeDelay": 302400,
"initialBond": "0.01",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.01"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. The sequencer is publishing data to EigenDA v2. Sequencer transaction data roots are checked against the DACert Verifier data roots, signed off by EigenDA operators.",
"sentiment": "warning"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain. A custom data availability (DA) provider without attestations is used, but data unavailability can be challenged.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a withdrawal transaction by submitting a request through L1 with a 0.01 ETH fee. If the sequencer is down for more than 15d, users can use the exit hatch to withdraw their funds. The sequencer can censor individual deposits, but in such case after 15d users can get their funds back.",
"sentiment": "good",
"orderHint": 1296000
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a withdrawal transaction by submitting a request through L1 with a 0.01 ETH fee. If the sequencer is down for more than 15d, users can use the exit hatch to withdraw their funds. The sequencer can censor individual deposits, but in such case after 15d users can get their funds back.",
"sentiment": "good",
"orderHint": 1296000
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "1mo",
"description": "Users have 1mo to exit funds in case of an unwanted upgrade. There is a 1mo 15d delay before a upgrade is applied, and withdrawals can take up to 15d to be processed.",
"sentiment": "good",
"orderHint": 2592000
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a withdrawal transaction by submitting a request through L1 with a 0.01 ETH fee. If the sequencer is down for more than 15d, users can use the exit hatch to withdraw their funds. The sequencer can censor individual deposits, but in such case after 15d users can get their funds back.",
"sentiment": "good",
"orderHint": 1296000
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+21 -4
+21 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 6d 15h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 575476,
"secondLine": "6d 15h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d 12h delay on this operation.",
"sentiment": "good",
"orderHint": 388800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 6d 15h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 575476
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1d challenge period.",
"executionDelay": 0,
"challengeDelay": 86400,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on the base chain, which ultimately gets published on Ethereum.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 7d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 636216,
"secondLine": "7d 8h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1d challenge period.",
"executionDelay": 0,
"challengeDelay": 86400,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 7d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 636216
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 4/7 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5714285714285714
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade. Users can be explicitly censored from withdrawing (Blocklist on L1).",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. Sequencer transaction data roots are not checked against the ServiceManager DA bridge data roots onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. Sequencer transaction data roots are not checked against the ServiceManager DA bridge data roots onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "9d",
"description": "There is a 9d exit window (or 2d if shortened by the Priority Controller).",
"sentiment": "warning",
"orderHint": 777600
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a trade or a withdrawal transaction by submitting a request through L1. If the sequencer censors or is down for 14d, users can use the exit hatch to withdraw their funds. Users are required to find a counterparty for the trade by out of system means.",
"sentiment": "good",
"orderHint": 1209600,
"secondLine": "14d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. Positions will be closed using the average price from the last batch state update.",
"sentiment": "good",
"orderHint": null
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 5d delay on this operation.",
"sentiment": "good",
"orderHint": 432000
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656,
"secondLine": "11d 23h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 3 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 7d challenge period.",
"executionDelay": 0,
"challengeDelay": 604800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 3,
"initialBond": "0.0",
"initialBond": {
"value": "0.0"
},
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 13d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1154616,
"secondLine": "13d 8h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 3 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 7d challenge period.",
"executionDelay": 0,
"challengeDelay": 604800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 3,
"initialBond": "0.0",
"initialBond": {
"value": "0.0"
},
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 5d delay on this operation.",
"sentiment": "good",
"orderHint": 432000
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 13d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1154616
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+4 -1
+4 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.2
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a trade or a withdrawal transaction by submitting a request through L1. If the sequencer censors or is down for 7d, users can use the exit hatch to withdraw their funds. Users are required to find a counterparty for the trade by out of system means.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. Positions will be closed using the average price from the last batch state update.",
"sentiment": "good",
"orderHint": null
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.01",
"initialBond": {
"value": "0.01"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.01",
"initialBond": {
"value": "0.01"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 5d delay on this operation.",
"sentiment": "good",
"orderHint": 432000
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+24 -6
+24 -6
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Actors watching the chain can challenge state proposals, and challenged proposals must provide ZK proofs. SNARKs are zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"challengeDelay": 604800,
"executionDelay": 0,
"initialBond": "0.0005",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0005"
},
"permissioned": false,
"defenderAdvantage": "not-assessed",
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "Users can self sequence transactions by sending them on L1. There is no privileged operator.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can propose blocks if accompanied by a validity proof. Only the whitelisted proposers can propose state roots for recent blocks optimistically. Anyone can propose optimistically for L2 blocks that are older than 14d.",
"sentiment": "good",
"orderHint": 1209600
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 7 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 7,
"initialBond": "0.3",
"initialBond": {
"value": "0.3"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Actors watching the chain can challenge state proposals, and challenged proposals must provide ZK proofs. SNARKs are zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"challengeDelay": 604800,
"executionDelay": 0,
"initialBond": "0.005",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.005"
},
"permissioned": false,
"defenderAdvantage": "not-assessed",
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "∞",
"description": "Users can exit funds at any time because contracts are not upgradeable.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "Users can self sequence transactions by sending them on L1. There is no privileged operator.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can propose blocks if accompanied by a validity proof. Only the whitelisted proposers can propose state roots for recent blocks optimistically. Anyone can propose optimistically for L2 blocks that are older than 14d.",
"sentiment": "good",
"orderHint": 1209600
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 6 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 6,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -3456000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1mo 10d delay on this operation.",
"sentiment": "good",
"orderHint": 3456000,
"secondLine": "1mo 10d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain. A custom data availability (DA) provider without attestations is used, but data unavailability can be challenged.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2y 9mo delay on this operation.",
"sentiment": "good",
"orderHint": 86400000,
"secondLine": "2y 9mo delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 15 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 15,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656,
"secondLine": "11d 23h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 15 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 15,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656
}
}
}+21 -4
+21 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1mo 8d challenge period.",
"executionDelay": 0,
"challengeDelay": 3298896,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1mo 8d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 1mo 14d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 3848712,
"secondLine": "1mo 14d delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1mo 8d challenge period.",
"executionDelay": 0,
"challengeDelay": 3298896,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1mo 8d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d 12h delay on this operation.",
"sentiment": "good",
"orderHint": 388800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 1mo 14d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 3848712
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. The Operator actively uses a TransactionFilterer contract, which requires accounts that enqueue or force transactions from L1 to be whitelisted.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -302400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "7d",
"description": "Users have 7d to exit funds in case of an unwanted upgrade. There is a 7d delay before a upgrade is applied, and withdrawals can take up to 0s to be processed.",
"sentiment": "warning",
"orderHint": 604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for , users can use the exit hatch to withdraw their funds.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "1.9",
"initialBond": {
"value": "1.9"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+10 -2
+10 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -200
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is ultimately NOT published on Ethereum.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -200
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 5/7 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.7142857142857143
},
"exitWindow": {
"value": "14d",
"description": "Users have 14d to exit funds in case of an unwanted upgrade. There is a 14d delay before a upgrade is applied, and withdrawals can take up to 0s to be processed.",
"sentiment": "warning",
"orderHint": 1209600
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. NFTs will be minted on L1 to exit.",
"sentiment": "good",
"orderHint": null
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.8",
"initialBond": {
"value": "0.8"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.8",
"initialBond": {
"value": "0.8"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+9 -2
+9 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+3 -0
+3 -0
{
"host": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 7d delay on this operation. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
},
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Self custodied",
"description": "All data required for payments and withdrawals is self custodied by users.",
"sentiment": "good"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
},
"stacked": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Self custodied",
"description": "All data required for payments and withdrawals is self custodied by users.",
"sentiment": "good"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 7d delay on this operation. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, forced transactions are disabled.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 9 WHITELISTED actors watching the chain to prove that the state is incorrect. At least 5 Challengers are external to the Operator. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "warning",
"orderHint": 9,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades of the L1 as they are initiated by the Security Council with instant upgrade power and without proper notice. Upgrades initiated by actors other than the Security Council (e.g. KYC providers) on Layer 2 guarantee at least a 7d exit window to the user.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1d challenge period.",
"executionDelay": 0,
"challengeDelay": 86400,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 7d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 636216,
"secondLine": "7d 8h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1d challenge period.",
"executionDelay": 0,
"challengeDelay": 86400,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1d challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 7d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 636216
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for , users can use the exit hatch to withdraw their funds.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Avail. Transaction data is checked against the Vector bridge data roots, signed off by Avail validators.",
"sentiment": "warning"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -1209600
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 14d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 1209600
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1. Unlike most ZK rollups, transaction data is posted instead of state diffs.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Eventually (after 6 months of no finalized blocks) the Operator role becomes public, theoretically allowing anyone to post data.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. Eventually (after 6 months of no finalized blocks) the Operator role becomes public, theoretically allowing anyone to propose state with valid proofs.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -1296000
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a withdrawal transaction by submitting a request through L1 with a 0.02 ETH fee. If the sequencer is down for more than 15d, users can use the exit hatch to withdraw their funds. The sequencer can censor individual deposits, but in such case after 15d users can get their funds back.",
"sentiment": "good",
"orderHint": 1296000
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 43200,
"secondLine": "12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -43200
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+4 -2
+4 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Single round proofs (1R) prove the validity of a state proposal, only requiring a single transaction to resolve. A fault proof eliminates a state proposal by proving that any intermediate state transition in the proposal results in a different state root. For either, a ZK proof is used. Since the node source is not available, challengers cannot watch the chain independently. `vanguardAdvantage` applies to every proposal and is set to 36558901084y 8mo, so only the Vanguard can submit state proposals; faulty proposals can be flagged but not replaced, halting the chain until the Vanguard proposes a correct state root.",
"sentiment": "bad",
"executionDelay": 302400,
"challengeDelay": 604800,
"initialBond": "0.00001",
"initialBond": {
"value": "0.00001"
},
"orderHint": null,
"secondLine": "10d 12h challenge + execution delay"
"secondLine": "7d challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. The sequencer is publishing data to EigenDA v2. Sequencer transaction data roots are not checked against the DACert Verifier onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+7 -0
+7 -0
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.Anyone can submit challenge requests. However, permissioned actors are needed to create the challenge and to delete successfully disputed state roots. Additionally, the current permissioned actors (GameCreator and Security Council minority) can collude and finalize malicious state roots.",
"executionDelay": 0,
"challengeDelay": 604800,
"sentiment": "bad",
"orderHint": null,
"initialBond": {
"value": "4.0",
"token": "METIS"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. The single address acting as a sequencer on L1 is not trustlessly linkable to the claim of multiple decentralized sequencers being used.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Security Council minority",
"description": "Only the whitelisted proposer can update state roots on L1, so in the event of failure the withdrawals are frozen. The Security Council minority can be alerted to enforce censorship resistance because they own the proposer registry, controlling the active whitelisted proposer.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on the base chain, which ultimately gets published on Ethereum.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Single round proofs (1R) only require a single transaction to resolve. ZK proofs are used to prove the correctness of the state transition. The system currently operates with at least 5 whitelisted challengers external to the team.",
"sentiment": "warning",
"orderHint": null,
"challengeDelay": 172800,
"initialBond": "1.0",
"executionDelay": 0,
"initialBond": {
"value": "1.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "2d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for 7d, new L1 batches must include at least 1 transaction from the queue.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 7d of inactivity from the currently whitelisted Proposers. This requires using the source-available prover to submit a zk proof of validity for the proposal.",
"sentiment": "good",
"orderHint": 604800
}
}
}+24 -6
+24 -6
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 30m challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 1800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "2d challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "30m challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 28d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 2419200,
"secondLine": "28d delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 30m challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 1800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "2d challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "30m challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 28d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 2419200
}
}
}+4 -1
+4 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.4
},
"exitWindow": {
"value": "1d",
"description": "Users have 1d to exit funds in case of an unwanted upgrade. There is a 8d delay before a upgrade is applied, and withdrawals can take up to 7d to be processed.",
"sentiment": "bad",
"orderHint": 86400
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. NFTs will be minted on L1 to exit.",
"sentiment": "good",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 10 WHITELISTED actors watching the chain to prove that the state is incorrect. At least 5 Challengers are external to the Operator. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "warning",
"orderHint": 10,
"initialBond": "1.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "1.0"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 5/6 that is tasked with protecting and supplying the data.",
"sentiment": "warning",
"orderHint": 0.8333333333333334
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "7d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have only 7d to exit.\n\n If users post a tx after that time, they would only be able to self propose a state root 28d after the last state root was proposed and then wait for the 6d 8h challenge window, while the upgrade would be confirmed just after the 6d 8h challenge window and the 3d L1 timelock.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 28d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 2419200,
"secondLine": "28d delay"
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "1.2",
"initialBond": {
"value": "1.2"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+23 -6
+23 -6
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1mo 3d challenge period.",
"executionDelay": 1036800,
"executionDelayMode": "if-challenged",
"challengeDelay": 2903040,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "1mo 15d challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "1mo 3d challenge period\n+ 12d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 1mo 3d challenge period.",
"executionDelay": 1036800,
"executionDelayMode": "if-challenged",
"challengeDelay": 2903040,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "1mo 15d challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "1mo 3d challenge period\n+ 12d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d 12h delay on this operation.",
"sentiment": "good",
"orderHint": 129600
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Encrypted data is posted on Ethereum as blobs, and a privacy council of 3 members holds the decryption keys. Users are not able to independetly reconstruct the L2 state without relying on the council members.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d challenge period.",
"executionDelay": 0,
"challengeDelay": 518400,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -172800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800,
"secondLine": "2d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 8h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1068216,
"secondLine": "12d 8h delay"
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+19 -4
+19 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 10 WHITELISTED actors watching the chain to prove that the state is incorrect. At least 5 Challengers are external to the Operator. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "warning",
"orderHint": 10,
"initialBond": "1.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "1.0"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 5/6 that is tasked with protecting and supplying the data.",
"sentiment": "warning",
"orderHint": 0.8333333333333334
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "7d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have only 7d to exit.\n\n If users post a tx after that time, they would only be able to self propose a state root 28d after the last state root was proposed and then wait for the 6d 8h challenge window, while the upgrade would be confirmed just after the 6d 8h challenge window and the 3d L1 timelock.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 28d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 2419200,
"secondLine": "28d delay"
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 30m challenge period.",
"executionDelay": 0,
"challengeDelay": 1800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "30m challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -864000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 10d delay on this operation.",
"sentiment": "good",
"orderHint": 864000,
"secondLine": "10d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 6d 9h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 551616,
"secondLine": "6d 9h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 30m challenge period.",
"executionDelay": 0,
"challengeDelay": 1800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "30m challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -864000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 11d delay on this operation.",
"sentiment": "good",
"orderHint": 950400
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 1mo 4d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 2970816
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 14 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 14,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2y 9mo delay on this operation.",
"sentiment": "good",
"orderHint": 86400000,
"secondLine": "2y 9mo delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656,
"secondLine": "11d 23h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 14 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 14,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400000
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2y 9mo delay on this operation.",
"sentiment": "good",
"orderHint": 86486400
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 14 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 14,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656,
"secondLine": "11d 23h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 14 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 14,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656
}
}
}+7 -2
+7 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 6 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 6,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. NFTs will be minted on L1 to exit.",
"sentiment": "good",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. The sequencer is publishing data to EigenDA v2. Sequencer transaction data roots are not checked against the DACert Verifier onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 3 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 3,
"initialBond": "0.7",
"initialBond": {
"value": "0.7"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 3 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 3,
"initialBond": "0.7",
"initialBond": {
"value": "0.7"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 7d delay on this operation. Proposing new blocks requires creating ZK proofs.",
"sentiment": "good",
"orderHint": 604800
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge.",
"sentiment": "good"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/3 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6666666666666666
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (1R, ZK)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Single round proofs (1R) prove the validity of a state proposal, only requiring a single transaction to resolve. A fault proof eliminates a state proposal by proving that any intermediate state transition in the proposal results in a different state root. For either, a ZK proof is used.",
"sentiment": "good",
"orderHint": null,
"executionDelay": 28800,
"challengeDelay": 64800,
"initialBond": "0.01",
"secondLine": "1d 2h challenge + execution delay"
"initialBond": {
"value": "0.01"
},
"permissioned": false,
"defenderAdvantage": "not-assessed",
"secondLine": "18h challenge period\n+ 8h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -28800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on EigenDA. The sequencer is publishing data to EigenDA v2. Sequencer transaction data roots are not checked against the DACert Verifier onchain.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Avail. Transaction data is checked against the Vector bridge data roots, signed off by Avail validators.",
"sentiment": "warning"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. The Operator actively uses a TransactionFilterer contract, which requires accounts that enqueue or force transactions from L1 OR their targets on L2, to be whitelisted.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+4 -1
+4 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 2/4 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 7d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 604800,
"secondLine": "7d delay"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds. NFTs will be minted on L1 to exit.",
"sentiment": "good",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Celestia. Sequencer tx roots are not checked against the Blobstream bridge data roots onchain, but L2 nodes can verify data availability by running a Celestia light client.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST)",
"description": "STARKs are zero knowledge proofs that ensure state correctness.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "7d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L1 and go through a 8d delay. In case users are censored, the Security Council minority can be alerted to enforce censorship resistance by submitting a new state root. This process is assumed to take 1d, leaving users 7d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Log via L1",
"description": "Users can submit transactions to an L1 map, but can't force them. When users “complain” that their transaction is stuck on L1 and not picked up by the sequencer, the Security Council minority can bypass the sequencer by posting a state root that includes it.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Security Council minority",
"description": "Only the whitelisted proposer can update state roots on L1, so in the event of failure the withdrawals are frozen. The Security Council minority can be alerted to enforce censorship resistance because they are a permissioned Operator.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+24 -6
+24 -6
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 5d 14h challenge period.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"secondLine": "7d 14h challenge + execution delay"
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 6 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 6,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation fully rely on data that is posted on Avail. Transaction data is checked against the Vector bridge data roots, signed off by Avail validators.",
"sentiment": "warning"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "No actor outside of the single Proposer can submit fraud proofs. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 7d challenge period.",
"executionDelay": 0,
"challengeDelay": 604800,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 1,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -345600
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 4d delay on this operation.",
"sentiment": "good",
"orderHint": 345600,
"secondLine": "4d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 1mo 5d of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 3024000,
"secondLine": "1mo 5d delay"
}
}
}+9 -2
+9 -2
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable. Upgrades need to be approved by 2 parties: the Base Coordinator Multisig and the Base Security Council.",
"sentiment": "bad",
"orderHint": 0
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on the base chain, which ultimately gets published on Ethereum.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
},
"stacked": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"challengeDelay": 604800,
"secondLine": "7d challenge period"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -1209600
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 14d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 1209600
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+9 -2
+9 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "good",
"orderHint": null,
"initialBond": "0.08",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.08"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 0.9133003936324697,
"shape": "linear"
},
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 15 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 1h challenge period.",
"executionDelay": 0,
"challengeDelay": 3600,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 15,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 6d 9h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 553416,
"secondLine": "6d 9h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 15 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 1h challenge period.",
"executionDelay": 0,
"challengeDelay": 3600,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 15,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "1h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 6d 9h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 553416
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/2 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.5
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since the Security Council can remove the delay on upgrades.",
"sentiment": "bad",
"orderHint": -1,
"regular": {
"value": "3d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 3d Timelock for non-emergency upgrades, there are no forced transactions and thus no way to exit during operator censorship or downtime.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}+22 -4
+22 -4
{
"host": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve.",
"executionDelay": 172800,
"executionDelayMode": "if-challenged",
"challengeDelay": 549816,
"sentiment": "good",
"orderHint": null,
"initialBond": "3600.0",
"secondLine": "8d 8h challenge + execution delay"
"initialBond": {
"value": "3600.0"
},
"permissioned": false,
"defenderAdvantage": {
"multiplier": 6.486486486486486,
"shape": "linear"
},
"secondLine": "6d 8h challenge period\n+ 2d execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400,
"regular": {
"value": "10d",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades are initiated on L2 and go through a 8d delay on L2 and a 3d delay on L1. Since there is a 1d delay to force a tx (forcing the inclusion in the following state update), users have 10d to exit.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can be a Proposer and propose new roots to the L1 bridge.",
"sentiment": "good",
"orderHint": 0
}
},
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 3/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632,
"secondLine": "12d 17h delay"
}
},
"stacked": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs only allow 2 WHITELISTED actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. The challenge protocol can be subject to delay attacks. There is a 6d 8h challenge period.",
"executionDelay": 0,
"challengeDelay": 549816,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 2,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "6d 8h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 3/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 2d delay on this operation.",
"sentiment": "good",
"orderHint": 172800
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 12d 17h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1099632
}
}
}+6 -1
+6 -1
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow 10 WHITELISTED actors watching the chain to prove that the state is incorrect. There are fewer than 5 Challengers external to the Operator among these. Interactive proofs (INT) require multiple transactions over time to resolve. There is a 5d 14h challenge period.",
"executionDelay": 0,
"challengeDelay": 483840,
"permissioned": true,
"defenderAdvantage": "not-applicable",
"sentiment": "bad",
"orderHint": 10,
"initialBond": "0.1",
"initialBond": {
"value": "0.1"
},
"secondLine": "5d 14h challenge period"
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 1/1 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 1
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -86400
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 1d delay on this operation.",
"sentiment": "good",
"orderHint": 86400,
"secondLine": "1d delay"
},
"proposerFailure": {
"value": "Self propose",
"description": "Anyone can become a Proposer after 11d 23h of inactivity from the currently whitelisted Proposers.",
"sentiment": "good",
"orderHint": 1033656,
"secondLine": "11d 23h delay"
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "None",
"description": "Currently the system permits invalid state roots. More details in project overview.",
"sentiment": "bad",
"orderHint": null,
"executionDelay": 14400,
"permissioned": true,
"secondLine": "4h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. The L2 code has been modified to allow the sequencer to explicitly censor selected L1->L2 transactions.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Use escape hatch",
"sentiment": "warning",
"orderHint": null,
"description": "Users are able to trustlessly exit by submitting a Merkle proof of funds after 1mo with no new state proposals have passed. The escape of ETH and ERC-20 balances is permissionless while the escape of DeFi contract balances is trusted."
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External (DAC)",
"description": "Proof construction relies fully on data that is NOT published onchain. There exists a Data Availability Committee (DAC) with a threshold of 3/5 that is tasked with protecting and supplying the data.",
"sentiment": "bad",
"orderHint": 0.6
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -1296000,
"regular": {
"value": "1d",
"sentiment": "warning"
},
"warning": {
"value": "Even though there is a 1d Timelock for non-emergency upgrades, forced transactions are disabled. Even if they were to be enabled, user withdrawals can be censored up to 15d.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Although the functionality exists in the code, it is currently disabled.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Self propose",
"description": "If the Proposer fails, users can leverage the source available prover to submit proofs to the L1 bridge. There is a 5d delay for proving and a 5d delay for finalizing state proven in this way. These delays can only be lowered except during the emergency state.",
"sentiment": "good"
}
}
}+7 -2
+7 -2
{
"host": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1. Unlike most ZK rollups, transaction data is posted instead of state diffs.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring. Eventually (after 6 months of no finalized blocks) the Operator role becomes public, theoretically allowing anyone to post data.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. Eventually (after 6 months of no finalized blocks) the Operator role becomes public, theoretically allowing anyone to propose state with valid proofs.",
"sentiment": "bad",
"orderHint": null
}
},
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is NOT published onchain.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "Enqueue via L2",
"description": "Users can submit transactions to an L2 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
},
"stacked": {
"stateValidation": {
"value": "Validity proofs",
"description": "Zero knowledge cryptography is used to ensure state correctness. Proofs are first verified on Linea and finally on Ethereum.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "External",
"description": "Proof construction and state derivation rely fully on data that is ultimately NOT published on Ethereum.",
"sentiment": "bad"
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0
},
"sequencerFailure": {
"value": "No mechanism",
"description": "There is no mechanism to have transactions be included if the sequencer is down or censoring.",
"sentiment": "bad"
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "5d",
"description": "Users have 5d to exit funds in case of an unwanted upgrade. There is a 8d delay before a upgrade is applied, and withdrawals can take up to 3d to be processed.",
"sentiment": "bad",
"orderHint": 432000
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 3d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 259200
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "Unknown",
"description": "Some contracts are not verified, so there is no way to assess the exit window.",
"sentiment": "bad",
"orderHint": null
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for , users can use the exit hatch to withdraw their funds.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+2 -1
+2 -1
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null
"orderHint": null,
"permissioned": true
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "Unknown",
"description": "Some contracts are not verified, so there is no way to assess the exit window.",
"sentiment": "bad",
"orderHint": null
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for , users can use the exit hatch to withdraw their funds.",
"sentiment": "good"
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (SN)",
"description": "SNARKs are succinct zero knowledge proofs that ensure state correctness, but require trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 0,
"secondLine": "No execution delay"
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": -1209600,
"regular": {
"value": "7d",
"sentiment": "warning"
},
"warning": {
"value": "Users have 7d to exit funds in case of an unwanted non-emergency upgrade. There is a 21d delay before a non-emergency upgrade is applied, and withdrawals can take up to 14d to be processed.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Force via L1",
"description": "Users can force the sequencer to include a transaction by submitting a request through L1. If the sequencer censors or is down for for more than 14d, users can use the exit hatch to withdraw their funds.",
"sentiment": "good",
"orderHint": 1209600
},
"proposerFailure": {
"value": "Use escape hatch",
"description": "Users are able to trustlessly exit by submitting a zero knowledge proof of funds.",
"sentiment": "good",
"orderHint": null
}
}
}+1 -0
+1 -0
{
"self": {
"stateValidation": {
"value": "Validity proofs (ST, SN)",
"description": "STARKs and SNARKs are zero knowledge proofs that ensure state correctness. STARKs proofs are wrapped in SNARKs proofs for efficiency. SNARKs require a trusted setup.",
"sentiment": "good",
"orderHint": null,
"permissioned": true,
"executionDelay": 10800,
"secondLine": "3h execution delay"
},
"dataAvailability": {
"value": "Onchain (SD)",
"description": "All of the data (SD = state diffs) needed for proof construction is published onchain.",
"sentiment": "good",
"orderHint": null
},
"exitWindow": {
"value": "None",
"description": "There is no window for users to exit in case of an unwanted upgrade since contracts are instantly upgradable.",
"sentiment": "bad",
"orderHint": 0,
"regular": {
"value": "4d 3h",
"sentiment": "warning"
},
"warning": {
"value": "Non-emergency upgrades go through a 4d 3h delay, but the central operator can still censor withdrawal transactions by implementing a TransactionFilterer with no delay.",
"sentiment": "warning"
}
},
"sequencerFailure": {
"value": "Enqueue via L1",
"description": "Users can submit transactions to an L1 queue, but can't force them. The sequencers cannot selectively skip transactions but can stop processing the queue entirely. In other words, if the sequencers censor or are down, they are so for everyone.",
"sentiment": "warning"
},
"proposerFailure": {
"value": "Replace proposer",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen. There is a decentralized Governance system that can attempt changing Proposers with an upgrade.",
"sentiment": "warning",
"orderHint": null
}
}
}+6 -2
+6 -2
{
"self": {
"stateValidation": {
"value": "Fraud proofs (INT)",
"description": "Fraud proofs allow actors watching the chain to prove that the state is incorrect. Interactive proofs (INT) require multiple transactions over time to resolve. Only one entity is currently allowed to propose and submit challenges, as only permissioned games are currently allowed.",
"executionDelay": 302400,
"challengeDelay": 302400,
"sentiment": "bad",
"orderHint": null,
"initialBond": "0.0",
"secondLine": "7d challenge + execution delay"
"initialBond": {
"value": "0.0"
},
"permissioned": true,
"defenderAdvantage": "not-applicable",
"secondLine": "3d 12h challenge period\n+ 3d 12h execution delay"
},
"exitWindow": {
"value": "None",
"description": "There is no exit window for users to exit in case of unwanted upgrades as they are initiated by the Security Council with instant upgrade power and without proper notice.",
"sentiment": "bad",
"orderHint": -604800
},
"proposerFailure": {
"value": "Cannot withdraw",
"description": "Only the whitelisted proposers can publish state roots on L1, so in the event of failure the withdrawals are frozen.",
"sentiment": "bad",
"orderHint": null
},
"dataAvailability": {
"value": "Onchain",
"description": "All of the data needed for proof construction is published on Ethereum L1.",
"sentiment": "good",
"orderHint": null
},
"sequencerFailure": {
"value": "Self sequence",
"description": "In the event of a sequencer failure, users can force transactions to be included in the project's chain by sending them to L1. There can be up to a 12h delay on this operation.",
"sentiment": "good",
"orderHint": 43200,
"secondLine": "12h delay"
}
}
}