Block #2,742,400

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/10/2018, 9:47:41 AM · Difficulty 11.6312 · 4,090,372 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8880ada331b4886cc38eea9f492cd7be0a9e4b436b295b39364554f1606f2b0

Height

#2,742,400

Difficulty

11.631173

Transactions

5

Size

1.73 KB

Version

2

Bits

0ba19495

Nonce

144,591,581

Timestamp

7/10/2018, 9:47:41 AM

Confirmations

4,090,372

Merkle Root

1cf1b3a30f57d8d3548282bd84c36de8bb733eff3d87c81ec91fcee028ec4dd5
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.701 × 10⁹⁵(96-digit number)
17013234213482276973…02115248214590252799
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.701 × 10⁹⁵(96-digit number)
17013234213482276973…02115248214590252799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.402 × 10⁹⁵(96-digit number)
34026468426964553946…04230496429180505599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.805 × 10⁹⁵(96-digit number)
68052936853929107892…08460992858361011199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.361 × 10⁹⁶(97-digit number)
13610587370785821578…16921985716722022399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.722 × 10⁹⁶(97-digit number)
27221174741571643157…33843971433444044799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.444 × 10⁹⁶(97-digit number)
54442349483143286314…67687942866888089599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.088 × 10⁹⁷(98-digit number)
10888469896628657262…35375885733776179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.177 × 10⁹⁷(98-digit number)
21776939793257314525…70751771467552358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.355 × 10⁹⁷(98-digit number)
43553879586514629051…41503542935104716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.710 × 10⁹⁷(98-digit number)
87107759173029258102…83007085870209433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.742 × 10⁹⁸(99-digit number)
17421551834605851620…66014171740418867199
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,906,340 XPM·at block #6,832,771 · 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