Block #318,924

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 4:52:46 PM · Difficulty 10.1615 · 6,490,488 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
633680ca97714f912592f074850c5cda27baa14ff865bf8d483a8941806fe895

Height

#318,924

Difficulty

10.161452

Transactions

17

Size

7.59 KB

Version

2

Bits

0a2954e7

Nonce

153,509

Timestamp

12/18/2013, 4:52:46 PM

Confirmations

6,490,488

Merkle Root

2c2ffd598447e284a47ec8da95bedfe8ac1693e7b73a5d5c16a306f7ee76867e
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.

2.140 × 10⁹⁹(100-digit number)
21405463281808679933…30850703876612149599
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
2.140 × 10⁹⁹(100-digit number)
21405463281808679933…30850703876612149599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.281 × 10⁹⁹(100-digit number)
42810926563617359867…61701407753224299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.562 × 10⁹⁹(100-digit number)
85621853127234719734…23402815506448598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.712 × 10¹⁰⁰(101-digit number)
17124370625446943946…46805631012897196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.424 × 10¹⁰⁰(101-digit number)
34248741250893887893…93611262025794393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.849 × 10¹⁰⁰(101-digit number)
68497482501787775787…87222524051588787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.369 × 10¹⁰¹(102-digit number)
13699496500357555157…74445048103177574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.739 × 10¹⁰¹(102-digit number)
27398993000715110315…48890096206355148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.479 × 10¹⁰¹(102-digit number)
54797986001430220630…97780192412710297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.095 × 10¹⁰²(103-digit number)
10959597200286044126…95560384825420595199
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,719,371 XPM·at block #6,809,411 · 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