[CODE]4084 4085 mart_r completed no 1248 4084719360923671711
[/CODE](125 kgaps, using mingap=1110)
If the given number wouldn't have been prime, this would've been a gap of 1410 with a merit of 32.9. Oh well, wouldn't have been a first occurence anyway.

--> Reserving 4083-4084.

if I am not mistaken range 4000-4099 is 90% complete. I'm sure Robert will correct me if i'm wrong.

[B]Reserved and not completed [/B]

4058 4071 4072 4076 4077 4078 4079.

[B]NOT YET RESERVED[/B]

4080 4081 4082

When these are completed 3 (at least) of LLN records will change from "First Known Occurrence" C?C to "First Occurrence" CFC

Completed 4247-4254e15 no new records
[CODE]4247-4248e15 112 kgaps, largest 1202 @ 4247784753700833959
4248-4249e15 93 kgaps, largest 1216 @ 4248846271434283567
4249-4250e15 120 kgaps, largest 1178 @ 4249275472371528089
4250-4251e15 110 kgaps, largest 1240 @ 4250414410870158841
4251-4252e15 115 kgaps, largest 1200 @ 4251337919737544803
4252-4253e15 99 kgaps, largest 1220 @ 4252743030295287839
4253-4254e15 109 kgaps, largest 1440 @ 4253027105513399527[/CODE]Reserving 4260-4270e15

4100-4200e15 completely done. :smile:
Here are the results of the final 4 blocks:
[CODE]4196-4197e15 91 kgaps, largest 1194 @ 4196984610243549073
4197-4198e15 90 kgaps, largest 1224 @ 4197007075420580873
4198-4199e15 89 kgaps, largest 1284 @ 4198807155367628303
4199-4200e15 91 kgaps, largest 1164 @ 4199307726979273439
[/CODE]

Reserving 4410-4430e15.

[QUOTE=Antonio;461123]Completed 4247-4254e15 no new records
[CODE]
4253-4254e15 109 kgaps, largest 1440 @ 4253027105513399527[/CODE][/QUOTE]

Updated post #3 just now. To note the largest gap found by this search effort to date - albeit only a confirmation of a Leonhardy find.

Some up-to-date stats as we pass the 35% mark

[CODE]
Searcher compl. resd.

Thomas11 104 26
danaj 102 99
antonio 65 16
robert44444uk 57 26
pinhodecarlos 25 40
ET_ 4 1
mart_r 1 1
henryzz 1 9

Total 359 218


[/CODE]

Can someone attach some Linux binaries please hence I'm trying to bring more CPU power to the search. Thank you in advance.

Please hold 4800-4900.

[CODE]4083 4084 mart_r completed no 1182 4083971344409518049
[/CODE]Reserving 4082-4083

[QUOTE=pinhodecarlos;461164]Can someone attach some Linux binaries please hence I'm trying to bring more CPU power to the search. Thank you in advance.[/QUOTE]

Although I suggest to build your own binaries specific for your system environment, here are some Linux builds for Nehalem, Sandybridge, Ivybridge, Haswell, Broadwell and Opteron cpus.

The build options for the latter two were as follows:
[CODE]
gcc -m64 -static -fopenmp -O2 -frename-registers -fomit-frame-pointer -flto -msse3 -mtune=k8-sse3 -march=k8-sse3 -o gap5_f_opteron_static gap5_f.c -lm
gcc -flto -m64 -static -fopenmp -O2 -frename-registers -fomit-frame-pointer -mavx2 -mtune=broadwell -march=broadwell -o gap5_f_broadwell_static gap5_f.c -lm
[/CODE]

If the dynamic builds (the smaller files) don't work, try the static builds.

BTW.: I had a look into the intermediate assembler code as generated by the gcc compiler. It seems that apart from the bit scanning operations (ffs, clz), there is no real benefit from the additional capabilities of the newer cpus. Actually the AVX registers are only used once for the translation of the floating point input arguments (n1, n2) into integers.
So, perhaps, we could restrict ourselves to just one or two build targets, e.g. a generic one (Nehalem) and one for Haswell, which has the bit scanning operations.
At least we could skip the Ivybridge build, since it is (from the assembly side) identical to the Sandybridge.

[QUOTE=Thomas11;461193]
So, perhaps, we could restrict ourselves to just one or two build targets, e.g. a generic one (Nehalem) and one for Haswell, which has the bit scanning operations.
[/QUOTE]

Well, actually the missing [B]lzcnt[/B] (leading zeros count) in older cpus is efficiently replaced by the compiler by a [B]bsr[/B] (bit scanning right) operation:

Broadwell:
[CODE]
precpower2:
.LFB74:
.cfi_startproc
movl $63, %eax
lzcntq %rdi, %rdi
subl %edi, %eax
cltq
movq Bits(,%rax,8), %rax
ret
.cfi_endproc
[/CODE]

Nehalem:
[CODE]
precpower2:
.LFB74:
.cfi_startproc
bsrq %rdi, %rdi
movl $63, %eax
xorq $63, %rdi
subl %edi, %eax
cltq
movq Bits(,%rax,8), %rax
ret
.cfi_endproc
[/CODE]

So, essentially, it's just the cost of an additional [B]xor[/B] operation.