Block #358,293

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 11:48:09 PM · Difficulty 10.3884 · 6,456,842 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80e8d0318fff9e5cf668b9fc197e20eaeef51e9a5f58504d85d8195ce7fe5210

Height

#358,293

Difficulty

10.388441

Transactions

4

Size

876 B

Version

2

Bits

0a6370e2

Nonce

22,293

Timestamp

1/13/2014, 11:48:09 PM

Confirmations

6,456,842

Merkle Root

4519e52eb802a10bb6d9bb6ab8c93eb52eb63f5d53bb19e5edf8352b19b435bc
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.886 × 10⁹⁴(95-digit number)
28863432604281173395…55069413288593284549
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.886 × 10⁹⁴(95-digit number)
28863432604281173395…55069413288593284549
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.772 × 10⁹⁴(95-digit number)
57726865208562346790…10138826577186569099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.154 × 10⁹⁵(96-digit number)
11545373041712469358…20277653154373138199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.309 × 10⁹⁵(96-digit number)
23090746083424938716…40555306308746276399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.618 × 10⁹⁵(96-digit number)
46181492166849877432…81110612617492552799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.236 × 10⁹⁵(96-digit number)
92362984333699754865…62221225234985105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.847 × 10⁹⁶(97-digit number)
18472596866739950973…24442450469970211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.694 × 10⁹⁶(97-digit number)
36945193733479901946…48884900939940422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.389 × 10⁹⁶(97-digit number)
73890387466959803892…97769801879880844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.477 × 10⁹⁷(98-digit number)
14778077493391960778…95539603759761689599
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,765,173 XPM·at block #6,815,134 · 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