Block #2,644,005

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 7:45:16 AM · Difficulty 11.6997 · 4,189,922 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4f6c896acde7cf2dc229d21ddba812104a9262e3eab591a6f2da9d71e8c3ec33

Height

#2,644,005

Difficulty

11.699704

Transactions

3

Size

769 B

Version

2

Bits

0bb31fd0

Nonce

199,577,502

Timestamp

5/2/2018, 7:45:16 AM

Confirmations

4,189,922

Merkle Root

e97145df517aadc699251ddd8cf149cefde53ee7f83a648d3229af2d34479299
Transactions (3)
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.029 × 10⁹⁷(98-digit number)
10295978860901177925…52641521936542760959
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.029 × 10⁹⁷(98-digit number)
10295978860901177925…52641521936542760959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.059 × 10⁹⁷(98-digit number)
20591957721802355851…05283043873085521919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.118 × 10⁹⁷(98-digit number)
41183915443604711703…10566087746171043839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.236 × 10⁹⁷(98-digit number)
82367830887209423406…21132175492342087679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.647 × 10⁹⁸(99-digit number)
16473566177441884681…42264350984684175359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.294 × 10⁹⁸(99-digit number)
32947132354883769362…84528701969368350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.589 × 10⁹⁸(99-digit number)
65894264709767538725…69057403938736701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.317 × 10⁹⁹(100-digit number)
13178852941953507745…38114807877473402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.635 × 10⁹⁹(100-digit number)
26357705883907015490…76229615754946805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.271 × 10⁹⁹(100-digit number)
52715411767814030980…52459231509893611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.054 × 10¹⁰⁰(101-digit number)
10543082353562806196…04918463019787223039
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,915,644 XPM·at block #6,833,926 · 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