Block #278,265

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 10:06:36 PM · Difficulty 9.9685 · 6,548,923 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf02dfc8fee260603c3a4d1c43851c2e3aee4235cbedda2c3b04e380176a5480

Height

#278,265

Difficulty

9.968481

Transactions

2

Size

1.05 KB

Version

2

Bits

09f7ee5f

Nonce

4,612

Timestamp

11/27/2013, 10:06:36 PM

Confirmations

6,548,923

Merkle Root

feb14bb119e83cc3cbeb16170c9be400a4098bc2cd7f3cca7e6cd1f55f2ef965
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.

3.222 × 10¹⁰⁴(105-digit number)
32222374045203592607…77538152678599850239
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
3.222 × 10¹⁰⁴(105-digit number)
32222374045203592607…77538152678599850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.444 × 10¹⁰⁴(105-digit number)
64444748090407185215…55076305357199700479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.288 × 10¹⁰⁵(106-digit number)
12888949618081437043…10152610714399400959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.577 × 10¹⁰⁵(106-digit number)
25777899236162874086…20305221428798801919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.155 × 10¹⁰⁵(106-digit number)
51555798472325748172…40610442857597603839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.031 × 10¹⁰⁶(107-digit number)
10311159694465149634…81220885715195207679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.062 × 10¹⁰⁶(107-digit number)
20622319388930299268…62441771430390415359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.124 × 10¹⁰⁶(107-digit number)
41244638777860598537…24883542860780830719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.248 × 10¹⁰⁶(107-digit number)
82489277555721197075…49767085721561661439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.649 × 10¹⁰⁷(108-digit number)
16497855511144239415…99534171443123322879
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,861,601 XPM·at block #6,827,187 · 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