Block #1,349,951

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/1/2015, 3:58:33 PM · Difficulty 10.8050 · 5,492,303 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8bd0d8230c7ad0ee50bdd564f2dddf322582dc50c2821164713afe5bfd594c9d

Height

#1,349,951

Difficulty

10.804998

Transactions

2

Size

575 B

Version

2

Bits

0ace1461

Nonce

2,014,979,443

Timestamp

12/1/2015, 3:58:33 PM

Confirmations

5,492,303

Merkle Root

675e50c9e9de73f22c96c397b0a4464172ba6a2838004a4c03314efaf427f7ec
Transactions (2)
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.

8.056 × 10⁹⁶(97-digit number)
80569531957737528235…20496283724185139199
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
8.056 × 10⁹⁶(97-digit number)
80569531957737528235…20496283724185139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.611 × 10⁹⁷(98-digit number)
16113906391547505647…40992567448370278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.222 × 10⁹⁷(98-digit number)
32227812783095011294…81985134896740556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.445 × 10⁹⁷(98-digit number)
64455625566190022588…63970269793481113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.289 × 10⁹⁸(99-digit number)
12891125113238004517…27940539586962227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.578 × 10⁹⁸(99-digit number)
25782250226476009035…55881079173924454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.156 × 10⁹⁸(99-digit number)
51564500452952018070…11762158347848908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.031 × 10⁹⁹(100-digit number)
10312900090590403614…23524316695697817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.062 × 10⁹⁹(100-digit number)
20625800181180807228…47048633391395635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.125 × 10⁹⁹(100-digit number)
41251600362361614456…94097266782791270399
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,982,429 XPM·at block #6,842,253 · 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