Block #2,730,985

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/2/2018, 11:24:41 AM · Difficulty 11.6314 · 4,107,591 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
07b2836f2f387cb3b77c783e78415e8500ea1d26461d75aedd4d3016bdeb8ea3

Height

#2,730,985

Difficulty

11.631362

Transactions

34

Size

9.21 KB

Version

2

Bits

0ba1a0f7

Nonce

446,203,718

Timestamp

7/2/2018, 11:24:41 AM

Confirmations

4,107,591

Merkle Root

2912151e20394eb3c024009e31cf021d46f8c12255e52aa79671f01b0a7b34ed
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.

1.068 × 10⁹³(94-digit number)
10684436787215153551…74528243142258160641
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
1.068 × 10⁹³(94-digit number)
10684436787215153551…74528243142258160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.136 × 10⁹³(94-digit number)
21368873574430307102…49056486284516321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.273 × 10⁹³(94-digit number)
42737747148860614205…98112972569032642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.547 × 10⁹³(94-digit number)
85475494297721228411…96225945138065285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.709 × 10⁹⁴(95-digit number)
17095098859544245682…92451890276130570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.419 × 10⁹⁴(95-digit number)
34190197719088491364…84903780552261140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.838 × 10⁹⁴(95-digit number)
68380395438176982729…69807561104522280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.367 × 10⁹⁵(96-digit number)
13676079087635396545…39615122209044561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.735 × 10⁹⁵(96-digit number)
27352158175270793091…79230244418089123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.470 × 10⁹⁵(96-digit number)
54704316350541586183…58460488836178247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.094 × 10⁹⁶(97-digit number)
10940863270108317236…16920977672356495361
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,894 XPM·at block #6,838,575 · 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