Block #2,730,668

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/2/2018, 6:03:12 AM · Difficulty 11.6318 · 4,109,303 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6cb2148d0e451c306eeb2e91b0acc5b6191f40234a7f18e6a81ce8ef04399ae7

Height

#2,730,668

Difficulty

11.631838

Transactions

33

Size

9.98 KB

Version

2

Bits

0ba1c028

Nonce

1,768,677,547

Timestamp

7/2/2018, 6:03:12 AM

Confirmations

4,109,303

Merkle Root

f2bbd70880e7958608d2e2dbb3076332681e93d9897425f7220e6b3df7e861ae
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.

3.277 × 10⁹⁴(95-digit number)
32776481461327565831…70529134965851008001
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
3.277 × 10⁹⁴(95-digit number)
32776481461327565831…70529134965851008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.555 × 10⁹⁴(95-digit number)
65552962922655131663…41058269931702016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.311 × 10⁹⁵(96-digit number)
13110592584531026332…82116539863404032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.622 × 10⁹⁵(96-digit number)
26221185169062052665…64233079726808064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.244 × 10⁹⁵(96-digit number)
52442370338124105330…28466159453616128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.048 × 10⁹⁶(97-digit number)
10488474067624821066…56932318907232256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.097 × 10⁹⁶(97-digit number)
20976948135249642132…13864637814464512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.195 × 10⁹⁶(97-digit number)
41953896270499284264…27729275628929024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.390 × 10⁹⁶(97-digit number)
83907792540998568528…55458551257858048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.678 × 10⁹⁷(98-digit number)
16781558508199713705…10917102515716096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.356 × 10⁹⁷(98-digit number)
33563117016399427411…21834205031432192001
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,964,073 XPM·at block #6,839,970 · 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