Block #2,188,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/1/2017, 2:06:28 PM · Difficulty 10.9480 · 4,655,133 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3a92ad39c66ef39925997cf38d15c0390bdf462164eb5ad174118710824e1a96

Height

#2,188,061

Difficulty

10.948009

Transactions

2

Size

720 B

Version

2

Bits

0af2b0ba

Nonce

1,195,998,731

Timestamp

7/1/2017, 2:06:28 PM

Confirmations

4,655,133

Merkle Root

832d297c35bf8ac1997f6aec117d3c59ecc93464ee0417a80c602f6f9e977b74
Transactions (2)
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.

3.528 × 10⁹⁴(95-digit number)
35285973446963675510…00743385586165965279
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
3.528 × 10⁹⁴(95-digit number)
35285973446963675510…00743385586165965279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.057 × 10⁹⁴(95-digit number)
70571946893927351020…01486771172331930559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.411 × 10⁹⁵(96-digit number)
14114389378785470204…02973542344663861119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.822 × 10⁹⁵(96-digit number)
28228778757570940408…05947084689327722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.645 × 10⁹⁵(96-digit number)
56457557515141880816…11894169378655444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.129 × 10⁹⁶(97-digit number)
11291511503028376163…23788338757310888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.258 × 10⁹⁶(97-digit number)
22583023006056752326…47576677514621777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.516 × 10⁹⁶(97-digit number)
45166046012113504653…95153355029243555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.033 × 10⁹⁶(97-digit number)
90332092024227009306…90306710058487111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.806 × 10⁹⁷(98-digit number)
18066418404845401861…80613420116974223359
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,989,922 XPM·at block #6,843,193 · 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