Block #298,162

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2013, 3:46:32 AM · Difficulty 9.9919 · 6,511,983 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6991e43f321cd92c745fbc47b83ad300d44f1c9bb2a1720ec05e37d95d8a6934

Height

#298,162

Difficulty

9.991910

Transactions

3

Size

800 B

Version

2

Bits

09fdedc9

Nonce

46,321

Timestamp

12/7/2013, 3:46:32 AM

Confirmations

6,511,983

Merkle Root

63169dbfc9cc11d9a8cc9672d6737409cea447df355b629aed4a448bdbd8a685
Transactions (3)
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.

3.391 × 10⁹⁶(97-digit number)
33910543277324928229…13974650596844610959
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
3.391 × 10⁹⁶(97-digit number)
33910543277324928229…13974650596844610959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.782 × 10⁹⁶(97-digit number)
67821086554649856459…27949301193689221919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.356 × 10⁹⁷(98-digit number)
13564217310929971291…55898602387378443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.712 × 10⁹⁷(98-digit number)
27128434621859942583…11797204774756887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.425 × 10⁹⁷(98-digit number)
54256869243719885167…23594409549513775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.085 × 10⁹⁸(99-digit number)
10851373848743977033…47188819099027550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.170 × 10⁹⁸(99-digit number)
21702747697487954066…94377638198055101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.340 × 10⁹⁸(99-digit number)
43405495394975908133…88755276396110202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.681 × 10⁹⁸(99-digit number)
86810990789951816267…77510552792220405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.736 × 10⁹⁹(100-digit number)
17362198157990363253…55021105584440811519
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,725,224 XPM·at block #6,810,144 · 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