Block #2,148,343

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/6/2017, 9:40:56 AM · Difficulty 10.8953 · 4,694,847 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d40225867f741f55375454aea028f035db1f1732387006ae35c85b83a378a843

Height

#2,148,343

Difficulty

10.895321

Transactions

2

Size

426 B

Version

2

Bits

0ae533c5

Nonce

1,501,271,477

Timestamp

6/6/2017, 9:40:56 AM

Confirmations

4,694,847

Merkle Root

44250a706a9508741cda427cc3f3bfd792c56fd8fbec9c7dc70a2e023761da19
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.

5.090 × 10⁹⁶(97-digit number)
50907700059097191150…43030436205482777599
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
5.090 × 10⁹⁶(97-digit number)
50907700059097191150…43030436205482777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.018 × 10⁹⁷(98-digit number)
10181540011819438230…86060872410965555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.036 × 10⁹⁷(98-digit number)
20363080023638876460…72121744821931110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.072 × 10⁹⁷(98-digit number)
40726160047277752920…44243489643862220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.145 × 10⁹⁷(98-digit number)
81452320094555505841…88486979287724441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.629 × 10⁹⁸(99-digit number)
16290464018911101168…76973958575448883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.258 × 10⁹⁸(99-digit number)
32580928037822202336…53947917150897766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.516 × 10⁹⁸(99-digit number)
65161856075644404673…07895834301795532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.303 × 10⁹⁹(100-digit number)
13032371215128880934…15791668603591065599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.606 × 10⁹⁹(100-digit number)
26064742430257761869…31583337207182131199
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,889 XPM·at block #6,843,189 · 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