Block #358,688

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 7:59:18 AM · Difficulty 10.3846 · 6,466,627 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
25514798b8b6cbb252dc9cc3b5fef8f36b32955b89d0017aae42a527dd62e897

Height

#358,688

Difficulty

10.384589

Transactions

14

Size

6.28 KB

Version

2

Bits

0a627472

Nonce

3,848

Timestamp

1/14/2014, 7:59:18 AM

Confirmations

6,466,627

Merkle Root

41eeb005cb19a4cad9443ee46903123ead0ac0ce98df97ffaf3796149ecfccd7
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.

8.172 × 10⁹⁷(98-digit number)
81725388404775864596…94510754601392729599
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
8.172 × 10⁹⁷(98-digit number)
81725388404775864596…94510754601392729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.634 × 10⁹⁸(99-digit number)
16345077680955172919…89021509202785459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.269 × 10⁹⁸(99-digit number)
32690155361910345838…78043018405570918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.538 × 10⁹⁸(99-digit number)
65380310723820691677…56086036811141836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.307 × 10⁹⁹(100-digit number)
13076062144764138335…12172073622283673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.615 × 10⁹⁹(100-digit number)
26152124289528276670…24344147244567347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.230 × 10⁹⁹(100-digit number)
52304248579056553341…48688294489134694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.046 × 10¹⁰⁰(101-digit number)
10460849715811310668…97376588978269388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.092 × 10¹⁰⁰(101-digit number)
20921699431622621336…94753177956538777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.184 × 10¹⁰⁰(101-digit number)
41843398863245242673…89506355913077555199
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,846,624 XPM·at block #6,825,314 · 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