Block #2,774,788

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2018, 1:24:51 PM · Difficulty 11.6666 · 4,063,703 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
46144bb1acffc975a26e16946bbb442e6a3228845e832633273c0121606c6a76

Height

#2,774,788

Difficulty

11.666558

Transactions

6

Size

1.94 KB

Version

2

Bits

0baaa38f

Nonce

409,875,783

Timestamp

8/1/2018, 1:24:51 PM

Confirmations

4,063,703

Merkle Root

99f21234b1976aa9e3cc402792d7423b7e5871860a876145e14e9801b6db4a1f
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.324 × 10⁹⁴(95-digit number)
33247307782576777953…00049398396245456161
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.324 × 10⁹⁴(95-digit number)
33247307782576777953…00049398396245456161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.649 × 10⁹⁴(95-digit number)
66494615565153555906…00098796792490912321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.329 × 10⁹⁵(96-digit number)
13298923113030711181…00197593584981824641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.659 × 10⁹⁵(96-digit number)
26597846226061422362…00395187169963649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.319 × 10⁹⁵(96-digit number)
53195692452122844725…00790374339927298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.063 × 10⁹⁶(97-digit number)
10639138490424568945…01580748679854597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.127 × 10⁹⁶(97-digit number)
21278276980849137890…03161497359709194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.255 × 10⁹⁶(97-digit number)
42556553961698275780…06322994719418388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.511 × 10⁹⁶(97-digit number)
85113107923396551560…12645989438836776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.702 × 10⁹⁷(98-digit number)
17022621584679310312…25291978877673553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.404 × 10⁹⁷(98-digit number)
34045243169358620624…50583957755347107841
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,952,200 XPM·at block #6,838,490 · 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