Block #803,771

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/9/2014, 8:53:02 AM · Difficulty 10.9754 · 6,003,426 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af04268e11c3582cabd6732dea95e3f331cb34edd540eab15d2e579950454c77

Height

#803,771

Difficulty

10.975431

Transactions

3

Size

659 B

Version

2

Bits

0af9b5d9

Nonce

1,379,015,541

Timestamp

11/9/2014, 8:53:02 AM

Confirmations

6,003,426

Merkle Root

5b4c670c6023e39366f8f72f25162eb89e5efaaa3b49c60b71ce9fcc3f460df1
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.

9.254 × 10⁹⁷(98-digit number)
92545550818526229668…62145437427922493439
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
9.254 × 10⁹⁷(98-digit number)
92545550818526229668…62145437427922493439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.850 × 10⁹⁸(99-digit number)
18509110163705245933…24290874855844986879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.701 × 10⁹⁸(99-digit number)
37018220327410491867…48581749711689973759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.403 × 10⁹⁸(99-digit number)
74036440654820983734…97163499423379947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.480 × 10⁹⁹(100-digit number)
14807288130964196746…94326998846759895039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.961 × 10⁹⁹(100-digit number)
29614576261928393493…88653997693519790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.922 × 10⁹⁹(100-digit number)
59229152523856786987…77307995387039580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.184 × 10¹⁰⁰(101-digit number)
11845830504771357397…54615990774079160319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.369 × 10¹⁰⁰(101-digit number)
23691661009542714795…09231981548158320639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.738 × 10¹⁰⁰(101-digit number)
47383322019085429590…18463963096316641279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.476 × 10¹⁰⁰(101-digit number)
94766644038170859180…36927926192633282559
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,701,589 XPM·at block #6,807,196 · 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.

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