Block #2,262,555

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/22/2017, 4:25:35 AM · Difficulty 10.9521 · 4,553,474 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d799d4789cd3eba22ec46e7739f46d4335ad9c233d337de6bcf9ffc946529b0d

Height

#2,262,555

Difficulty

10.952121

Transactions

4

Size

1.43 KB

Version

2

Bits

0af3be35

Nonce

1,539,931,739

Timestamp

8/22/2017, 4:25:35 AM

Confirmations

4,553,474

Merkle Root

9eeae0da7f0af413783c06cf443b452215cff7e59646e3cf37f7139200aed738
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.

3.881 × 10⁹⁴(95-digit number)
38816336716247268271…86542754473326039839
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
3.881 × 10⁹⁴(95-digit number)
38816336716247268271…86542754473326039839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.763 × 10⁹⁴(95-digit number)
77632673432494536543…73085508946652079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.552 × 10⁹⁵(96-digit number)
15526534686498907308…46171017893304159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.105 × 10⁹⁵(96-digit number)
31053069372997814617…92342035786608318719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.210 × 10⁹⁵(96-digit number)
62106138745995629235…84684071573216637439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.242 × 10⁹⁶(97-digit number)
12421227749199125847…69368143146433274879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.484 × 10⁹⁶(97-digit number)
24842455498398251694…38736286292866549759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.968 × 10⁹⁶(97-digit number)
49684910996796503388…77472572585733099519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.936 × 10⁹⁶(97-digit number)
99369821993593006776…54945145171466199039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.987 × 10⁹⁷(98-digit number)
19873964398718601355…09890290342932398079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.974 × 10⁹⁷(98-digit number)
39747928797437202710…19780580685864796159
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,772,345 XPM·at block #6,816,028 · 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