Block #2,277,968

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/1/2017, 4:16:36 PM · Difficulty 10.9553 · 4,552,871 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1d155819eea3e4ecb7ed1b6964805d104851a6062f40b74a409a39865aa8e481

Height

#2,277,968

Difficulty

10.955342

Transactions

2

Size

424 B

Version

2

Bits

0af4914a

Nonce

126,421,111

Timestamp

9/1/2017, 4:16:36 PM

Confirmations

4,552,871

Merkle Root

564efd6fee4f66bd7cc6d104e06ada680fb55fa8e725c12e5a9603e5be59c59c
Transactions (2)
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.735 × 10⁹⁴(95-digit number)
57351121822786504168…81473022537829810279
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.735 × 10⁹⁴(95-digit number)
57351121822786504168…81473022537829810279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.147 × 10⁹⁵(96-digit number)
11470224364557300833…62946045075659620559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.294 × 10⁹⁵(96-digit number)
22940448729114601667…25892090151319241119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.588 × 10⁹⁵(96-digit number)
45880897458229203334…51784180302638482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.176 × 10⁹⁵(96-digit number)
91761794916458406669…03568360605276964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.835 × 10⁹⁶(97-digit number)
18352358983291681333…07136721210553928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.670 × 10⁹⁶(97-digit number)
36704717966583362667…14273442421107857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.340 × 10⁹⁶(97-digit number)
73409435933166725335…28546884842215715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.468 × 10⁹⁷(98-digit number)
14681887186633345067…57093769684431431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.936 × 10⁹⁷(98-digit number)
29363774373266690134…14187539368862863359
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,890,846 XPM·at block #6,830,838 · 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