Block #2,730,151

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/1/2018, 9:48:42 PM · Difficulty 11.6301 · 4,109,026 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3ab050e513f03febc39c3a1d5fd79a58ca1d05f15cb9baf58da2c21caffd100

Height

#2,730,151

Difficulty

11.630144

Transactions

9

Size

2.93 KB

Version

2

Bits

0ba15118

Nonce

272,127,139

Timestamp

7/1/2018, 9:48:42 PM

Confirmations

4,109,026

Merkle Root

6d4bd4a1908c852be719348530f984a946b2cbd1ff4cc6ea661e803b1f88968e
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.151 × 10⁹⁵(96-digit number)
41514943545569727496…22563912467584399361
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.151 × 10⁹⁵(96-digit number)
41514943545569727496…22563912467584399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.302 × 10⁹⁵(96-digit number)
83029887091139454992…45127824935168798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.660 × 10⁹⁶(97-digit number)
16605977418227890998…90255649870337597441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.321 × 10⁹⁶(97-digit number)
33211954836455781996…80511299740675194881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.642 × 10⁹⁶(97-digit number)
66423909672911563993…61022599481350389761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.328 × 10⁹⁷(98-digit number)
13284781934582312798…22045198962700779521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.656 × 10⁹⁷(98-digit number)
26569563869164625597…44090397925401559041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.313 × 10⁹⁷(98-digit number)
53139127738329251194…88180795850803118081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.062 × 10⁹⁸(99-digit number)
10627825547665850238…76361591701606236161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.125 × 10⁹⁸(99-digit number)
21255651095331700477…52723183403212472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.251 × 10⁹⁸(99-digit number)
42511302190663400955…05446366806424944641
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,957,698 XPM·at block #6,839,176 · 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