Block #2,771,997

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/30/2018, 3:44:21 PM · Difficulty 11.6631 · 4,070,228 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54f3cfcee0fa6235bfecf7b6fc5071605ece0c4635e5295f57d0e227f28ab511

Height

#2,771,997

Difficulty

11.663101

Transactions

40

Size

11.24 KB

Version

2

Bits

0ba9c101

Nonce

767,721,568

Timestamp

7/30/2018, 3:44:21 PM

Confirmations

4,070,228

Merkle Root

fe5eabd7d3d5a81b24123d1e73abcd7ed15f8a6b180e428e4e43630b859b2d31
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.751 × 10⁹³(94-digit number)
97512951622715761603…19556836296000153599
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.751 × 10⁹³(94-digit number)
97512951622715761603…19556836296000153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.950 × 10⁹⁴(95-digit number)
19502590324543152320…39113672592000307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.900 × 10⁹⁴(95-digit number)
39005180649086304641…78227345184000614399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.801 × 10⁹⁴(95-digit number)
78010361298172609283…56454690368001228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.560 × 10⁹⁵(96-digit number)
15602072259634521856…12909380736002457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.120 × 10⁹⁵(96-digit number)
31204144519269043713…25818761472004915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.240 × 10⁹⁵(96-digit number)
62408289038538087426…51637522944009830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.248 × 10⁹⁶(97-digit number)
12481657807707617485…03275045888019660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.496 × 10⁹⁶(97-digit number)
24963315615415234970…06550091776039321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.992 × 10⁹⁶(97-digit number)
49926631230830469941…13100183552078643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.985 × 10⁹⁶(97-digit number)
99853262461660939882…26200367104157286399
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,198 XPM·at block #6,842,224 · 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