Block #3,244,951

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/28/2019, 4:56:41 PM · Difficulty 11.0128 · 3,594,833 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
23129e94609c8a623bac780c81c68d93b999322d4b9cd0a5cb4b15703935ea08

Height

#3,244,951

Difficulty

11.012762

Transactions

7

Size

1.75 KB

Version

2

Bits

0b034464

Nonce

1,393,015,975

Timestamp

6/28/2019, 4:56:41 PM

Confirmations

3,594,833

Merkle Root

62a87b9605dfb5698d9d9322254bf052df6f55933a969f446cfcf0352600d4cc
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.509 × 10⁹⁸(99-digit number)
15099824370168839560…24431030642459893759
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.509 × 10⁹⁸(99-digit number)
15099824370168839560…24431030642459893759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.019 × 10⁹⁸(99-digit number)
30199648740337679121…48862061284919787519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.039 × 10⁹⁸(99-digit number)
60399297480675358243…97724122569839575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.207 × 10⁹⁹(100-digit number)
12079859496135071648…95448245139679150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.415 × 10⁹⁹(100-digit number)
24159718992270143297…90896490279358300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.831 × 10⁹⁹(100-digit number)
48319437984540286594…81792980558716600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.663 × 10⁹⁹(100-digit number)
96638875969080573189…63585961117433200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.932 × 10¹⁰⁰(101-digit number)
19327775193816114637…27171922234866401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.865 × 10¹⁰⁰(101-digit number)
38655550387632229275…54343844469732802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.731 × 10¹⁰⁰(101-digit number)
77311100775264458551…08687688939465605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.546 × 10¹⁰¹(102-digit number)
15462220155052891710…17375377878931210239
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,962,562 XPM·at block #6,839,783 · 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