Block #2,091,333

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2017, 10:33:06 AM · Difficulty 10.8727 · 4,742,590 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1ad34fe77f10c863b18f0b1ad912d566d317ffc88f1d60ce822d7b13d6ed681

Height

#2,091,333

Difficulty

10.872681

Transactions

2

Size

835 B

Version

2

Bits

0adf680b

Nonce

807,628,263

Timestamp

4/28/2017, 10:33:06 AM

Confirmations

4,742,590

Merkle Root

d93f7f67facc2c3895cba746178aeeddb554fa4de1f84f1f931c70043689add0
Transactions (2)
1 in → 1 out8.4700 XPM109 B
4 in → 1 out1909.8842 XPM635 B
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.965 × 10⁹⁶(97-digit number)
19659122635412527396…59169442885939389439
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.965 × 10⁹⁶(97-digit number)
19659122635412527396…59169442885939389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.931 × 10⁹⁶(97-digit number)
39318245270825054793…18338885771878778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.863 × 10⁹⁶(97-digit number)
78636490541650109586…36677771543757557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.572 × 10⁹⁷(98-digit number)
15727298108330021917…73355543087515115519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.145 × 10⁹⁷(98-digit number)
31454596216660043834…46711086175030231039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.290 × 10⁹⁷(98-digit number)
62909192433320087669…93422172350060462079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.258 × 10⁹⁸(99-digit number)
12581838486664017533…86844344700120924159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.516 × 10⁹⁸(99-digit number)
25163676973328035067…73688689400241848319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.032 × 10⁹⁸(99-digit number)
50327353946656070135…47377378800483696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.006 × 10⁹⁹(100-digit number)
10065470789331214027…94754757600967393279
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,915,611 XPM·at block #6,833,922 · 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