Block #2,761,624

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2018, 12:46:38 PM · Difficulty 11.6551 · 4,072,112 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba1ad4a5580e004e82dd291f22dde414173755bfea5fc133caf456515648f89b

Height

#2,761,624

Difficulty

11.655075

Transactions

5

Size

1.74 KB

Version

2

Bits

0ba7b2ff

Nonce

2,025,939,901

Timestamp

7/23/2018, 12:46:38 PM

Confirmations

4,072,112

Merkle Root

533d417700edbf23e01ce2c7835eef9232b7ddbcc932762247d2fe83797fc19f
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.

5.768 × 10⁹⁷(98-digit number)
57680580167841060015…78056492808950292479
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
5.768 × 10⁹⁷(98-digit number)
57680580167841060015…78056492808950292479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.153 × 10⁹⁸(99-digit number)
11536116033568212003…56112985617900584959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.307 × 10⁹⁸(99-digit number)
23072232067136424006…12225971235801169919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.614 × 10⁹⁸(99-digit number)
46144464134272848012…24451942471602339839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.228 × 10⁹⁸(99-digit number)
92288928268545696024…48903884943204679679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.845 × 10⁹⁹(100-digit number)
18457785653709139204…97807769886409359359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.691 × 10⁹⁹(100-digit number)
36915571307418278409…95615539772818718719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.383 × 10⁹⁹(100-digit number)
73831142614836556819…91231079545637437439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.476 × 10¹⁰⁰(101-digit number)
14766228522967311363…82462159091274874879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.953 × 10¹⁰⁰(101-digit number)
29532457045934622727…64924318182549749759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.906 × 10¹⁰⁰(101-digit number)
59064914091869245455…29848636365099499519
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,914,105 XPM·at block #6,833,735 · 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