1. #6,837,2702CC10 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #2,100,191

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2017, 1:03:30 AM · Difficulty 10.8554 · 4,737,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd1be9004320a793b7b32dc12f7d5544919f3bd97009766eaee0b92c31dd6dd4

Height

#2,100,191

Difficulty

10.855368

Transactions

2

Size

1.28 KB

Version

2

Bits

0adaf966

Nonce

1,502,442,871

Timestamp

5/5/2017, 1:03:30 AM

Confirmations

4,737,082

Merkle Root

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

9.044 × 10⁹⁴(95-digit number)
90448085150968376626…80906434555369284479
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.044 × 10⁹⁴(95-digit number)
90448085150968376626…80906434555369284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.808 × 10⁹⁵(96-digit number)
18089617030193675325…61812869110738568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.617 × 10⁹⁵(96-digit number)
36179234060387350650…23625738221477137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.235 × 10⁹⁵(96-digit number)
72358468120774701300…47251476442954275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.447 × 10⁹⁶(97-digit number)
14471693624154940260…94502952885908551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.894 × 10⁹⁶(97-digit number)
28943387248309880520…89005905771817103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.788 × 10⁹⁶(97-digit number)
57886774496619761040…78011811543634206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.157 × 10⁹⁷(98-digit number)
11577354899323952208…56023623087268413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.315 × 10⁹⁷(98-digit number)
23154709798647904416…12047246174536826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.630 × 10⁹⁷(98-digit number)
46309419597295808832…24094492349073653759
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:57,942,495 XPM·at block #6,837,272 · 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