Block #2,727,415

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/30/2018, 1:03:33 AM · Difficulty 11.6261 · 4,109,466 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b963dac9545ddc15496746e4988fa914f564ebb7d14e1aae458b0b15a9cbafd8

Height

#2,727,415

Difficulty

11.626129

Transactions

4

Size

1.31 KB

Version

2

Bits

0ba049ff

Nonce

1,347,746,540

Timestamp

6/30/2018, 1:03:33 AM

Confirmations

4,109,466

Merkle Root

84c89e1d1b1cdd8d4ba9bed904fbaf5845fb997492c4246c802271b437ad9857
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.386 × 10⁹⁵(96-digit number)
13862021969753616342…68895993120944535279
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.386 × 10⁹⁵(96-digit number)
13862021969753616342…68895993120944535279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.772 × 10⁹⁵(96-digit number)
27724043939507232685…37791986241889070559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.544 × 10⁹⁵(96-digit number)
55448087879014465371…75583972483778141119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.108 × 10⁹⁶(97-digit number)
11089617575802893074…51167944967556282239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.217 × 10⁹⁶(97-digit number)
22179235151605786148…02335889935112564479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.435 × 10⁹⁶(97-digit number)
44358470303211572297…04671779870225128959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.871 × 10⁹⁶(97-digit number)
88716940606423144594…09343559740450257919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.774 × 10⁹⁷(98-digit number)
17743388121284628918…18687119480900515839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.548 × 10⁹⁷(98-digit number)
35486776242569257837…37374238961801031679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.097 × 10⁹⁷(98-digit number)
70973552485138515675…74748477923602063359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.419 × 10⁹⁸(99-digit number)
14194710497027703135…49496955847204126719
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,939,339 XPM·at block #6,836,880 · 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