Block #461,572

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2014, 8:00:53 PM · Difficulty 10.4142 · 6,371,794 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e552d1488bf5cf218d661f487d4233ba4216fa946e791e9d8e2565fbccba9249

Height

#461,572

Difficulty

10.414223

Transactions

2

Size

884 B

Version

2

Bits

0a6a0a82

Nonce

160,010

Timestamp

3/26/2014, 8:00:53 PM

Confirmations

6,371,794

Merkle Root

35cb3ab8aad15956b71279d5e3b52e2fd9df1a7c68f2f336adbe91b019437bca
Transactions (2)
1 in → 1 out9.2200 XPM109 B
5 in → 1 out29.0000 XPM684 B
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.286 × 10⁹⁷(98-digit number)
22863029039077799371…53122647924918265041
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.286 × 10⁹⁷(98-digit number)
22863029039077799371…53122647924918265041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.572 × 10⁹⁷(98-digit number)
45726058078155598743…06245295849836530081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.145 × 10⁹⁷(98-digit number)
91452116156311197487…12490591699673060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.829 × 10⁹⁸(99-digit number)
18290423231262239497…24981183399346120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.658 × 10⁹⁸(99-digit number)
36580846462524478995…49962366798692240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.316 × 10⁹⁸(99-digit number)
73161692925048957990…99924733597384481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.463 × 10⁹⁹(100-digit number)
14632338585009791598…99849467194768962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.926 × 10⁹⁹(100-digit number)
29264677170019583196…99698934389537925121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.852 × 10⁹⁹(100-digit number)
58529354340039166392…99397868779075850241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.170 × 10¹⁰⁰(101-digit number)
11705870868007833278…98795737558151700481
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,911,125 XPM·at block #6,833,365 · 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