Block #358,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 11:56:23 PM · Difficulty 10.3883 · 6,453,969 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c0b2d96c8f885aeff687e9dee78d3a811b1ed89c68b79f9500beec7ebea980c

Height

#358,299

Difficulty

10.388292

Transactions

13

Size

4.03 KB

Version

2

Bits

0a636718

Nonce

120,540

Timestamp

1/13/2014, 11:56:23 PM

Confirmations

6,453,969

Merkle Root

585f13cdb5bd359d9567ea0ae49b0e8659cbb7af9e5ded2fdc06c5d4b19efa74
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.969 × 10⁹⁹(100-digit number)
19698930275363900015…26267294473321230799
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.969 × 10⁹⁹(100-digit number)
19698930275363900015…26267294473321230799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.939 × 10⁹⁹(100-digit number)
39397860550727800030…52534588946642461599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.879 × 10⁹⁹(100-digit number)
78795721101455600061…05069177893284923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.575 × 10¹⁰⁰(101-digit number)
15759144220291120012…10138355786569846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.151 × 10¹⁰⁰(101-digit number)
31518288440582240024…20276711573139692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.303 × 10¹⁰⁰(101-digit number)
63036576881164480049…40553423146279385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.260 × 10¹⁰¹(102-digit number)
12607315376232896009…81106846292558771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.521 × 10¹⁰¹(102-digit number)
25214630752465792019…62213692585117542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.042 × 10¹⁰¹(102-digit number)
50429261504931584039…24427385170235084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.008 × 10¹⁰²(103-digit number)
10085852300986316807…48854770340470169599
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,742,161 XPM·at block #6,812,267 · 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