Ara Adkins

# Description The interpreter uses constant folding liberally for correctness and accuracy during its operation. When trees are complex, this constant folding operation can take quite some time and result...

# Description As node construction is one of the most common operations in the virtual machine, it is important that it be as cheap as possible. Currently this is quite...

# Describe the Bug While I do not think it can ever be conclusively eliminated, there are some fairly recognizable cases in which we infer the tail of a packed...

# Description Currently we cannot discover fixed-length arrays, we should be able to. # Spec - [ ] Work out how to iterate constant loops a constant amount of times...

# Description Currently we do not have the ability to discover large structs (> 1 word in size) used as the element type in a dynamic array. We should. #...

# Description Where a whole multiple of a type can fit into a single storage slots, dynamic arrays pack these. We should be able to discover this. # Spec -...

# Description Currently the storage layout analysis only includes gas costs based on the current hard fork. We want to be able to analyse contracts compiled for other hard forks,...

# Description Some EVM-based chains other than ethereum itself feature additional opcodes and precompiles that should be supported by this tool. This task deals with adding support for that. #...

# Description While we currently have a basic watchdog mechanism allowing the analysis to be terminated in major loops, the nature of that mechanism is fundamentally limited. With any bug...

# Description Currently the analyzer generates the keccak hashes of the first 1000 storage slots in order to help with slot identification. According to @thevaizman, some contracts have quite large...