Block #2,747,177

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/13/2018, 1:24:22 PM · Difficulty 11.6485 · 4,097,382 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36a4040243154741d1ce8ecf4c9cbd1db2b2f15db2cd8ce87ed7ad1b6a79f7c6

Height

#2,747,177

Difficulty

11.648506

Transactions

6

Size

1.72 KB

Version

2

Bits

0ba6047f

Nonce

1,258,222,761

Timestamp

7/13/2018, 1:24:22 PM

Confirmations

4,097,382

Merkle Root

971c1f9cedeb8b16f8a7b88cbf2b42132c0945c1baf173e2f4f12e01f4da7733
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.

9.984 × 10⁹⁴(95-digit number)
99840228707822940521…14175826254124902399
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
9.984 × 10⁹⁴(95-digit number)
99840228707822940521…14175826254124902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.996 × 10⁹⁵(96-digit number)
19968045741564588104…28351652508249804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.993 × 10⁹⁵(96-digit number)
39936091483129176208…56703305016499609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.987 × 10⁹⁵(96-digit number)
79872182966258352417…13406610032999219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.597 × 10⁹⁶(97-digit number)
15974436593251670483…26813220065998438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.194 × 10⁹⁶(97-digit number)
31948873186503340966…53626440131996876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.389 × 10⁹⁶(97-digit number)
63897746373006681933…07252880263993753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.277 × 10⁹⁷(98-digit number)
12779549274601336386…14505760527987507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.555 × 10⁹⁷(98-digit number)
25559098549202672773…29011521055975014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.111 × 10⁹⁷(98-digit number)
51118197098405345547…58023042111950028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.022 × 10⁹⁸(99-digit number)
10223639419681069109…16046084223900057599
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:58,000,874 XPM·at block #6,844,558 · 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