Block #2,773,946

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2018, 12:13:21 AM · Difficulty 11.6631 · 4,057,309 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2dfba9f2047755239d29729255e4b9586d7096daab21409f6767aec6580c48e8

Height

#2,773,946

Difficulty

11.663087

Transactions

2

Size

870 B

Version

2

Bits

0ba9c00d

Nonce

39,538,564

Timestamp

8/1/2018, 12:13:21 AM

Confirmations

4,057,309

Merkle Root

195bec733067403198825149be15019781faaf01fb7af32b4a50923a44875370
Transactions (2)
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.

2.546 × 10⁹⁵(96-digit number)
25462799293920210262…30091276870360997101
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
2.546 × 10⁹⁵(96-digit number)
25462799293920210262…30091276870360997101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.092 × 10⁹⁵(96-digit number)
50925598587840420524…60182553740721994201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.018 × 10⁹⁶(97-digit number)
10185119717568084104…20365107481443988401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.037 × 10⁹⁶(97-digit number)
20370239435136168209…40730214962887976801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.074 × 10⁹⁶(97-digit number)
40740478870272336419…81460429925775953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.148 × 10⁹⁶(97-digit number)
81480957740544672838…62920859851551907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.629 × 10⁹⁷(98-digit number)
16296191548108934567…25841719703103814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.259 × 10⁹⁷(98-digit number)
32592383096217869135…51683439406207628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.518 × 10⁹⁷(98-digit number)
65184766192435738271…03366878812415257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.303 × 10⁹⁸(99-digit number)
13036953238487147654…06733757624830515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.607 × 10⁹⁸(99-digit number)
26073906476974295308…13467515249661030401
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,894,190 XPM·at block #6,831,254 · 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