Block #901,262

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2015, 10:36:47 AM · Difficulty 10.9417 · 5,924,318 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90b42e5c7fa2aed757e47b5ba6ad27b5240c6e433386a88eaf9e1a97fd6e6b04

Height

#901,262

Difficulty

10.941741

Transactions

10

Size

5.80 KB

Version

2

Bits

0af115ec

Nonce

504,063,957

Timestamp

1/19/2015, 10:36:47 AM

Confirmations

5,924,318

Merkle Root

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

3.467 × 10⁹⁷(98-digit number)
34678249632193770023…40272319018112160001
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
3.467 × 10⁹⁷(98-digit number)
34678249632193770023…40272319018112160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.935 × 10⁹⁷(98-digit number)
69356499264387540046…80544638036224320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.387 × 10⁹⁸(99-digit number)
13871299852877508009…61089276072448640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.774 × 10⁹⁸(99-digit number)
27742599705755016018…22178552144897280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.548 × 10⁹⁸(99-digit number)
55485199411510032037…44357104289794560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.109 × 10⁹⁹(100-digit number)
11097039882302006407…88714208579589120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.219 × 10⁹⁹(100-digit number)
22194079764604012815…77428417159178240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.438 × 10⁹⁹(100-digit number)
44388159529208025630…54856834318356480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.877 × 10⁹⁹(100-digit number)
88776319058416051260…09713668636712960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.775 × 10¹⁰⁰(101-digit number)
17755263811683210252…19427337273425920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.551 × 10¹⁰⁰(101-digit number)
35510527623366420504…38854674546851840001
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,848,741 XPM·at block #6,825,579 · 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