Block #2,100,218

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2017, 1:32:30 AM · Difficulty 10.8554 · 4,739,206 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4eac9ef4013f1201f7106500963556b926a19916cbf4afa3552df76495809e56

Height

#2,100,218

Difficulty

10.855364

Transactions

5

Size

1.46 KB

Version

2

Bits

0adaf925

Nonce

407,967,927

Timestamp

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

Confirmations

4,739,206

Merkle Root

66a0db60fb06f6d8b06ad0a61177fc392eb6b5f37f0bc5b16645e85d47c4b40a
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.

8.151 × 10⁹⁴(95-digit number)
81517987665046257467…29366708656533264399
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
8.151 × 10⁹⁴(95-digit number)
81517987665046257467…29366708656533264399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.630 × 10⁹⁵(96-digit number)
16303597533009251493…58733417313066528799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.260 × 10⁹⁵(96-digit number)
32607195066018502986…17466834626133057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.521 × 10⁹⁵(96-digit number)
65214390132037005973…34933669252266115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.304 × 10⁹⁶(97-digit number)
13042878026407401194…69867338504532230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.608 × 10⁹⁶(97-digit number)
26085756052814802389…39734677009064460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.217 × 10⁹⁶(97-digit number)
52171512105629604778…79469354018128921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.043 × 10⁹⁷(98-digit number)
10434302421125920955…58938708036257843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.086 × 10⁹⁷(98-digit number)
20868604842251841911…17877416072515686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.173 × 10⁹⁷(98-digit number)
41737209684503683823…35754832145031372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.347 × 10⁹⁷(98-digit number)
83474419369007367646…71509664290062745599
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,959,681 XPM·at block #6,839,423 · 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