Block #2,719,800

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2018, 9:04:45 PM · Difficulty 11.6127 · 4,121,084 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0868c53794cc2d5adb3b808067ed775506b1b4bc672b2dcfbf6ad2815b8eb047

Height

#2,719,800

Difficulty

11.612694

Transactions

3

Size

994 B

Version

2

Bits

0b9cd98b

Nonce

660,840,318

Timestamp

6/24/2018, 9:04:45 PM

Confirmations

4,121,084

Merkle Root

9ba6e78d450b24756197b748e34bf687554a7011855e3ec145112a18af98bde5
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.

2.842 × 10⁹⁴(95-digit number)
28425742038521087170…57842099377745596919
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
2.842 × 10⁹⁴(95-digit number)
28425742038521087170…57842099377745596919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.685 × 10⁹⁴(95-digit number)
56851484077042174340…15684198755491193839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.137 × 10⁹⁵(96-digit number)
11370296815408434868…31368397510982387679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.274 × 10⁹⁵(96-digit number)
22740593630816869736…62736795021964775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.548 × 10⁹⁵(96-digit number)
45481187261633739472…25473590043929550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.096 × 10⁹⁵(96-digit number)
90962374523267478944…50947180087859101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.819 × 10⁹⁶(97-digit number)
18192474904653495788…01894360175718202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.638 × 10⁹⁶(97-digit number)
36384949809306991577…03788720351436405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.276 × 10⁹⁶(97-digit number)
72769899618613983155…07577440702872811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.455 × 10⁹⁷(98-digit number)
14553979923722796631…15154881405745623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.910 × 10⁹⁷(98-digit number)
29107959847445593262…30309762811491246079
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,971,421 XPM·at block #6,840,883 · 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