Block #278,143

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 8:55:23 PM · Difficulty 9.9682 · 6,546,418 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
52689dad41aa1a5f55eab8a2f8c53756bfaedf780b8d39ea8712ebaadb1bfdaa

Height

#278,143

Difficulty

9.968167

Transactions

1

Size

1.15 KB

Version

2

Bits

09f7d9d3

Nonce

34,795

Timestamp

11/27/2013, 8:55:23 PM

Confirmations

6,546,418

Merkle Root

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

2.017 × 10⁹⁶(97-digit number)
20172774698535573611…82128578414317363199
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
2.017 × 10⁹⁶(97-digit number)
20172774698535573611…82128578414317363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.034 × 10⁹⁶(97-digit number)
40345549397071147222…64257156828634726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.069 × 10⁹⁶(97-digit number)
80691098794142294444…28514313657269452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.613 × 10⁹⁷(98-digit number)
16138219758828458888…57028627314538905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.227 × 10⁹⁷(98-digit number)
32276439517656917777…14057254629077811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.455 × 10⁹⁷(98-digit number)
64552879035313835555…28114509258155622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.291 × 10⁹⁸(99-digit number)
12910575807062767111…56229018516311244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.582 × 10⁹⁸(99-digit number)
25821151614125534222…12458037032622489599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.164 × 10⁹⁸(99-digit number)
51642303228251068444…24916074065244979199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.032 × 10⁹⁹(100-digit number)
10328460645650213688…49832148130489958399
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,840,552 XPM·at block #6,824,560 · 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