Block #2,292,714

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/11/2017, 11:59:01 PM · Difficulty 10.9548 · 4,549,468 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f9e462c544761ef7b816de67c5fd514d6682d1df40e58ead077a58f4ca621907

Height

#2,292,714

Difficulty

10.954759

Transactions

2

Size

424 B

Version

2

Bits

0af46b13

Nonce

2,135,270,183

Timestamp

9/11/2017, 11:59:01 PM

Confirmations

4,549,468

Merkle Root

48222d783c490226692ed21e591cd93bd20d29a035a873dcb628c77638a6ffda
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.

9.289 × 10⁹³(94-digit number)
92890060031794449573…64116673885180365479
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
9.289 × 10⁹³(94-digit number)
92890060031794449573…64116673885180365479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.857 × 10⁹⁴(95-digit number)
18578012006358889914…28233347770360730959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.715 × 10⁹⁴(95-digit number)
37156024012717779829…56466695540721461919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.431 × 10⁹⁴(95-digit number)
74312048025435559659…12933391081442923839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.486 × 10⁹⁵(96-digit number)
14862409605087111931…25866782162885847679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.972 × 10⁹⁵(96-digit number)
29724819210174223863…51733564325771695359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.944 × 10⁹⁵(96-digit number)
59449638420348447727…03467128651543390719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.188 × 10⁹⁶(97-digit number)
11889927684069689545…06934257303086781439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.377 × 10⁹⁶(97-digit number)
23779855368139379090…13868514606173562879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.755 × 10⁹⁶(97-digit number)
47559710736278758181…27737029212347125759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.511 × 10⁹⁶(97-digit number)
95119421472557516363…55474058424694251519
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,981,848 XPM·at block #6,842,181 · 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