Block #2,293,510

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/12/2017, 2:31:25 PM · Difficulty 10.9541 · 4,548,818 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d59b39dcc4288562e29e6bb0030ec7cd100b1f244466212f9d643c6196353bc2

Height

#2,293,510

Difficulty

10.954117

Transactions

2

Size

424 B

Version

2

Bits

0af440fb

Nonce

885,083,756

Timestamp

9/12/2017, 2:31:25 PM

Confirmations

4,548,818

Merkle Root

aba8e4d39f3247e2dead9ce9b16b4d1ca77ae0109533aa881b859586bbd13c89
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.

1.504 × 10⁹⁵(96-digit number)
15040920335995427428…69670569593038287999
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
1.504 × 10⁹⁵(96-digit number)
15040920335995427428…69670569593038287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.008 × 10⁹⁵(96-digit number)
30081840671990854856…39341139186076575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.016 × 10⁹⁵(96-digit number)
60163681343981709712…78682278372153151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.203 × 10⁹⁶(97-digit number)
12032736268796341942…57364556744306303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.406 × 10⁹⁶(97-digit number)
24065472537592683885…14729113488612607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.813 × 10⁹⁶(97-digit number)
48130945075185367770…29458226977225215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.626 × 10⁹⁶(97-digit number)
96261890150370735540…58916453954450431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.925 × 10⁹⁷(98-digit number)
19252378030074147108…17832907908900863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.850 × 10⁹⁷(98-digit number)
38504756060148294216…35665815817801727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.700 × 10⁹⁷(98-digit number)
77009512120296588432…71331631635603455999
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,983,031 XPM·at block #6,842,327 · 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