Block #228,948

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/26/2013, 8:41:05 PM · Difficulty 9.9381 · 6,596,522 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5f3752470bd2a5e167403322598640733795adba55dd8673bb53cfe646f4169

Height

#228,948

Difficulty

9.938091

Transactions

2

Size

1.50 KB

Version

2

Bits

09f026b9

Nonce

19,047

Timestamp

10/26/2013, 8:41:05 PM

Confirmations

6,596,522

Merkle Root

ca4d56651341943fba966d3744b93a98ddb46fe06a51976e3d7f101c8b972ca2
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.025 × 10⁹⁹(100-digit number)
80251408510963456326…38442041748385854399
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.025 × 10⁹⁹(100-digit number)
80251408510963456326…38442041748385854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.605 × 10¹⁰⁰(101-digit number)
16050281702192691265…76884083496771708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.210 × 10¹⁰⁰(101-digit number)
32100563404385382530…53768166993543417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.420 × 10¹⁰⁰(101-digit number)
64201126808770765061…07536333987086835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.284 × 10¹⁰¹(102-digit number)
12840225361754153012…15072667974173670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.568 × 10¹⁰¹(102-digit number)
25680450723508306024…30145335948347340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.136 × 10¹⁰¹(102-digit number)
51360901447016612048…60290671896694681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.027 × 10¹⁰²(103-digit number)
10272180289403322409…20581343793389363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.054 × 10¹⁰²(103-digit number)
20544360578806644819…41162687586778726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.108 × 10¹⁰²(103-digit number)
41088721157613289639…82325375173557452799
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,847,852 XPM·at block #6,825,469 · 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