Block #2,468,541

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2018, 9:34:19 PM · Difficulty 10.9601 · 4,369,006 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c79c805c4092f5005a7e3763e0a1629d462f631474042808f9dd887fb65c99b

Height

#2,468,541

Difficulty

10.960109

Transactions

6

Size

1.23 KB

Version

2

Bits

0af5c9ba

Nonce

1,440,178,570

Timestamp

1/11/2018, 9:34:19 PM

Confirmations

4,369,006

Merkle Root

8c139ebd8a110410f88c77e9299bc0260af826142542cc615dddaea17aacf984
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.052 × 10⁹⁴(95-digit number)
50525383193335170536…36728154399973310241
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.052 × 10⁹⁴(95-digit number)
50525383193335170536…36728154399973310241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.010 × 10⁹⁵(96-digit number)
10105076638667034107…73456308799946620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.021 × 10⁹⁵(96-digit number)
20210153277334068214…46912617599893240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.042 × 10⁹⁵(96-digit number)
40420306554668136429…93825235199786481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.084 × 10⁹⁵(96-digit number)
80840613109336272858…87650470399572963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.616 × 10⁹⁶(97-digit number)
16168122621867254571…75300940799145927681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.233 × 10⁹⁶(97-digit number)
32336245243734509143…50601881598291855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.467 × 10⁹⁶(97-digit number)
64672490487469018286…01203763196583710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.293 × 10⁹⁷(98-digit number)
12934498097493803657…02407526393167421441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.586 × 10⁹⁷(98-digit number)
25868996194987607314…04815052786334842881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.173 × 10⁹⁷(98-digit number)
51737992389975214629…09630105572669685761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,944,704 XPM·at block #6,837,546 · 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