Block #355,187

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 11:48:05 PM · Difficulty 10.3586 · 6,457,184 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aaf251d509bbcb0e3bde98f03997d8d7f8c587ab4baef2ca1c5bdfc5c151a903

Height

#355,187

Difficulty

10.358631

Transactions

5

Size

1.08 KB

Version

2

Bits

0a5bcf38

Nonce

168,263

Timestamp

1/11/2014, 11:48:05 PM

Confirmations

6,457,184

Merkle Root

15abba020f823f266131d5015721357eebcac06eb59ef0252d83abd297ef0d2c
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.

5.035 × 10⁹⁹(100-digit number)
50357826670329968787…74445279810827467499
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
5.035 × 10⁹⁹(100-digit number)
50357826670329968787…74445279810827467499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.007 × 10¹⁰⁰(101-digit number)
10071565334065993757…48890559621654934999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.014 × 10¹⁰⁰(101-digit number)
20143130668131987514…97781119243309869999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.028 × 10¹⁰⁰(101-digit number)
40286261336263975029…95562238486619739999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.057 × 10¹⁰⁰(101-digit number)
80572522672527950059…91124476973239479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.611 × 10¹⁰¹(102-digit number)
16114504534505590011…82248953946478959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.222 × 10¹⁰¹(102-digit number)
32229009069011180023…64497907892957919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.445 × 10¹⁰¹(102-digit number)
64458018138022360047…28995815785915839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.289 × 10¹⁰²(103-digit number)
12891603627604472009…57991631571831679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.578 × 10¹⁰²(103-digit number)
25783207255208944019…15983263143663359999
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,989 XPM·at block #6,812,370 · 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