Block #3,006,896

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2019, 8:50:10 PM · Difficulty 11.2027 · 3,830,030 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7a71a2931176d37e4d180d755151c9657bf47add0878ed6ec7b15dc353d1d195

Height

#3,006,896

Difficulty

11.202689

Transactions

24

Size

7.00 KB

Version

2

Bits

0b33e369

Nonce

2,067,496,533

Timestamp

1/12/2019, 8:50:10 PM

Confirmations

3,830,030

Merkle Root

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

7.242 × 10⁹⁶(97-digit number)
72423880176571102870…82124468549764464639
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
7.242 × 10⁹⁶(97-digit number)
72423880176571102870…82124468549764464639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.448 × 10⁹⁷(98-digit number)
14484776035314220574…64248937099528929279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.896 × 10⁹⁷(98-digit number)
28969552070628441148…28497874199057858559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.793 × 10⁹⁷(98-digit number)
57939104141256882296…56995748398115717119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.158 × 10⁹⁸(99-digit number)
11587820828251376459…13991496796231434239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.317 × 10⁹⁸(99-digit number)
23175641656502752918…27982993592462868479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.635 × 10⁹⁸(99-digit number)
46351283313005505837…55965987184925736959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.270 × 10⁹⁸(99-digit number)
92702566626011011674…11931974369851473919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.854 × 10⁹⁹(100-digit number)
18540513325202202334…23863948739702947839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.708 × 10⁹⁹(100-digit number)
37081026650404404669…47727897479405895679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.416 × 10⁹⁹(100-digit number)
74162053300808809339…95455794958811791359
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,939,704 XPM·at block #6,836,925 · 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