Block #516,190

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 5:35:43 AM · Difficulty 10.8452 · 6,300,898 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ecaf676268216971f45695f232924402b32e3068799133d13616a3b824b00ab

Height

#516,190

Difficulty

10.845222

Transactions

5

Size

1.41 KB

Version

2

Bits

0ad8607a

Nonce

179,102,986

Timestamp

4/29/2014, 5:35:43 AM

Confirmations

6,300,898

Merkle Root

2070d13d9b1960275e136ebfd2db7002f1bc4668a0399f8a97cc962a3af10688
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.214 × 10⁹⁹(100-digit number)
12141497675238274127…23777849931812045281
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.214 × 10⁹⁹(100-digit number)
12141497675238274127…23777849931812045281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.428 × 10⁹⁹(100-digit number)
24282995350476548255…47555699863624090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.856 × 10⁹⁹(100-digit number)
48565990700953096511…95111399727248181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.713 × 10⁹⁹(100-digit number)
97131981401906193023…90222799454496362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.942 × 10¹⁰⁰(101-digit number)
19426396280381238604…80445598908992724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.885 × 10¹⁰⁰(101-digit number)
38852792560762477209…60891197817985448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.770 × 10¹⁰⁰(101-digit number)
77705585121524954418…21782395635970897921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.554 × 10¹⁰¹(102-digit number)
15541117024304990883…43564791271941795841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.108 × 10¹⁰¹(102-digit number)
31082234048609981767…87129582543883591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.216 × 10¹⁰¹(102-digit number)
62164468097219963535…74259165087767183361
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,780,742 XPM·at block #6,817,087 · 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