Block #604,899

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/28/2014, 3:33:45 AM · Difficulty 10.9099 · 6,221,821 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e35240dfaf2c8c20a46d447028ff2d87d873a0b969b0dd8536c9683627db91a

Height

#604,899

Difficulty

10.909902

Transactions

7

Size

1.52 KB

Version

2

Bits

0ae8ef58

Nonce

456,984,877

Timestamp

6/28/2014, 3:33:45 AM

Confirmations

6,221,821

Merkle Root

a1243aba80fb9bc0d115d80e466bad64d23f83ccbf28337bd81f26348da61b30
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.

2.969 × 10⁹⁹(100-digit number)
29698444071426981808…67161067230873213439
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
2.969 × 10⁹⁹(100-digit number)
29698444071426981808…67161067230873213439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.939 × 10⁹⁹(100-digit number)
59396888142853963616…34322134461746426879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.187 × 10¹⁰⁰(101-digit number)
11879377628570792723…68644268923492853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.375 × 10¹⁰⁰(101-digit number)
23758755257141585446…37288537846985707519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.751 × 10¹⁰⁰(101-digit number)
47517510514283170893…74577075693971415039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.503 × 10¹⁰⁰(101-digit number)
95035021028566341786…49154151387942830079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.900 × 10¹⁰¹(102-digit number)
19007004205713268357…98308302775885660159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.801 × 10¹⁰¹(102-digit number)
38014008411426536714…96616605551771320319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.602 × 10¹⁰¹(102-digit number)
76028016822853073429…93233211103542640639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.520 × 10¹⁰²(103-digit number)
15205603364570614685…86466422207085281279
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,857,914 XPM·at block #6,826,719 · 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