1. #6,809,5812CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #1,245,188

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/20/2015, 7:03:17 PM · Difficulty 10.7439 · 5,564,394 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b0a1d6d7b99ea43ef539014ae51e4d747a7a1354c370254fc4dceb7ef086b94b

Height

#1,245,188

Difficulty

10.743915

Transactions

2

Size

1.09 KB

Version

2

Bits

0abe7135

Nonce

143,883,157

Timestamp

9/20/2015, 7:03:17 PM

Confirmations

5,564,394

Merkle Root

1d6777a28c13e3f0bb9a3ed0f1039670ba86aa9a9e5cb156dfe8b88ef5b8b2e9
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.120 × 10⁹⁶(97-digit number)
11201506455366758159…58483111271028687359
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.120 × 10⁹⁶(97-digit number)
11201506455366758159…58483111271028687359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.240 × 10⁹⁶(97-digit number)
22403012910733516318…16966222542057374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.480 × 10⁹⁶(97-digit number)
44806025821467032636…33932445084114749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.961 × 10⁹⁶(97-digit number)
89612051642934065273…67864890168229498879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.792 × 10⁹⁷(98-digit number)
17922410328586813054…35729780336458997759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.584 × 10⁹⁷(98-digit number)
35844820657173626109…71459560672917995519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.168 × 10⁹⁷(98-digit number)
71689641314347252218…42919121345835991039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.433 × 10⁹⁸(99-digit number)
14337928262869450443…85838242691671982079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.867 × 10⁹⁸(99-digit number)
28675856525738900887…71676485383343964159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.735 × 10⁹⁸(99-digit number)
57351713051477801774…43352970766687928319
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,720,733 XPM·at block #6,809,581 · 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.

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