Block #520,079

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 3:26:19 PM · Difficulty 10.8578 · 6,286,231 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
75db61c529845d62b4df8c65e528d5f127235aab79151219d288aa81b06dbbd4

Height

#520,079

Difficulty

10.857764

Transactions

7

Size

1.53 KB

Version

2

Bits

0adb9668

Nonce

91,176,130

Timestamp

5/1/2014, 3:26:19 PM

Confirmations

6,286,231

Merkle Root

5b4f455fe91f8de1b203483fcf802aed1796c9979d22e2a3ec68ac36a9b09f4d
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.135 × 10⁹⁸(99-digit number)
21359248533019455911…65846263399043337201
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.135 × 10⁹⁸(99-digit number)
21359248533019455911…65846263399043337201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.271 × 10⁹⁸(99-digit number)
42718497066038911822…31692526798086674401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.543 × 10⁹⁸(99-digit number)
85436994132077823645…63385053596173348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.708 × 10⁹⁹(100-digit number)
17087398826415564729…26770107192346697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.417 × 10⁹⁹(100-digit number)
34174797652831129458…53540214384693395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.834 × 10⁹⁹(100-digit number)
68349595305662258916…07080428769386790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.366 × 10¹⁰⁰(101-digit number)
13669919061132451783…14160857538773580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.733 × 10¹⁰⁰(101-digit number)
27339838122264903566…28321715077547161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.467 × 10¹⁰⁰(101-digit number)
54679676244529807133…56643430155094323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.093 × 10¹⁰¹(102-digit number)
10935935248905961426…13286860310188646401
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,694,568 XPM·at block #6,806,309 · 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