Block #2,034,181

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2017, 8:48:41 PM · Difficulty 10.6847 · 4,805,393 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bcd00c26de86a8dc95096285e228cdb100c26b5df59473d6a9082411450f1fa8

Height

#2,034,181

Difficulty

10.684655

Transactions

2

Size

1.11 KB

Version

2

Bits

0aaf4591

Nonce

1,896,246,771

Timestamp

3/22/2017, 8:48:41 PM

Confirmations

4,805,393

Merkle Root

fca6db9734563a7f5556ef7b970e49bdcfafd581d0ae371af3dc0ed8746c1dc2
Transactions (2)
1 in → 1 out8.7600 XPM110 B
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.

4.727 × 10⁹²(93-digit number)
47270085878668674856…92171864058063642399
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
4.727 × 10⁹²(93-digit number)
47270085878668674856…92171864058063642399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.454 × 10⁹²(93-digit number)
94540171757337349713…84343728116127284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.890 × 10⁹³(94-digit number)
18908034351467469942…68687456232254569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.781 × 10⁹³(94-digit number)
37816068702934939885…37374912464509139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.563 × 10⁹³(94-digit number)
75632137405869879770…74749824929018278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.512 × 10⁹⁴(95-digit number)
15126427481173975954…49499649858036556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.025 × 10⁹⁴(95-digit number)
30252854962347951908…98999299716073113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.050 × 10⁹⁴(95-digit number)
60505709924695903816…97998599432146227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.210 × 10⁹⁵(96-digit number)
12101141984939180763…95997198864292454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.420 × 10⁹⁵(96-digit number)
24202283969878361526…91994397728584908799
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,960,878 XPM·at block #6,839,573 · 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