Block #2,833,759

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2018, 11:21:29 PM · Difficulty 11.7158 · 3,999,973 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd1348b821cb4f60a0b5082e6a38ca3d893189230319c358978bcb0368b55954

Height

#2,833,759

Difficulty

11.715809

Transactions

4

Size

1.27 KB

Version

2

Bits

0bb73f3f

Nonce

585,845,514

Timestamp

9/10/2018, 11:21:29 PM

Confirmations

3,999,973

Merkle Root

4cc16fad80d1691dc137d242f4395337ee078e224aec05760082c4955b455435
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.

6.591 × 10⁹⁴(95-digit number)
65916817177136847932…77408145562533003041
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
6.591 × 10⁹⁴(95-digit number)
65916817177136847932…77408145562533003041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.318 × 10⁹⁵(96-digit number)
13183363435427369586…54816291125066006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.636 × 10⁹⁵(96-digit number)
26366726870854739172…09632582250132012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.273 × 10⁹⁵(96-digit number)
52733453741709478345…19265164500264024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.054 × 10⁹⁶(97-digit number)
10546690748341895669…38530329000528048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.109 × 10⁹⁶(97-digit number)
21093381496683791338…77060658001056097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.218 × 10⁹⁶(97-digit number)
42186762993367582676…54121316002112194561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.437 × 10⁹⁶(97-digit number)
84373525986735165352…08242632004224389121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.687 × 10⁹⁷(98-digit number)
16874705197347033070…16485264008448778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.374 × 10⁹⁷(98-digit number)
33749410394694066141…32970528016897556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.749 × 10⁹⁷(98-digit number)
67498820789388132282…65941056033795112961
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,914,079 XPM·at block #6,833,731 · 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