Block #913,286

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2015, 1:39:12 PM · Difficulty 10.9277 · 5,903,800 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
98011567ee08ca19f4901ede8b12df133bac2eca9a0c9999bdf1b963aec7d4c9

Height

#913,286

Difficulty

10.927698

Transactions

9

Size

4.86 KB

Version

2

Bits

0aed7da6

Nonce

1,390,799,249

Timestamp

1/28/2015, 1:39:12 PM

Confirmations

5,903,800

Merkle Root

10fb4f7a976e38000a35c3c174d9133b85f6b0158dc531a32fb770ba6433ca92
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.865 × 10⁹⁵(96-digit number)
38654235853604422869…36608316788747619839
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.865 × 10⁹⁵(96-digit number)
38654235853604422869…36608316788747619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.730 × 10⁹⁵(96-digit number)
77308471707208845739…73216633577495239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.546 × 10⁹⁶(97-digit number)
15461694341441769147…46433267154990479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.092 × 10⁹⁶(97-digit number)
30923388682883538295…92866534309980958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.184 × 10⁹⁶(97-digit number)
61846777365767076591…85733068619961917439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.236 × 10⁹⁷(98-digit number)
12369355473153415318…71466137239923834879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.473 × 10⁹⁷(98-digit number)
24738710946306830636…42932274479847669759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.947 × 10⁹⁷(98-digit number)
49477421892613661273…85864548959695339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.895 × 10⁹⁷(98-digit number)
98954843785227322546…71729097919390679039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.979 × 10⁹⁸(99-digit number)
19790968757045464509…43458195838781358079
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,780,726 XPM·at block #6,817,085 · 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