Block #2,765,631

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/26/2018, 4:52:57 AM · Difficulty 11.6659 · 4,077,993 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
957233190d1f66072f806820515c5949713e6683d5121e53a07ed87d141c6270

Height

#2,765,631

Difficulty

11.665925

Transactions

37

Size

10.66 KB

Version

2

Bits

0baa7a15

Nonce

1,821,919,121

Timestamp

7/26/2018, 4:52:57 AM

Confirmations

4,077,993

Merkle Root

58065522c304baac101010cfbf35aa2a2abde1664abe2f989c1901dc2f0058a9
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.172 × 10⁹⁴(95-digit number)
11725606961824544871…95589143979289690639
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.172 × 10⁹⁴(95-digit number)
11725606961824544871…95589143979289690639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.345 × 10⁹⁴(95-digit number)
23451213923649089743…91178287958579381279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.690 × 10⁹⁴(95-digit number)
46902427847298179487…82356575917158762559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.380 × 10⁹⁴(95-digit number)
93804855694596358975…64713151834317525119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.876 × 10⁹⁵(96-digit number)
18760971138919271795…29426303668635050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.752 × 10⁹⁵(96-digit number)
37521942277838543590…58852607337270100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.504 × 10⁹⁵(96-digit number)
75043884555677087180…17705214674540200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.500 × 10⁹⁶(97-digit number)
15008776911135417436…35410429349080401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.001 × 10⁹⁶(97-digit number)
30017553822270834872…70820858698160803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.003 × 10⁹⁶(97-digit number)
60035107644541669744…41641717396321607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.200 × 10⁹⁷(98-digit number)
12007021528908333948…83283434792643215359
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,993,358 XPM·at block #6,843,623 · 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