Block #490,563

1CCLength 10ā˜…ā˜…ā˜†ā˜†ā˜†

Cunningham Chain of the First Kind Ā· Discovered 4/13/2014, 10:49:17 PM Ā· Difficulty 10.6780 Ā· 6,335,581 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8964d63e984748b9e723bb67a44c1b4af8c0d2ec86a770daeeec3fc13a7ccc8f

Height

#490,563

Difficulty

10.677955

Transactions

1

Size

901 B

Version

2

Bits

0aad8e76

Nonce

176,646

Timestamp

4/13/2014, 10:49:17 PM

Confirmations

6,335,581

Mined by

Merkle Root

495a03d941436f8cfe23dc6713bc6890c6761820d9b5019704fcd3813d6c4f26
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.265 Ɨ 10⁹⁵(96-digit number)
12652623836364277393…70944378976510574999
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.265 Ɨ 10⁹⁵(96-digit number)
12652623836364277393…70944378976510574999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
2
2^1 Ɨ origin āˆ’ 1
2.530 Ɨ 10⁹⁵(96-digit number)
25305247672728554787…41888757953021149999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
3
2^2 Ɨ origin āˆ’ 1
5.061 Ɨ 10⁹⁵(96-digit number)
50610495345457109574…83777515906042299999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
4
2^3 Ɨ origin āˆ’ 1
1.012 Ɨ 10⁹⁶(97-digit number)
10122099069091421914…67555031812084599999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
5
2^4 Ɨ origin āˆ’ 1
2.024 Ɨ 10⁹⁶(97-digit number)
20244198138182843829…35110063624169199999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
6
2^5 Ɨ origin āˆ’ 1
4.048 Ɨ 10⁹⁶(97-digit number)
40488396276365687659…70220127248338399999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
7
2^6 Ɨ origin āˆ’ 1
8.097 Ɨ 10⁹⁶(97-digit number)
80976792552731375319…40440254496676799999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
8
2^7 Ɨ origin āˆ’ 1
1.619 Ɨ 10⁹⁷(98-digit number)
16195358510546275063…80880508993353599999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
9
2^8 Ɨ origin āˆ’ 1
3.239 Ɨ 10⁹⁷(98-digit number)
32390717021092550127…61761017986707199999
Verify on FactorDB ↗Wolfram Alpha ↗
Ɨ2+1 →
10
2^9 Ɨ origin āˆ’ 1
6.478 Ɨ 10⁹⁷(98-digit number)
64781434042185100255…23522035973414399999
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,853,277 XPMĀ·at block #6,826,143 Ā· 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