Block #2,298,950

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2017, 6:20:20 AM · Difficulty 10.9411 · 4,540,183 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b4101236a4bdb6937c445cf4f94650aee3aad0b1e613f29f94456a3dd8a849e5

Height

#2,298,950

Difficulty

10.941147

Transactions

2

Size

723 B

Version

2

Bits

0af0ef09

Nonce

956,659,897

Timestamp

9/17/2017, 6:20:20 AM

Confirmations

4,540,183

Merkle Root

e78be520351d5ceaa482473940e9d1ea66a5dd083ebb5ee8b3d0146355b8d093
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.987 × 10⁹⁷(98-digit number)
59870804178681146232…03267797073870008319
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.987 × 10⁹⁷(98-digit number)
59870804178681146232…03267797073870008319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.197 × 10⁹⁸(99-digit number)
11974160835736229246…06535594147740016639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.394 × 10⁹⁸(99-digit number)
23948321671472458492…13071188295480033279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.789 × 10⁹⁸(99-digit number)
47896643342944916985…26142376590960066559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.579 × 10⁹⁸(99-digit number)
95793286685889833971…52284753181920133119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.915 × 10⁹⁹(100-digit number)
19158657337177966794…04569506363840266239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.831 × 10⁹⁹(100-digit number)
38317314674355933588…09139012727680532479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.663 × 10⁹⁹(100-digit number)
76634629348711867177…18278025455361064959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.532 × 10¹⁰⁰(101-digit number)
15326925869742373435…36556050910722129919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.065 × 10¹⁰⁰(101-digit number)
30653851739484746871…73112101821444259839
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,957,342 XPM·at block #6,839,132 · 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