Our current heuristic supports public functions with 3 or 4 byte sighashes. However, there are cases of optimized code with "mined" sighashes that are smaller than 3 bytes. In order to support this with generality we'd probably need some limited global analysis.
Example
Our current heuristic supports public functions with 3 or 4 byte sighashes. However, there are cases of optimized code with "mined" sighashes that are smaller than 3 bytes. In order to support this with generality we'd probably need some limited global analysis. Example