Block #495,314

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2014, 2:05:09 PM · Difficulty 10.7347 · 6,320,844 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ccbfa156c82ef4347c6164b2c582a5c7c6681b47a8ffaa1b2af225b578a8e394

Height

#495,314

Difficulty

10.734698

Transactions

12

Size

7.26 KB

Version

2

Bits

0abc1529

Nonce

9,083,040

Timestamp

4/16/2014, 2:05:09 PM

Confirmations

6,320,844

Merkle Root

56571308b6b584ff16e629eda2402758bf359046231db0bab629ae6916a434a5
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.

7.542 × 10⁹⁴(95-digit number)
75425156187361253582…36038759451885037439
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
7.542 × 10⁹⁴(95-digit number)
75425156187361253582…36038759451885037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.508 × 10⁹⁵(96-digit number)
15085031237472250716…72077518903770074879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.017 × 10⁹⁵(96-digit number)
30170062474944501432…44155037807540149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.034 × 10⁹⁵(96-digit number)
60340124949889002865…88310075615080299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.206 × 10⁹⁶(97-digit number)
12068024989977800573…76620151230160599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.413 × 10⁹⁶(97-digit number)
24136049979955601146…53240302460321198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.827 × 10⁹⁶(97-digit number)
48272099959911202292…06480604920642396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.654 × 10⁹⁶(97-digit number)
96544199919822404585…12961209841284792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.930 × 10⁹⁷(98-digit number)
19308839983964480917…25922419682569584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.861 × 10⁹⁷(98-digit number)
38617679967928961834…51844839365139169279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,773,386 XPM·at block #6,816,157 · 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