Block #2,293,521

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/12/2017, 2:44:21 PM · Difficulty 10.9541 · 4,550,424 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27948996c37a30c9abca465e9c72fe47aa8d2307320d9afaa253a2a426107476

Height

#2,293,521

Difficulty

10.954095

Transactions

2

Size

424 B

Version

2

Bits

0af43f8a

Nonce

126,846,260

Timestamp

9/12/2017, 2:44:21 PM

Confirmations

4,550,424

Merkle Root

17fbe3e4a58182189a7fbb960e2d1903b69a442145a268d1730060d1725a2bf2
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.032 × 10⁹⁴(95-digit number)
30321879423431597653…99800383775332710029
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.032 × 10⁹⁴(95-digit number)
30321879423431597653…99800383775332710029
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.064 × 10⁹⁴(95-digit number)
60643758846863195306…99600767550665420059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.212 × 10⁹⁵(96-digit number)
12128751769372639061…99201535101330840119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.425 × 10⁹⁵(96-digit number)
24257503538745278122…98403070202661680239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.851 × 10⁹⁵(96-digit number)
48515007077490556245…96806140405323360479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.703 × 10⁹⁵(96-digit number)
97030014154981112490…93612280810646720959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.940 × 10⁹⁶(97-digit number)
19406002830996222498…87224561621293441919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.881 × 10⁹⁶(97-digit number)
38812005661992444996…74449123242586883839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.762 × 10⁹⁶(97-digit number)
77624011323984889992…48898246485173767679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.552 × 10⁹⁷(98-digit number)
15524802264796977998…97796492970347535359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.104 × 10⁹⁷(98-digit number)
31049604529593955996…95592985940695070719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,995,934 XPM·at block #6,843,944 · 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