Block #298,915

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2013, 3:13:41 PM · Difficulty 9.9920 · 6,517,574 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fadac775d757b3e66ca425180dacecbb9d7fbe3a3223a7ca3d91c22173b303cb

Height

#298,915

Difficulty

9.992039

Transactions

4

Size

2.00 KB

Version

2

Bits

09fdf64a

Nonce

7,381

Timestamp

12/7/2013, 3:13:41 PM

Confirmations

6,517,574

Merkle Root

d5b6ab1b264574a173961337ae76879548f6df54130a2e12487d6d56bb68fe3b
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.557 × 10⁹⁵(96-digit number)
15579420158144876231…68981496034710904959
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.557 × 10⁹⁵(96-digit number)
15579420158144876231…68981496034710904959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.115 × 10⁹⁵(96-digit number)
31158840316289752462…37962992069421809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.231 × 10⁹⁵(96-digit number)
62317680632579504924…75925984138843619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.246 × 10⁹⁶(97-digit number)
12463536126515900984…51851968277687239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.492 × 10⁹⁶(97-digit number)
24927072253031801969…03703936555374479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.985 × 10⁹⁶(97-digit number)
49854144506063603939…07407873110748958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.970 × 10⁹⁶(97-digit number)
99708289012127207879…14815746221497917439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.994 × 10⁹⁷(98-digit number)
19941657802425441575…29631492442995834879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.988 × 10⁹⁷(98-digit number)
39883315604850883151…59262984885991669759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.976 × 10⁹⁷(98-digit number)
79766631209701766303…18525969771983339519
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,776,039 XPM·at block #6,816,488 · 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