Block #305,754

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 4:22:01 PM · Difficulty 9.9937 · 6,505,348 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aeefd30cc22464e7e17350a5e03880d9b3298d60fda7c3843e36b81bd76625cf

Height

#305,754

Difficulty

9.993679

Transactions

8

Size

2.27 KB

Version

2

Bits

09fe61c0

Nonce

9,780

Timestamp

12/11/2013, 4:22:01 PM

Confirmations

6,505,348

Merkle Root

f779a8a6acb0a0fc735905fe1cb5a94296675f631197722e79602c71837b99a5
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.313 × 10⁹⁴(95-digit number)
13134208095552135883…68225083502640102399
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.313 × 10⁹⁴(95-digit number)
13134208095552135883…68225083502640102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.626 × 10⁹⁴(95-digit number)
26268416191104271767…36450167005280204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.253 × 10⁹⁴(95-digit number)
52536832382208543535…72900334010560409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.050 × 10⁹⁵(96-digit number)
10507366476441708707…45800668021120819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.101 × 10⁹⁵(96-digit number)
21014732952883417414…91601336042241638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.202 × 10⁹⁵(96-digit number)
42029465905766834828…83202672084483276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.405 × 10⁹⁵(96-digit number)
84058931811533669656…66405344168966553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.681 × 10⁹⁶(97-digit number)
16811786362306733931…32810688337933107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.362 × 10⁹⁶(97-digit number)
33623572724613467862…65621376675866214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.724 × 10⁹⁶(97-digit number)
67247145449226935725…31242753351732428799
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,732,925 XPM·at block #6,811,101 · 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