Block #2,375,691

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/12/2017, 1:30:39 AM · Difficulty 10.8828 · 4,469,198 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e72691b14afa63b40f369baf558adce21ab2ae066870b8154ac94c889612bce0

Height

#2,375,691

Difficulty

10.882751

Transactions

6

Size

1.49 KB

Version

2

Bits

0ae1fbf6

Nonce

766,161,707

Timestamp

11/12/2017, 1:30:39 AM

Confirmations

4,469,198

Merkle Root

fe83d07745e67b36002ef243b5f1040daa1db9a847f9f492ee8e51885104db5b
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.853 × 10⁹⁶(97-digit number)
78532357276332937856…18949262394000793599
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.853 × 10⁹⁶(97-digit number)
78532357276332937856…18949262394000793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.570 × 10⁹⁷(98-digit number)
15706471455266587571…37898524788001587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.141 × 10⁹⁷(98-digit number)
31412942910533175142…75797049576003174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.282 × 10⁹⁷(98-digit number)
62825885821066350285…51594099152006348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.256 × 10⁹⁸(99-digit number)
12565177164213270057…03188198304012697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.513 × 10⁹⁸(99-digit number)
25130354328426540114…06376396608025395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.026 × 10⁹⁸(99-digit number)
50260708656853080228…12752793216050790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.005 × 10⁹⁹(100-digit number)
10052141731370616045…25505586432101580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.010 × 10⁹⁹(100-digit number)
20104283462741232091…51011172864203161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.020 × 10⁹⁹(100-digit number)
40208566925482464182…02022345728406323199
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:58,003,527 XPM·at block #6,844,888 · 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