And since I understood if I add a key
-r 10 the algorithm begins to generate keys in a random 10Mkey/s and check with a list of existing addresses.
it turns into a game who is more successful in this version of the universe

VanitySearch.exe -t 0 -gpu -gpuId 0 -g 24,128 -r 10 -i btc.txt -o output.txt
I think this is better than generating one key and searching nearby in a small range of matches.
my benchmark on GPU
GeForce GT 1030C:\Users\adaris\Desktop\btc\VanitySearch>VanitySearch.exe -check
GetBase10() Results OK
Add() Results OK : 427.350 MegaAdd/sec
Mult() Results OK : 31.716 MegaMult/sec
Div() Results OK : 4.322 MegaDiv/sec
R1=1000003D1
R2=1000007A2000E90A1
Field characteristic size: 256bits
ModInv()/ModExp() Results OK
ModInv() Edge cases Results OK
.Avg = 6.13
ModInv() Results OK : 445.968 KiloInv/sec
ModInv() cycles : 6503.24
ModSqrt() Results OK !
IntGroup.ModInv() Results OK : 5.641 MegaInv/sec
ModMulK1() Results OK : 27.392 MegaMult/sec
ModSquareK1() Results OK : 31.616 MegaSqr/sec
ModInv() Cost : 141.8 S
ModMulK1order() Results OK : 3.785 MegaMult/sec
Check Generator :OK
Check Double :OK
Check Add :OK
Check GenKey :OK
Adress : 15t3Nt1zyMETkHbjJTTshxLnqPzQvAtdCe OK!
Adress : 1BoatSLRHtKNngkdXEeobR76b53LETtpyT OK!
Adress : 1Test6BNjSJC5qwYXsjwKVLvz7DpfLehy OK!
Adress : 16S5PAsGZ8VFM1CRGGLqm37XHrp46f6CTn OK!
Adress : 1Tst2RwMxZn9cYY5mQhCdJic3JJrK7Fq7 OK!
Adress : 3CyQYcByvcWK8BkYJabBS82yDLNWt6rWSx OK!
Adress : 31to1KQe67YjoDfYnwFJThsGeQcFhVDM5Q OK!
Adress : bc1q6tqytpg06uhmtnhn9s4f35gkt8yya5a24dptmn OK!
Check Calc PubKey (full) 1ViViGLEawN27xRzGrEhhYPQrZiTKvKLo :OK
Check Calc PubKey (even) 385cR5DM96n1HvBDMzLHPYcw89fZAXULJP:OK
Check Calc PubKey (odd) 18aPiLmTow7Xgu96msrDYvSSWweCvB9oBA:OK
GPU: GPU #0 GeForce GT 1030 (3x128 cores) Grid(24x128)
Seed: 1613577059
61.751 MegaKey/sec
ComputeKeys() found 611 items , CPU check...
GPU/CPU check OK