Block #527,429

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2014, 12:58:11 AM · Difficulty 10.8842 · 6,298,034 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
697206e963992dac036c5e9b8bf078e3d32d95f5de080309577b448ca8c104cf

Height

#527,429

Difficulty

10.884194

Transactions

9

Size

2.11 KB

Version

2

Bits

0ae25a90

Nonce

50,263,343

Timestamp

5/6/2014, 12:58:11 AM

Confirmations

6,298,034

Merkle Root

db0cd02cf221d8debeff1193b38d241fb6939230109a0841dffd0d408ffca8a4
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.

7.043 × 10¹⁰⁰(101-digit number)
70437534881110928200…40013552929995294721
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
7.043 × 10¹⁰⁰(101-digit number)
70437534881110928200…40013552929995294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.408 × 10¹⁰¹(102-digit number)
14087506976222185640…80027105859990589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.817 × 10¹⁰¹(102-digit number)
28175013952444371280…60054211719981178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.635 × 10¹⁰¹(102-digit number)
56350027904888742560…20108423439962357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.127 × 10¹⁰²(103-digit number)
11270005580977748512…40216846879924715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.254 × 10¹⁰²(103-digit number)
22540011161955497024…80433693759849431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.508 × 10¹⁰²(103-digit number)
45080022323910994048…60867387519698862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.016 × 10¹⁰²(103-digit number)
90160044647821988096…21734775039397724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.803 × 10¹⁰³(104-digit number)
18032008929564397619…43469550078795448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.606 × 10¹⁰³(104-digit number)
36064017859128795238…86939100157590896641
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,847,807 XPM·at block #6,825,462 · 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