Block #520,466

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 8:50:33 PM · Difficulty 10.8595 · 6,292,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2af35b480773f9b09a6fe3f4a7ac25954dace22e7a635350d8d1debcbbeed42

Height

#520,466

Difficulty

10.859505

Transactions

7

Size

2.11 KB

Version

2

Bits

0adc0889

Nonce

77,101,752

Timestamp

5/1/2014, 8:50:33 PM

Confirmations

6,292,376

Merkle Root

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

8.251 × 10¹⁰⁰(101-digit number)
82512550421304280838…61463141690822236161
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
8.251 × 10¹⁰⁰(101-digit number)
82512550421304280838…61463141690822236161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.650 × 10¹⁰¹(102-digit number)
16502510084260856167…22926283381644472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.300 × 10¹⁰¹(102-digit number)
33005020168521712335…45852566763288944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.601 × 10¹⁰¹(102-digit number)
66010040337043424671…91705133526577889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.320 × 10¹⁰²(103-digit number)
13202008067408684934…83410267053155778561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.640 × 10¹⁰²(103-digit number)
26404016134817369868…66820534106311557121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.280 × 10¹⁰²(103-digit number)
52808032269634739736…33641068212623114241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.056 × 10¹⁰³(104-digit number)
10561606453926947947…67282136425246228481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.112 × 10¹⁰³(104-digit number)
21123212907853895894…34564272850492456961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.224 × 10¹⁰³(104-digit number)
42246425815707791789…69128545700984913921
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,746,781 XPM·at block #6,812,841 · 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