Block #304,765

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 2:48:57 AM · Difficulty 9.9934 · 6,522,176 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c80d7a30a764d44aea74a4052783adf96d261daed1d0798a288cd75ebbe65ea9

Height

#304,765

Difficulty

9.993423

Transactions

25

Size

12.41 KB

Version

2

Bits

09fe50fa

Nonce

17,735

Timestamp

12/11/2013, 2:48:57 AM

Confirmations

6,522,176

Merkle Root

6cebdf080f340db2f0235ba592ac1f274c6f3081d4b5386e49539daad491a73e
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.047 × 10⁹⁵(96-digit number)
10479484822263203966…76406547558585297469
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.047 × 10⁹⁵(96-digit number)
10479484822263203966…76406547558585297469
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.095 × 10⁹⁵(96-digit number)
20958969644526407932…52813095117170594939
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.191 × 10⁹⁵(96-digit number)
41917939289052815864…05626190234341189879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.383 × 10⁹⁵(96-digit number)
83835878578105631728…11252380468682379759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.676 × 10⁹⁶(97-digit number)
16767175715621126345…22504760937364759519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.353 × 10⁹⁶(97-digit number)
33534351431242252691…45009521874729519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.706 × 10⁹⁶(97-digit number)
67068702862484505382…90019043749459038079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.341 × 10⁹⁷(98-digit number)
13413740572496901076…80038087498918076159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.682 × 10⁹⁷(98-digit number)
26827481144993802153…60076174997836152319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.365 × 10⁹⁷(98-digit number)
53654962289987604306…20152349995672304639
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,859,702 XPM·at block #6,826,940 · 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