Block #892,107

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2015, 8:19:20 AM · Difficulty 10.9525 · 5,917,160 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
92503fa5d580f7e17b2285a0d708cfa6d74961c16f81569315b6472e0e2ea4e3

Height

#892,107

Difficulty

10.952541

Transactions

17

Size

4.23 KB

Version

2

Bits

0af3d9c2

Nonce

220,772,527

Timestamp

1/12/2015, 8:19:20 AM

Confirmations

5,917,160

Merkle Root

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

2.120 × 10⁹⁷(98-digit number)
21207483055498830198…16114784496853529599
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
2.120 × 10⁹⁷(98-digit number)
21207483055498830198…16114784496853529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.241 × 10⁹⁷(98-digit number)
42414966110997660396…32229568993707059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.482 × 10⁹⁷(98-digit number)
84829932221995320793…64459137987414118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.696 × 10⁹⁸(99-digit number)
16965986444399064158…28918275974828236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.393 × 10⁹⁸(99-digit number)
33931972888798128317…57836551949656473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.786 × 10⁹⁸(99-digit number)
67863945777596256635…15673103899312947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.357 × 10⁹⁹(100-digit number)
13572789155519251327…31346207798625894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.714 × 10⁹⁹(100-digit number)
27145578311038502654…62692415597251788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.429 × 10⁹⁹(100-digit number)
54291156622077005308…25384831194503577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.085 × 10¹⁰⁰(101-digit number)
10858231324415401061…50769662389007155199
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,718,204 XPM·at block #6,809,266 · 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