Block #2,153,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/9/2017, 5:22:42 PM · Difficulty 10.9031 · 4,673,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e062c92fa50b541c01a0d0abe3419c7aad19087ef6da0832c07c26f38e6345d8

Height

#2,153,502

Difficulty

10.903076

Transactions

4

Size

2.67 KB

Version

2

Bits

0ae73005

Nonce

412,594,267

Timestamp

6/9/2017, 5:22:42 PM

Confirmations

4,673,420

Merkle Root

15fd60ed52cb8470e9b3306ab7f7c787a6e94fe54bf1d69764b1dfc3527af336
Transactions (4)
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.572 × 10⁹⁴(95-digit number)
25724672111296648956…22879489094219158081
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.572 × 10⁹⁴(95-digit number)
25724672111296648956…22879489094219158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.144 × 10⁹⁴(95-digit number)
51449344222593297912…45758978188438316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.028 × 10⁹⁵(96-digit number)
10289868844518659582…91517956376876632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.057 × 10⁹⁵(96-digit number)
20579737689037319165…83035912753753264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.115 × 10⁹⁵(96-digit number)
41159475378074638330…66071825507506529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.231 × 10⁹⁵(96-digit number)
82318950756149276660…32143651015013058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.646 × 10⁹⁶(97-digit number)
16463790151229855332…64287302030026117121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.292 × 10⁹⁶(97-digit number)
32927580302459710664…28574604060052234241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.585 × 10⁹⁶(97-digit number)
65855160604919421328…57149208120104468481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.317 × 10⁹⁷(98-digit number)
13171032120983884265…14298416240208936961
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,859,547 XPM·at block #6,826,921 · 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