Block #2,645,878

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 2:42:03 AM · Difficulty 11.7405 · 4,194,541 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1d8a383737a0f924e48374bde760f3f891bb25575e1ff4643feb4f9a05080002

Height

#2,645,878

Difficulty

11.740520

Transactions

24

Size

6.37 KB

Version

2

Bits

0bbd92bc

Nonce

51,354,653

Timestamp

5/3/2018, 2:42:03 AM

Confirmations

4,194,541

Merkle Root

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

3.861 × 10⁹⁶(97-digit number)
38614308224068342575…92474639240021247999
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
3.861 × 10⁹⁶(97-digit number)
38614308224068342575…92474639240021247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.722 × 10⁹⁶(97-digit number)
77228616448136685151…84949278480042495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.544 × 10⁹⁷(98-digit number)
15445723289627337030…69898556960084991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.089 × 10⁹⁷(98-digit number)
30891446579254674060…39797113920169983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.178 × 10⁹⁷(98-digit number)
61782893158509348121…79594227840339967999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.235 × 10⁹⁸(99-digit number)
12356578631701869624…59188455680679935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.471 × 10⁹⁸(99-digit number)
24713157263403739248…18376911361359871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.942 × 10⁹⁸(99-digit number)
49426314526807478497…36753822722719743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.885 × 10⁹⁸(99-digit number)
98852629053614956994…73507645445439487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.977 × 10⁹⁹(100-digit number)
19770525810722991398…47015290890878975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.954 × 10⁹⁹(100-digit number)
39541051621445982797…94030581781757951999
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,967,677 XPM·at block #6,840,418 · 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