Block #501,830

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 1:04:39 AM · Difficulty 10.8052 · 6,323,783 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a3256cac22c9469450f129e44c3b275df01b9565480124dcdbee97b35103017

Height

#501,830

Difficulty

10.805153

Transactions

7

Size

3.40 KB

Version

2

Bits

0ace1e83

Nonce

142,231

Timestamp

4/20/2014, 1:04:39 AM

Confirmations

6,323,783

Merkle Root

22748b302b48f59c89cd8220986671ffa4ae32d461d08444483af4e63d014a5f
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.

9.605 × 10⁹⁷(98-digit number)
96050864280284365949…42739990205734527841
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
9.605 × 10⁹⁷(98-digit number)
96050864280284365949…42739990205734527841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.921 × 10⁹⁸(99-digit number)
19210172856056873189…85479980411469055681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.842 × 10⁹⁸(99-digit number)
38420345712113746379…70959960822938111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.684 × 10⁹⁸(99-digit number)
76840691424227492759…41919921645876222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.536 × 10⁹⁹(100-digit number)
15368138284845498551…83839843291752445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.073 × 10⁹⁹(100-digit number)
30736276569690997103…67679686583504890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.147 × 10⁹⁹(100-digit number)
61472553139381994207…35359373167009781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.229 × 10¹⁰⁰(101-digit number)
12294510627876398841…70718746334019563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.458 × 10¹⁰⁰(101-digit number)
24589021255752797683…41437492668039127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.917 × 10¹⁰⁰(101-digit number)
49178042511505595366…82874985336078254081
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,849,007 XPM·at block #6,825,612 · 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