Block #2,278,714

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2017, 3:57:17 AM · Difficulty 10.9558 · 4,552,473 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d2888306c09c40e64c19a3da5a5802f783978242c6c3770cc3a166b00afebf23

Height

#2,278,714

Difficulty

10.955772

Transactions

34

Size

11.24 KB

Version

2

Bits

0af4ad73

Nonce

1,052,657,806

Timestamp

9/2/2017, 3:57:17 AM

Confirmations

4,552,473

Merkle Root

dceb3bfb1b8fee7075ea3691eb6edb663c0eed0b6fe4b4215797959bcb0b1320
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.270 × 10⁹⁶(97-digit number)
22709910525129553829…81345333964574538239
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.270 × 10⁹⁶(97-digit number)
22709910525129553829…81345333964574538239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.541 × 10⁹⁶(97-digit number)
45419821050259107658…62690667929149076479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.083 × 10⁹⁶(97-digit number)
90839642100518215317…25381335858298152959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.816 × 10⁹⁷(98-digit number)
18167928420103643063…50762671716596305919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.633 × 10⁹⁷(98-digit number)
36335856840207286127…01525343433192611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.267 × 10⁹⁷(98-digit number)
72671713680414572254…03050686866385223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.453 × 10⁹⁸(99-digit number)
14534342736082914450…06101373732770447359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.906 × 10⁹⁸(99-digit number)
29068685472165828901…12202747465540894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.813 × 10⁹⁸(99-digit number)
58137370944331657803…24405494931081789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.162 × 10⁹⁹(100-digit number)
11627474188866331560…48810989862163578879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.325 × 10⁹⁹(100-digit number)
23254948377732663121…97621979724327157759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,893,640 XPM·at block #6,831,186 · 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