Block #2,770,243

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/29/2018, 11:35:39 AM · Difficulty 11.6586 · 4,072,972 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff23db0b3d1e5ee2fe2e1342dc8c837318301059f6d18c4a58f0985316ac3e9b

Height

#2,770,243

Difficulty

11.658589

Transactions

5

Size

1.49 KB

Version

2

Bits

0ba89942

Nonce

84,861,688

Timestamp

7/29/2018, 11:35:39 AM

Confirmations

4,072,972

Merkle Root

1ba8934b1ef610195745f119d1c9a43811eb23348262213c1729deaaad2d0441
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.118 × 10⁹⁶(97-digit number)
21187478373156236017…05246354960497556481
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.118 × 10⁹⁶(97-digit number)
21187478373156236017…05246354960497556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.237 × 10⁹⁶(97-digit number)
42374956746312472034…10492709920995112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.474 × 10⁹⁶(97-digit number)
84749913492624944069…20985419841990225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.694 × 10⁹⁷(98-digit number)
16949982698524988813…41970839683980451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.389 × 10⁹⁷(98-digit number)
33899965397049977627…83941679367960903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.779 × 10⁹⁷(98-digit number)
67799930794099955255…67883358735921807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.355 × 10⁹⁸(99-digit number)
13559986158819991051…35766717471843614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.711 × 10⁹⁸(99-digit number)
27119972317639982102…71533434943687229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.423 × 10⁹⁸(99-digit number)
54239944635279964204…43066869887374458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.084 × 10⁹⁹(100-digit number)
10847988927055992840…86133739774748917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.169 × 10⁹⁹(100-digit number)
21695977854111985681…72267479549497835521
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,990,093 XPM·at block #6,843,214 · 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