Block #500,302

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 2:11:53 AM · Difficulty 10.7986 · 6,317,307 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c7cd35b2108766d6dbd9a7b7f314d2a7fe0991d67b2a5277378679b882db2a3

Height

#500,302

Difficulty

10.798630

Transactions

1

Size

866 B

Version

2

Bits

0acc730a

Nonce

19,899

Timestamp

4/19/2014, 2:11:53 AM

Confirmations

6,317,307

Merkle Root

2c51071dc1f34ca2a6990b1e862d0e59777e3744d01408f8041f786cbb8b1301
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.192 × 10⁹²(93-digit number)
11927740517218672078…01692327774834769741
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.192 × 10⁹²(93-digit number)
11927740517218672078…01692327774834769741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.385 × 10⁹²(93-digit number)
23855481034437344157…03384655549669539481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.771 × 10⁹²(93-digit number)
47710962068874688315…06769311099339078961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.542 × 10⁹²(93-digit number)
95421924137749376631…13538622198678157921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.908 × 10⁹³(94-digit number)
19084384827549875326…27077244397356315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.816 × 10⁹³(94-digit number)
38168769655099750652…54154488794712631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.633 × 10⁹³(94-digit number)
76337539310199501305…08308977589425263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.526 × 10⁹⁴(95-digit number)
15267507862039900261…16617955178850526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.053 × 10⁹⁴(95-digit number)
30535015724079800522…33235910357701053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.107 × 10⁹⁴(95-digit number)
61070031448159601044…66471820715402106881
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,784,928 XPM·at block #6,817,608 · 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