Block #305,246

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 9:32:24 AM · Difficulty 9.9936 · 6,519,300 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36ef6f5d9bf3a3812d5ddc423ddc0d3c8aeba2564690fade59cd304ec2d814f2

Height

#305,246

Difficulty

9.993550

Transactions

6

Size

1.73 KB

Version

2

Bits

09fe5950

Nonce

17,244

Timestamp

12/11/2013, 9:32:24 AM

Confirmations

6,519,300

Merkle Root

02b3340e8006a42e6b566843a8d8ab6c121314f67b20a6152b4c18af01470f53
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.

6.189 × 10⁹³(94-digit number)
61893896604148807266…05379546320465525759
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
6.189 × 10⁹³(94-digit number)
61893896604148807266…05379546320465525759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.237 × 10⁹⁴(95-digit number)
12378779320829761453…10759092640931051519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.475 × 10⁹⁴(95-digit number)
24757558641659522906…21518185281862103039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.951 × 10⁹⁴(95-digit number)
49515117283319045812…43036370563724206079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.903 × 10⁹⁴(95-digit number)
99030234566638091625…86072741127448412159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.980 × 10⁹⁵(96-digit number)
19806046913327618325…72145482254896824319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.961 × 10⁹⁵(96-digit number)
39612093826655236650…44290964509793648639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.922 × 10⁹⁵(96-digit number)
79224187653310473300…88581929019587297279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.584 × 10⁹⁶(97-digit number)
15844837530662094660…77163858039174594559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.168 × 10⁹⁶(97-digit number)
31689675061324189320…54327716078349189119
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,840,430 XPM·at block #6,824,545 · 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