Block #1,236,358

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2015, 12:11:18 PM · Difficulty 10.7546 · 5,573,883 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f67cb15a608af7c013003d85af3d281f3b57008e0b2c6d2668887cc50df9699e

Height

#1,236,358

Difficulty

10.754621

Transactions

7

Size

2.22 KB

Version

2

Bits

0ac12ed7

Nonce

314,644,360

Timestamp

9/14/2015, 12:11:18 PM

Confirmations

5,573,883

Merkle Root

1d5866dec91b3c8756e1ddf72e26909967c34579f6a743d99500fc39fd598d30
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.

9.097 × 10⁹⁵(96-digit number)
90976057987165017855…23742375467964960759
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
9.097 × 10⁹⁵(96-digit number)
90976057987165017855…23742375467964960759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.819 × 10⁹⁶(97-digit number)
18195211597433003571…47484750935929921519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.639 × 10⁹⁶(97-digit number)
36390423194866007142…94969501871859843039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.278 × 10⁹⁶(97-digit number)
72780846389732014284…89939003743719686079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.455 × 10⁹⁷(98-digit number)
14556169277946402856…79878007487439372159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.911 × 10⁹⁷(98-digit number)
29112338555892805713…59756014974878744319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.822 × 10⁹⁷(98-digit number)
58224677111785611427…19512029949757488639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.164 × 10⁹⁸(99-digit number)
11644935422357122285…39024059899514977279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.328 × 10⁹⁸(99-digit number)
23289870844714244570…78048119799029954559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.657 × 10⁹⁸(99-digit number)
46579741689428489141…56096239598059909119
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,726,006 XPM·at block #6,810,240 · 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