Block #2,793,769

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/14/2018, 3:32:59 PM · Difficulty 11.6758 · 4,047,323 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
faca58225bfeaaf1d8966287be781dec064699f70e88740b99824dd3f3ab63c7

Height

#2,793,769

Difficulty

11.675811

Transactions

18

Size

6.45 KB

Version

2

Bits

0bad01eb

Nonce

393,302,556

Timestamp

8/14/2018, 3:32:59 PM

Confirmations

4,047,323

Merkle Root

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

4.810 × 10⁹⁶(97-digit number)
48105711650563662650…56906969657846507519
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
4.810 × 10⁹⁶(97-digit number)
48105711650563662650…56906969657846507519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.621 × 10⁹⁶(97-digit number)
96211423301127325301…13813939315693015039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.924 × 10⁹⁷(98-digit number)
19242284660225465060…27627878631386030079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.848 × 10⁹⁷(98-digit number)
38484569320450930120…55255757262772060159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.696 × 10⁹⁷(98-digit number)
76969138640901860241…10511514525544120319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.539 × 10⁹⁸(99-digit number)
15393827728180372048…21023029051088240639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.078 × 10⁹⁸(99-digit number)
30787655456360744096…42046058102176481279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.157 × 10⁹⁸(99-digit number)
61575310912721488193…84092116204352962559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.231 × 10⁹⁹(100-digit number)
12315062182544297638…68184232408705925119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.463 × 10⁹⁹(100-digit number)
24630124365088595277…36368464817411850239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.926 × 10⁹⁹(100-digit number)
49260248730177190554…72736929634823700479
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,973,100 XPM·at block #6,841,091 · 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