Block #519,697

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2014, 9:28:07 AM · Difficulty 10.8571 · 6,296,522 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c1435688179c5301bed7f7e82406ec492537fe0fc2b4c600cdcbdb88ebc959f5

Height

#519,697

Difficulty

10.857061

Transactions

5

Size

2.96 KB

Version

2

Bits

0adb6858

Nonce

89,854,684

Timestamp

5/1/2014, 9:28:07 AM

Confirmations

6,296,522

Merkle Root

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

1.521 × 10⁹⁹(100-digit number)
15217192189161949168…15326825293196320001
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
1.521 × 10⁹⁹(100-digit number)
15217192189161949168…15326825293196320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.043 × 10⁹⁹(100-digit number)
30434384378323898337…30653650586392640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.086 × 10⁹⁹(100-digit number)
60868768756647796674…61307301172785280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.217 × 10¹⁰⁰(101-digit number)
12173753751329559334…22614602345570560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.434 × 10¹⁰⁰(101-digit number)
24347507502659118669…45229204691141120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.869 × 10¹⁰⁰(101-digit number)
48695015005318237339…90458409382282240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.739 × 10¹⁰⁰(101-digit number)
97390030010636474678…80916818764564480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.947 × 10¹⁰¹(102-digit number)
19478006002127294935…61833637529128960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.895 × 10¹⁰¹(102-digit number)
38956012004254589871…23667275058257920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.791 × 10¹⁰¹(102-digit number)
77912024008509179742…47334550116515840001
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,773,881 XPM·at block #6,816,218 · 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