Block #509,945

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2014, 8:48:04 AM · Difficulty 10.8226 · 6,296,768 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6402c54a2d0cd218f92bfc8df30ba997c6827ceffb929630694d849e545644d1

Height

#509,945

Difficulty

10.822628

Transactions

6

Size

1.45 KB

Version

2

Bits

0ad297b8

Nonce

18,519,299

Timestamp

4/25/2014, 8:48:04 AM

Confirmations

6,296,768

Merkle Root

e3c8360ce241a918b406484f975c951df2f720924f64aac33b5478fca8594f42
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.431 × 10¹⁰⁰(101-digit number)
74312470590120850489…31588120375855349761
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.431 × 10¹⁰⁰(101-digit number)
74312470590120850489…31588120375855349761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.486 × 10¹⁰¹(102-digit number)
14862494118024170097…63176240751710699521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.972 × 10¹⁰¹(102-digit number)
29724988236048340195…26352481503421399041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.944 × 10¹⁰¹(102-digit number)
59449976472096680391…52704963006842798081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.188 × 10¹⁰²(103-digit number)
11889995294419336078…05409926013685596161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.377 × 10¹⁰²(103-digit number)
23779990588838672156…10819852027371192321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.755 × 10¹⁰²(103-digit number)
47559981177677344313…21639704054742384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.511 × 10¹⁰²(103-digit number)
95119962355354688626…43279408109484769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.902 × 10¹⁰³(104-digit number)
19023992471070937725…86558816218969538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.804 × 10¹⁰³(104-digit number)
38047984942141875450…73117632437939077121
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,697,802 XPM·at block #6,806,712 · 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