Block #4,014,515

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2020, 5:11:42 AM · Difficulty 10.8545 · 2,801,668 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
829a2ce6479592a95c24901df3356b39a02be3fb54aa354e7e2b568e97024002

Height

#4,014,515

Difficulty

10.854467

Transactions

3

Size

2.99 KB

Version

2

Bits

0adabe5a

Nonce

91,075,612

Timestamp

12/30/2020, 5:11:42 AM

Confirmations

2,801,668

Merkle Root

293236b530d03f79d4f9b9b1658dda746b9de348fc5df89e62c95f59777880b0
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.

1.075 × 10⁹⁶(97-digit number)
10755652630591088212…00651343768818215681
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.075 × 10⁹⁶(97-digit number)
10755652630591088212…00651343768818215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.151 × 10⁹⁶(97-digit number)
21511305261182176425…01302687537636431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.302 × 10⁹⁶(97-digit number)
43022610522364352850…02605375075272862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.604 × 10⁹⁶(97-digit number)
86045221044728705700…05210750150545725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.720 × 10⁹⁷(98-digit number)
17209044208945741140…10421500301091450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.441 × 10⁹⁷(98-digit number)
34418088417891482280…20843000602182901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.883 × 10⁹⁷(98-digit number)
68836176835782964560…41686001204365803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.376 × 10⁹⁸(99-digit number)
13767235367156592912…83372002408731607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.753 × 10⁹⁸(99-digit number)
27534470734313185824…66744004817463214081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.506 × 10⁹⁸(99-digit number)
55068941468626371648…33488009634926428161
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,773,590 XPM·at block #6,816,182 · 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