Block #3,429,374

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/12/2019, 12:44:40 AM · Difficulty 10.9805 · 3,413,715 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e53a0fa063c90dccb3847fb4207cca08e32c0e70dd8b0385663a5f77bc1deb2

Height

#3,429,374

Difficulty

10.980514

Transactions

2

Size

1.57 KB

Version

2

Bits

0afb02f9

Nonce

919,538,443

Timestamp

11/12/2019, 12:44:40 AM

Confirmations

3,413,715

Merkle Root

5e01441adc25bdd81811e41e84eaa29a2a49e92272e89b5319b9c1d9e6232e52
Transactions (2)
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.

1.781 × 10⁹³(94-digit number)
17815835666304455713…36865517586792657921
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
1.781 × 10⁹³(94-digit number)
17815835666304455713…36865517586792657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.563 × 10⁹³(94-digit number)
35631671332608911427…73731035173585315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.126 × 10⁹³(94-digit number)
71263342665217822855…47462070347170631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.425 × 10⁹⁴(95-digit number)
14252668533043564571…94924140694341263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.850 × 10⁹⁴(95-digit number)
28505337066087129142…89848281388682526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.701 × 10⁹⁴(95-digit number)
57010674132174258284…79696562777365053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.140 × 10⁹⁵(96-digit number)
11402134826434851656…59393125554730106881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.280 × 10⁹⁵(96-digit number)
22804269652869703313…18786251109460213761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.560 × 10⁹⁵(96-digit number)
45608539305739406627…37572502218920427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.121 × 10⁹⁵(96-digit number)
91217078611478813255…75145004437840855041
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,989,074 XPM·at block #6,843,088 · 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