Block #3,432,632

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/14/2019, 9:36:17 AM · Difficulty 10.9800 · 3,392,785 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ed063d62e6998cc84e0ba950690bbbd90e0379fc1e4ce3a6ffad08592db776f

Height

#3,432,632

Difficulty

10.980009

Transactions

18

Size

5.68 KB

Version

2

Bits

0afae1e7

Nonce

79,193,329

Timestamp

11/14/2019, 9:36:17 AM

Confirmations

3,392,785

Merkle Root

a227895a68f3364313dc69393fdce1306a72da3c9e3509d8a4f3f1b8618738c6
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.

4.146 × 10⁹⁶(97-digit number)
41462399177166622402…55981843547050943679
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
4.146 × 10⁹⁶(97-digit number)
41462399177166622402…55981843547050943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.292 × 10⁹⁶(97-digit number)
82924798354333244804…11963687094101887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.658 × 10⁹⁷(98-digit number)
16584959670866648960…23927374188203774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.316 × 10⁹⁷(98-digit number)
33169919341733297921…47854748376407549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.633 × 10⁹⁷(98-digit number)
66339838683466595843…95709496752815098879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.326 × 10⁹⁸(99-digit number)
13267967736693319168…91418993505630197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.653 × 10⁹⁸(99-digit number)
26535935473386638337…82837987011260395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.307 × 10⁹⁸(99-digit number)
53071870946773276674…65675974022520791039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.061 × 10⁹⁹(100-digit number)
10614374189354655334…31351948045041582079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.122 × 10⁹⁹(100-digit number)
21228748378709310669…62703896090083164159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.245 × 10⁹⁹(100-digit number)
42457496757418621339…25407792180166328319
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,847,437 XPM·at block #6,825,416 · 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