Block #2,993,125

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2019, 11:52:54 PM · Difficulty 11.2695 · 3,850,741 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c1c78c73468c3b6714a1698f7586da12567dd82508bead2eed8b71cbe6d88201

Height

#2,993,125

Difficulty

11.269504

Transactions

8

Size

2.72 KB

Version

2

Bits

0b44fe31

Nonce

1,094,676,795

Timestamp

1/2/2019, 11:52:54 PM

Confirmations

3,850,741

Merkle Root

12381819b05f1b5eea2f6520f90c26a98d6a189dcd87ab8fd55b08b8c3dd38ac
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.462 × 10⁹³(94-digit number)
54620347038188513295…06131213880507084999
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.462 × 10⁹³(94-digit number)
54620347038188513295…06131213880507084999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.092 × 10⁹⁴(95-digit number)
10924069407637702659…12262427761014169999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.184 × 10⁹⁴(95-digit number)
21848138815275405318…24524855522028339999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.369 × 10⁹⁴(95-digit number)
43696277630550810636…49049711044056679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.739 × 10⁹⁴(95-digit number)
87392555261101621273…98099422088113359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.747 × 10⁹⁵(96-digit number)
17478511052220324254…96198844176226719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.495 × 10⁹⁵(96-digit number)
34957022104440648509…92397688352453439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.991 × 10⁹⁵(96-digit number)
69914044208881297018…84795376704906879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.398 × 10⁹⁶(97-digit number)
13982808841776259403…69590753409813759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.796 × 10⁹⁶(97-digit number)
27965617683552518807…39181506819627519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.593 × 10⁹⁶(97-digit number)
55931235367105037615…78363013639255039999
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,995,298 XPM·at block #6,843,865 · 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