Block #2,271,272

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2017, 3:46:11 AM · Difficulty 10.9535 · 4,560,571 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
10a7f6a519b403b4ca4e0bc8b5584f8f88d6a0c69bd5bee1f062cb3100e71684

Height

#2,271,272

Difficulty

10.953472

Transactions

9

Size

3.40 KB

Version

2

Bits

0af416bb

Nonce

929,590,365

Timestamp

8/28/2017, 3:46:11 AM

Confirmations

4,560,571

Merkle Root

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

9.258 × 10⁹⁴(95-digit number)
92584500310385432450…57762510850198246399
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
9.258 × 10⁹⁴(95-digit number)
92584500310385432450…57762510850198246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.851 × 10⁹⁵(96-digit number)
18516900062077086490…15525021700396492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.703 × 10⁹⁵(96-digit number)
37033800124154172980…31050043400792985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.406 × 10⁹⁵(96-digit number)
74067600248308345960…62100086801585971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.481 × 10⁹⁶(97-digit number)
14813520049661669192…24200173603171942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.962 × 10⁹⁶(97-digit number)
29627040099323338384…48400347206343884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.925 × 10⁹⁶(97-digit number)
59254080198646676768…96800694412687769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.185 × 10⁹⁷(98-digit number)
11850816039729335353…93601388825375539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.370 × 10⁹⁷(98-digit number)
23701632079458670707…87202777650751078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.740 × 10⁹⁷(98-digit number)
47403264158917341414…74405555301502156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.480 × 10⁹⁷(98-digit number)
94806528317834682829…48811110603004313599
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,898,864 XPM·at block #6,831,842 · 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