Block #2,079,649

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/20/2017, 3:16:49 PM · Difficulty 10.8605 · 4,764,426 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a834dbf3e278a406341c46156fcb7b887a848e2de531ff37e4dd02805e644c63

Height

#2,079,649

Difficulty

10.860505

Transactions

4

Size

3.31 KB

Version

2

Bits

0adc4a06

Nonce

359,293,845

Timestamp

4/20/2017, 3:16:49 PM

Confirmations

4,764,426

Merkle Root

d748830256663b7da0500945f16e921303477c1f61ed570f05e084b761112554
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.788 × 10⁹⁵(96-digit number)
37884599557845791613…68094042743294499839
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.788 × 10⁹⁵(96-digit number)
37884599557845791613…68094042743294499839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.576 × 10⁹⁵(96-digit number)
75769199115691583227…36188085486588999679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.515 × 10⁹⁶(97-digit number)
15153839823138316645…72376170973177999359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.030 × 10⁹⁶(97-digit number)
30307679646276633291…44752341946355998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.061 × 10⁹⁶(97-digit number)
60615359292553266582…89504683892711997439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.212 × 10⁹⁷(98-digit number)
12123071858510653316…79009367785423994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.424 × 10⁹⁷(98-digit number)
24246143717021306632…58018735570847989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.849 × 10⁹⁷(98-digit number)
48492287434042613265…16037471141695979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.698 × 10⁹⁷(98-digit number)
96984574868085226531…32074942283391959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.939 × 10⁹⁸(99-digit number)
19396914973617045306…64149884566783918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.879 × 10⁹⁸(99-digit number)
38793829947234090612…28299769133567836159
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,996,975 XPM·at block #6,844,074 · 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