Block #2,786,862

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/9/2018, 9:04:10 PM · Difficulty 11.6731 · 4,053,221 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
509500925a2858f67a2d05678a0a14291f5a91bb8cce75d9006b81842f25ed8a

Height

#2,786,862

Difficulty

11.673100

Transactions

7

Size

3.15 KB

Version

2

Bits

0bac504d

Nonce

428,149,550

Timestamp

8/9/2018, 9:04:10 PM

Confirmations

4,053,221

Merkle Root

4336753a9184728c6f17634923d4069c086b5ce6188b90460741533fb771ef0d
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

6.236 × 10⁹⁵(96-digit number)
62367192681503156470…97388371644385779199
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
6.236 × 10⁹⁵(96-digit number)
62367192681503156470…97388371644385779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.247 × 10⁹⁶(97-digit number)
12473438536300631294…94776743288771558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.494 × 10⁹⁶(97-digit number)
24946877072601262588…89553486577543116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.989 × 10⁹⁶(97-digit number)
49893754145202525176…79106973155086233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.978 × 10⁹⁶(97-digit number)
99787508290405050353…58213946310172467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.995 × 10⁹⁷(98-digit number)
19957501658081010070…16427892620344934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.991 × 10⁹⁷(98-digit number)
39915003316162020141…32855785240689868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.983 × 10⁹⁷(98-digit number)
79830006632324040282…65711570481379737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.596 × 10⁹⁸(99-digit number)
15966001326464808056…31423140962759475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.193 × 10⁹⁸(99-digit number)
31932002652929616113…62846281925518950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.386 × 10⁹⁸(99-digit number)
63864005305859232226…25692563851037900799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,964,972 XPM·at block #6,840,082 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy