Block #2,745,031

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/12/2018, 2:12:49 AM · Difficulty 11.6462 · 4,098,062 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f49b8e54fce8762777a0cbcd6488c90de6ba12de4b6fe4aa4c0813c1c7befa8

Height

#2,745,031

Difficulty

11.646184

Transactions

6

Size

1.97 KB

Version

2

Bits

0ba56c55

Nonce

1,099,393,622

Timestamp

7/12/2018, 2:12:49 AM

Confirmations

4,098,062

Merkle Root

6ea42fd4532375ed28ea8ee8cb8218b246ae83e9ce25c15cb0a0e618767a4c1c
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.887 × 10⁹⁵(96-digit number)
18871276771331780682…18977439950463238139
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.887 × 10⁹⁵(96-digit number)
18871276771331780682…18977439950463238139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.774 × 10⁹⁵(96-digit number)
37742553542663561364…37954879900926476279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.548 × 10⁹⁵(96-digit number)
75485107085327122728…75909759801852952559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.509 × 10⁹⁶(97-digit number)
15097021417065424545…51819519603705905119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.019 × 10⁹⁶(97-digit number)
30194042834130849091…03639039207411810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.038 × 10⁹⁶(97-digit number)
60388085668261698182…07278078414823620479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.207 × 10⁹⁷(98-digit number)
12077617133652339636…14556156829647240959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.415 × 10⁹⁷(98-digit number)
24155234267304679273…29112313659294481919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.831 × 10⁹⁷(98-digit number)
48310468534609358546…58224627318588963839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.662 × 10⁹⁷(98-digit number)
96620937069218717092…16449254637177927679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.932 × 10⁹⁸(99-digit number)
19324187413843743418…32898509274355855359
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,989,107 XPM·at block #6,843,092 · 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