Block #454,606

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 1:44:11 AM · Difficulty 10.3971 · 6,354,409 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
05278f9515c768d2b51605548457a3acd2ec4f5129efeb53f507c52f8cd84048

Height

#454,606

Difficulty

10.397114

Transactions

8

Size

2.45 KB

Version

2

Bits

0a65a945

Nonce

464,702

Timestamp

3/22/2014, 1:44:11 AM

Confirmations

6,354,409

Merkle Root

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

1.523 × 10⁹⁵(96-digit number)
15236552162661034898…40072663506877255561
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
1.523 × 10⁹⁵(96-digit number)
15236552162661034898…40072663506877255561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.047 × 10⁹⁵(96-digit number)
30473104325322069797…80145327013754511121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.094 × 10⁹⁵(96-digit number)
60946208650644139594…60290654027509022241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.218 × 10⁹⁶(97-digit number)
12189241730128827918…20581308055018044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.437 × 10⁹⁶(97-digit number)
24378483460257655837…41162616110036088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.875 × 10⁹⁶(97-digit number)
48756966920515311675…82325232220072177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.751 × 10⁹⁶(97-digit number)
97513933841030623351…64650464440144355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.950 × 10⁹⁷(98-digit number)
19502786768206124670…29300928880288711681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.900 × 10⁹⁷(98-digit number)
39005573536412249340…58601857760577423361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.801 × 10⁹⁷(98-digit number)
78011147072824498681…17203715521154846721
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,716,181 XPM·at block #6,809,014 · 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