Block #2,727,646

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/30/2018, 4:39:06 AM · Difficulty 11.6274 · 4,104,022 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ae744ade9b850f52ab21ece1fe5762b9fa55350372181ee7f4a255de30470c4

Height

#2,727,646

Difficulty

11.627350

Transactions

7

Size

1.82 KB

Version

2

Bits

0ba09a08

Nonce

248,827,510

Timestamp

6/30/2018, 4:39:06 AM

Confirmations

4,104,022

Merkle Root

9f375ffc4eb0331ba65db4d3ac669747e0cdeb8637b04c3278883838ea525f0d
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.247 × 10⁹⁴(95-digit number)
82479908787063746441…25838610968959234561
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.247 × 10⁹⁴(95-digit number)
82479908787063746441…25838610968959234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.649 × 10⁹⁵(96-digit number)
16495981757412749288…51677221937918469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.299 × 10⁹⁵(96-digit number)
32991963514825498576…03354443875836938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.598 × 10⁹⁵(96-digit number)
65983927029650997153…06708887751673876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.319 × 10⁹⁶(97-digit number)
13196785405930199430…13417775503347752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.639 × 10⁹⁶(97-digit number)
26393570811860398861…26835551006695505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.278 × 10⁹⁶(97-digit number)
52787141623720797722…53671102013391011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.055 × 10⁹⁷(98-digit number)
10557428324744159544…07342204026782023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.111 × 10⁹⁷(98-digit number)
21114856649488319089…14684408053564047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.222 × 10⁹⁷(98-digit number)
42229713298976638178…29368816107128094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.445 × 10⁹⁷(98-digit number)
84459426597953276356…58737632214256189441
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,897,448 XPM·at block #6,831,667 · 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