Block #359,668

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2014, 10:47:42 PM · Difficulty 10.3884 · 6,449,549 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8acb9593c91a91adc4de26b50eabf0313197b3f1c03f9d338aaab21d2c77fc78

Height

#359,668

Difficulty

10.388440

Transactions

1

Size

1003 B

Version

2

Bits

0a6370d4

Nonce

50,835

Timestamp

1/14/2014, 10:47:42 PM

Confirmations

6,449,549

Merkle Root

61e1d147df488e6a4b2600edf8b6bfc0892d9fadb269cabc064d09560470bf73
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.285 × 10⁹⁵(96-digit number)
22851767745438531394…65533350840921841921
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.285 × 10⁹⁵(96-digit number)
22851767745438531394…65533350840921841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.570 × 10⁹⁵(96-digit number)
45703535490877062789…31066701681843683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.140 × 10⁹⁵(96-digit number)
91407070981754125579…62133403363687367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.828 × 10⁹⁶(97-digit number)
18281414196350825115…24266806727374735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.656 × 10⁹⁶(97-digit number)
36562828392701650231…48533613454749470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.312 × 10⁹⁶(97-digit number)
73125656785403300463…97067226909498941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.462 × 10⁹⁷(98-digit number)
14625131357080660092…94134453818997882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.925 × 10⁹⁷(98-digit number)
29250262714161320185…88268907637995765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.850 × 10⁹⁷(98-digit number)
58500525428322640370…76537815275991531521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.170 × 10⁹⁸(99-digit number)
11700105085664528074…53075630551983063041
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 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
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 2CC formula:

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