Block #2,234,861

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/3/2017, 8:05:11 AM · Difficulty 10.9457 · 4,596,889 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a7cf6bb9b7cdc89e46ba598dff6855ccd2608f2e579b03dea9400594f3cd66a3

Height

#2,234,861

Difficulty

10.945678

Transactions

3

Size

1.22 KB

Version

2

Bits

0af217f0

Nonce

159,627,996

Timestamp

8/3/2017, 8:05:11 AM

Confirmations

4,596,889

Merkle Root

3b19672ee13ae2625064e3d4a0140f0657ebc570a2698fe609d6bd71f5ed7151
Transactions (3)
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.

4.861 × 10⁹⁶(97-digit number)
48619647568444750453…98755714287808450559
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
4.861 × 10⁹⁶(97-digit number)
48619647568444750453…98755714287808450559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.723 × 10⁹⁶(97-digit number)
97239295136889500906…97511428575616901119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.944 × 10⁹⁷(98-digit number)
19447859027377900181…95022857151233802239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.889 × 10⁹⁷(98-digit number)
38895718054755800362…90045714302467604479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.779 × 10⁹⁷(98-digit number)
77791436109511600725…80091428604935208959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.555 × 10⁹⁸(99-digit number)
15558287221902320145…60182857209870417919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.111 × 10⁹⁸(99-digit number)
31116574443804640290…20365714419740835839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.223 × 10⁹⁸(99-digit number)
62233148887609280580…40731428839481671679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.244 × 10⁹⁹(100-digit number)
12446629777521856116…81462857678963343359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.489 × 10⁹⁹(100-digit number)
24893259555043712232…62925715357926686719
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,898,108 XPM·at block #6,831,749 · 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