Block #453,035

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 11:44:24 PM · Difficulty 10.3940 · 6,363,641 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb40aeee5b35a86a48bdfbeacd9ab1b2d64415a3b108b9d85cfe50e9babfdcae

Height

#453,035

Difficulty

10.393955

Transactions

2

Size

1.01 KB

Version

2

Bits

0a64da35

Nonce

350,411

Timestamp

3/20/2014, 11:44:24 PM

Confirmations

6,363,641

Merkle Root

58a94546d88ce2a4e5ffa0ab20b5d6139a86268e01449e85d2b17c858b415050
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.

6.295 × 10⁹⁸(99-digit number)
62959832551802044753…09132940197707796641
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
6.295 × 10⁹⁸(99-digit number)
62959832551802044753…09132940197707796641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.259 × 10⁹⁹(100-digit number)
12591966510360408950…18265880395415593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.518 × 10⁹⁹(100-digit number)
25183933020720817901…36531760790831186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.036 × 10⁹⁹(100-digit number)
50367866041441635803…73063521581662373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.007 × 10¹⁰⁰(101-digit number)
10073573208288327160…46127043163324746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.014 × 10¹⁰⁰(101-digit number)
20147146416576654321…92254086326649492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.029 × 10¹⁰⁰(101-digit number)
40294292833153308642…84508172653298984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.058 × 10¹⁰⁰(101-digit number)
80588585666306617284…69016345306597969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.611 × 10¹⁰¹(102-digit number)
16117717133261323456…38032690613195939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.223 × 10¹⁰¹(102-digit number)
32235434266522646913…76065381226391879681
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,777,527 XPM·at block #6,816,675 · 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