Quote from: Kostelooscoin on February 10, 2021, 04:48:02 PM

Collision: 60 bits
Priv (WIF): p2pkh:L3K5y3LyKXUCmSmpptJrAG5w6o9r6YbfBQyWATV5gyhQ5dwq8moB
Priv (WIF): p2pkh:L3K5y3LyKXUCmSmpptJrAG5w6o9r6YbfBQxC9tihuggxfWGSwDY6
Add1: 12DgBEott9LiyPWspyZfY7K2EWv79498u2
Add2: 12DgBEott9LpupgZkw1fKKKK8pYPMoPatY6

Quote from: NotATether on February 10, 2021, 06:40:16 PM

The distinguished point (DP) method is an efficient method for storing random walks and detect collision between them.
[...]
A distinguished point = a collision = a solution.
[...]
This is why discussion about the number of DPs is frequent here because the number of DPs tells how many collisions/solutions there are.

I see no collision on those examples.
Partly matched string != collission IMHO