Block #3,663,402

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2020, 10:53:51 AM · Difficulty 10.8797 · 3,181,949 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2689954a24b5155acfaaa0d3797a3f14a8937364174d9b7ec6c64198c1662a42

Height

#3,663,402

Difficulty

10.879742

Transactions

3

Size

1.50 KB

Version

2

Bits

0ae136c0

Nonce

471,937,516

Timestamp

4/29/2020, 10:53:51 AM

Confirmations

3,181,949

Merkle Root

b384ba1cb533108aa5600eef8ad2b1c7354e9dc6e0ef848ed603d37724ccb5fa
Transactions (3)
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.

2.407 × 10⁹²(93-digit number)
24071768496272623786…33120219135427810641
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
2.407 × 10⁹²(93-digit number)
24071768496272623786…33120219135427810641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.814 × 10⁹²(93-digit number)
48143536992545247573…66240438270855621281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.628 × 10⁹²(93-digit number)
96287073985090495146…32480876541711242561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.925 × 10⁹³(94-digit number)
19257414797018099029…64961753083422485121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.851 × 10⁹³(94-digit number)
38514829594036198058…29923506166844970241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.702 × 10⁹³(94-digit number)
77029659188072396117…59847012333689940481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.540 × 10⁹⁴(95-digit number)
15405931837614479223…19694024667379880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.081 × 10⁹⁴(95-digit number)
30811863675228958447…39388049334759761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.162 × 10⁹⁴(95-digit number)
61623727350457916894…78776098669519523841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.232 × 10⁹⁵(96-digit number)
12324745470091583378…57552197339039047681
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:58,007,251 XPM·at block #6,845,350 · 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