Block #304,249

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 8:04:27 PM · Difficulty 9.9933 · 6,513,379 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee42aaf1e9ee2ebf666996f47ebd9ac03990ee840ea35c189eeadb5037996727

Height

#304,249

Difficulty

9.993262

Transactions

4

Size

1.15 KB

Version

2

Bits

09fe466d

Nonce

231,664

Timestamp

12/10/2013, 8:04:27 PM

Confirmations

6,513,379

Merkle Root

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

3.779 × 10⁹¹(92-digit number)
37790606203342384944…24229821659555692159
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
3.779 × 10⁹¹(92-digit number)
37790606203342384944…24229821659555692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.558 × 10⁹¹(92-digit number)
75581212406684769888…48459643319111384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.511 × 10⁹²(93-digit number)
15116242481336953977…96919286638222768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.023 × 10⁹²(93-digit number)
30232484962673907955…93838573276445537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.046 × 10⁹²(93-digit number)
60464969925347815910…87677146552891074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.209 × 10⁹³(94-digit number)
12092993985069563182…75354293105782149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.418 × 10⁹³(94-digit number)
24185987970139126364…50708586211564298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.837 × 10⁹³(94-digit number)
48371975940278252728…01417172423128596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.674 × 10⁹³(94-digit number)
96743951880556505457…02834344846257192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.934 × 10⁹⁴(95-digit number)
19348790376111301091…05668689692514385919
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,785,075 XPM·at block #6,817,627 · 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