Block #3,504,382

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2020, 8:56:52 PM · Difficulty 10.9310 · 3,337,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a43cdca52e7e50e1774d1b99e06a22c1d8b4427835872a1ddce5496b5067c0f

Height

#3,504,382

Difficulty

10.930986

Transactions

20

Size

76.99 KB

Version

2

Bits

0aee5519

Nonce

1,149,218,302

Timestamp

1/7/2020, 8:56:52 PM

Confirmations

3,337,107

Merkle Root

a8d07054cb209b3f5dd9d5a722063e4bfe5291022024443a88097851eaa7270a
Transactions (20)
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.176 × 10⁹⁵(96-digit number)
11765797286276933005…28038373042082713601
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.176 × 10⁹⁵(96-digit number)
11765797286276933005…28038373042082713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.353 × 10⁹⁵(96-digit number)
23531594572553866011…56076746084165427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.706 × 10⁹⁵(96-digit number)
47063189145107732022…12153492168330854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.412 × 10⁹⁵(96-digit number)
94126378290215464044…24306984336661708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.882 × 10⁹⁶(97-digit number)
18825275658043092808…48613968673323417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.765 × 10⁹⁶(97-digit number)
37650551316086185617…97227937346646835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.530 × 10⁹⁶(97-digit number)
75301102632172371235…94455874693293670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.506 × 10⁹⁷(98-digit number)
15060220526434474247…88911749386587340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.012 × 10⁹⁷(98-digit number)
30120441052868948494…77823498773174681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.024 × 10⁹⁷(98-digit number)
60240882105737896988…55646997546349363201
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,976,288 XPM·at block #6,841,488 · 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