Block #2,933,803

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2018, 2:51:00 AM · Difficulty 11.3964 · 3,899,107 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6878a25c7ec306f87af467009ddd057bbf08b67e256278085093f11249a47bb7

Height

#2,933,803

Difficulty

11.396410

Transactions

5

Size

1.92 KB

Version

2

Bits

0b657b20

Nonce

967,095,270

Timestamp

11/22/2018, 2:51:00 AM

Confirmations

3,899,107

Merkle Root

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

3.462 × 10⁹⁶(97-digit number)
34621261731850574960…31278956570243310719
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
3.462 × 10⁹⁶(97-digit number)
34621261731850574960…31278956570243310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.924 × 10⁹⁶(97-digit number)
69242523463701149920…62557913140486621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.384 × 10⁹⁷(98-digit number)
13848504692740229984…25115826280973242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.769 × 10⁹⁷(98-digit number)
27697009385480459968…50231652561946485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.539 × 10⁹⁷(98-digit number)
55394018770960919936…00463305123892971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.107 × 10⁹⁸(99-digit number)
11078803754192183987…00926610247785943039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.215 × 10⁹⁸(99-digit number)
22157607508384367974…01853220495571886079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.431 × 10⁹⁸(99-digit number)
44315215016768735949…03706440991143772159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.863 × 10⁹⁸(99-digit number)
88630430033537471898…07412881982287544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.772 × 10⁹⁹(100-digit number)
17726086006707494379…14825763964575088639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.545 × 10⁹⁹(100-digit number)
35452172013414988759…29651527929150177279
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,907,453 XPM·at block #6,832,909 · 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