Block #2,337,580

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2017, 8:30:30 AM · Difficulty 10.9168 · 4,494,899 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1f877d144f6fde35b370be1a37d222ce7485c5cd5734f40dbc5f90b4d7dedac

Height

#2,337,580

Difficulty

10.916845

Transactions

42

Size

14.35 KB

Version

2

Bits

0aeab65f

Nonce

1,408,709,081

Timestamp

10/15/2017, 8:30:30 AM

Confirmations

4,494,899

Merkle Root

108a07aceae421cb9a991b7c76de1a4628aad5bc51a690a888df6f6dc8a38506
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.

8.537 × 10⁹⁶(97-digit number)
85374101294506135219…02283149574381148159
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
8.537 × 10⁹⁶(97-digit number)
85374101294506135219…02283149574381148159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.707 × 10⁹⁷(98-digit number)
17074820258901227043…04566299148762296319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.414 × 10⁹⁷(98-digit number)
34149640517802454087…09132598297524592639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.829 × 10⁹⁷(98-digit number)
68299281035604908175…18265196595049185279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.365 × 10⁹⁸(99-digit number)
13659856207120981635…36530393190098370559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.731 × 10⁹⁸(99-digit number)
27319712414241963270…73060786380196741119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.463 × 10⁹⁸(99-digit number)
54639424828483926540…46121572760393482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.092 × 10⁹⁹(100-digit number)
10927884965696785308…92243145520786964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.185 × 10⁹⁹(100-digit number)
21855769931393570616…84486291041573928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.371 × 10⁹⁹(100-digit number)
43711539862787141232…68972582083147857919
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,903,985 XPM·at block #6,832,478 · 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