Block #3,261,274

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/10/2019, 10:34:44 AM · Difficulty 10.9960 · 3,570,007 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b974edfb1753e194fabf2890644c0553e05b92b7c2fa82fd790ec08999d1f55a

Height

#3,261,274

Difficulty

10.996016

Transactions

23

Size

5.69 KB

Version

2

Bits

0afefaec

Nonce

305,943,311

Timestamp

7/10/2019, 10:34:44 AM

Confirmations

3,570,007

Merkle Root

ae93ba81cf0e5ec70385555737a4638142915ed88f6fdf253317546ff3b2d767
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.

3.229 × 10⁹⁵(96-digit number)
32298630006086692571…64479712675584907319
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
3.229 × 10⁹⁵(96-digit number)
32298630006086692571…64479712675584907319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.459 × 10⁹⁵(96-digit number)
64597260012173385142…28959425351169814639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.291 × 10⁹⁶(97-digit number)
12919452002434677028…57918850702339629279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.583 × 10⁹⁶(97-digit number)
25838904004869354057…15837701404679258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.167 × 10⁹⁶(97-digit number)
51677808009738708114…31675402809358517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.033 × 10⁹⁷(98-digit number)
10335561601947741622…63350805618717034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.067 × 10⁹⁷(98-digit number)
20671123203895483245…26701611237434068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.134 × 10⁹⁷(98-digit number)
41342246407790966491…53403222474868136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.268 × 10⁹⁷(98-digit number)
82684492815581932982…06806444949736273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.653 × 10⁹⁸(99-digit number)
16536898563116386596…13612889899472547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.307 × 10⁹⁸(99-digit number)
33073797126232773193…27225779798945095679
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,894,392 XPM·at block #6,831,280 · 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