Block #2,165,049

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2017, 10:25:35 PM · Difficulty 10.8980 · 4,678,853 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
baf0c4072ac04b92022a22685ef1fe831045d945a2edb35a94c69a032d82f583

Height

#2,165,049

Difficulty

10.898000

Transactions

17

Size

8.82 KB

Version

2

Bits

0ae5e34d

Nonce

420,059,315

Timestamp

6/17/2017, 10:25:35 PM

Confirmations

4,678,853

Merkle Root

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

7.362 × 10⁹⁶(97-digit number)
73624132155906966278…87983002347799900159
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
7.362 × 10⁹⁶(97-digit number)
73624132155906966278…87983002347799900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.472 × 10⁹⁷(98-digit number)
14724826431181393255…75966004695599800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.944 × 10⁹⁷(98-digit number)
29449652862362786511…51932009391199600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.889 × 10⁹⁷(98-digit number)
58899305724725573022…03864018782399201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.177 × 10⁹⁸(99-digit number)
11779861144945114604…07728037564798402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.355 × 10⁹⁸(99-digit number)
23559722289890229208…15456075129596805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.711 × 10⁹⁸(99-digit number)
47119444579780458417…30912150259193610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.423 × 10⁹⁸(99-digit number)
94238889159560916835…61824300518387220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.884 × 10⁹⁹(100-digit number)
18847777831912183367…23648601036774440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.769 × 10⁹⁹(100-digit number)
37695555663824366734…47297202073548881919
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,995,587 XPM·at block #6,843,901 · 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