Block #510,968

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 11:07:13 PM · Difficulty 10.8283 · 6,299,028 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
320a0b4e38ff7124c9eeb39263df7016fc92086bc2cfbb66d1b7497c7e6afaa7

Height

#510,968

Difficulty

10.828319

Transactions

8

Size

3.56 KB

Version

2

Bits

0ad40cba

Nonce

21,724,276

Timestamp

4/25/2014, 11:07:13 PM

Confirmations

6,299,028

Merkle Root

78e8be4ca824eedf58535f9226493394f84f7b89f218c933fab49b266dc7bcda
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.

4.177 × 10⁹⁹(100-digit number)
41776015772388576499…14011593746513769599
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
4.177 × 10⁹⁹(100-digit number)
41776015772388576499…14011593746513769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.355 × 10⁹⁹(100-digit number)
83552031544777152999…28023187493027539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.671 × 10¹⁰⁰(101-digit number)
16710406308955430599…56046374986055078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.342 × 10¹⁰⁰(101-digit number)
33420812617910861199…12092749972110156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.684 × 10¹⁰⁰(101-digit number)
66841625235821722399…24185499944220313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.336 × 10¹⁰¹(102-digit number)
13368325047164344479…48370999888440627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.673 × 10¹⁰¹(102-digit number)
26736650094328688959…96741999776881254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.347 × 10¹⁰¹(102-digit number)
53473300188657377919…93483999553762508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.069 × 10¹⁰²(103-digit number)
10694660037731475583…86967999107525017599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.138 × 10¹⁰²(103-digit number)
21389320075462951167…73935998215050035199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,724,042 XPM·at block #6,809,995 · 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