Block #2,286,171

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/7/2017, 9:01:24 AM · Difficulty 10.9556 · 4,544,505 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9a0647b261f8e934810c239625d805d579707182b833a1f7968c84cf933756e4

Height

#2,286,171

Difficulty

10.955574

Transactions

2

Size

426 B

Version

2

Bits

0af4a085

Nonce

259,066,008

Timestamp

9/7/2017, 9:01:24 AM

Confirmations

4,544,505

Merkle Root

827a673923a7323d26b624fa1154e02e329ee8a92a35124a90b028be36bbdc0c
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.518 × 10⁹⁷(98-digit number)
15180389306692912973…36690565513756456959
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.518 × 10⁹⁷(98-digit number)
15180389306692912973…36690565513756456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.036 × 10⁹⁷(98-digit number)
30360778613385825946…73381131027512913919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.072 × 10⁹⁷(98-digit number)
60721557226771651892…46762262055025827839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.214 × 10⁹⁸(99-digit number)
12144311445354330378…93524524110051655679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.428 × 10⁹⁸(99-digit number)
24288622890708660756…87049048220103311359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.857 × 10⁹⁸(99-digit number)
48577245781417321513…74098096440206622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.715 × 10⁹⁸(99-digit number)
97154491562834643027…48196192880413245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.943 × 10⁹⁹(100-digit number)
19430898312566928605…96392385760826490879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.886 × 10⁹⁹(100-digit number)
38861796625133857210…92784771521652981759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.772 × 10⁹⁹(100-digit number)
77723593250267714421…85569543043305963519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.554 × 10¹⁰⁰(101-digit number)
15544718650053542884…71139086086611927039
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,889,537 XPM·at block #6,830,675 · 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