Block #532,572

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 4:25:34 AM · Difficulty 10.8976 · 6,294,349 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
45087ba03205f39cb6498fee5e4ffa7bc09f2aceccd81d7cbb23bb706c9202d1

Height

#532,572

Difficulty

10.897630

Transactions

6

Size

1.18 KB

Version

2

Bits

0ae5cb1b

Nonce

2,878,452

Timestamp

5/9/2014, 4:25:34 AM

Confirmations

6,294,349

Merkle Root

2f12daf075a4662d40419cf273a153232aa586c2a52bb41008198899a0d103a1
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.047 × 10⁹⁹(100-digit number)
10478064116672400572…48901338069838463121
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.047 × 10⁹⁹(100-digit number)
10478064116672400572…48901338069838463121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.095 × 10⁹⁹(100-digit number)
20956128233344801144…97802676139676926241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.191 × 10⁹⁹(100-digit number)
41912256466689602289…95605352279353852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.382 × 10⁹⁹(100-digit number)
83824512933379204579…91210704558707704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.676 × 10¹⁰⁰(101-digit number)
16764902586675840915…82421409117415409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.352 × 10¹⁰⁰(101-digit number)
33529805173351681831…64842818234830819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.705 × 10¹⁰⁰(101-digit number)
67059610346703363663…29685636469661639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.341 × 10¹⁰¹(102-digit number)
13411922069340672732…59371272939323279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.682 × 10¹⁰¹(102-digit number)
26823844138681345465…18742545878646558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.364 × 10¹⁰¹(102-digit number)
53647688277362690931…37485091757293117441
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,539 XPM·at block #6,826,920 · 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