Block #2,261,467

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2017, 10:02:42 AM · Difficulty 10.9522 · 4,579,891 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f6771557178011333dcfe6997c861f15307a2fa8a5ccd6badc5f22d3a980d88

Height

#2,261,467

Difficulty

10.952234

Transactions

4

Size

2.45 KB

Version

2

Bits

0af3c597

Nonce

1,115,110,525

Timestamp

8/21/2017, 10:02:42 AM

Confirmations

4,579,891

Merkle Root

1de09b51e3191381ccd92cb1c8cd33bcb64559e63fcd8871e914a9980c5fdfea
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.567 × 10⁹⁶(97-digit number)
15677932585334814890…46320702718049761279
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.567 × 10⁹⁶(97-digit number)
15677932585334814890…46320702718049761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.135 × 10⁹⁶(97-digit number)
31355865170669629781…92641405436099522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.271 × 10⁹⁶(97-digit number)
62711730341339259562…85282810872199045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.254 × 10⁹⁷(98-digit number)
12542346068267851912…70565621744398090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.508 × 10⁹⁷(98-digit number)
25084692136535703825…41131243488796180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.016 × 10⁹⁷(98-digit number)
50169384273071407650…82262486977592360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.003 × 10⁹⁸(99-digit number)
10033876854614281530…64524973955184721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.006 × 10⁹⁸(99-digit number)
20067753709228563060…29049947910369443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.013 × 10⁹⁸(99-digit number)
40135507418457126120…58099895820738887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.027 × 10⁹⁸(99-digit number)
80271014836914252240…16199791641477775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.605 × 10⁹⁹(100-digit number)
16054202967382850448…32399583282955550719
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,975,232 XPM·at block #6,841,357 · 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