Block #2,946,620

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2018, 12:34:42 AM · Difficulty 11.3962 · 3,884,825 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
02a9e5fcc47c73cb3727b4f32b68d7f3696e95e55aaf7777ef43ac27d413b86a

Height

#2,946,620

Difficulty

11.396189

Transactions

45

Size

12.16 KB

Version

2

Bits

0b656ca8

Nonce

368,786,543

Timestamp

12/1/2018, 12:34:42 AM

Confirmations

3,884,825

Merkle Root

d6e9fe5c288ecaadfca335d748cc4026bbfc27543cd8b48663e5200f91f7ec79
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.812 × 10⁹⁷(98-digit number)
18123576128194958539…22875499901054033919
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.812 × 10⁹⁷(98-digit number)
18123576128194958539…22875499901054033919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.624 × 10⁹⁷(98-digit number)
36247152256389917079…45750999802108067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.249 × 10⁹⁷(98-digit number)
72494304512779834158…91501999604216135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.449 × 10⁹⁸(99-digit number)
14498860902555966831…83003999208432271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.899 × 10⁹⁸(99-digit number)
28997721805111933663…66007998416864542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.799 × 10⁹⁸(99-digit number)
57995443610223867326…32015996833729085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.159 × 10⁹⁹(100-digit number)
11599088722044773465…64031993667458170879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.319 × 10⁹⁹(100-digit number)
23198177444089546930…28063987334916341759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.639 × 10⁹⁹(100-digit number)
46396354888179093861…56127974669832683519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.279 × 10⁹⁹(100-digit number)
92792709776358187723…12255949339665367039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.855 × 10¹⁰⁰(101-digit number)
18558541955271637544…24511898679330734079
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,895,724 XPM·at block #6,831,444 · 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