Block #671,325

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2014, 5:20:13 AM · Difficulty 10.9641 · 6,160,050 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4c3661e3ade426e202faf4f24ab7dc7cdc118d12943babb0d26e2570a87170aa

Height

#671,325

Difficulty

10.964076

Transactions

4

Size

1.30 KB

Version

2

Bits

0af6cdaf

Nonce

1,117,392,178

Timestamp

8/10/2014, 5:20:13 AM

Confirmations

6,160,050

Merkle Root

18383758f14f54e66b33b12d4069c16d546a49ada856305b0ff42b6663194941
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.

9.528 × 10⁹⁶(97-digit number)
95287223489524022359…32721192123637951999
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
9.528 × 10⁹⁶(97-digit number)
95287223489524022359…32721192123637951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.905 × 10⁹⁷(98-digit number)
19057444697904804471…65442384247275903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.811 × 10⁹⁷(98-digit number)
38114889395809608943…30884768494551807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.622 × 10⁹⁷(98-digit number)
76229778791619217887…61769536989103615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.524 × 10⁹⁸(99-digit number)
15245955758323843577…23539073978207231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.049 × 10⁹⁸(99-digit number)
30491911516647687155…47078147956414463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.098 × 10⁹⁸(99-digit number)
60983823033295374310…94156295912828927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.219 × 10⁹⁹(100-digit number)
12196764606659074862…88312591825657855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.439 × 10⁹⁹(100-digit number)
24393529213318149724…76625183651315711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.878 × 10⁹⁹(100-digit number)
48787058426636299448…53250367302631423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.757 × 10⁹⁹(100-digit number)
97574116853272598896…06500734605262847999
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,895,157 XPM·at block #6,831,374 · 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