Block #2,818,343

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/31/2018, 11:26:31 AM · Difficulty 11.6978 · 4,021,682 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
646a3c48c7dc5257d4ff33d9ed4f8b638e3c761503f0a7483f04a8b1cff11171

Height

#2,818,343

Difficulty

11.697762

Transactions

4

Size

1.08 KB

Version

2

Bits

0bb2a08c

Nonce

704,995,056

Timestamp

8/31/2018, 11:26:31 AM

Confirmations

4,021,682

Merkle Root

986f3ccfb70d47dd3024f25fb90db1a1a5728f314846a1fe62d06d65732a3b73
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.463 × 10⁹⁴(95-digit number)
74630907781287710281…67008995022228175359
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.463 × 10⁹⁴(95-digit number)
74630907781287710281…67008995022228175359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.492 × 10⁹⁵(96-digit number)
14926181556257542056…34017990044456350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.985 × 10⁹⁵(96-digit number)
29852363112515084112…68035980088912701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.970 × 10⁹⁵(96-digit number)
59704726225030168225…36071960177825402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.194 × 10⁹⁶(97-digit number)
11940945245006033645…72143920355650805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.388 × 10⁹⁶(97-digit number)
23881890490012067290…44287840711301611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.776 × 10⁹⁶(97-digit number)
47763780980024134580…88575681422603223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.552 × 10⁹⁶(97-digit number)
95527561960048269160…77151362845206446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.910 × 10⁹⁷(98-digit number)
19105512392009653832…54302725690412892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.821 × 10⁹⁷(98-digit number)
38211024784019307664…08605451380825784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.642 × 10⁹⁷(98-digit number)
76422049568038615328…17210902761651568639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,964,512 XPM·at block #6,840,024 · 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