Block #2,343,497

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2017, 12:11:45 AM · Difficulty 10.9030 · 4,490,237 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
683a8924d9046cce1dd10df5bf5ce3d734a67298b6e788f0f0a41eb3a86eb0e2

Height

#2,343,497

Difficulty

10.903006

Transactions

19

Size

4.01 KB

Version

2

Bits

0ae72b6f

Nonce

2,092,640,986

Timestamp

10/20/2017, 12:11:45 AM

Confirmations

4,490,237

Merkle Root

0df12f572160d0f9ef2c44c1490fec9c4493e6c74abf65b11d93f51afc7dc686
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.705 × 10⁹⁴(95-digit number)
17055635521157812301…63349500990416560759
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.705 × 10⁹⁴(95-digit number)
17055635521157812301…63349500990416560759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.411 × 10⁹⁴(95-digit number)
34111271042315624602…26699001980833121519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.822 × 10⁹⁴(95-digit number)
68222542084631249205…53398003961666243039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.364 × 10⁹⁵(96-digit number)
13644508416926249841…06796007923332486079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.728 × 10⁹⁵(96-digit number)
27289016833852499682…13592015846664972159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.457 × 10⁹⁵(96-digit number)
54578033667704999364…27184031693329944319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.091 × 10⁹⁶(97-digit number)
10915606733540999872…54368063386659888639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.183 × 10⁹⁶(97-digit number)
21831213467081999745…08736126773319777279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.366 × 10⁹⁶(97-digit number)
43662426934163999491…17472253546639554559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.732 × 10⁹⁶(97-digit number)
87324853868327998983…34944507093279109119
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,914,096 XPM·at block #6,833,733 · 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