Block #2,720,692

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2018, 11:47:09 AM · Difficulty 11.6134 · 4,121,551 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f4808e870e1f2ebeb658415d7019a5922194142041614c03535a5a2adf18b18

Height

#2,720,692

Difficulty

11.613427

Transactions

6

Size

1.34 KB

Version

2

Bits

0b9d098e

Nonce

2,115,426,183

Timestamp

6/25/2018, 11:47:09 AM

Confirmations

4,121,551

Merkle Root

c8a02078b24f8381ebf737e90a4c30b910129e904c34b44d8cf204a5a7017d91
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.

4.430 × 10⁹⁵(96-digit number)
44309695827136028111…27386157139974328319
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
4.430 × 10⁹⁵(96-digit number)
44309695827136028111…27386157139974328319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.861 × 10⁹⁵(96-digit number)
88619391654272056223…54772314279948656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.772 × 10⁹⁶(97-digit number)
17723878330854411244…09544628559897313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.544 × 10⁹⁶(97-digit number)
35447756661708822489…19089257119794626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.089 × 10⁹⁶(97-digit number)
70895513323417644979…38178514239589253119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.417 × 10⁹⁷(98-digit number)
14179102664683528995…76357028479178506239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.835 × 10⁹⁷(98-digit number)
28358205329367057991…52714056958357012479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.671 × 10⁹⁷(98-digit number)
56716410658734115983…05428113916714024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.134 × 10⁹⁸(99-digit number)
11343282131746823196…10856227833428049919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.268 × 10⁹⁸(99-digit number)
22686564263493646393…21712455666856099839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.537 × 10⁹⁸(99-digit number)
45373128526987292786…43424911333712199679
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,342 XPM·at block #6,842,242 · 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