Block #3,055,714

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2019, 6:07:56 PM · Difficulty 11.0080 · 3,777,768 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62ec91b75136dd76dd8878188d00c4c13fadf201d5f08b10f21591ad4f9950be

Height

#3,055,714

Difficulty

11.008028

Transactions

2

Size

1.28 KB

Version

2

Bits

0b020e25

Nonce

313,669,756

Timestamp

2/16/2019, 6:07:56 PM

Confirmations

3,777,768

Merkle Root

8321bd2e412574f3cce270e7a3bef0303cc842ea517f97935b779d2435cd9353
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.

1.156 × 10⁹⁶(97-digit number)
11563193373866075588…40958049617969459199
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.156 × 10⁹⁶(97-digit number)
11563193373866075588…40958049617969459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.312 × 10⁹⁶(97-digit number)
23126386747732151176…81916099235938918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.625 × 10⁹⁶(97-digit number)
46252773495464302352…63832198471877836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.250 × 10⁹⁶(97-digit number)
92505546990928604704…27664396943755673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.850 × 10⁹⁷(98-digit number)
18501109398185720940…55328793887511347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.700 × 10⁹⁷(98-digit number)
37002218796371441881…10657587775022694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.400 × 10⁹⁷(98-digit number)
74004437592742883763…21315175550045388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.480 × 10⁹⁸(99-digit number)
14800887518548576752…42630351100090777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.960 × 10⁹⁸(99-digit number)
29601775037097153505…85260702200181555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.920 × 10⁹⁸(99-digit number)
59203550074194307011…70521404400363110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.184 × 10⁹⁹(100-digit number)
11840710014838861402…41042808800726220799
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,912,060 XPM·at block #6,833,481 · 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