Block #766,143

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/13/2014, 3:44:38 PM · Difficulty 10.9781 · 6,051,671 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4da5bef2ad837357a1f587d7409505ca69c633f198f74745d671a525a469dd1c

Height

#766,143

Difficulty

10.978061

Transactions

5

Size

1.81 KB

Version

2

Bits

0afa622f

Nonce

77,119,400

Timestamp

10/13/2014, 3:44:38 PM

Confirmations

6,051,671

Merkle Root

89544bbbffbfd4962965dce166055543f6141aa5d1246889933f584202f581a9
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.

2.842 × 10⁹⁷(98-digit number)
28425051581973538337…31594117420939325439
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
2.842 × 10⁹⁷(98-digit number)
28425051581973538337…31594117420939325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.685 × 10⁹⁷(98-digit number)
56850103163947076674…63188234841878650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.137 × 10⁹⁸(99-digit number)
11370020632789415334…26376469683757301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.274 × 10⁹⁸(99-digit number)
22740041265578830669…52752939367514603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.548 × 10⁹⁸(99-digit number)
45480082531157661339…05505878735029207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.096 × 10⁹⁸(99-digit number)
90960165062315322678…11011757470058414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.819 × 10⁹⁹(100-digit number)
18192033012463064535…22023514940116828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.638 × 10⁹⁹(100-digit number)
36384066024926129071…44047029880233656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.276 × 10⁹⁹(100-digit number)
72768132049852258143…88094059760467312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.455 × 10¹⁰⁰(101-digit number)
14553626409970451628…76188119520934625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.910 × 10¹⁰⁰(101-digit number)
29107252819940903257…52376239041869250559
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,786,574 XPM·at block #6,817,813 · 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