Block #1,216,202

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/31/2015, 8:36:23 PM · Difficulty 10.7283 · 5,591,689 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b11b3a48da07313278ca56ff0d0bcc1c2fa5248abc5519a43fe4aebd91bf5a28

Height

#1,216,202

Difficulty

10.728332

Transactions

7

Size

2.93 KB

Version

2

Bits

0aba73f1

Nonce

199,059,742

Timestamp

8/31/2015, 8:36:23 PM

Confirmations

5,591,689

Merkle Root

31473ec8c40140d216bab95666a3aefbc388f31ac14b1a311355bd252b6aa73a
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.

7.692 × 10⁹⁶(97-digit number)
76927161936027543042…81427338824709512959
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
7.692 × 10⁹⁶(97-digit number)
76927161936027543042…81427338824709512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.538 × 10⁹⁷(98-digit number)
15385432387205508608…62854677649419025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.077 × 10⁹⁷(98-digit number)
30770864774411017217…25709355298838051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.154 × 10⁹⁷(98-digit number)
61541729548822034434…51418710597676103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.230 × 10⁹⁸(99-digit number)
12308345909764406886…02837421195352207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.461 × 10⁹⁸(99-digit number)
24616691819528813773…05674842390704414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.923 × 10⁹⁸(99-digit number)
49233383639057627547…11349684781408829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.846 × 10⁹⁸(99-digit number)
98466767278115255094…22699369562817658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.969 × 10⁹⁹(100-digit number)
19693353455623051018…45398739125635317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.938 × 10⁹⁹(100-digit number)
39386706911246102037…90797478251270635519
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,707,163 XPM·at block #6,807,890 · 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