Block #2,141,743

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2017, 11:40:40 AM · Difficulty 10.8732 · 4,699,700 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
877585431678d597396b4bfe334149fdfaa6c4fb4d7917bfe5a81b3ffd0b42c3

Height

#2,141,743

Difficulty

10.873187

Transactions

3

Size

1.07 KB

Version

2

Bits

0adf8931

Nonce

155,465,349

Timestamp

6/2/2017, 11:40:40 AM

Confirmations

4,699,700

Merkle Root

416ca4a74f805a93693f5bef5436e6409ef061f57f758fb55a3e89ef1cee41d4
Transactions (3)
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.394 × 10⁹⁷(98-digit number)
43946047399831868095…97386788132420648959
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.394 × 10⁹⁷(98-digit number)
43946047399831868095…97386788132420648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.789 × 10⁹⁷(98-digit number)
87892094799663736191…94773576264841297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.757 × 10⁹⁸(99-digit number)
17578418959932747238…89547152529682595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.515 × 10⁹⁸(99-digit number)
35156837919865494476…79094305059365191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.031 × 10⁹⁸(99-digit number)
70313675839730988952…58188610118730383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.406 × 10⁹⁹(100-digit number)
14062735167946197790…16377220237460766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.812 × 10⁹⁹(100-digit number)
28125470335892395581…32754440474921533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.625 × 10⁹⁹(100-digit number)
56250940671784791162…65508880949843066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.125 × 10¹⁰⁰(101-digit number)
11250188134356958232…31017761899686133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.250 × 10¹⁰⁰(101-digit number)
22500376268713916464…62035523799372267519
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,975,924 XPM·at block #6,841,442 · 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