# Impact Analysis of Neutering `SELFDESTRUCT` - Dev Update #2 This is the second update for my [CDAP Project](https://github.com/ethereum-cdap/cohort-zero/blob/main/development-updates.md#albus), which is about analyzing the existing uses of the `SELFDESTRUCT` opcode in Ethereum. ## Progress since last update Since the last [update](https://hackmd.io/@albus/HJ6EBiTn_), I have focused on analyzing existing uses of *redeployed contracts*, which is a contract that is deployed at the same address as a selfdestructed contract. Since redeploying a contract will no longer be possible if `SELFDESTRUCT` is neutered, this is an interesting use case to analyze. The analysis revealed that disabling or neutering `SELFDESTRUCT` opens a security risk to uninformed users of a [contract](https://etherscan.io/address/0xD412054ccA18A61278ceD6F674A526A6940eBd84) used by [Pine Finance](https://pine.finance/). In short, users of this contract send tokens to an predetermined address called a vault. Relayers then trigger a function in the PineCore contract to create a new contract at this predetermined address using `CREATE2`, which executes a trade and then self destructs. Under the current behaviour, it is possible for a user to use the same vault several times. If `SELFDESTRUCT` is neutered, however, this would no longer be possible. In fact, if a user then tried to send tokens to a used vault, anyone could steal the tokens in the vault. The full analysis is hosted [here](https://nbviewer.jupyter.org/github/adompeldorius/selfdestruct-analysis/blob/main/analysis.ipynb). ## What to do next Based on the analysis, I will suggest trying to preserve `SELFDESTRUCT` when switching to Verkle trees. There are several ways this may be done, so I will write down the different options as diffs to the current [Verkle tree proposal](https://notes.ethereum.org/@vbuterin/verkle_tree_eip) and evaluate them.
Last changed by  
 
Albus Dompeldorius
412

Read more

Albus Dompeldorius CDAP - Dev Update #7

This is the seventh update for my work in the CDAP. What I have done since last update I have been working on Springrollup. First, I managed to implement two circuits. One for adding pending transactions, and one for processing pending transactions. Then I realized that the rollup could be simplified a lot; instead of having pending transactions, we could simply require that the operator sends witnesses to all senders in a rollup block, who then confirm their transactions, before the operator publishes the block. Only transactions whose senders have confirmed, are processed. With this new mechanism, there is no longer any need for maintaining pending transactions. Another challange I faced was that I learned that circuits are very strict about the sizes of their inputs. This means that for instance the number of transactions in a block must be hard-coded in the circuit. One solution to allow dynamically adjusted block sizes is to create several circuits for different sizes and allowing the operator to pick one circuit each time they want to publish a block. However, this challenge is even more difficult in our case, since not only is the number of transactions variable, but also the number of senders. One solution for this is to have two circuits that are processed after one another. The first circuit processes all balance updates, and the second circuit processes all senders (checks their signature, and checks that their account index is part of the calldata). The first circuit could compute a hash of all senders (along with the new state root), which is fed as an input to the second circuit. What I will do next

11/9/2021
Albus Dompeldorius CDAP - Dev Update #6

This is the sixth update for my work in the CDAP. What I have done since last update Springrollup specification Since my last update, I have finally figured out how to do deposits/withdrawals in my zk-rollup (called Springrollup), and I have posted the first description of it on ethresear.ch. I realized that because of the differences between my design and regular zk-rollups, deposits and withdrawals were more complicated in comparison with a regular zk-rollups, but I found a way to do it. I figured out that it was much easier to do withdrawals and deposits if we represented each rollup account's balance as a sum of two balances: one balance which keeps track of the amount deposited on L1 to the account minus the amount withdrawn on L1 from the account, and another balance which keeps track of the amount received to the account minus the amount sent by L2 transfers from the account.

10/26/2021
Springrollup: A zk-rollup that allows a sender to batch an unlimited number of transfers with only 6 bytes of calldata per batch

(The newest version of this document can always be found on hackmd or GitHub) We introduce Springrollup: a Layer 2 solution which has the same security assumptions as existing zk-rollups, but uses much less on-chain data. In this rollup, a sender can batch an arbitrary number of transfers to other accounts while only having to post their address as calldata, which is 6 bytes if we want to support up to 2^48 ~ 300 trillion accounts. As a by-product we also achieve increased privacy, since less user data is posted on-chain. General framework We start by introducing the general framework that we will use to describe the rollup. The rollup state is divided in two parts: On-chain available state: State with on-chain data availability. All changes to this state must be provided as calldata by the operator.

10/20/2021
Albus Dompeldorius CDAP - Dev Update #5

This is the fifth update for my work in the CDAP. What I have done since last update Since my last update, I have been working on my zk-rollup concept, which allows for greatly reduced calldata usage while still preserving the same security of zk-rollups. The document is now expanded with more details about deposits, withdrawals, calldata estimates and examples. Anyone familiar with how zk-rollups work should now hopefully be able to grasp the main idea in my proposal. The reason I haven't posted to ethresear.ch yet, is that I want to implement an optimization first. (see below) What I will do next I am currently working on an optimization which would allow even less calldata usage. The current proposal uses 8 bytes of calldata for a batch of up to 65536 transfers from the same sender, but with the extra optimization this will be reduced to 6 bytes for a batch of an unlimited amount of transfers from the same sender. Once this is done, I will post the proposal on ethresear.ch to get some feedback on the proposal. I will reach out to zk-people to try to collaborate on an implementation.

10/12/2021
Read more from Albus Dompeldorius
Published on HackMD