Block #901,157

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2015, 8:53:02 AM · Difficulty 10.9417 · 5,906,814 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c58fbe87125bb0b9ccb2587e3558d7d3b80d8529fd558a222370b6f8f6d15633

Height

#901,157

Difficulty

10.941689

Transactions

7

Size

4.99 KB

Version

2

Bits

0af11287

Nonce

352,406,024

Timestamp

1/19/2015, 8:53:02 AM

Confirmations

5,906,814

Merkle Root

8ef7288aa1f0fba1ef21995cf2b7932523fc52faf26c75177a8c6494933e42ee
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.

4.908 × 10⁹⁶(97-digit number)
49086452278511116438…56000879341314091521
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
4.908 × 10⁹⁶(97-digit number)
49086452278511116438…56000879341314091521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.817 × 10⁹⁶(97-digit number)
98172904557022232877…12001758682628183041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.963 × 10⁹⁷(98-digit number)
19634580911404446575…24003517365256366081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.926 × 10⁹⁷(98-digit number)
39269161822808893151…48007034730512732161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.853 × 10⁹⁷(98-digit number)
78538323645617786302…96014069461025464321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.570 × 10⁹⁸(99-digit number)
15707664729123557260…92028138922050928641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.141 × 10⁹⁸(99-digit number)
31415329458247114520…84056277844101857281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.283 × 10⁹⁸(99-digit number)
62830658916494229041…68112555688203714561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.256 × 10⁹⁹(100-digit number)
12566131783298845808…36225111376407429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.513 × 10⁹⁹(100-digit number)
25132263566597691616…72450222752814858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.026 × 10⁹⁹(100-digit number)
50264527133195383233…44900445505629716481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,707,812 XPM·at block #6,807,970 · 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