Block #2,131,408

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 2:18:06 AM · Difficulty 10.9101 · 4,708,374 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fba470b2586e6913ea37bb6269f5244bc7608dbe43d087e50275ea035a10b0f8

Height

#2,131,408

Difficulty

10.910097

Transactions

5

Size

1.08 KB

Version

2

Bits

0ae8fc1f

Nonce

77,933,317

Timestamp

5/25/2017, 2:18:06 AM

Confirmations

4,708,374

Merkle Root

4770282398b20bc08e6e3f77abda082e8f70a4544b1277fb4a9d9a28a4b0fd10
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.

3.132 × 10⁹⁵(96-digit number)
31329888566467958375…30439036541657200641
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
3.132 × 10⁹⁵(96-digit number)
31329888566467958375…30439036541657200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.265 × 10⁹⁵(96-digit number)
62659777132935916750…60878073083314401281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.253 × 10⁹⁶(97-digit number)
12531955426587183350…21756146166628802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.506 × 10⁹⁶(97-digit number)
25063910853174366700…43512292333257605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.012 × 10⁹⁶(97-digit number)
50127821706348733400…87024584666515210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10025564341269746680…74049169333030420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.005 × 10⁹⁷(98-digit number)
20051128682539493360…48098338666060840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.010 × 10⁹⁷(98-digit number)
40102257365078986720…96196677332121681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.020 × 10⁹⁷(98-digit number)
80204514730157973440…92393354664243363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.604 × 10⁹⁸(99-digit number)
16040902946031594688…84786709328486727681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,962,546 XPM·at block #6,839,781 · 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