Block #3,301,725

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/8/2019, 1:12:37 PM · Difficulty 10.9959 · 3,516,031 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea0cfa847dc81af6cb524fcc978f4fd403af169e1f28a0d65fdb98ffee0cead1

Height

#3,301,725

Difficulty

10.995872

Transactions

7

Size

2.95 KB

Version

2

Bits

0afef17c

Nonce

1,979,674,854

Timestamp

8/8/2019, 1:12:37 PM

Confirmations

3,516,031

Merkle Root

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

5.630 × 10⁹³(94-digit number)
56307860826810676291…51512132922754943039
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
5.630 × 10⁹³(94-digit number)
56307860826810676291…51512132922754943039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.126 × 10⁹⁴(95-digit number)
11261572165362135258…03024265845509886079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.252 × 10⁹⁴(95-digit number)
22523144330724270516…06048531691019772159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.504 × 10⁹⁴(95-digit number)
45046288661448541033…12097063382039544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.009 × 10⁹⁴(95-digit number)
90092577322897082066…24194126764079088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.801 × 10⁹⁵(96-digit number)
18018515464579416413…48388253528158177279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.603 × 10⁹⁵(96-digit number)
36037030929158832826…96776507056316354559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.207 × 10⁹⁵(96-digit number)
72074061858317665653…93553014112632709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.441 × 10⁹⁶(97-digit number)
14414812371663533130…87106028225265418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.882 × 10⁹⁶(97-digit number)
28829624743327066261…74212056450530836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.765 × 10⁹⁶(97-digit number)
57659249486654132522…48424112901061672959
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,786,103 XPM·at block #6,817,755 · 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