Block #2,757,572

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2018, 2:27:43 PM · Difficulty 11.6660 · 4,081,835 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
25e0e87ac8a07c086f0ad40663942db681a35098e362ab088703ef3258a4e049

Height

#2,757,572

Difficulty

11.665970

Transactions

3

Size

1.22 KB

Version

2

Bits

0baa7d06

Nonce

371,030,274

Timestamp

7/20/2018, 2:27:43 PM

Confirmations

4,081,835

Merkle Root

867bb363feda525f31376f4cc37ba9f3126b3dba474fd40e990f64473a9a841a
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.

8.849 × 10⁹²(93-digit number)
88494039697504601941…23439059381195824641
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
8.849 × 10⁹²(93-digit number)
88494039697504601941…23439059381195824641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.769 × 10⁹³(94-digit number)
17698807939500920388…46878118762391649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.539 × 10⁹³(94-digit number)
35397615879001840776…93756237524783298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.079 × 10⁹³(94-digit number)
70795231758003681552…87512475049566597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.415 × 10⁹⁴(95-digit number)
14159046351600736310…75024950099133194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.831 × 10⁹⁴(95-digit number)
28318092703201472621…50049900198266388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.663 × 10⁹⁴(95-digit number)
56636185406402945242…00099800396532776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.132 × 10⁹⁵(96-digit number)
11327237081280589048…00199600793065553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.265 × 10⁹⁵(96-digit number)
22654474162561178096…00399201586131107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.530 × 10⁹⁵(96-digit number)
45308948325122356193…00798403172262215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.061 × 10⁹⁵(96-digit number)
90617896650244712387…01596806344524431361
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,959,543 XPM·at block #6,839,406 · 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