Block #2,759,309

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/21/2018, 8:26:15 PM · Difficulty 11.6620 · 4,083,588 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1576508a11f72468ad57c671cd127383e5c3205850b6ef8c4923ea06fa2da815

Height

#2,759,309

Difficulty

11.661967

Transactions

18

Size

5.87 KB

Version

2

Bits

0ba976b0

Nonce

1,382,715,183

Timestamp

7/21/2018, 8:26:15 PM

Confirmations

4,083,588

Merkle Root

8519695f599976c57c298027f9fb68fd6395fce6445039a376e7ee122f2d5e68
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.294 × 10⁹⁴(95-digit number)
12947384905520949752…26208405143942956479
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.294 × 10⁹⁴(95-digit number)
12947384905520949752…26208405143942956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.589 × 10⁹⁴(95-digit number)
25894769811041899505…52416810287885912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.178 × 10⁹⁴(95-digit number)
51789539622083799011…04833620575771825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.035 × 10⁹⁵(96-digit number)
10357907924416759802…09667241151543651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.071 × 10⁹⁵(96-digit number)
20715815848833519604…19334482303087303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.143 × 10⁹⁵(96-digit number)
41431631697667039209…38668964606174607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.286 × 10⁹⁵(96-digit number)
82863263395334078418…77337929212349214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.657 × 10⁹⁶(97-digit number)
16572652679066815683…54675858424698429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.314 × 10⁹⁶(97-digit number)
33145305358133631367…09351716849396858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.629 × 10⁹⁶(97-digit number)
66290610716267262735…18703433698793717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.325 × 10⁹⁷(98-digit number)
13258122143253452547…37406867397587435519
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,987,524 XPM·at block #6,842,896 · 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