Block #3,505,594

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 6:10:20 PM · Difficulty 10.9302 · 3,311,010 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60fda563ed9a66d8362b29e569d56376ea41bf79d16ed28b409d9a93b195c477

Height

#3,505,594

Difficulty

10.930206

Transactions

24

Size

78.32 KB

Version

2

Bits

0aee21f8

Nonce

46,429,734

Timestamp

1/8/2020, 6:10:20 PM

Confirmations

3,311,010

Merkle Root

5a375c3ee0104eceea3bf0762a7eb598d43383afb21f4dabf56e3650afa52040
Transactions (24)
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.

9.437 × 10⁹⁵(96-digit number)
94379152050121932148…39964966060073172481
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
9.437 × 10⁹⁵(96-digit number)
94379152050121932148…39964966060073172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.887 × 10⁹⁶(97-digit number)
18875830410024386429…79929932120146344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.775 × 10⁹⁶(97-digit number)
37751660820048772859…59859864240292689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.550 × 10⁹⁶(97-digit number)
75503321640097545718…19719728480585379841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.510 × 10⁹⁷(98-digit number)
15100664328019509143…39439456961170759681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.020 × 10⁹⁷(98-digit number)
30201328656039018287…78878913922341519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.040 × 10⁹⁷(98-digit number)
60402657312078036574…57757827844683038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.208 × 10⁹⁸(99-digit number)
12080531462415607314…15515655689366077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.416 × 10⁹⁸(99-digit number)
24161062924831214629…31031311378732154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.832 × 10⁹⁸(99-digit number)
48322125849662429259…62062622757464309761
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,776,958 XPM·at block #6,816,603 · 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