Block #2,273,489

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/29/2017, 2:59:00 PM · Difficulty 10.9545 · 4,560,425 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71124bcd693495bd4c9ec0560c112975206a211dccd3a050f7c7434207016ee6

Height

#2,273,489

Difficulty

10.954487

Transactions

2

Size

2.01 KB

Version

2

Bits

0af45942

Nonce

162,014,582

Timestamp

8/29/2017, 2:59:00 PM

Confirmations

4,560,425

Merkle Root

33d72cf648098c32aed56d5cce44d45de6d3f50399b2df547389a39b36c9584e
Transactions (2)
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.

1.835 × 10⁹⁶(97-digit number)
18354648304866932290…07254038557984844799
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
1.835 × 10⁹⁶(97-digit number)
18354648304866932290…07254038557984844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.670 × 10⁹⁶(97-digit number)
36709296609733864581…14508077115969689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.341 × 10⁹⁶(97-digit number)
73418593219467729162…29016154231939379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.468 × 10⁹⁷(98-digit number)
14683718643893545832…58032308463878758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.936 × 10⁹⁷(98-digit number)
29367437287787091665…16064616927757516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.873 × 10⁹⁷(98-digit number)
58734874575574183330…32129233855515033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.174 × 10⁹⁸(99-digit number)
11746974915114836666…64258467711030067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.349 × 10⁹⁸(99-digit number)
23493949830229673332…28516935422060134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.698 × 10⁹⁸(99-digit number)
46987899660459346664…57033870844120268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.397 × 10⁹⁸(99-digit number)
93975799320918693328…14067741688240537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.879 × 10⁹⁹(100-digit number)
18795159864183738665…28135483376481075199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,915,538 XPM·at block #6,833,913 · 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