Block #2,126,234

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2017, 2:42:54 AM · Difficulty 10.9194 · 4,707,094 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1255be53ec0fb14c29e7a9a546b4be1479b874c29518a9c0a5cb98f436ab33bb

Height

#2,126,234

Difficulty

10.919377

Transactions

5

Size

1.66 KB

Version

2

Bits

0aeb5c4b

Nonce

366,549,991

Timestamp

5/21/2017, 2:42:54 AM

Confirmations

4,707,094

Merkle Root

93a484fd56c6c70c6fc3aab8aae3d29e302fd624d6100c7d2936361c98653090
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.

6.450 × 10⁹⁷(98-digit number)
64509667086763203250…29072778167535534079
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
6.450 × 10⁹⁷(98-digit number)
64509667086763203250…29072778167535534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.290 × 10⁹⁸(99-digit number)
12901933417352640650…58145556335071068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.580 × 10⁹⁸(99-digit number)
25803866834705281300…16291112670142136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.160 × 10⁹⁸(99-digit number)
51607733669410562600…32582225340284272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.032 × 10⁹⁹(100-digit number)
10321546733882112520…65164450680568545279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.064 × 10⁹⁹(100-digit number)
20643093467764225040…30328901361137090559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.128 × 10⁹⁹(100-digit number)
41286186935528450080…60657802722274181119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.257 × 10⁹⁹(100-digit number)
82572373871056900160…21315605444548362239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.651 × 10¹⁰⁰(101-digit number)
16514474774211380032…42631210889096724479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.302 × 10¹⁰⁰(101-digit number)
33028949548422760064…85262421778193448959
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,910,817 XPM·at block #6,833,327 · 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