Block #598,868

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2014, 3:08:37 AM · Difficulty 10.9287 · 6,209,112 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cd3b5639e65a7bb61bff1eaaab0c8f608236b053c023d102e6bc0c8366de0db1

Height

#598,868

Difficulty

10.928709

Transactions

4

Size

1.15 KB

Version

2

Bits

0aedbfdf

Nonce

207,096,872

Timestamp

6/23/2014, 3:08:37 AM

Confirmations

6,209,112

Merkle Root

443403c5920018afa65f895066a6c0842e7f94b3ca0cd0d0afeb0d02c0e656be
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.279 × 10⁹⁸(99-digit number)
22794039832526227017…73817198354757558401
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.279 × 10⁹⁸(99-digit number)
22794039832526227017…73817198354757558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.558 × 10⁹⁸(99-digit number)
45588079665052454035…47634396709515116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.117 × 10⁹⁸(99-digit number)
91176159330104908070…95268793419030233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.823 × 10⁹⁹(100-digit number)
18235231866020981614…90537586838060467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.647 × 10⁹⁹(100-digit number)
36470463732041963228…81075173676120934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.294 × 10⁹⁹(100-digit number)
72940927464083926456…62150347352241868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.458 × 10¹⁰⁰(101-digit number)
14588185492816785291…24300694704483737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.917 × 10¹⁰⁰(101-digit number)
29176370985633570582…48601389408967475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.835 × 10¹⁰⁰(101-digit number)
58352741971267141165…97202778817934950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.167 × 10¹⁰¹(102-digit number)
11670548394253428233…94405557635869900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.334 × 10¹⁰¹(102-digit number)
23341096788506856466…88811115271739801601
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,885 XPM·at block #6,807,979 · 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