Block #125,212

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2013, 2:42:27 AM · Difficulty 9.7761 · 6,682,702 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6da3b20e51aa97a64078235ae50fe2419d75987356889b64d50daa7689cd8b2d

Height

#125,212

Difficulty

9.776067

Transactions

11

Size

2.55 KB

Version

2

Bits

09c6ac53

Nonce

93,013

Timestamp

8/20/2013, 2:42:27 AM

Confirmations

6,682,702

Merkle Root

fea7cf769615a2349c4a8e06523695b99a6cbc87ac481f9668aaaf9e5eddc0d5
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.862 × 10⁹⁸(99-digit number)
28622866667066640583…31855527714198330041
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.862 × 10⁹⁸(99-digit number)
28622866667066640583…31855527714198330041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.724 × 10⁹⁸(99-digit number)
57245733334133281166…63711055428396660081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.144 × 10⁹⁹(100-digit number)
11449146666826656233…27422110856793320161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.289 × 10⁹⁹(100-digit number)
22898293333653312466…54844221713586640321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.579 × 10⁹⁹(100-digit number)
45796586667306624933…09688443427173280641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.159 × 10⁹⁹(100-digit number)
91593173334613249867…19376886854346561281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.831 × 10¹⁰⁰(101-digit number)
18318634666922649973…38753773708693122561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.663 × 10¹⁰⁰(101-digit number)
36637269333845299946…77507547417386245121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.327 × 10¹⁰⁰(101-digit number)
73274538667690599893…55015094834772490241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.465 × 10¹⁰¹(102-digit number)
14654907733538119978…10030189669544980481
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,707,347 XPM·at block #6,807,913 · 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.

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