Block #2,613,167

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2018, 7:00:19 AM · Difficulty 11.2089 · 4,229,088 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2a9c99200c2becfe4654f1e73f501a7864ee05e406ad6a699c1592fb1ddb62d

Height

#2,613,167

Difficulty

11.208875

Transactions

4

Size

1.45 KB

Version

2

Bits

0b3578d0

Nonce

216,140,731

Timestamp

4/14/2018, 7:00:19 AM

Confirmations

4,229,088

Merkle Root

2e01b59b86257e6c47d8894771d12e2c5f954eb7b5918304d41c9e03270d3eb4
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.

2.806 × 10⁹⁴(95-digit number)
28069072168491759452…44707460988188044799
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
2.806 × 10⁹⁴(95-digit number)
28069072168491759452…44707460988188044799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.613 × 10⁹⁴(95-digit number)
56138144336983518905…89414921976376089599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.122 × 10⁹⁵(96-digit number)
11227628867396703781…78829843952752179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.245 × 10⁹⁵(96-digit number)
22455257734793407562…57659687905504358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.491 × 10⁹⁵(96-digit number)
44910515469586815124…15319375811008716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.982 × 10⁹⁵(96-digit number)
89821030939173630248…30638751622017433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.796 × 10⁹⁶(97-digit number)
17964206187834726049…61277503244034867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.592 × 10⁹⁶(97-digit number)
35928412375669452099…22555006488069734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.185 × 10⁹⁶(97-digit number)
71856824751338904199…45110012976139468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.437 × 10⁹⁷(98-digit number)
14371364950267780839…90220025952278937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.874 × 10⁹⁷(98-digit number)
28742729900535561679…80440051904557875199
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,982,437 XPM·at block #6,842,254 · 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