Block #2,783,345

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2018, 12:55:37 PM · Difficulty 11.6633 · 4,059,579 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1ea161590c42f815bcecf9a4b9cbe3d04fc0da5ad77e9279dbcd0aad16ec052

Height

#2,783,345

Difficulty

11.663345

Transactions

5

Size

1.91 KB

Version

2

Bits

0ba9d0fe

Nonce

987,324,523

Timestamp

8/7/2018, 12:55:37 PM

Confirmations

4,059,579

Merkle Root

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

7.987 × 10⁹¹(92-digit number)
79872606435100972249…89666972559010112581
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
7.987 × 10⁹¹(92-digit number)
79872606435100972249…89666972559010112581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.597 × 10⁹²(93-digit number)
15974521287020194449…79333945118020225161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.194 × 10⁹²(93-digit number)
31949042574040388899…58667890236040450321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.389 × 10⁹²(93-digit number)
63898085148080777799…17335780472080900641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.277 × 10⁹³(94-digit number)
12779617029616155559…34671560944161801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.555 × 10⁹³(94-digit number)
25559234059232311119…69343121888323602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.111 × 10⁹³(94-digit number)
51118468118464622239…38686243776647205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.022 × 10⁹⁴(95-digit number)
10223693623692924447…77372487553294410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.044 × 10⁹⁴(95-digit number)
20447387247385848895…54744975106588820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.089 × 10⁹⁴(95-digit number)
40894774494771697791…09489950213177640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.178 × 10⁹⁴(95-digit number)
81789548989543395583…18979900426355281921
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,987,740 XPM·at block #6,842,923 · 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