Block #2,765,394

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/26/2018, 1:20:18 AM · Difficulty 11.6643 · 4,066,245 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c6d48cb764b7d01690eb498a19e1956a741421171a7fe577f4a510453262534

Height

#2,765,394

Difficulty

11.664256

Transactions

4

Size

1.85 KB

Version

2

Bits

0baa0cb4

Nonce

235,775,425

Timestamp

7/26/2018, 1:20:18 AM

Confirmations

4,066,245

Merkle Root

a1da23f4cd6ba6b386622ab41355c5ae8f1a2b1a5d7497ffdb3ed558eb183030
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.362 × 10⁹⁶(97-digit number)
43628896458843205317…97111010076790657919
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.362 × 10⁹⁶(97-digit number)
43628896458843205317…97111010076790657919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.725 × 10⁹⁶(97-digit number)
87257792917686410635…94222020153581315839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.745 × 10⁹⁷(98-digit number)
17451558583537282127…88444040307162631679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.490 × 10⁹⁷(98-digit number)
34903117167074564254…76888080614325263359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.980 × 10⁹⁷(98-digit number)
69806234334149128508…53776161228650526719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.396 × 10⁹⁸(99-digit number)
13961246866829825701…07552322457301053439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.792 × 10⁹⁸(99-digit number)
27922493733659651403…15104644914602106879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.584 × 10⁹⁸(99-digit number)
55844987467319302806…30209289829204213759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.116 × 10⁹⁹(100-digit number)
11168997493463860561…60418579658408427519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.233 × 10⁹⁹(100-digit number)
22337994986927721122…20837159316816855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.467 × 10⁹⁹(100-digit number)
44675989973855442245…41674318633633710079
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,897,216 XPM·at block #6,831,638 · 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