Block #318,886

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 4:13:56 PM · Difficulty 10.1614 · 6,498,888 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
edee2d9256f30809b8fc7475a2a0498e77be56dba9ac361c0f8641dc6ecae907

Height

#318,886

Difficulty

10.161428

Transactions

8

Size

3.31 KB

Version

2

Bits

0a295353

Nonce

12,633

Timestamp

12/18/2013, 4:13:56 PM

Confirmations

6,498,888

Merkle Root

86aa78e6e892edd3ffd9828c3ca6be73811082ed650ab2deca02df19cc88ca0b
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.495 × 10¹⁰¹(102-digit number)
14953936145562432909…20826393699099083839
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.495 × 10¹⁰¹(102-digit number)
14953936145562432909…20826393699099083839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.990 × 10¹⁰¹(102-digit number)
29907872291124865818…41652787398198167679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.981 × 10¹⁰¹(102-digit number)
59815744582249731637…83305574796396335359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.196 × 10¹⁰²(103-digit number)
11963148916449946327…66611149592792670719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.392 × 10¹⁰²(103-digit number)
23926297832899892655…33222299185585341439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.785 × 10¹⁰²(103-digit number)
47852595665799785310…66444598371170682879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.570 × 10¹⁰²(103-digit number)
95705191331599570620…32889196742341365759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.914 × 10¹⁰³(104-digit number)
19141038266319914124…65778393484682731519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.828 × 10¹⁰³(104-digit number)
38282076532639828248…31556786969365463039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.656 × 10¹⁰³(104-digit number)
76564153065279656496…63113573938730926079
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,786,250 XPM·at block #6,817,773 · 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