Block #2,150,857

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/8/2017, 12:19:13 AM · Difficulty 10.8995 · 4,688,568 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
09a574fd99e3391c42c07cfe679c1a87d4f79cedf43fd80b462182c436cfbf46

Height

#2,150,857

Difficulty

10.899456

Transactions

9

Size

1.96 KB

Version

2

Bits

0ae642c1

Nonce

52,284,435

Timestamp

6/8/2017, 12:19:13 AM

Confirmations

4,688,568

Merkle Root

31052a0b95c1fc16cb495ff4d7073852b07f4c1e9f311dba702927e8de6723be
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.235 × 10⁹⁴(95-digit number)
32353072851823416819…11927210506353548799
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.235 × 10⁹⁴(95-digit number)
32353072851823416819…11927210506353548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.470 × 10⁹⁴(95-digit number)
64706145703646833638…23854421012707097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.294 × 10⁹⁵(96-digit number)
12941229140729366727…47708842025414195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.588 × 10⁹⁵(96-digit number)
25882458281458733455…95417684050828390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.176 × 10⁹⁵(96-digit number)
51764916562917466910…90835368101656780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.035 × 10⁹⁶(97-digit number)
10352983312583493382…81670736203313561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.070 × 10⁹⁶(97-digit number)
20705966625166986764…63341472406627123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.141 × 10⁹⁶(97-digit number)
41411933250333973528…26682944813254246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.282 × 10⁹⁶(97-digit number)
82823866500667947056…53365889626508492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.656 × 10⁹⁷(98-digit number)
16564773300133589411…06731779253016985599
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,959,689 XPM·at block #6,839,424 · 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