Block #2,136,497

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2017, 5:06:20 AM · Difficulty 10.8940 · 4,708,823 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
528a4e8754caf484cfdde92ef84f0fddd26fd38654cd3397332cbb766e9c97d4

Height

#2,136,497

Difficulty

10.893960

Transactions

45

Size

18.38 KB

Version

2

Bits

0ae4da95

Nonce

1,005,086,001

Timestamp

5/29/2017, 5:06:20 AM

Confirmations

4,708,823

Merkle Root

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

9.810 × 10⁹³(94-digit number)
98102380485899204217…65793817915198358399
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
9.810 × 10⁹³(94-digit number)
98102380485899204217…65793817915198358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.962 × 10⁹⁴(95-digit number)
19620476097179840843…31587635830396716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.924 × 10⁹⁴(95-digit number)
39240952194359681686…63175271660793433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.848 × 10⁹⁴(95-digit number)
78481904388719363373…26350543321586867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.569 × 10⁹⁵(96-digit number)
15696380877743872674…52701086643173734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.139 × 10⁹⁵(96-digit number)
31392761755487745349…05402173286347468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.278 × 10⁹⁵(96-digit number)
62785523510975490699…10804346572694937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.255 × 10⁹⁶(97-digit number)
12557104702195098139…21608693145389875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.511 × 10⁹⁶(97-digit number)
25114209404390196279…43217386290779750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.022 × 10⁹⁶(97-digit number)
50228418808780392559…86434772581559500799
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:58,006,999 XPM·at block #6,845,319 · 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