Block #2,727,701

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/30/2018, 5:36:09 AM · Difficulty 11.6272 · 4,115,223 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5303a3ebdb0f335ba24c19d8f9abdef0fbc5fd84c40466367a548a132378f28a

Height

#2,727,701

Difficulty

11.627203

Transactions

5

Size

1.89 KB

Version

2

Bits

0ba09064

Nonce

141,788,925

Timestamp

6/30/2018, 5:36:09 AM

Confirmations

4,115,223

Merkle Root

117a61c2be61c8289c72906907ca657c69cb1b2b00901e21cd9ebd70798a4e82
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.572 × 10⁹⁴(95-digit number)
15722064202467840700…61168978514631672439
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.572 × 10⁹⁴(95-digit number)
15722064202467840700…61168978514631672439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.144 × 10⁹⁴(95-digit number)
31444128404935681401…22337957029263344879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.288 × 10⁹⁴(95-digit number)
62888256809871362803…44675914058526689759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.257 × 10⁹⁵(96-digit number)
12577651361974272560…89351828117053379519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.515 × 10⁹⁵(96-digit number)
25155302723948545121…78703656234106759039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.031 × 10⁹⁵(96-digit number)
50310605447897090242…57407312468213518079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.006 × 10⁹⁶(97-digit number)
10062121089579418048…14814624936427036159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.012 × 10⁹⁶(97-digit number)
20124242179158836097…29629249872854072319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.024 × 10⁹⁶(97-digit number)
40248484358317672194…59258499745708144639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.049 × 10⁹⁶(97-digit number)
80496968716635344388…18516999491416289279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.609 × 10⁹⁷(98-digit number)
16099393743327068877…37033998982832578559
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,987,740 XPM·at block #6,842,923 · 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