Block #2,753,763

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/18/2018, 1:50:04 AM · Difficulty 11.6544 · 4,079,571 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6de4e05d30404f6c30734b4d62aaca132fb7f6268c4ba260d248ca447613e06d

Height

#2,753,763

Difficulty

11.654369

Transactions

4

Size

1.16 KB

Version

2

Bits

0ba784be

Nonce

195,522,815

Timestamp

7/18/2018, 1:50:04 AM

Confirmations

4,079,571

Merkle Root

92c9c70673545fd82b9257850da9ed80ebe11da4e45a1001641ddf91d3318cd9
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.

1.228 × 10⁹⁴(95-digit number)
12283507047831812912…63052702978105286999
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
1.228 × 10⁹⁴(95-digit number)
12283507047831812912…63052702978105286999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.456 × 10⁹⁴(95-digit number)
24567014095663625824…26105405956210573999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.913 × 10⁹⁴(95-digit number)
49134028191327251649…52210811912421147999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.826 × 10⁹⁴(95-digit number)
98268056382654503298…04421623824842295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.965 × 10⁹⁵(96-digit number)
19653611276530900659…08843247649684591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.930 × 10⁹⁵(96-digit number)
39307222553061801319…17686495299369183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.861 × 10⁹⁵(96-digit number)
78614445106123602638…35372990598738367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.572 × 10⁹⁶(97-digit number)
15722889021224720527…70745981197476735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.144 × 10⁹⁶(97-digit number)
31445778042449441055…41491962394953471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.289 × 10⁹⁶(97-digit number)
62891556084898882110…82983924789906943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.257 × 10⁹⁷(98-digit number)
12578311216979776422…65967849579813887999
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,910,867 XPM·at block #6,833,333 · 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