Block #931,003

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2015, 10:59:46 PM · Difficulty 10.9020 · 5,878,619 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aa9ff2f74660c9878642b4401e67b1dc14b9e47c087ab232ca5c665619ee5270

Height

#931,003

Difficulty

10.902037

Transactions

2

Size

580 B

Version

2

Bits

0ae6ebeb

Nonce

449,381,453

Timestamp

2/10/2015, 10:59:46 PM

Confirmations

5,878,619

Merkle Root

4886446fde4b3654949a637e31d6478f3517304b9f4bdeefa89496aca222217f
Transactions (2)
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.038 × 10⁹⁷(98-digit number)
30385592638557923286…28253809106976153601
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.038 × 10⁹⁷(98-digit number)
30385592638557923286…28253809106976153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.077 × 10⁹⁷(98-digit number)
60771185277115846572…56507618213952307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.215 × 10⁹⁸(99-digit number)
12154237055423169314…13015236427904614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.430 × 10⁹⁸(99-digit number)
24308474110846338628…26030472855809228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.861 × 10⁹⁸(99-digit number)
48616948221692677257…52060945711618457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.723 × 10⁹⁸(99-digit number)
97233896443385354515…04121891423236915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.944 × 10⁹⁹(100-digit number)
19446779288677070903…08243782846473830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.889 × 10⁹⁹(100-digit number)
38893558577354141806…16487565692947660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.778 × 10⁹⁹(100-digit number)
77787117154708283612…32975131385895321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.555 × 10¹⁰⁰(101-digit number)
15557423430941656722…65950262771790643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.111 × 10¹⁰⁰(101-digit number)
31114846861883313444…31900525543581286401
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,721,054 XPM·at block #6,809,621 · 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