Block #3,265,014

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/13/2019, 4:29:41 AM · Difficulty 10.9960 · 3,545,956 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e3ee55f286caa26a4055a182a61f80a44af694724f1be17a7aacb6f3f7261a5

Height

#3,265,014

Difficulty

10.995955

Transactions

8

Size

1.97 KB

Version

2

Bits

0afef6ee

Nonce

2,065,911,029

Timestamp

7/13/2019, 4:29:41 AM

Confirmations

3,545,956

Merkle Root

01931a27eb6c97b509c1b12d309aaccf8d50fc2495d66aa7929e9e3900c72e73
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.263 × 10⁹⁴(95-digit number)
12634835848638727262…42439007005171539199
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.263 × 10⁹⁴(95-digit number)
12634835848638727262…42439007005171539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.526 × 10⁹⁴(95-digit number)
25269671697277454525…84878014010343078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.053 × 10⁹⁴(95-digit number)
50539343394554909051…69756028020686156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.010 × 10⁹⁵(96-digit number)
10107868678910981810…39512056041372313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.021 × 10⁹⁵(96-digit number)
20215737357821963620…79024112082744627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.043 × 10⁹⁵(96-digit number)
40431474715643927241…58048224165489254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.086 × 10⁹⁵(96-digit number)
80862949431287854482…16096448330978508799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.617 × 10⁹⁶(97-digit number)
16172589886257570896…32192896661957017599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.234 × 10⁹⁶(97-digit number)
32345179772515141793…64385793323914035199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.469 × 10⁹⁶(97-digit number)
64690359545030283586…28771586647828070399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.293 × 10⁹⁷(98-digit number)
12938071909006056717…57543173295656140799
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,731,862 XPM·at block #6,810,969 · 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.

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