Block #2,145,288

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2017, 12:31:35 PM · Difficulty 10.8878 · 4,699,598 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
df0d0ed5f505a1594937f0851ed4ff6e131b167fa42b391969a08c937524aee9

Height

#2,145,288

Difficulty

10.887816

Transactions

17

Size

3.53 KB

Version

2

Bits

0ae347e1

Nonce

447,528,708

Timestamp

6/4/2017, 12:31:35 PM

Confirmations

4,699,598

Merkle Root

5f216ff2e6cd98deeb2633beb682ed6f6a0fb0483c9ff827fa34894f275d47bf
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.637 × 10⁹⁵(96-digit number)
56376038322818220218…60018257196431865919
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.637 × 10⁹⁵(96-digit number)
56376038322818220218…60018257196431865919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.127 × 10⁹⁶(97-digit number)
11275207664563644043…20036514392863731839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.255 × 10⁹⁶(97-digit number)
22550415329127288087…40073028785727463679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.510 × 10⁹⁶(97-digit number)
45100830658254576174…80146057571454927359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.020 × 10⁹⁶(97-digit number)
90201661316509152349…60292115142909854719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.804 × 10⁹⁷(98-digit number)
18040332263301830469…20584230285819709439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.608 × 10⁹⁷(98-digit number)
36080664526603660939…41168460571639418879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.216 × 10⁹⁷(98-digit number)
72161329053207321879…82336921143278837759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.443 × 10⁹⁸(99-digit number)
14432265810641464375…64673842286557675519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.886 × 10⁹⁸(99-digit number)
28864531621282928751…29347684573115351039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.772 × 10⁹⁸(99-digit number)
57729063242565857503…58695369146230702079
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:58,003,502 XPM·at block #6,844,885 · 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