Block #2,260,393

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/20/2017, 4:42:56 PM · Difficulty 10.9519 · 4,573,341 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b65604a06876c84d1a2cefdbc71ba0db3937a8093a89823137313837faee54b9

Height

#2,260,393

Difficulty

10.951859

Transactions

41

Size

9.18 KB

Version

2

Bits

0af3ad0f

Nonce

118,496,111

Timestamp

8/20/2017, 4:42:56 PM

Confirmations

4,573,341

Merkle Root

da2f269abb002b73c320950f84c2dc496e2d0ff6e72ce0c0ae78e72f44481829
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.443 × 10⁹⁷(98-digit number)
14437558476227562835…74103002422551470079
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.443 × 10⁹⁷(98-digit number)
14437558476227562835…74103002422551470079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.887 × 10⁹⁷(98-digit number)
28875116952455125671…48206004845102940159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.775 × 10⁹⁷(98-digit number)
57750233904910251343…96412009690205880319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.155 × 10⁹⁸(99-digit number)
11550046780982050268…92824019380411760639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.310 × 10⁹⁸(99-digit number)
23100093561964100537…85648038760823521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.620 × 10⁹⁸(99-digit number)
46200187123928201074…71296077521647042559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.240 × 10⁹⁸(99-digit number)
92400374247856402149…42592155043294085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.848 × 10⁹⁹(100-digit number)
18480074849571280429…85184310086588170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.696 × 10⁹⁹(100-digit number)
36960149699142560859…70368620173176340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.392 × 10⁹⁹(100-digit number)
73920299398285121719…40737240346352680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.478 × 10¹⁰⁰(101-digit number)
14784059879657024343…81474480692705361919
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,914,096 XPM·at block #6,833,733 · 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