Block #2,275,857

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/31/2017, 5:36:46 AM · Difficulty 10.9550 · 4,569,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1271616380a2c5c8dfeb4abc10db9131592d795927dfecd74ec8a36959854498

Height

#2,275,857

Difficulty

10.954998

Transactions

2

Size

427 B

Version

2

Bits

0af47ac2

Nonce

363,456,427

Timestamp

8/31/2017, 5:36:46 AM

Confirmations

4,569,316

Merkle Root

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

1.096 × 10⁹⁶(97-digit number)
10966239799983118216…51559353054109813759
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
1.096 × 10⁹⁶(97-digit number)
10966239799983118216…51559353054109813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.193 × 10⁹⁶(97-digit number)
21932479599966236432…03118706108219627519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.386 × 10⁹⁶(97-digit number)
43864959199932472864…06237412216439255039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.772 × 10⁹⁶(97-digit number)
87729918399864945728…12474824432878510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.754 × 10⁹⁷(98-digit number)
17545983679972989145…24949648865757020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.509 × 10⁹⁷(98-digit number)
35091967359945978291…49899297731514040319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.018 × 10⁹⁷(98-digit number)
70183934719891956582…99798595463028080639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.403 × 10⁹⁸(99-digit number)
14036786943978391316…99597190926056161279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.807 × 10⁹⁸(99-digit number)
28073573887956782633…99194381852112322559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.614 × 10⁹⁸(99-digit number)
56147147775913565266…98388763704224645119
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:58,005,814 XPM·at block #6,845,172 · 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