Scyther with my modifications
6cd8007ab0
Given that sk/pk/k are now hardcoded, we can exploit their occurrences with this new heuristic. The heuristic can now scan for the lowest term depth at which either sk or k occur. This will cause the heuristic to favor looking for sk, then sk(x), and only later other terms. In a small test this was twice as fast. For protocols based on pk only the performance loss should be negligible. The old heuristic was 162, now it is 162+512 = 674. |
||
|---|---|---|
| design | ||
| dist | ||
| gui | ||
| protocols | ||
| scripts | ||
| src | ||